Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Simple group
Summary
In mathematics, a simple group is a nontrivial group whose only normal subgroups are the trivial group and the group itself. A group that is not simple can be broken into two smaller groups, namely a nontrivial normal subgroup and the corresponding quotient group. This process can be repeated, and for finite groups one eventually arrives at uniquely determined simple groups, by the Jordan–Hölder theorem.
The complete classification of finite simple groups, completed in 2004, is a major milestone in the history of mathematics.
The cyclic group of congruence classes modulo 3 (see modular arithmetic) is simple. If is a subgroup of this group, its order (the number of elements) must be a divisor of the order of which is 3. Since 3 is prime, its only divisors are 1 and 3, so either is , or is the trivial group. On the other hand, the group is not simple. The set of congruence classes of 0, 4, and 8 modulo 12 is a subgroup of order 3, and it is a normal subgroup since any subgroup of an abelian group is normal. Similarly, the additive group of the integers is not simple; the set of even integers is a non-trivial proper normal subgroup.
One may use the same kind of reasoning for any abelian group, to deduce that the only simple abelian groups are the cyclic groups of prime order. The classification of nonabelian simple groups is far less trivial. The smallest nonabelian simple group is the alternating group of order 60, and every simple group of order 60 is isomorphic to . The second smallest nonabelian simple group is the projective special linear group PSL(2,7) of order 168, and every simple group of order 168 is isomorphic to PSL(2,7).
The infinite alternating group , i.e. the group of even finitely supported permutations of the integers, is simple. This group can be written as the increasing union of the finite simple groups with respect to standard embeddings . Another family of examples of infinite simple groups is given by , where is an infinite field and .
It is much more difficult to construct finitely generated infinite simple groups.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.