# A5 (Group) - A5 (Gruppe)

The group considered in the mathematical branch of group theoryis the 5th degree alternating group . It has 60 elements and is the smallest non-Abelian simple group and the smallest non- resolvable group . It finds a geometric realization as a group of rotations of the icosahedron .

## Definitions

We consider the set of all bijective mappings of the 5-element setin itself. This forms a group with the sequential execution of images as a link ; this link is also called a *product* and is written asor without any connection signs. This is the symmetrical group With Elements.

Such mappings are called permutations and the so-called cycle notation is used for them with different elements . The illustrationmaps each element in the cycle list to the one on the right and finally the last element in the list to the first. The cycleSo maps 2 to 3, 3 to 4 and 4 to 2 and leaves elements 1 and 5 fixed. A cycle of length 2 therefore only interchanged and and leaves all other elements fixed, such mappings are called transpositions . Different cycles can describe the same permutation, for example'Uniqueness is obtained by agreeing to put the smallest number occurring in the cycle at the beginning.

Any permutation can be written as the product of cycles, even as the product of transpositions. The representation as a product of transpositions is ambiguous. See for example

We use the usual sequence for illustrations, that is, the illustration first applied, then . (This is not done consistently in the literature; authors who write operations and functions on the right-hand side of the elements to be mapped use exactly the opposite convention.) However, it is clear whether a straight permutation is used to represent a permutation as a product of transpositions or an odd number of transpositions is required, correspondingly the permutations are called even or odd.

Then it is clear that the product of even permutations is even again, because the numbers of transpositions used add up when combining. The even permutations therefore form a subgroup , that is the alternating group.

It goes without saying that there are analogous concepts for instead of possible, which then leads to the alternating group A _{n} . In this article we cover the case.

## Elementary properties

### Number of elements

Is some permutation so is odd or even if and only if is odd or even. So there are as many even as odd permutations, and it follows that Has 60 elements.

### Cycle of three

A cycle of three, that is to say, a cycle of length three, is straight, because

- .

A cycle of three is apparently a figure that consists of each of the elements maps to a different element of this set of three and the other two elements leaves solid; there are exactly two such images, namely and . As it totalIf there are such sets of three, we come to a total of 20 cycles of three. The other way around

- For different in pairs
- For different in pairs,

every even permutation is a product of cycles of three, that is, the group is generated by the triple cycles.

### Orders

As in every group, there is exactly one element of order 1, namely the neutral element .

The elements of order 2 are obtained from transpositions, which obviously have order 2. There contains only even permutations, the permutations of order 2 are exactly the products of two transpositions foreign to the element with different pairs . There are 5 possibilities for a set of four (one element does not belong in each case) and for each such set of four one can have three different elements of order 2, that makes a total of Elements of order 2.

The elements of order 3 are the 20 three-cycle cycles mentioned above.

All five-cycle are products of two cycles of three and therefore elements of the and obviously have the order 5. Since all 5 numbers are in occur, the 1 is also included, which is put in the first position. Therefore there are exactly the five-cycle with different pairs , and there is also Options. There are therefore 24 elements of order 5.

With this we have determined the orders of 1 + 15 + 20 + 24 = 60 elements, so there are no elements of further orders. This gives us the following overview:

order | number | Typical element | description |
---|---|---|---|

1 | 1 | neutral element | |

2 | 15 | two transpositions foreign to the element | |

3 | 20 | Cycle of three | |

5 | 24 | Five-cycle |

### Link panel

With the alternating group it is still possible to obtain the group elements and the link table from the geometric image of the rotations of a tetrahedron. The groupoccurs as a rotation group of the icosahedron (and the dodecahedron , which is dual to the icosahedron). That is why it is also called the *icosahedral rotating group* and alternatively denotes it with the letter. It is a subgroup of the full icosahedral group .

Geometric assignments are hardly practicable for a group with 60 elements. With a link table with 60 x 60 positions, it would also be confusing to write numbers, letters ^{[1]} or symbols in the table . However, it is possible to represent the elements using colored squares and, accordingly, the link table, as is done, for example, in the online encyclopedia for mathematics *MathWorld* . ^{[2]}

It should be noted that, in general, no particular arrangement can be identified for the elements of a group. The only fixed rule is that the neutral element is the first element of every row and column (top left corner). In order for a link table to make sense without specifying the individual elements, for example as permutations , one should commit to a comprehensible rule for the order of the elements. This is possible if you choose the order according to the faculty-based number system . With a permutation generator you can generate all 120 permutations of 5 objects in an orderly order. ^{[3]} This gives the elements of the symmetrical group. To go to the alternating groupyou just have to delete all odd permutations. Now the 59 x 59 group multiplications have to be carried out with these elements.

Since the order has been determined according to the faculty-based number system, each permutation is assigned an ordinal number from 0 to 59. They are assigned to a *hue* in the HSV color space with constant *color saturation* and constant *brightness* . The size of the *hue* is usually specified on a color wheel with a range of values from 0 to 360 (in degrees). The hues for the permutations are now distributed equidistantly according to their permutation number over the range of values of the *hue* quantity . This gives you a set of rules for assigning a color to an element of any group.

In this order, the ordinal numbers 1 and 2 are fixed points for elements 1, 2 and 3, and 1 is the sole fixed point for elements 4 to 12. Thus the first three elements form an alternating subgroup of the type and elements 1 to 12 an alternating subgroup of the type . These two subsets of the alternating groupcan be clearly seen as diagonal blocks from the graphic on the link table. Furthermore, you immediately notice a grouping in blocks of 12 elements each.

## presentation

A presentation by generators and relations looks like this: The group becomes through two generators and the relations

Are defined. That is, any group made up of two elements is generated, which also fulfill the mentioned relations, is isomorphic to .

The itself is from and generated, and these elements satisfy the specified relations. ^{[4]}

## Transitive operation on 6 elements

The group has 24 elements of order 5, of which 4 together with the neutral element form a subgroup of order 5, there are therefore six subgroups of order 5, which are also the 5- Sylow groups . Since the group operates transitively on the six 5-Sylow groups by means of conjugation , because every two 5-Sylow groups are conjugated, we get in total thatoperates transitively on a variable element set. This operation is even faithful . The following reversal applies: ^{[5]}

- Every 60-element transitive permutation group on 6 elements is isomorphic to .

## A _{5} cannot be resolved

To any group is the commutator group defined as that of all commutators generated subgroup. One explains inductivelyand calls the group resolvable if there is one gives with .

The group is not resolvable. Is namely a cycle of three, so be the two numbers not represented in it . Then you do the math

- ,

that is, every three-cycle is a commutator and therefore off . Since the cycle of three according to the above, the group generate follows and thus for all . thats whynot resolvable. ^{[6]}

is the smallest non-resolvable group. It is well known that every p-group , that is to say group, is of orderfor a prime number , resolvable. Furthermore, groups are of order with prime numbers and resolvable according to Burnside's theorem . After all, groups are okay with prime numbers and dissolvable. ^{[7]} The smallest order that comes into question for a non-resolvable group is thus. is therefore a non-resolvable group of the smallest possible order, one can even show that it is the only non-resolvable group of order 60 apart from isomorphism.

From the non-solubility of it easily turns out that all and all With are not resolvable, because subgroups of resolvable groups are resolvable again and all these groups contain one to isomorphic subgroup.

## A _{5} is easy

A group is called simple when it is next to the trivial normal divisors and contains no further normal dividers. Since commutator groups are normal divisors, solvable groups that are not cyclically prime always have normal divisors, but non-resolvable groups can also have normal divisors, as in the example show the has as normal divisor. Therefore, the following statement is an intensification of the non-dissolvability:

- is simple.

That follows easily from the fact that is a non-resolvable group of the smallest possible order. That would be a non-trivial normal divisor, so would have and a really smaller order and would therefore be resolvable. From the well-known theorems about solvable groups it followed the solvability ofwhich gives the desired contradiction.

The argument just given for the simplicity of the is by no means trivial, because it uses Burnside's theorem, which is the minimality of 60 for the order of a non-resolvable group. However, one does not need Burnside's theorem in its full strength, the solvability of groups of order , which can be proven without representation theory With is sufficient. ^{[8th]}

In a simpler proof one shows first that all three-cycles are conjugated and then that each normal subgroup different from the one-element subgroup must contain at least one three-cycle. The normal divisor then contains all conjugates of this cycle of three, because normal divisors are by definition stable under conjugation, and therefore all cycles of three. But since this already generate follows , that is, there are no non-trivial normal divisors in . ^{[9]} This proof applies to everyone.

Another simpler and on the tailored proof using Sylow's theorems can be found in the textbook by B. Huppert given below. ^{[10]} It is also shown there:

- Is a simple group of order 60, so is .

## Charactertafel

The character board of thelooks like this: ^{[11]}

## Occurrence

### Symmetry group

As mentioned above, the group occurs as a rotation group of the icosahedron. In order to get an overview of the possible rotations that transform the icosahedron into itself, let us consider how they affect the edges. The 30 edges of the icosahedron are divided into 5 classes of parallel edges, each of these classes containing 6 parallel edges. Since rotations of the icosahedron must preserve parallelism of edges, they permute these 5 classes and one obtains a homomorphism from the icosahedron group into the. A closer look then shows that it is an injective homomorphism whose image is currentlyis. Therefore the icosahedral group is isomorphic to.^{[12]}

The elements of the thus correspond to the following rotations:

The 30 edges define 15 axes of rotation through the centers of pairs of opposite edges, and about each axis is a rotation about possible. These are the 15 elements of order 2.

The 20 side surfaces define 10 axes of rotation through the centers of pairs of opposing side surfaces, and about each of these axes is a rotation about or possible, these are the 20 elements of the 3rd order.

The 12 corners determine 6 axes of rotation through pairs of opposite corners, for each axis there are 4 rotations around , of order 5, that is a total of 24 rotations of order 5.

### Galoisgruppe

The polynomial

has one for isomorphic Galois group . ^{[13]} According to theorems of Galois theory , because of the non-solubility of the group established above, this means that the zeros of the polynomial cannot be represented by radicals of the coefficients. This is confirmed by Abel-Ruffini's theorem , according to which there are no general solution formulas for polynomials of degree 5 or higher, which consist of roots and arithmetic operations of the coefficients.

### PSL _{2} (4) and PSL _{2} (5)

The projective linear groups for a finite body With Elements are except for and easy and have Elements. Therefore applies

- .

Since all simple groups of order 60 are isomorphic to the are, follows

- .
^{[14]}

## Individual evidence

- ↑ You need all letters of the alphabet and then letter pairs from AA to BH, just like with table title lines in Microsoft Excel .
- ↑ MathWorld: Alternating Group Please note one difference: In the color graphic of the link table shown above, the neutral element is highlighted as a black square, which is not the case in the color graphic in MathWorld.
- ↑ Permutations This website contains the code to generate permutations in a defined order, in 97 programming languages.
- ^ B. Huppert:
*Endliche Gruppen I.*Springer-Verlag, 1967, Chapter I, Example 19.9. - ↑ B. Huppert:
*Endliche Gruppen I.*Springer-Verlag, 1967, Chapter II, Proposition 8.25. - ^ Kurt Meyberg:
*Algebra.*Part 1. With 287 exercises. 2nd Edition. Hanser, Munich / Vienna 1980, ISBN 3-446-13079-9 , sentence 2.6.5. - ↑ B. Huppert:
*Endliche Gruppen I.*Springer-Verlag, 1967, chapter I sentence 8.9, sentence 8.13 and chapter V sentence 7.3. - ↑ Derek J. S. Robinson:
*A Course in the Theory of Groups.*Springer-Verlag, 1996, ISBN 0-387-94461-3, Abschnitt 5.4.1. - ^ Kurt Meyberg:
*Algebra.*Part 1. With 287 exercises. 2nd Edition. Hanser, Munich / Vienna 1980, ISBN 3-446-13079-9 , sentence 2.4.16. - ^ B. Huppert:
*Endliche Gruppen I.*Springer-Verlag, 1967, Chapter I, Sentence 8.14. - ↑ JL Alperin, RB Bell:
*Groups and Representations*, Springer-Verlag (1995), ISBN 0-387-94525-3 , chap. 6, example 9. - ↑ K. Lamotke:
*Regular Solids and Isolated Singularities.*Vieweg-Verlag, Braunschweig 1986, ISBN 3-528-08958-X, §5:*The Rotation Groups of the Platonic Solids.* - ↑ John Swallow:
*Exploratory Galois Theory.*Cambridge University Press, Cambridge, UK / New York 2004, ISBN 0-521-83650-6, S. 176 (hinter Theorem 34.7). - ^ B. Huppert:
*Endliche Gruppen I.*Springer-Verlag, 1967, Chapter II, Sentence 6.14.