In a finite monomial group, the displayed intersection is a normal subgroup. Every irreducible character is induced from a linear character of a subgroup containing . On restriction to , all conjugate inducing lines remain invariant, so lies in every irreducible character kernel. The intersection of those kernels is trivial, proving that is Abelian.
Use the coordinate conventionIn this convention the Heisenberg group over a prime field has the productThe 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 isThe term in matrix multiplication cancels the cross term in . Thus is an elementary abelian group, isomorphic to .
In the Heisenberg group over a commutative ring with , the subset is an Abelian subgroup of group order 16. Its product has central coordinate , symmetric in the two factors. Its inverse element is . The map is a surjective group homomorphism to the additive group of , with kernel of a group homomorphism . Thus is a normal subgroup and has four cosets in the 64-element group.
Unlike the odd-prime case, division by two is unavailable. In fact take and . Then , where the binomial coefficient is computed as an integer before reduction modulo four. Hence and has element order eight. The element has element order two and is not a power of : the powers with outer coordinates two have central coordinates one or three. Their generated subgroups intersect trivially, so the 16-element Abelian group is the direct product of groups .
Abelian quotient 2026-10-06
An abelian quotient is a quotient group that is an abelian group. It exists only for a normal subgroup , and it is abelian exactly when contains the commutator subgroup. Thus every abelian quotient factors through the abelianization .
The Sylow theorems give either one or eight Sylow subgroups of order seven. In the first case that subgroup is normal. In the second, their six nonidentity elements are pairwise disjoint, accounting for 48 elements. Only eight elements remain, including the identity, and every Sylow subgroup of order eight lies entirely among them. Thus there is exactly one, and it is a normal subgroup.
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 .
Center of a group Created 2026-09-24 Updated 2026-10-14
The center of a group consists of the elements that commute with every element of that group:where is the centralizer of . These are operations whose position in any product can be changed freely. The center is an abelian group and a characteristic subgroup, hence a normal subgroup. A group is an abelian group precisely when .
For the symmetric group , the conjugacy classes areAn element belongs to the center precisely when its conjugacy class has one element, so . Yet commutator subgroup of the symmetric group on three letters gives , with three elements. Thus belonging to the commutator subgroup does not mean commuting with everything. The alternating group is an abelian group as a subgroup, but its nonidentity elements do not commute with the transpositions in the surrounding .
For the dihedral group of group order eight in abelianization of the square symmetry group, the center is . A rotation commutes with precisely when , which requires even. No reflection commutes with , since whereas . ConsequentlyThe half-turn can be performed before or after any square symmetry with the same result. Its appearance both here and in the commutator subgroup is a feature of this example, rather than a general equality. See Conrad, Dihedral groups I, theorem 3.4 and example 3.5.
The center and the commutator subgroup answer different useful questions: which operations already commute with everything, and which operations must disappear for the entire group to commute. In an abelian group these answers are and . Another way to use the center is through conjugation: the group homomorphism has group kernel , so the first isomorphism theorem gives , the inner automorphism group. The quotient group by the center thus records the distinct conjugation operations; it need not be an abelian quotient.
A nontrivial finite p-group always has a nontrivial center. In the class equation, each noncentral conjugacy class has size divisible by , so . The identity element ensures is nonempty, hence it has at least elements. See McKernan, MIT 18.703, lemmas 23.6–23.7 and definition-lemma 23.10.
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 .
Character table of the alternating group A5 2026-10-31
In the conjugacy class order , the five complex irreducible characters of the alternating group areThe class sizes are . Restricting the degree-four and degree-five irreducible characters of gives rows of squared character inner product one. The degree-six restriction has squared norm two and is orthogonal to those rows and the trivial row, so it splits into the two remaining irreducibles. The sum of squared degrees forces their degrees to be three. Orthogonality forces their last two values to have sum one and product minus one, producing the displayed roots. Since a normal subgroup is a union of classes and its order divides sixty, these class sizes also prove the Simplicity of the alternating group A5.
Class equation Created 2026-10-03 Updated 2026-10-14
For a finite group , choose one representative from each conjugacy class with more than one element. The class equation iswhere is the center of a group and is the centralizer of . Each central element contributes its own one-element conjugacy class. Every remaining conjugacy class contributes its size, given by the orbit-stabilizer theorem. The sum counts each element exactly once. See McKernan, Group actions and automorphisms, lemma 23.6.
For conjugacy classes of the symmetric group on three letters, take and . Their centralizers have sizes two and three, and the center of a group has size one, givingFor an abelian group, every centralizer is the whole group, every conjugacy class has size one, and the sum over noncentral representatives is empty.
The power of this counting identity is that the sizes of conjugacy classes constrain group structure. For a nontrivial finite p-group with group order , every noncentral conjugacy class has size a positive power of , by Lagrange's theorem. The class equation therefore gives . Since the identity element lies in the center of a group, the center of a group must have at least elements. This obtains an element commuting with the entire group without constructing one. See McKernan, lemma 23.7.
Historically, these ideas belong to the nineteenth-century development of permutation groups and normal subgroups. Milne's historical opening records Galois's introduction of normal subgroups in 1832 and Jordan's systematic treatment of permutation groups in 1870. This is context for the conjugation action and the class equation, rather than a claim that either author first stated the modern formula.[ref]
Commutator subgroup Created 2026-09-24 Updated 2026-10-14
The commutator subgroup of a group is the subgroup generated by all its group commutators:Here and throughout, . A group commutator is the identity element precisely when and commute. The generated subgroup includes finite products of group commutators and their inverse elements; an element of need not itself be a single group commutator. Thus precisely when is an abelian group.
The useful idea is to record exactly what must disappear to make multiplication commutative. The identity shows how a group commutator corrects a change in multiplication order. Setting every such correction equal to produces the abelianization , while preserving every piece of information that a group homomorphism to an abelian group can detect. This connects a local comparison of two operations to a canonical quotient group of the whole group.
The commutator subgroup is a characteristic subgroup, hence a normal subgroup: a group automorphism sends to . For any normal subgroup ,Indeed, the group commutator of and is . This makes the smallest normal subgroup whose quotient group is an abelian group. See Conrad, Subgroup series I, section 4: commutators and abelian quotients.
Complement of a normal subgroup 2026-10-14
A group complement to a normal subgroup is a subgroup with and . Projection identifies with , and conjugation gives . This is a subgroup notion, not the set-theoretic complement of .
Conjugacy classes of the alternating group on six letters Created 2026-10-06 Updated 2026-10-14
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.
Conjugate subgroup Created 2026-09-24 Updated 2026-10-14
For a subgroup of a group and , the conjugate subgroup is the conjugate subsetIt is a subgroup because conjugation is a group automorphism. Restricting that group automorphism gives a group isomorphism from to , so conjugate subgroups have the same group order. This describes the same operations after moving their reference configuration. Conjugacy of subgroups is an equivalence relation. [ref]
For an equilateral triangle with vertices of a polygon labeled counterclockwise, its symmetry group is the symmetric group , also the dihedral group of group order six. Let be the counterclockwise rotation through degrees, and let be the reflection fixing vertex of a polygon . Products apply the rightmost permutation first. The cyclic subgroup contains the identity element and one reflection. Relabeling a transposition by conjugation givesThus the conjugation action moves among the three subgroups , , and . Geometrically, the rotation moves the axis of the reflection to the next axis. Each reflection fixes a different vertex of a polygon, although group isomorphisms relate all three subgroups.
The normalizer tells when this change of reference leaves the subgroup unchanged. For any group and subgroup , there is a bijectionTwo choices give the same conjugate subgroup exactly when . Consequently the index of a subgroup counts the distinct conjugate subgroups, even for an infinite group. For a finite group the count is . These are cosets; they need not form a quotient group, since need not be a normal subgroup of . In the triangle example there are conjugate subgroups, while the cyclic subgroup has only one. [ref]
Core (group theory) 2026-10-14
The core of a subgroup isIt is the largest normal subgroup of contained in . If has finite index , the action on gives .
Coset Created 2026-09-24 Updated 2026-10-14
For a subgroup of a group , a left coset is ; a right coset is . The name refers to the side on which the representative multiplies . Think of a coset as a translated copy of a subgroup: it remembers the relative differences allowed by , while moving the whole collection to another location in the group.
Two left cosets of the same subgroup are either equal or disjoint. Thus distinct left cosets form a partition of a set covering ; the same statement holds separately for right cosets. The useful membership test isThis also defines an equivalence relation: changing a representative by right multiplication with a member of leaves its left coset unchanged. These facts hold even for infinite groups. See MIT's coset notes, definitions 3.6 and 3.9.
For an explicit additive example, take the cyclic group , with modular arithmetic, and the subgroup . Adding each representative to both members gives exactlyRepresentatives repeat these three cosets, respectively. For example, , since . Every residue appears once in the displayed partition of a set. Each coset has two members, so the group order of is and its index of a subgroup is . Left and right cosets coincide here because is an abelian group.
A coset need not be a subgroup. In this example, lacks the identity element , and leaves it. In fact, the only left or right coset of that is a subgroup is itself: a subgroup must contain the identity element, and the coset containing that element is . Equal sizes come instead from the bijection , whose inverse is ; for right cosets, use and .
The nonabelian group , the symmetric group on three letters, separates the two sides. Use function composition with the rightmost permutation applied first, and let . Then but , giving the differing pairThe complete partition of a set into left cosets consists of , and ; the complete partition of a set into right cosets consists of , and . Each lists all six permutations exactly once. Both have three parts of size two, although their parts differ.
Left cosets support a group action by for every subgroup, as in the coset action. Multiplication of representatives defines a quotient group operation precisely when is a normal subgroup. Otherwise the answer can depend on the representatives: in this example, and represent the same coset , yet and differ. In the additive example, is a normal subgroup, making valid. See MIT's quotient-group notes, theorem 9.1.
Coset action Created 2026-09-24 Updated 2026-10-18
A group acts on the left cosets of a subgroup by left multiplication; its kernel is the core of that subgroup.
Let be a subgroup. The notation here means the set of left cosets , even when is not a normal subgroup. DefineThis gives a group action without needing a quotient group structure on .[ref]
Group Actions by Keith Conrad. Example 2.12, printed pages 7–8: left multiplication on left cosets, without normality
The representative check is essential: if , then for some , and . Thus equal input cosets give equal output cosets. The identity element fixes every coset, and associativity gives . Each induced map is a permutation, with inverse induced by . This is a transitive group action because sends to .
The stabilizer subgroup of is itself. At a general coset, the stabilizer subgroup and the group kernel areConsequently the coset action is a faithful group action exactly when the subgroup core is trivial.[ref]
Indeed, exactly when , or . Intersecting these membership conditions over all cosets gives the group kernel. Conjugation permutes the subgroups in this intersection, making it a normal subgroup of contained in . Conversely, any normal subgroup of contained in lies in every . This explains why the subgroup core is the largest such normal subgroup: it is exactly the portion of invisible at every label, rather than merely at the label .
For a normal subgroup , every equals , so . For , the construction is the regular group action behind Cayley's theorem. Between these extremes, a nontrivial subgroup with trivial subgroup core can give a faithful group action on fewer labels. If the index of a subgroup is finite, , the first isomorphism theorem givesThus a subgroup of small index of a subgroup exposes a small permutation group associated with . The two examples below and in nonfaithful coset action of the symmetric group on three letters show exactly which information can survive.
If is a normal subgroup, changing representatives to and , where , givesThe chosen representatives therefore give the same coset. Conversely, suppose the rule defines an operation on left cosets. Since for , multiplying by gives , hence . Applying this inclusion for every and proves , so is a normal subgroup. This makes normality exactly the condition needed to carry group operation to these classes.
Write with integer coordinates. Multiplication in this parametrization is . The subgroup has right cosets obtained by multiplying on the left by its elements, so its right cosets are exactly the displayed sets with fixed . In particular, right cosets are indexed by . Left cosets differ: fixes and , since right multiplication changes by and by . This also exhibits why is not a normal subgroup of the Integer Heisenberg group.
Cover of a value in a lattice-ordered group 2026-10-14
If is a value in a lattice-ordered group of , every convex lattice subgroup strictly containing contains . Thus the convex lattice subgroup generated by and is the unique least subgroup properly containing . It is called the cover of . There is no intermediate convex lattice subgroup. A normal-valued lattice-ordered group requires to be a normal subgroup of this cover, not necessarily of the whole group. Values are prime convex lattice subgroups: maximality omitting makes them meet-irreducible in the lattice of convex lattice subgroups, so their ordered right cosets form a chain.


