Subgroup
Template:Short description Template:Other uses Template:Sidebar with collapsible lists
In group theory, a branch of mathematics, a subset of a group G is a subgroup of G if the members of that subset form a group with respect to the group operation in G.
Formally, given a group Template:Mvar under a binary operation ∗, a subset Template:Mvar of Template:Mvar is called a subgroup of Template:Mvar if Template:Mvar also forms a group under the operation ∗. More precisely, Template:Mvar is a subgroup of Template:Mvar if the restriction of ∗ to Template:Math is a group operation on Template:Mvar. This is often denoted Template:Math, read as "Template:Mvar is a subgroup of Template:Mvar".
The trivial subgroup of any group is the subgroup {e} consisting of just the identity element.Template:Sfn
A proper subgroup of a group Template:Mvar is a subgroup Template:Mvar which is a proper subset of Template:Mvar (that is, Template:Math). This is often represented notationally by Template:Math, read as "Template:Mvar is a proper subgroup of Template:Mvar". Some authors also exclude the trivial group from being proper (that is, Template:Math).Template:SfnTemplate:Sfn
If Template:Mvar is a subgroup of Template:Mvar, then Template:Mvar is sometimes called an overgroup of Template:Mvar.
The same definitions apply more generally when Template:Mvar is an arbitrary semigroup, but this article will only deal with subgroups of groups.
Subgroup tests
Suppose that Template:Mvar is a group, and Template:Mvar is a subset of Template:Mvar. For now, assume that the group operation of Template:Mvar is written multiplicatively, denoted by juxtaposition.
- Then Template:Mvar is a subgroup of Template:Mvar if and only if Template:Mvar is nonempty and closed under products and inverses. Closed under products means that for every Template:Mvar and Template:Mvar in Template:Mvar, the product Template:Mvar is in Template:Mvar. Closed under inverses means that for every Template:Mvar in Template:Mvar, the inverse Template:Math is in Template:Mvar. These two conditions can be combined into one, that for every Template:Mvar and Template:Mvar in Template:Mvar, the element Template:Math is in Template:Mvar, but it is more natural and usually just as easy to test the two closure conditions separately.Template:Sfn
- When Template:Mvar is finite, the test can be simplified: Template:Mvar is a subgroup if and only if it is nonempty and closed under products. These conditions alone imply that every element Template:Mvar of Template:Mvar generates a finite cyclic subgroup of Template:Mvar, say of order Template:Mvar, and then the inverse of Template:Mvar is Template:Math.Template:Sfn
If the group operation is instead denoted by addition, then closed under products should be replaced by closed under addition, which is the condition that for every Template:Mvar and Template:Mvar in Template:Mvar, the sum Template:Math is in Template:Mvar, and closed under inverses should be edited to say that for every Template:Mvar in Template:Mvar, the inverse Template:Math is in Template:Mvar.
Basic properties of subgroups
- The identity of a subgroup is the identity of the group: if Template:Mvar is a group with identity Template:Mvar, and Template:Mvar is a subgroup of Template:Mvar with identity Template:Mvar, then Template:Math.
- The inverse of an element in a subgroup is the inverse of the element in the group: if Template:Mvar is a subgroup of a group Template:Mvar, and Template:Mvar and Template:Mvar are elements of Template:Mvar such that Template:Math, then Template:Math.
- If Template:Mvar is a subgroup of Template:Mvar, then the inclusion map Template:Math sending each element Template:Mvar of Template:Mvar to itself is a homomorphism.
- The intersection of subgroups Template:Mvar and Template:Mvar of Template:Mvar is again a subgroup of Template:Mvar.Template:Sfn For example, the intersection of the Template:Mvar-axis and Template:Mvar-axis in Template:Tmath under addition is the trivial subgroup. More generally, the intersection of an arbitrary collection of subgroups of Template:Mvar is a subgroup of Template:Mvar.
- The union of subgroups Template:Mvar and Template:Mvar is a subgroup if and only if Template:Math or Template:Math. A non-example: Template:Tmath is not a subgroup of Template:Tmath because 2 and 3 are elements of this subset whose sum, 5, is not in the subset. Similarly, the union of the Template:Mvar-axis and the Template:Mvar-axis in Template:Tmath is not a subgroup of Template:Tmath
- If Template:Mvar is a subset of Template:Mvar, then there exists a smallest subgroup containing Template:Mvar, namely the intersection of all of subgroups containing Template:Mvar; it is denoted by Template:Math and is called the [[generating set of a group|subgroup generated by Template:Mvar]]. An element of Template:Mvar is in Template:Math if and only if it is a finite product of elements of Template:Mvar and their inverses, possibly repeated.Template:Sfn
- Every element Template:Mvar of a group Template:Mvar generates a cyclic subgroup Template:Math. If Template:Math is isomorphic to Template:Tmath ([[Integers modulo n|the integers Template:Math]]) for some positive integer Template:Mvar, then Template:Mvar is the smallest positive integer for which Template:Math, and Template:Mvar is called the order of Template:Mvar. If Template:Math is isomorphic to Template:Tmath then Template:Mvar is said to have infinite order.
- The subgroups of any given group form a complete lattice under inclusion, called the lattice of subgroups. (While the infimum here is the usual set-theoretic intersection, the supremum of a set of subgroups is the subgroup generated by the set-theoretic union of the subgroups, not the set-theoretic union itself.) If Template:Mvar is the identity of Template:Mvar, then the trivial group Template:Math is the minimum subgroup of Template:Mvar, while the maximum subgroup is the group Template:Mvar itself.
Cosets and Lagrange's theorem
Template:Main Given a subgroup Template:Mvar and some Template:Mvar in Template:Mvar, we define the left coset Template:Math Because Template:Mvar is invertible, the map Template:Math given by Template:Math is a bijection. Furthermore, every element of Template:Mvar is contained in precisely one left coset of Template:Mvar; the left cosets are the equivalence classes corresponding to the equivalence relation Template:Math if and only if Template:Tmath is in Template:Mvar. The number of left cosets of Template:Mvar is called the index of Template:Mvar in Template:Mvar and is denoted by Template:Math.
Lagrange's theorem states that for a finite group Template:Mvar and a subgroup Template:Mvar,
where Template:Mvar and Template:Mvar denote the orders of Template:Mvar and Template:Mvar, respectively. In particular, the order of every subgroup of Template:Mvar (and the order of every element of Template:Mvar) must be a divisor of Template:Mvar.[1]Template:Sfn
Right cosets are defined analogously: Template:Math They are also the equivalence classes for a suitable equivalence relation and their number is equal to Template:Math.
If Template:Math for every Template:Mvar in Template:Mvar, then Template:Mvar is said to be a normal subgroup. Every subgroup of index 2 is normal: the left cosets, and also the right cosets, are simply the subgroup and its complement. More generally, if Template:Mvar is the lowest prime dividing the order of a finite group Template:Mvar, then any subgroup of index Template:Mvar (if such exists) is normal.
Example: Subgroups of Z8
Let Template:Mvar be the finite cyclic group
under addition modulo 8. The subset consisting of multiples of 2 is a subgroup of . More generally, for each divisor Template:Mvar of 8, the multiples of Template:Mvar form a subgroup. Explicitly, for , these subgroups are .
In general, for any positive integer Template:Mvar, one can describe all subgroups of the finite cyclic group similarly: for each divisor Template:Mvar of Template:Mvar, the multiples of Template:Mvar in form a subgroup of order , and every subgroup arises in this way.
Subgroups of cyclic groups are cyclic.Template:Sfn
Example: Subgroups of S4Template:Anchor
The symmetric group Template:Math is the group whose elements are the permutations of .
Below are all its subgroups, ordered by cardinality.
24 elements
Like each group, Template:Math is a subgroup of itself.
12 elements
The alternating group Template:Math consists of all the even permutations in Template:Math. Since it is of index 2, it is a normal subgroup.
8 elements
There are three subgroups of order 8, each isomorphic to the dihedral group Template:Math, the group of symmetries of a square.
Labeling the vertices of a square clockwise lets one view Template:Math as a subgroup of Template:Math. This subgroup is generated by the 90-degree clockwise rotation and by the reflection in the diagonal axis joining vertices 1 and 3; these are the permutations and .
Up to symmetries of the square, there are three different ways to label the vertices of a square, distinguished by which pairs of numbers appear on opposite corners. In the labeling above, 1 and 3 were opposite, and 2 and 4 were opposite; another choice has 1 and 4 opposite, and 2 and 3 opposite; the third choice has 1 and 2 opposite, and 3 and 4 opposite. The three labelings give rise to three different subgroups of order 8 in Template:Math, conjugate to each other, each isomorphic to Template:Math.
6 elements
There are four subgroups of order 6, each isomorphic to Template:Math. Each is the stabilizer of one of the elements of . For example, the stabilizer of 4 is the group of permutations in Template:Math that map 4 to 4, while permuting in an arbitrary way; it is generated by the permutations and , for instance. The four subgroups of order 6 are conjugate to each other.
4 elements
There are seven subgroups of order 4, falling into three conjugacy classes of subgroups:
- The subset is a normal subgroup isomorphic to the Klein four-group Template:Math.
- The group generated by and is another subgroup isomorphic to Template:Math, but it is not normal. Instead it has conjugates, namely the group generated by and and the group generated by and .
- Each of the six 4-cycles in Template:Math generates a cyclic subgroup of order 4, but each 4-cycle generates the same subgroup as its inverse, so there are only three distinct subgroups of this type. These three subgroups are conjugate to each other because all 4-cycles in Template:Math are conjugate to each other.
3 elements
There are four subgroups of order 3, each generated by a 3-cycle. There are eight 3-cycles in Template:Math, but each generates the same subgroup as its inverse. The resulting four subgroups are conjugate to each other.
2 elements
There are nine subgroups of order 2, falling into two conjugacy classes of subgroups:
- Each of the transpositions (2-cycles) generates a subgroup of order 2. These six subgroups are conjugate.
- Each of the double-transpositions , , generates a subgroup of order 2. These three subgroups are conjugate.
1 element
The trivial subgroup is the unique subgroup of order 1.
Other examples
- The even integers form a subgroup Template:Tmath of the integer ring Template:Tmath the sum of two even integers is even, and the negative of an even integer is even.
- Every ideal in a ring Template:Mvar is a subgroup of the additive group of Template:Mvar.
- Every linear subspace of a vector space is a subgroup of the additive group of vectors.
- In an abelian group, the elements of finite order form a subgroup called the torsion subgroup.
Notes
- ↑ See a didactic proof in this video.