Finite group theory studies groups with finitely many elements, including their subgroups, normal subgroups, group actions, and representations. Finiteness turns structural questions into arithmetic restrictions on group order.
For example, Lagrange's theorem says a subgroup order divides the group order, while the Sylow theorems locate subgroups of prime-power order and constrain their number. The symmetric groups encode permutations, and the dihedral groups encode polygon symmetries. These examples connect finite algebra to counting and geometry; finite simple groups serve as the possible factors of composition series.
A finite group of Lie type is built from an algebraic group in positive characteristic by taking fixed points of a suitable Frobenius-type endomorphism, often followed by a derived-group or central-quotient construction. The terminology covers classical matrix families and exceptional families, including twisted forms. It connects the structure of Lie theory with finite group theory; such a finite group is not a positive-dimensional real Lie group.[ref]
For example, consists of determinant-one matrices over a finite field. There are choices for its first column; for each nonzero first column, the determinant-one equation has solutions for the second. Dividing by its scalar center gives the projective special linear group
For , its order is sixty. These projective groups are simple for , whereas and are exceptions.[ref]
The classification of finite simple groups uses the simple members of the Lie-type families, with exceptional small parameters treated explicitly. A family name alone does not guarantee simplicity.
The classification of finite simple groups states that every finite simple group is isomorphic to a cyclic group of prime order, an alternating group with , a finite simple group of Lie type, or one of twenty-six sporadic simple groups. In the Lie-type families one takes the appropriate simple groups, respecting the exceptional small parameters and quotient constructions.[ref]
For example, is a simple abelian group, while is a simple nonabelian group of order sixty. The symmetric group is not simple: its subgroup is a proper nontrivial normal subgroup. The theorem lists the simple building blocks that occur as composition factors. It does not classify all finite groups: different group extensions can assemble the same factors into nonisomorphic groups.
These are all the groups of group order up to group isomorphism, with denoting a dihedral group of order . The Sylow theorems make the Sylow subgroups of orders five and seven unique: the possible counts divide fourteen and ten, respectively, and only one has the required residue. These normal subgroups of coprime order commute, giving a normal subgroup . Cauchy's theorem for finite groups provides an element of order two outside , so .
The automorphism of a finite cyclic group defining this semidirect product is a unit modulo with . The Chinese remainder theorem makes its restrictions modulo five and seven independently or . The resulting exponents are , giving the four displayed groups in order. Their center of a group orders are , so no two are isomorphic. Every case exists as the specified semidirect product.
Up to group isomorphism, the finite groups with at most six elements are the trivial group, the cyclic groups , the Klein four-group , and the symmetric group .
A group of prime cardinality is a cyclic group, since Lagrange's theorem forces any nonidentity element to generate it. For four elements, either an element has order of a group element four, or every nonidentity element is an involution. In the latter case the group of exponent two is abelian identity shows that two distinct nonidentity elements generate .
For a group of order six, either an element generates it or some element has order of a group element three: otherwise all nonidentity elements would be involutions, producing a four-element subgroup in contradiction with Lagrange's theorem. Pairing each element with its inverse element gives an involution outside . The subgroup has index of a subgroup two and is a normal subgroup, so or . The commuting case makes have order of a group element six, whereas the second case gives the multiplication rules of on the six distinct elements , .
All these groups embed in except and . The former is excluded by Lagrange's theorem; the latter is excluded because the disjoint cycle decomposition of a permutation of four letters cannot have least common multiple of cycle lengths equal to six.
Every group of order six is isomorphic to the cyclic group or the symmetric group on three points . Lagrange's theorem restricts element orders to . If there is an element of order six, it generates the group. If every nonidentity element had order two, the group of exponent two is abelian result would produce a subgroup of order four, contradicting Lagrange's theorem. Thus the noncyclic case has an element of order three.
There cannot be two distinct subgroups of order three: their intersection would be trivial and their nine pairwise products would be distinct elements of a six-element group. Hence exactly two elements have order three, and the other three nonidentity elements have order two. The subgroup has index two and is normal. Choose an involution outside it. Conjugation sends to or . The first case would make have order six, so . The generators therefore obey , , the relations realized by and in .
The largest nilpotent normal subgroup of a finite group . If denotes its p-core, distinct p-cores commute, and . Every normal nilpotent group has Sylow subgroups which are characteristic subgroups, so it is contained in this product.
In a finite soluble group, . Put and . If , choose an elementary abelian minimal normal subgroup of inside , and let be its preimage. Then , so is a nilpotent normal subgroup, contradicting .
For a finite group, centralizes its group socle. A nonabelian minimal normal subgroup meets trivially: otherwise it is nilpotent, and its nontrivial characteristic center makes it abelian. Their group commutators therefore vanish. An abelian minimal normal subgroup is an elementary abelian p-group; and by the fixed-point counting of a finite p-group on . Minimal normality makes , and other p-cores commute with .
A normal subgroup which is a nilpotent group. In a finite group its unique Sylow subgroups are characteristic subgroups and hence normal in the ambient group. Products of nilpotent normal subgroups are nilpotent groups: their normal Sylow subgroups of different prime characteristics commute.
The largest normal p-subgroup of a finite group. Products of normal p-subgroups are again normal p-subgroups, since . Thus the subgroup generated by all such subgroups is itself a p-subgroup. It is a characteristic subgroup.
A group of order ten is either a cyclic group or the dihedral group of the pentagon. Lagrange's theorem and the fact that a group of exponent two has power-of-two order force an element of order five or ten. In the latter case the group is cyclic. In the former case its order-five cyclic subgroup is normal by index two; an outside involution acts on it either trivially or by inversion. The trivial action gives , and inversion gives .
A group between a nonabelian simple group and its automorphism group. Finite two-transitive groups are either of this type or affine two-transitive groups, a structural theorem rather than an order-divisibility test.
Upper-unitriangular three-by-three matrices over the prime finite field form the finite analogue of the real Heisenberg group. In coordinates their multiplication is . The order is , and . For odd , every nonidentity element has order , but the group is nonabelian. For the exponent statement changes, so odd characteristic is essential for the nonisomorphic Gassmann equivalent regular subgroups construction.
Use the coordinate convention
In this convention the Heisenberg group over a prime field has the product
The subset is an Abelian subgroup of order : the middle coordinate in a product is , which is symmetric in the factors. Also lies in . The map is a surjective group homomorphism to the additive group of , with kernel of a group homomorphism . Hence is a normal subgroup of subgroup index , and its left cosets are exactly the level sets of .
For odd , an explicit group isomorphism from to the additive group is
The term in matrix multiplication cancels the cross term in . Thus is an elementary abelian group, isomorphic to .
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.
The orientation-preserving symmetries of a regular tetrahedron form the alternating group on its four vertices. There are twelve elements: the identity, eight rotational symmetries of order three, and three half-turns.
The full symmetry group of a regular tetrahedron is the symmetric group acting on its vertices. Its subgroups with at most six elements have eight types up to conjugation, with the following representative subgroups and counts:
A transposition is a reflection through the plane containing the two fixed vertices and the midpoint of the exchanged edge. A double transposition is a half-turn about the axis joining the midpoints of the two exchanged edges. A three-cycle is a one-third-turn about a vertex-to-opposite-face axis. A four-cycle is a quarter-turn composed with a reflection perpendicular to the opposite-edge midpoint axis; it is an improper orthogonal transformation.
The unique Klein four-group containing only double transpositions consists of the three opposite-edge half-turns and the identity element. The other three Klein four-groups consist of two perpendicular mirror reflections, their half-turn product, and the identity element. Each is a stabilizer subgroup of a vertex, including the three rotations and three mirror reflections preserving that vertex.
For completeness, a Klein four-group containing must contain the commuting involution or , yielding the displayed subgroup; one containing no transpositions must contain all three double transpositions. An subgroup has a unique cyclic subgroup of cardinality three, whose unique fixed vertex must therefore be preserved by the entire . These observations and the disjoint cycle decomposition exhaust the types allowed by groups of order at most six. The counts sum to .
The identity and three half-turns form a normal Klein four-group inside the proper rotational tetrahedral symmetry group . Conjugation preserves double-transposition cycle type, establishing normality. The quotient group has order three and is therefore cyclic. If is any 3-cycle, every element is uniquely with and . The formula defines a surjective group homomorphism with kernel . Normality allows the factors from to be moved past powers of , making exponents add modulo three and proving the homomorphism property directly.
The proper rotational tetrahedral symmetry group is , acting by even permutations of the vertices. Its conjugacy classes consist of the identity, the three half-turns about opposite-edge midpoint axes, four rotations through about outward-pointing vertex axes, and their four inverses. A 3-cycle has a three-element centralizer, so its class has size . Conjugating it to its inverse would require an odd permutation on its three moved vertices, so the two orientations form different classes in even though they lie in one class in .
Up to group isomorphism, the groups of order eight are , , , and , with here denoting the eight-element dihedral group. An element of order eight gives the first case. If every nonidentity element has order two the group is an elementary abelian group. Otherwise, after excluding elements of order eight, a cyclic subgroup of order four has index two; an element outside it either commutes with its generator or inverts it. In the latter case its square is either the identity or the central involution, giving the dihedral group or quaternion group.
Every finite group of odd order is a solvable group. In particular, a nonabelian simple group has even order and therefore has an involution by Cauchy's theorem for finite groups. This is a deep theorem, not an elementary consequence of the Sylow theorems.
The alternating group is the subgroup of the symmetric group consisting of even permutations, those expressible as an even number of transpositions. It is the kernel of the sign homomorphism , so it is a normal subgroup and has order for .
A three-cycle is even because , and three-cycles generate . For example, is a cyclic group of order three. For , is a nonabelian simple group, a central family in finite group theory and the obstruction behind the general unsolvability of polynomial equations by radicals.
Every maximal proper subgroup normalizes one of its minimal normal subgroups. As has no proper nonabelian simple subgroup, that subgroup is elementary abelian. Its possible types are . Their normalizers have orders respectively. The order-four normalizer lies in an order-twelve point stabilizer; the other three types are maximal and each forms a single conjugacy class. There are five, six and ten maximal subgroups of orders twelve, ten and six, respectively.
Except in degree six, the -cycles are characterized among order-three elements by the largest centralizer. Their cyclic subgroups correspond to three-element supports. Two different such subgroups commute exactly for disjoint supports; with one common point their generator products have order five, and with two common points those products have order two or three. Thus an automorphism induces an automorphism of . The maximal cliques of a Johnson graph reconstruct a permutation of the points. After undoing that permutation, an automorphism fixes every cyclic -subgroup. Product orders force its choices of generator inversion to be consistent on the connected graph, and inversion of every -cycle would reverse a noncommuting product. Hence it fixes all -cycles, which generate .
A connected finite hypergraph of three-element supports, with a three-cycle on each support, generates the full alternating group. To merge a new triple meeting an old alternating support in two letters, conjugate over unordered pairs of old letters. For one-letter overlap compare and : their quotient is , reducing to two two-letter-overlap steps.
The alternating conjugacy class splitting criterion gives seven conjugacy classes in . Their cycle types and sizes are , , , , , and two classes of size 72. Representatives of the split classes are a 5-cycle and its square. Their sizes sum to 360. A normal subgroup must be a union of these classes containing the identity, so these explicit sizes can prove simplicity using Lagrange's theorem.
For a prime number , a finite p-group is a group of order for some nonnegative integer . More generally, a possibly infinite group is called a p-group when every element has finite order a power of ; finiteness should therefore be stated when group order is used.
Examples are the cyclic group of order and the dihedral group of order eight for . Every nontrivial finite p-group has a nontrivial center of a group: its class equation shows that noncentral conjugacy classes have sizes divisible by , forcing the size of the center of a group to be divisible by . This makes induction on the order particularly effective.
The symmetric group is the group of all bijections of an -element set, with multiplication given by function composition. There are such permutations, since one chooses the images successively in ways.
For , composition is not commutative: but the reversed product is , applying the rightmost permutation first. Every permutation decomposes into disjoint cycles and into transpositions. By Cayley's theorem, every finite group embeds in some symmetric group, so permutation actions provide a universal concrete model of finite group operations.
The permutation group of a three-element set has six elements: the identity, three transpositions, and two three-cycles. A three-cycle and any transposition generate it, with relations , . Its alternating group is the normal cyclic subgroup of order three. It is the unique nonabelian isomorphism type of a group of order six.
The conjugacy classes of the symmetric group on three letters have sizes : the identity, the three transpositions and the two 3-cycles. A normal subgroup is a union of whole conjugacy classes and contains the identity. Its candidate orders are therefore . Lagrange's theorem excludes four, leaving precisely , and . The order-three subgroup is the cyclic group of the two 3-cycles and the identity; it is also the kernel of a group homomorphism of the sign map.
The first isomorphism theorem gives the corresponding quotients , and the trivial group. Thus these are exactly the possible images of surjective group homomorphisms from . Each occurs, by the identity map, the sign map and the constant identity map, respectively.
An automorphism preserving the transposition class is inner: commuting relations recover the vertex stars of the complete graph, with a small-case adjustment in degrees three and four. An involution class has the same size as the transposition class only in degree six, when triple transpositions also have size fifteen. Hence outer automorphism groups of symmetric groups are trivial outside degree six and have size at most two in degree six.
// Target: combinatorics.bigb
A permutation of order two is a product of disjoint transpositions. Its conjugacy class has the displayed size. For , equality with the transposition class requires . The left side grows strictly with . At , its ratio to the right side is one only for ; at it jumps from below to above one between and , and for it is already greater than one. Thus degree six is the only possible exceptional degree for an group automorphism not preserving transpositions.
A subgroup of the symmetric group of a set, acting faithfully by permutations. A finite permutation group specified by generators can be enumerated by repeatedly multiplying the elements already found by those generators until no new element appears. Its orbits and conjugacy classes can then be computed directly.
The historical study of permutations of letters or quantities and their compositions, closely connected with the development of group theory and the theory of polynomial equations.
A permutation group on a set is oligomorphic when its diagonal action on ordered -tuples has finitely many orbits for every positive integer . For a countable model of a complete theory, an oligomorphic automorphism group makes every finite-arity type space finite: realized types are dense, and only finitely many are possible because types are constant on orbits.
For and , an -cycle and generate exactly when . Their conjugate transpositions connect labels differing by modulo . This graph is connected exactly at coprime separation, so transpositions on a connected graph generate the symmetric group. Otherwise residue classes modulo form a nontrivial block system preserved by both generators.
Associate a transposition to each edge of a finite connected graph. For a simple path , let . Then , using rightmost-first composition. Thus edge transpositions generate every transposition, and hence the full symmetric group.
The parity of a permutation records whether it is a product of an even or odd number of transpositions. It is well-defined and equals the sign of the corresponding permutation matrix.
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.
A permutation cycle sends to , sends to , and fixes every other element. Its order is .
For , every permutation of order of a permutation in is one full cycle if and only if is a prime power. If , all lengths in its disjoint cycle decomposition divide , and their least common multiple is their maximum. One cycle therefore has length and uses every symbol. If has more than one prime divisor, write with coprime by separating one full prime-power factor from the others. Since , disjoint cycles of lengths and fit inside . Their product has order of a permutation , but is not a full cycle.
A disjoint cycle decomposition writes a permutation as a product of disjoint permutation cycles. Repeatedly apply the permutation to a point until it returns to that point; these successive points form one cycle. Repeat on points not yet used. Finiteness and injectivity ensure that each process returns to its starting point. This partitions the underlying finite set into cycles. The decomposition is unique up to reordering the cycles, cyclically rotating the entries within each cycle, and optionally omitting fixed-point one-cycles. Include the one-cycles when specifying cycle type.
The cycle type of a permutation is the multiset of lengths in its decomposition into disjoint permutation cycles, including one-cycles for fixed points. Two permutations in the same symmetric group are conjugate exactly when they have the same cycle type.
Conjugation preserves order of a group element, because , and preserves the sign of a permutation, because sign is a group homomorphism into . These invariants do not determine cycle type. In , and both have order three and positive sign, but have three and zero fixed points respectively. Conjugation relabels cycles, so these permutations are not conjugate.
Squaring an odd-length permutation cycle retains its length, whereas an even-length cycle splits into two cycles of half its length. Thus if any even cycle is present, the number of cycles strictly increases, so the cycle type changes. Since conjugate permutations in a symmetric group have the same cycle type, a permutation is conjugate to its square precisely when all its cycle lengths are odd, equivalently when its order of a group element is odd.
Left multiplication of a permutation by a transposition swaps the two target labels . If they occur in different cycles, becomes the single cycle . If they occur in the same cycle, that formula reverses and splits the cycle in two. All other cycles are unchanged, so the total number of cycles, including fixed points, decreases or increases by exactly one. Empty intermediate lists yield one-cycles and require no exceptional case.
A three-cycle is a permutation cycle of length three. On any chosen set of three letters, the two possible three-cycles are inverses of one another.
Permutation cycles with disjoint supports commute. The order of their product is the least common multiple of their lengths.
The support of a permutation is the set of elements it does not fix. A permutation has finite support when this set is finite.
The sign homomorphism is the determinant of the corresponding permutation matrix. A transposition has sign , so this also proves that the parity of any transposition decomposition is well-defined.
An odd permutation has sign , equivalently it is a product of an odd number of transpositions.
An even permutation has sign , equivalently it is a product of an even number of transpositions.
The quaternion group is with . It is a nonabelian group of order eight: but .
Its unique element of order two is , and its other six nonidentity elements have order four. Every subgroup is normal: the three order-four subgroups have index two, and is central. Thus it is a nonabelian Dedekind group. It differs from the dihedral group of order eight, which has several elements of order two, despite having the same group order.
In the quaternion group, commutes with each generator because any element commutes with its powers. Hence is central and is a normal subgroup. The reverse products satisfy , , , so none of is central. Therefore .
The four cosets are . Each nonidentity coset squares to , and . Thus the quotient group is the Klein four-group. Explicitly, mapping to its identity and mapping to its three different nonidentity elements is a surjective group homomorphism with group kernel . The first isomorphism theorem gives the title result.
The quaternion group has conjugacy classes , , , , , with sizes . Over the complex numbers, the number of classes and the sum of squares of irreducible representation dimensions force four one-dimensional representations and one two-dimensional representation. For , the linear character rows on these classes are . Orthogonality then gives the remaining row . A representation with character contains two copies of the two-dimensional irrep and none of the linear irreps, by the character inner product. The choice of scalar field matters: the corresponding quaternionic four-dimensional real representation is irreducible over the reals.
The least size of a finite set on which the quaternion group acts faithfully is eight. Every nontrivial subgroup of contains its central involution . In an action on fewer than eight points, the orbit-stabilizer theorem makes every stabilizer subgroup nontrivial, so fixes every point. This rules out a faithful group action, even with several group orbits. The regular action on eight points is faithful by Cayley theorem.
The dicyclic group of order has generators
Every element has a unique form or , with .
This dicyclic group has classes , , , and the two parity classes of , of sizes . Its quotient by is cyclic of order four, supplying four linear characters with , . Its two remaining irreducible representations have and for , where . The traces are on and zero on . Distinct diagonal eigenlines are exchanged by , proving irreducibility; the degree-square sum proves completeness.
For the dicyclic group , with , there are four linear characters and irreducible complex characters of degree two.
The linear characters are determined by and , where . Their values are on and on . When is even both choices of allow ; when is odd, requires .
Put . For , take the group representation
Its character is at and zero at every . The distinct eigenlines of are exchanged by , proving that this group representation is an irreducible representation. The degree-square sum proves completeness. These formulas specify every row of the character table; the elements outside form two conjugacy classes, rather than two distinct cosets of that index-two cyclic subgroup.
A finite p-group is a finite group whose order is a power of one prime number .
Induct on the order of the finite p-group. Its center of a group is nontrivial unless the group itself is trivial. Quotient by the center to obtain a smaller finite p-group and lift a central series supplied by induction. Prepending the center gives a central series for the original group: the first term is central, and the remaining commutator-containment conditions are exactly the lifted quotient conditions. Hence every finite p-group is a nilpotent group. Since central factors are Abelian, every nilpotent group is also a soluble group.
A p-subgroup is a subgroup which is a finite p-group, for a specified prime . Every p-subgroup lies in a Sylow subgroup.
A p-subgroup is p-radical if it equals the p-core of its normalizer. Every defect group of a block is p-radical by defect groups are centralizer-conjugate Sylow intersections. Being an intersection of arbitrary Sylow subgroups alone is weaker than the centralizer-conjugate statement used in that argument.
The displayed descending filtration combines powers and group commutators. In a pro-p group, take the closure of the generated product at each step. For a powerful p-group these layers are , with iterated closed power subgroups in the infinite case. The successive quotients are elementary abelian p-groups.
A finite p-group is powerful if for odd , or for . Here powers denote generated subgroups. The same definition applies to pro-p groups using closed power and commutator subgroups. Its Frattini subgroup is . For odd , successive power layers admit linear correction of roots, which makes every element of an actual th power.
For an odd prime number , a finite p-group that is a product of cyclic subgroups is a powerful p-group. Indeed, has exponent of a finite group and the same minimal generator number . Its cyclic factorization gives , while its Frattini quotient has order . Thus , is an elementary abelian group, and . The condition on the number of factors is essential: the nonabelian Heisenberg group over has exponent and is a product of three cyclic subgroups, although its minimal generator number is two.
For odd , a subgroup of a finite powerful p-group satisfies . Here is the dimension of the Frattini quotient. Set , , , and . The onto power map sends into the image of in . Since , this image has dimension at least . Also . Induction on , applied to the powerful subgroup , gives . Consequently
The last inequality is rank-nullity theorem.
For odd , set and . Powerful embedding gives . Modulo , commutators with are central and have exponent dividing , so when . Also the power map is a surjective homomorphism. First find a root modulo , then multiply it by successive corrections in . The process terminates for a finite p-group, and converges for a pro-p group with separated power filtration. This proves that the generated power subgroup consists of actual powers.
A normal subgroup is powerfully embedded in a finite p-group or pro-p group if for odd , or for ; use closed generated subgroups in the pro-p group case. The condition implies that is a powerful p-group. For odd , both and remain powerfully embedded.
The nontrivial center of a finite p-group theorem implies that the center of a group of order has order or . If it has order , the quotient by the center has prime order and is cyclic; a cyclic quotient by the center forces the whole group to be abelian, contradicting the assumed size of its center. Thus the group is abelian. An element of order makes it cyclic. Otherwise choose and ; their order- cyclic subgroups intersect trivially and generate the direct product of groups . The two possibilities are nonisomorphic because only the cyclic one has an element of order .
Every proper subgroup of a finite p-group is properly contained in its normalizer. Let act on the left cosets by left multiplication. The fixed cosets are those represented by elements of , so there are of them. All other orbits of a group action have sizes divisible by . Since is divisible by and at least one coset is fixed, the fixed-coset count is a positive multiple of . This also proves .
A nontrivial normal subgroup of a finite p-group meets the center of a group nontrivially. The conjugation action of on has singleton orbits exactly at . The orbit-stabilizer theorem makes every other orbit size divisible by , so . Since the intersection contains the identity, its size is at least .
Every nontrivial finite p-group has a nontrivial center. The conjugation action partitions the group into conjugacy classes whose noncentral sizes are positive powers of ; the class equation then implies .
For a finite group , the Frattini subgroup is the intersection of all maximal subgroups. Its elements are exactly the non-generators: an element in every maximal subgroup cannot enlarge a proper generated subgroup to , while an element outside a maximal subgroup generates together with it.
For a finite p-group,
where is generated by all th powers and is the commutator subgroup. Every maximal subgroup has index and is normal, so its quotient group is cyclic of order and it contains . Conversely is an elementary abelian p-group; each nonzero vector is excluded by some hyperplane, whose preimage is a maximal subgroup. This proves equality.
Thus is its order- subgroup, whereas . The Frattini quotient records the independent generators in the Burnside basis theorem.
Let in a finite group. If contains and is a nilpotent group, every Sylow subgroup of has . The Frattini argument gives , and the defining non-generator property of forces . Hence is a nilpotent group.
An element that can always be omitted from a generating family. These are exactly the elements of the Frattini subgroup: a proper generated subgroup is contained in a maximal subgroup, while an element outside a maximal subgroup generates the group together with it.
The Frattini quotient of a finite p-group is an elementary abelian p-group. Its dimension over is the minimum number of generators of ; in particular, it has dimension at least two when is noncyclic.
A subset generates a finite p-group precisely when its images span the Frattini quotient. Indeed implies , since otherwise a maximal subgroup contains both factors. Minimal generating sets correspond to vector-space bases in the quotient.
A nontrivial simple group has no normal subgroups other than the identity subgroup and itself.
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 .
For a nontrivial simple soluble group, the commutator subgroup is either the identity or the whole group. It cannot be the whole group because the derived series would never terminate. The group is therefore Abelian. Every nonidentity element then generates a normal cyclic subgroup, which must be the whole group. An infinite cyclic group has proper nontrivial subgroups; a finite cyclic group is simple exactly when its order is prime. Thus the soluble simple groups are precisely the cyclic groups of prime order.
A nontrivial finite group whose only normal subgroups are the trivial group and the whole group. A cyclic group of prime number order gives an abelian example; gives a nonabelian alternating group example. Finite versions of classical groups can produce further examples after taking suitable subgroups and quotients; small parameters require separate checks.
For a finite simple group of this order, gives a normal Sylow -subgroup, and gives a nontrivial sign homomorphism from the regular action, because an involution swaps fifteen pairs. Thus . The Sylow -count divides ; it cannot be one or three. If it is five, a Sylow subgroup's normalizer has index five. If it is fifteen, the strengthened Sylow congruence from intersections produces two Sylow subgroups meeting in index two. Their common subgroup is normal in both, so its normalizer contains both and has index three or five. Simplicity excludes index three. The resulting faithful degree-five action embeds in and forces order , proving the conclusion.
For a faithful primitive group action, suppose a point stabilizer has an abelian normal subgroup whose conjugates generate the whole group. Every nontrivial normal subgroup then contains the derived subgroup. Indeed the normal subgroup is transitive, and all those conjugates have the same image in the quotient, making the quotient abelian. If the whole group is nontrivial and perfect, it is simple.
A normal subgroup of has order dividing 360 and consists of the identity plus whole conjugacy classes of the alternating group on six letters. If it omits the odd-sized class of size 45, its order is an odd divisor and no nontrivial class sum fits. If it includes that class, the possible class sums not exceeding 180 are , none dividing 360. Every proper subgroup has order at most 180; therefore is a simple group.
The alternating group is simple for every . In particular it has no proper subgroup of index two, since every index-two subgroup is normal.
A finite nonabelian simple group is a finite group that is a nonabelian group and a simple group. Every such group is a perfect group because its commutator subgroup is a nontrivial normal subgroup.
The Monster group is the largest of the twenty-six sporadic simple groups. Its order is
It is a finite nonabelian simple group: it has no nontrivial proper normal subgroups. Size alone does not specify its multiplication; its structure is studied through representations and subgroups.[ref]
The ATLAS specifies generators in conjugacy classes , with of order . The letters distinguish different conjugacy classes having the same element order; the relations alone are not a presentation of the Monster group. This illustrates how computational data about enormous groups can still start from two carefully chosen elements.
A sporadic simple group is one of the twenty-six exceptional finite nonabelian simple groups that lie outside the alternating and Lie-type families in the classification of finite simple groups. “Sporadic” describes their place in that classification; it does not mean randomly chosen or lacking internal structure.[ref]
For example, the Mathieu group acts by coordinate permutations preserving the extended binary Golay code on twenty-four positions. Thus an exceptional group can emerge as the exact symmetry of a highly organized error-correcting code. The Monster group is another sporadic example, vastly larger. In contrast, the alternating group is simple but belongs to an infinite family, so is not sporadic.
Let be the smallest prime divisor of the order of a finite nonabelian simple group. A cyclic Sylow subgroup would give a normal p-complement, so if does not divide the order, the Sylow subgroup must be . Conjugation embeds its normalizer modulo centralizer into , and this quotient has order prime to . For odd , every other prime divisor of is smaller than , again forcing trivial conjugation and a contradiction to the Burnside transfer theorem. For , nontrivial conjugation must have order three, giving . The groups give infinitely many examples with exactly two factors of two in their orders.
The five simple Mathieu groups are the exceptional finite simple groups . Their natural permutation group degrees are the displayed subscripts, with transitivity degrees , respectively.
One concrete definition of is the subgroup of generated by
These are the explicit generators of a group in the official Chapter 50, section 50.1-13, MathieuGroup example. Its order is , and its natural group action is sharply four-transitive.
The larger groups have useful design and coding realizations. is the automorphism group of the small Witt design; a point stabilizer is . The coordinate permutations preserving the extended binary Golay code form ; its one-point and two-point pointwise stabilizers are and . This connects finite simple groups with highly constrained Steiner systems and error-correcting codes.[ref]
For , the small Ree group is a twisted finite group of Lie type. In characteristic three, the algebraic group of type G2 has an exceptional endomorphism with , the Frobenius endomorphism of an algebraic group. The fixed points of form . This explains both the twist and the odd exponent restriction.[ref]
It is simple, has order , and acts two-transitively on points. At the degree is and the order is . The excluded parameter gives a nonsimple group. The characteristic-two family is a different Ree family.
For , the Suzuki group is a twisted finite group of Lie type. In characteristic two, the algebraic symplectic group over a field has an exceptional endomorphism satisfying . Fixed points of give ; its natural matrix representation has degree four.[ref]
It is simple, of order , and acts two-transitively on the points of a Suzuki ovoid. A point stabilizer has order and contains a subgroup of order acting regularly on the remaining points. At the degree is and the order is . The parameter instead gives a nonsimple group of order .
A Suzuki ovoid is a special set of points in the three-dimensional projective space over , for . It is an ovoid: no three of its points are collinear. Its projective symmetries include the Suzuki group of Lie type , acting two-transitively on these points.
For , fixing one point leaves a stabilizer of order , with a subgroup of order acting regularly on the other points. Thus the geometry realizes the natural permutation action of the group, rather than only its four-dimensional matrix action. For , there are ovoid points and .
The absence of collinear triples means that choosing two ovoid points determines a secant containing exactly those two ovoid points. There are therefore such secants. This turns part of the geometry into an explicit pair-counting problem.[ref]
The conjugacy classes of have sizes
A normal subgroup is a union of these classes containing the identity. No proper nontrivial such union has size dividing , so Lagrange's theorem proves that is simple.
Every finite nonabelian simple group has order at least 60; the alternating group A5 attains this bound.
The group consists of invertible by matrices over the finite field .
If counts conjugacy classes in , then . Associate a partition to each irreducible polynomial other than t. The Euler product over those polynomials counts monic polynomials with nonzero constant term and is .
The group of invertible linear maps preserving a nondegenerate Hermitian form over a quadratic finite field is, in an orthonormal basis, the displayed matrix group. Here denotes the size of the field on which the matrices act; some authors denote this same group by . Imposing determinant one gives the special unitary subgroup, and subsequently quotienting its scalar center gives the projective special unitary group over a finite field.
The projective quotient of determinant-one matrices preserving a nondegenerate Hermitian form over , with conjugation . In dimension three its natural two-transitive action has isotropic points. For its order is .
Articles were limited to the first 100 out of 175 total.

Articles by others on the same topic (0)

There are currently no matching articles.