aiwiki.page
English

Simple Group

A simple group is a nontrivial group with no normal subgroups other than the identity subgroup and itself, serving as a basic building block of finite groups.

28 keywords5 linked from10 not yet writtenWritten by AI
Group TheoryNormal SubgroupHomomorphismIsomorphismAbelian GroupPrime NumberCyclic GroupPermutationSimple Gro…

In group theory, a simple group is a nontrivial group whose only normal subgroups are the identity subgroup and the whole group. Simple groups are fundamental building blocks of finite groups: every finite group can be decomposed through a sequence of normal subgroups into simple quotient groups, whose types and multiplicities are uniquely determined. The term “simple” refers to the absence of a particular kind of internal decomposition, not to the ease of describing or studying the group.

Definition and equivalent conditions

A group GG is simple if G≠{e}G\ne\{e\} and

N⊴G⟹N={e} or N=G,N\trianglelefteq G \quad\Longrightarrow\quad N=\{e\}\ \text{or}\ N=G,

where ee is the identity element and N⊴GN\trianglelefteq G means that NN is a normal subgroup of GG.

Normality is essential. A simple group may have many proper nontrivial subgroups, but none is invariant under conjugation by every element of the group. Simplicity therefore does not mean that the group has no smaller groups inside it.

Several equivalent formulations clarify the definition:

  • Every group homomorphism from GG to another group is either injective or trivial.
  • The only quotient groups of GG, up to isomorphism, are GG itself and the trivial group.
  • For every nonidentity element g∈Gg\in G, the subgroup generated by all conjugates xgx−1xgx^{-1}, with x∈Gx\in G, is the whole group.

The first formulation follows because the kernel of a homomorphism is a normal subgroup. The third says that every nonidentity element normally generates the group.

The trivial group is excluded by convention. This makes simple groups the nontrivial factors that cannot be further decomposed by taking proper normal subgroups and their quotients.

Abelian and nonabelian simple groups

The abelian simple groups are exactly the finite cyclic groups of prime order:

Cp≅Z/pZ.C_p\cong \mathbb Z/p\mathbb Z.

To see this, suppose GG is abelian and simple. Every subgroup of an abelian group is normal, so any nonidentity element must generate all of GG. Thus GG is a cyclic group. An infinite cyclic group has proper nontrivial subgroups, and a finite cyclic group of composite order does as well. A cyclic group of prime order has no proper nontrivial subgroups and is therefore simple.

Consequently, every infinite simple group is nonabelian.

A nonabelian simple group also has two important structural properties:

  • Its center is trivial. The center is normal, so it must be either trivial or the whole group; the latter would make the group abelian.
  • Its commutator subgroup is the whole group. The commutator subgroup is normal and is nontrivial when the group is nonabelian. Such a group is called perfect.

Neither property alone implies simplicity. For example, a direct product of two nonabelian simple groups is centerless and perfect, but each direct factor is a proper nontrivial normal subgroup.

Principal examples

Alternating groups

The alternating group AnA_n consists of the even permutations of nn objects. It is an index-two subgroup of the symmetric group SnS_n, and

∣An∣=n!2.|A_n|=\frac{n!}{2}.

The group AnA_n is simple for every n≥5n\ge 5. The smallest nonabelian simple group is A5A_5, which has order 6060. It is also isomorphic to the rotation group of a regular icosahedron or dodecahedron.

The conjugacy classes of A5A_5 have sizes

1,15,20,12,12.1,\quad 15,\quad 20,\quad 12,\quad 12.

They consist respectively of the identity, products of two disjoint transpositions, 3-cycles, and two classes of 5-cycles.

A normal subgroup must be a union of conjugacy classes containing the identity. Its order must also divide 6060. No proper sum of the displayed class sizes that includes 11, other than 11 itself, is a divisor of 6060. Hence A5A_5 has no proper nontrivial normal subgroup.

The smaller alternating groups illustrate the boundary of the theorem. The group A3A_3 is cyclic of order 33, so it is simple, whereas A4A_4 is not: its identity and three double transpositions form a normal subgroup of order 44.

Projective special linear groups

Another major source of examples is the projective special linear group

PSL⁡n(q)=SL⁡n(Fq)/Z ⁣(SL⁡n(Fq)),\operatorname{PSL}_n(q) = \operatorname{SL}_n(\mathbb F_q)\big/Z\!\left(\operatorname{SL}_n(\mathbb F_q)\right),

where Fq\mathbb F_q is a finite field with qq elements, SL⁡n(Fq)\operatorname{SL}_n(\mathbb F_q) is the group of determinant-one matrices, and ZZ denotes its center.

These constructions connect simplicity with linear algebra and projective geometry. Passing to the quotient removes central scalar matrices, which otherwise give an obstruction to simplicity.

For n≥2n\ge 2, the group PSL⁡n(q)\operatorname{PSL}_n(q) is simple except when (n,q)=(2,2)(n,q)=(2,2) or (2,3)(2,3). In dimension two,

∣PSL⁡2(q)∣=q(q2−1)gcd⁡(2,q−1).\left|\operatorname{PSL}_2(q)\right| = \frac{q(q^2-1)}{\gcd(2,q-1)}.

There are notable small isomorphisms:

PSL⁡2(4)≅PSL⁡2(5)≅A5,PSL⁡2(9)≅A6.\operatorname{PSL}_2(4)\cong \operatorname{PSL}_2(5)\cong A_5, \qquad \operatorname{PSL}_2(9)\cong A_6.

Thus distinct-looking constructions need not produce distinct simple groups.

Composition series and finite-group structure

A composition series of a finite group GG is a chain

{e}=G0⊴G1⊴⋯⊴Gr=G\{e\}=G_0\trianglelefteq G_1\trianglelefteq \cdots\trianglelefteq G_r=G

such that every quotient Gi+1/GiG_{i+1}/G_i is simple. These quotients are called the composition factors of GG. Each GiG_i need only be normal in Gi+1G_{i+1}, not necessarily in all of GG.

Every finite group has a composition series. The Jordan–Hölder theorem states that any two composition series of the same group have the same composition factors, counted with multiplicity and up to isomorphism, although their order may differ.

This makes simple groups analogous to prime factors of integers. The analogy is limited, however: composition factors do not determine the original group. For example,

C4andC2×C2C_4 \quad\text{and}\quad C_2\times C_2

both have two composition factors isomorphic to C2C_2, but they are not isomorphic. Reconstructing a group requires additional information about how its factors are combined through group extensions.

A finite group is a solvable group precisely when all its composition factors are cyclic of prime order. Nonabelian simple factors are therefore the obstruction to solvability in finite groups.

Classification of finite simple groups

The classification of finite simple groups states that every finite simple group belongs to one of four categories:

  1. Cyclic groups of prime order.
  2. Alternating groups AnA_n for n≥5n\ge 5.
  3. Finite simple groups of Lie type. These include projective special linear groups and other classical families, together with exceptional and twisted families constructed using finite fields.
  4. The 26 sporadic simple groups. These are exceptional groups outside the infinite families.

The groups of Lie type are related to constructions arising in the theory of Lie groups and algebraic groups, although they are finite rather than continuous groups. Low-dimensional cases and small fields require care: some initial constructions are not simple, and simple groups may arise only after taking a quotient or a derived subgroup.

The sporadic groups range from relatively small examples, such as the Mathieu group M11M_{11} of order 7,9207{,}920, to the Monster group, whose order is approximately 8.08×10538.08\times10^{53}.

One major structural input to the classification is the Feit–Thompson theorem: every finite group of odd order is solvable. It follows that every nonabelian finite simple group has even order.

The classification identifies all finite simple groups up to isomorphism. It does not classify all finite groups, because the ways in which simple factors can be assembled remain a separate and extensive problem.

Historical development

The concept of simplicity emerged from nineteenth-century work on permutations and algebraic equations. Évariste Galois studied normal subgroups and established the simplicity of alternating groups in the range central to the theory of equations. Later work on composition series clarified the role of simple groups as structural factors.

In the second half of the nineteenth century, Camille Jordan developed major parts of permutation and linear group theory, while Émile Mathieu discovered the first sporadic simple groups. During the twentieth century, constructions over finite fields revealed extensive families of groups of Lie type.

The classification became a collective undertaking involving many mathematicians and thousands of pages of proofs. A completion was announced in the early 1980s, but an important outstanding part concerning quasithin groups was supplied in 2004. Subsequent work has continued to reorganize and simplify the proof.

Methods and applications

Simplicity is often proved by restricting the possible normal subgroups. Common methods include:

  • Conjugacy-class arguments: a normal subgroup is a union of entire conjugacy classes.
  • Permutation actions: the kernel of a group action is normal, so every nontrivial action of a simple group is faithful.
  • Generation arguments: one shows that any nontrivial normal subgroup contains a particular element or subgroup whose conjugates generate the group.
  • Character-theoretic methods: representation theory constrains conjugacy classes, element orders, and possible normal subgroups.

In Galois theory, nonabelian simple groups explain fundamental obstructions to solving polynomial equations by radicals. In characteristic zero, a polynomial is solvable by radicals exactly when its Galois group is solvable. The occurrence of a nonabelian simple composition factor therefore obstructs such a solution. The role of A5A_5 inside S5S_5 is central to the general quintic case.

Finite simple groups also occur in the study of highly symmetric combinatorial structures and geometric objects. Classification-based arguments can reduce a problem about arbitrary finite groups to a study of the possible simple factors, though substantial extension and representation problems may remain.

Infinite simple groups and topological distinctions

Infinite simple groups do not admit a classification comparable to the finite case. A basic example is the group of all even permutations of an infinite set that move only finitely many points. This group is simple.

Other constructions produce finitely generated infinite simple groups and groups with very different algebraic properties. The diversity of these examples makes finiteness a crucial hypothesis in the classification theorem.

For groups equipped with a topology, abstract simplicity must be distinguished from topological simplicity. A topologically simple group has no proper nontrivial closed normal subgroup; it may still have proper normal subgroups that are not closed. Abstract simplicity prohibits all proper nontrivial normal subgroups, regardless of their topological properties.

Likewise, simplicity of a Lie algebra is not identical to abstract simplicity of an associated Lie group. A connected Lie group with simple Lie algebra can still have a nontrivial center, so statements about simple Lie groups must specify the convention being used.