For a finite simple group with a subgroup of index , the coset action is nontrivial and its kernel is a normal subgroup, hence trivial. Its sign homomorphism must also be trivial: otherwise simplicity would give an isomorphism to , which cannot act transitively on at least three points. Thus the image lies in the alternating group. In particular Lagrange's theorem gives . This can exclude simplicity with very little counting: a group of order has a subgroup of index seven by Sylow theorems, but does not divide .
Faithful four-point action of GL2 over F2 Created 2026-10-06 Updated 2026-11-05
The general linear group over a finite field acts faithfully on the four vectors of , since a matrix fixing all vectors fixes the standard basis. The zero vector is fixed by every element; the induced action on the three nonzero vectors identifies this six-element group with . Swapping the two coordinates fixes and and exchanges the other two vectors, so its four-point permutation is odd. This action therefore embeds the group into with nontrivial composite sign homomorphism.
For the preliminary index assertion, the coset action gives a homomorphism . Its kernel is a normal subgroup and cannot be all of , because the action is transitive on points. Simplicity makes the kernel trivial. The sign homomorphism of this faithful action must be trivial: otherwise simplicity would identify with , impossible for a transitive action of degree at least three. Thus embeds in , and Lagrange gives
A group of order has a Sylow two-subgroup of index seven. If the group were simple, the preceding result would give . This fails because is divisible by while has only three factors of two. Thus there is no simple group of order .
For order , Sylow gives . If it is one, the order-seven Sylow is a normal subgroup. Otherwise its eight Sylows of order seven intersect only at the identity, giving nonidentity elements of order seven. Only eight elements remain including the identity. Every Sylow two-subgroup has order eight and consists entirely of these remaining elements. Hence all Sylow two-subgroups coincide and the order-eight subgroup is a normal subgroup. Either case gives a nontrivial proper normal subgroup, so no group of order is simple.
For a permutation , let be its permutation matrix, defined by . Define the signature of a permutation by . A permutation matrix is orthogonal, so and its permutation sign lies in . A transposition exchanges two columns of the identity and therefore has determinant . Every permutation is a product of transpositions, by decomposing each permutation cycle as
Hence for any expression as transpositions; the determinant definition proves that this parity of a permutation is independent of the expression. Equivalently the permutation sign is positive for an even permutation and negative for an odd permutation.
Composition is taken rightmost first. Since , we have . Multiplicativity of the determinant therefore proves the sign homomorphism identity
The alternating group consists of the even permutations:
It contains the identity. If , their product has permutation sign , and , so their inverses also belong to . This proves it is a subgroup. Finally, for every and ,
Thus is a normal subgroup of . This also exhibits directly why a kernel of a group homomorphism is normal.
The alternating group is the subgroup of the symmetric group consisting of even permutations:
For a permutation cycle of length ,
using rightmost-first composition. Its sign of a permutation is therefore . Multiplicativity of the sign homomorphism gives
Thus
Equivalently, is even when counts all cycles, including fixed points. Odd-length cycles contribute positive sign and impose no further restriction.
A simple group has no normal subgroup except the identity subgroup and the whole group. To prove the Simplicity of the alternating group A5, we compute its conjugacy classes. Since the sign homomorphism is onto, . Its possible nonidentity cycle types are a three-cycle, a product of two disjoint transpositions, and a five-cycle.
There are three-cycles. The centralizer in of consists of its three powers and an independent interchange of the two unused letters. Only the three powers are even. Its centralizer in therefore has order three, giving one conjugacy class of size by the orbit-stabilizer theorem.
There are products of two disjoint transpositions: choose the fixed letter and then a pairing of the other four letters. For , a commuting permutation fixes and may interchange the two pairs and swap within them, giving a centralizer of order eight in . It contains an odd element, , so exactly half its elements are even. The centralizer in has order four, and these fifteen elements form one conjugacy class of size .
Finally, there are five-cycles. A permutation commuting with a five-cycle is determined by the image of one letter and must be a power of that cycle. All five powers are even, so the centralizer in has order five. Each such conjugacy class has size , giving two classes of size twelve.
A normal subgroup must be a union of conjugacy classes and must include the identity. Its order therefore has the form
The resulting distinct possibilities are
Of these, only and divide . Lagrange's theorem rules out every other possible order. Hence
No such finite group exists. Cayley theorem embeds every finite group of order into : the left-regular group action sends to the permutation , and this is faithful because the image of the identity element is .
To make every image permutation even, let , with support disjoint from the first letters. For , let for an even permutation and for an odd permutation, and set
The sign homomorphism gives , and commutes with all permutations of the first letters. Thus is a group homomorphism. It is injective by restriction to those letters, and its sign is . Consequently
This is the alternating-group embedding of a finite group.
Every permutation is a product of transpositions, since a cycle can be written
with rightmost factors acting first. Define the sign of a permutation to be for a product of transpositions. To prove that it is well defined without assuming parity, let be the permutation matrix specified by . Then , and a transposition exchanges two columns of the identity, so its determinant is . Any decomposition into transpositions therefore has
The left-hand side depends only on , proving well-definedness. Multiplicativity of the determinant now gives the sign homomorphism:
For the first requested group embedding, use the faithful four-point action of GL2 over F2: label the four vectors in and let an invertible matrix act on them by multiplication. Composition of these actions gives a group homomorphism . If a matrix fixes every vector, it fixes both standard basis vectors and is the identity, so the action is faithful. The matrix
fixes and and exchanges with . Its image is a single transposition, hence . The composite sign map is nontrivial.
For the second group embedding, simply take
The preceding multiplication formula proves the group homomorphism property, and forces for every , proving injectivity.
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.
For , let be its permutation matrix and define
Since a transposition exchanges two columns, it has determinant . Thus any expression of as transpositions has sign , proving that the parity is independent of the expression. Moreover, , so the determinant proves
Hence the sign homomorphism is a surjective homomorphism for .
For any homomorphism , all transpositions have the same image because they are conjugate. Since transpositions generate , image would make trivial. Surjectivity therefore forces every transposition to map to , and hence .
Let act on its underlying set by left multiplication. The resulting homomorphism
is injective because . This is Cayley theorem. If , then would imply after right cancellation, so every nonidentity permutation in the image is fixed-point free.
If is even, pair every element with its inverse. Elements not equal to their inverses occur in pairs. Since the identity is self-inverse and the group has even size, there must be another self-inverse element . It has order two.
A permutation is odd when its sign is . If a subgroup contains an odd element, the restriction
is surjective. Its kernel is the set of even elements and has index two. Each coset has the same size, so precisely half of is odd.
Now let . An element of order two in the fixed-point-free regular representation is a product of
disjoint transpositions, so it is odd. The image therefore has an index-two normal subgroup of even permutations. Its order is , so it is nontrivial and proper. Hence
Nonabelian simple groups of even order do exist; the smallest example is the alternating group , of order sixty.
Let act by left multiplication on the set of left cosets. This gives a group action homomorphism
Its kernel
is a normal subgroup of , and the first isomorphism theorem gives . By Lagrange's theorem, divides . The image acts transitively on the cosets, so the orbit-stabilizer theorem shows that divides ; in particular,
Now suppose is nonabelian and simple. Since is proper, the coset action is nontrivial, so . Simplicity gives , and embeds into . Composing with the sign homomorphism gives
Its kernel is normal. A nontrivial map would embed the simple group into the abelian group of order two, which is impossible because is nonabelian. The sign is therefore always , so
A Sylow subgroup of a finite group is a subgroup whose order is the largest power of a prime dividing . The Sylow theorems say that such subgroups exist, that every -subgroup lies in one, that all Sylow -subgroups are conjugate, and that their number divides and obeys .
For the last congruence, let one Sylow -subgroup act by conjugation on the set of all Sylow -subgroups. Every orbit other than a fixed point has size divisible by . If is fixed, then . They are Sylow subgroups of this normalizer, so they are conjugate within ; because every element of fixes under conjugation, this forces . Thus there is exactly one fixed point and .
Now let have index with . The coset action gives a homomorphism
Its kernel is a normal subgroup of the simple group . It cannot be all of , since the action is transitive and nontrivial, so it is trivial. This would embed into , contrary to . Hence no such subgroup exists.
Suppose finally that a group of order were simple. The Sylow count satisfies
and simplicity excludes , so . Conjugation on these six subgroups gives a nontrivial homomorphism , which simplicity makes injective. Its image lies in , because the composite with the sign homomorphism must be trivial. It would therefore be a subgroup of of index , contradicting the result just proved. Thus
The sign homomorphism records parity of a permutation. The kernel of a group homomorphism in this case is the alternating group , consisting of even permutations. For it has index two in the symmetric group and order .
The cycle type is the multiset of lengths of the disjoint cycles, including fixed points if desired. For the complete count is
A single transposition and a four-cycle are odd and are excluded. Thus