An even permutation in the alternating group has one of the cycle types listed below. In the symmetric group, a type with cycles of length has centralizer order and class size : commuting permutations can rotate each cycle and exchange equal-length cycles.
An conjugacy class remains one class if its centralizer contains an odd permutation. Otherwise it splits into two equal classes, since the centralizer is already contained in the index-two subgroup . This is the alternating conjugacy class splitting criterion. For the nonsplitting nonidentity types here, odd commuting permutations are respectively a constituent transposition, a transposition of fixed points, the interchange of two 3-cycles, and the constituent 4-cycle. For a 5-cycle with one fixed point, the centralizer is its cyclic group of order five and contains only even permutations.
Thus the conjugacy classes of the alternating group on six letters are:
The two 5-cycle representatives lie in different classes. A relabelling that conjugates a 5-cycle to its square acts on its five positions as multiplication by two modulo five, a 4-cycle on the nonzero positions, hence is odd. Every other such conjugator differs by an even centralizer element. The sizes sum to , so the list is exhaustive.
For simplicity of the alternating group on six letters, let be a normal subgroup. It contains the identity and is a union of full conjugacy classes; also divides by Lagrange's theorem. A proper subgroup has order at most .
If the class of size 45 is absent, is odd. The odd divisors of are . A nontrivial union has order at least 41, but no selection of the even class sizes sums to , so order 45 is impossible. Thus in this case.
If the size-45 class is present, write with and . The possible values at most are , none dividing . Hence no proper nontrivial normal subgroup exists:
True. The sign of a permutation is a group homomorphism , as follows, for example, from the multiplicative determinant of permutation matrices. Its kernel of a group homomorphism is the alternating group
A transposition maps to , so this homomorphism is onto.
A permutation representation is a group homomorphism , equivalently a group action on a set . The left regular action takes and . Each such map is a bijection, and . If is the identity, evaluating at the identity element gives . Thus the representation is faithful. Numbering the elements of identifies with the symmetric group , proving Cayley theorem:
For a nonabelian simple group, compose this faithful representation with the sign of a permutation homomorphism . Its kernel is a normal subgroup of , hence either trivial or all of . A trivial kernel would embed in a group of order two, contradicting noncommutativity. Therefore every represented element is even, and the same representation embeds in the alternating group .
Finally let act on the two cosets of its normal subgroup . An even permutation fixes both cosets, whereas an odd permutation exchanges them. This gives with kernel ; explicitly, send even permutations to the identity and odd permutations to .
If and belong to different factors, the powers have distinct normal forms of length . Every nontrivial free product is therefore an infinite group, whereas the alternating group is a finite group of order .
With rightmost-first composition, a permutation cycle satisfies
Tracing each verifies the equality, and every other letter is fixed. Thus every cycle is a product of transpositions; decomposing a permutation into disjoint permutation cycles proves that every element of is such a product. The identity is the empty product.
To establish that parity is well defined, use the permutation matrix defined by . Its determinant is , and . A transposition swaps two columns of the identity matrix and has determinant . Therefore if is expressed as a product of transpositions,
The left side depends only on , so any two decompositions have the same parity. Define
Multiplicativity of the determinant makes this the sign homomorphism. Its kernel of a group homomorphism is the alternating group
It is a normal subgroup consisting of the even permutations. For the sign map is surjective because a transposition has sign , so . For both groups are trivial.
A finite nonabelian simple group cannot be a p-group: a nontrivial finite p-group has nontrivial centre of a group, since its class equation makes every noncentral conjugacy class size divisible by , and hence makes the centre size a positive multiple of . That centre is a normal subgroup, so must be the whole group if is a simple group, making it abelian; an abelian simple group has prime order. Therefore every Sylow subgroup here is nontrivial and proper. It cannot be normal, so .
To obtain a simple group embedding from Sylow conjugation, the conjugation action on Sylow subgroups gives a group homomorphism . This group action is transitive by the Sylow theorems and is nontrivial since . Its kernel of a group homomorphism is a normal subgroup, so the defining property of a simple group makes the kernel of a group homomorphism trivial: is an embedding. Now compose with the sign of a permutation . A nontrivial composite would again be injective because is a simple group, embedding in a group of order two, impossible for a nonabelian group. Thus lies in the alternating group . By Lagrange's theorem,
The argument only invokes the factorial formula once ; the impossible case itself is also excluded by the embedding.
If a monic polynomial has roots in a splitting field, its polynomial discriminant is
It is a symmetric polynomial in the roots, so it belongs to the base field; it is nonzero exactly when is a separable polynomial.
Put
the Vandermonde determinant. A root permutation sends to . Hence the Galois group of a polynomial is contained in the alternating group exactly when every Galois automorphism fixes , which by the fixed-field property is equivalent to . This implies that is a square in . Conversely, if for , then , so . The Galois group therefore fixes and consists of even permutations. This proves the discriminant criterion for an alternating Galois group.
Now let
The rational root theorem shows that none of is a root, so this cubic is irreducible over . The discriminant of a depressed cubic is
This is not a square in , so the Galois group of an irreducible cubic is over .
Over , the discriminant is the square
The cubic remains irreducible: a root in the degree-two extension would generate over both a degree-three field, by irreducibility, and a subfield of a degree-two field, contradicting the tower law for field extensions. Its Galois group over is consequently .
Sign homomorphism Created 2026-09-24 Updated 2026-10-03
The sign homomorphism sends an even permutation to and an odd permutation to ; its kernel is the alternating group.
A symmetric group is the group of all bijections from a set to itself, with function composition as its operation.
Tetrahedral symmetry Created 2026-10-06 Updated 2026-10-07
A regular tetrahedron has a proper rotational symmetry group of order 12, isomorphic to the alternating group acting on its four vertices. Its full spatial symmetry group has order 24 and is isomorphic to the symmetric group ; the additional operations reverse orientation. Three-fold vertex/face-axis rotations and half-turns about opposite-edge midpoints generate the proper group. The distinction matters when a field symmetry uses only proper rotations, but a scalar density also admits reflections.