2-modular defect groups of A5 Created 2026-10-05 Updated 2026-10-14
In characteristic , a Sylow subgroup of is a Klein four-group, and its normalizer is . Since has one block, Brauer first main theorem gives a unique block of with defect . No order-two subgroup can be a defect group of a block: both and equal , so the Brauer morphisms of a central block idempotent at and at are equal. A nonzero image is , since a group algebra of a p-group in characteristic p is local, and consequently is not maximal among subgroups with nonzero Brauer image.
Affine primitive permutation group Created 2026-10-14 Updated 2026-11-05
An elementary abelian regular minimal normal subgroup acts as translations of a vector space. Its point stabilizer acts faithfully and irreducibly on that space; invariant subspaces would be blocks. The full affine normalizer is . In degree sixteen it lies inside : nonzero translations swap eight pairs, and elementary linear transvections swap four pairs. Thus it is not a maximal subgroup of .
Centralizer Created 2026-09-24 Updated 2026-10-14
The centralizer of an element of a group consists of all elements that commute with :
It is the stabilizer subgroup of under the conjugation action, hence a subgroup of . In conjugacy classes of the symmetric group on three letters, the three representative computations are
For the transposition , a commuting permutation must preserve the exchanged pair and fix ; only and do so. For , a commuting permutation is determined by where it sends : the equation forces the images of and , leaving exactly . For , every permutation commutes. These centralizer sizes give conjugacy class sizes .
The centralizer is useful because it measures how much freedom remains after fixing one operation. Its index of a subgroup counts the distinct results of conjugation, and the intersection of all element centralizers is the center of a group. A centralizer need not be an abelian group: even when is a nonabelian group. In an abelian group, all element centralizers equal . These observations also explain why the surrounding group matters: the centralizer of inside the alternating group is the whole , whereas its centralizer inside is a proper subgroup. See McKernan, the centralizer definition preceding lemma 23.6.
For an arbitrary subset , the centralizer of a subset fixes every element of individually under the conjugation action:
This is a pointwise stabilizer of the elements of , not of the vertices of a polygon in a geometric realization. In particular, belongs to although its rotation moves every vertex of a polygon of the equilateral triangle. If generates a subgroup , commuting with every element of implies commuting with every product of those elements and their inverse elements; hence . For the triangle rotation subgroup , this gives .
To see the commutation test directly on the equilateral triangle, compare a rotation with the reflection . Their permutations satisfy
The two orders send vertex of a polygon to different places: , but . Thus . By contrast and commute, with . The reflection reverses the chosen rotation while preserving the subgroup of all triangle rotations, so . The distinction is visible before any counting: commuting preserves an operation itself; membership in the normalizer permits exchanging it with another operation in the same subgroup.
Figure 1.
Commuting triangle rotations and noncommuting rotation–reflection products
. Colored labels track the original vertices of a polygon. Products act from right to left. The top row gives the same labeled triangle for and ; the bottom row gives different labeled triangles for and . All six permutations in are included in the centralizer and normalizer membership table. Details.
Centralizer and normalizer Created 2026-09-24 Updated 2026-10-14
Both constructions are stabilizer subgroups for the conjugation action. The centralizer fixes an individual element ; the normalizer preserves a subgroup as a whole, while possibly moving its elements. The centralizer of a subset fixes every member of individually, so
For a cyclic subgroup , commuting with the group generator is equivalent to commuting with all its powers, giving .
In the symmetric group , let and . Then
Every transposition sends to under conjugation. In particular, for ,
Thus belongs to the normalizer of but not to the centralizer of . Preserving the collection of powers allows the two possible directions of its group generator to be exchanged.
Figure 1.
The centralizer fixes , while the normalizer preserves and may exchange with its inverse element
. Details.
This distinction lets one ask separately which operations leave a chosen operation unchanged and which operations preserve the subgroup it generates. The normalizer also supplies a group homomorphism to the automorphism group of , by ; its group kernel is . In this example the group homomorphism has two possible outputs, fixing or replacing it by . The quotient group is therefore a cyclic group of group order two. Milne develops the normalizer as a stabilizer subgroup in Group Theory (v4.01) by James S. Milne.
Classification of connected covering spaces Created 2026-09-24 Updated 2026-11-05
Let be path-connected, locally path-connected and semilocally simply connected, with base point and fundamental group . Isomorphism classes of based connected covering spaces correspond bijectively to subgroups , by
Forgetting replaces individual subgroups by their conjugacy classes. The number of sheets is the index of a subgroup . A covering space is a regular covering exactly when is a normal subgroup; then its deck transformation group is . In general its deck transformation group is , where is the normalizer.[ref]
For a circle, the subgroups give the -sheeted covering spaces for , while the trivial subgroup gives . All are regular coverings because is Abelian. The local hypotheses are part of the theorem: existence of a cover for every subgroup cannot simply be asserted for an arbitrary connected topological space.
Conjugates of a proper subgroup do not cover a finite group Created 2026-10-14 Updated 2026-10-31
For a proper subgroup of a finite group , the number of its conjugates is , because its normalizer contains . All conjugates contain the identity, so their union has size at most . Thus some element is not conjugate to any element of . Finiteness is essential to this cardinal counting argument.
Conjugate subgroup Created 2026-09-24 Updated 2026-10-14
For a subgroup of a group and , the conjugate subgroup is the conjugate subset
It 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 gives
Thus 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.
Figure 1. . Each arrow sends a subgroup to , rather than multiplying its elements by on one side. The three-node group orbit has stabilizer subgroup . The cyclic subgroup has a one-node group orbit even though reflection conjugation exchanges its two nonidentity elements. Details.
The normalizer tells when this change of reference leaves the subgroup unchanged. For any group and subgroup , there is a bijection
Two 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]
There are partitions of six letters into two unordered triples. A stabilizer is , also the normalizer of the Sylow subgroup generated by one 3-cycle in each triple. Relative to one partition, all other partitions have intersection pattern up to interchange, giving one orbit of the stabilizer and hence a two-transitive action. A natural fixing one letter is transitive on these partitions, giving .
Diagonal primitive permutation group Created 2026-10-14 Updated 2026-11-05
For a nonabelian simple group , act on cosets of its full diagonal in . A suitable factor-permuting extension is primitive and has point stabilizer intersecting the socle in the diagonal. The full normalizer has order . For , it acts on the sixty elements of by left/right multiplication, automorphisms and inversion, and has order . Odd conjugation in induces an odd permutation of these sixty points, while inversion is even; the full group is a primitive maximal subgroup of .
Every involution of is a transvection , because its nilpotent part has square zero and rank one. Two distinct commuting transvections either have common image line or common fixed plane. This gives two types of elementary abelian groups of order four, displayed above. No larger elementary abelian -subgroup is possible: a transvection commuting with all three elements of a common-image group must have that same image, and the dual argument applies to a common-fixed-plane group. Their normalizers are respectively point and plane stabilizers of order . The common fixed-space dimensions one and two distinguish their conjugacy classes.
Even primitive groups of safe-prime degree Created 2026-10-14 Updated 2026-11-05
Every nontrivial normal subgroup of a faithful primitive group of prime degree is transitive and contains a Sylow -subgroup . Its normalizer in has order . For a proper normal subgroup , the Frattini argument gives ; unless , its -normalizer is the full order- normalizer, while . The Burnside transfer theorem gives a characteristic normal -complement in . This complement is normal in and cannot be transitive because its order is prime to , so it is trivial. Thus and .
Finite nilpotent group decomposition Created 2026-10-14 Updated 2026-11-05
A finite group is nilpotent exactly when it is the direct product of groups of its Sylow subgroups. The normalizer condition for nilpotent groups and Sylow conjugacy force each Sylow normalizer to be the whole group. Distinct normal Sylow subgroups commute because their commutators lie in their trivial intersection. Conversely finite p-groups are nilpotent by the nontrivial center and induction; direct products preserve nilpotence.
General affine group Created 2026-10-14 Updated 2026-11-05
The group of maps of a finite-dimensional vector space, with invertible. Identifying the underlying points with a regular elementary abelian group identifies its normalizer in the symmetric group with this semidirect product.
Green correspondence for blocks Created 2026-10-14 Updated 2026-11-05
If , Brauer correspondence pairs the blocks of a group algebra of and having defect group of a block . This is Green correspondence for their bimodules, with vertex of an indecomposable module in . The normalizer of lies in , and the corresponding restriction and induction have unique summands with that vertex.
Green correspondent of a module Created 2026-10-14 Updated 2026-11-05
The Green correspondent is the unique indecomposable summand of restriction or induction having the selected vertex of an indecomposable module, in the setting of Green correspondence. The two correspondence maps are inverse and preserve sources of an indecomposable module up to the appropriate normalizer conjugacy.
Hall subgroup existence in soluble groups Created 2026-10-07 Updated 2026-11-05
Every finite soluble group has a Hall subgroup for each prime set. Induct on the group order using an elementary abelian minimal normal subgroup. In the coprime hard case, lift a minimal normal subgroup of the quotient, choose its Sylow subgroup, and apply the Frattini argument. A proper normalizer reduces the order; a normal Sylow subgroup allows induction in its quotient. This proves existence without assuming an independent complement theorem.
Holomorph Created 2026-10-14 Updated 2026-10-31
The holomorph acts on the underlying set of a group by . Its multiplication is . This is exactly the normalizer of the left regular permutation representation: a normalizing permutation fixing the identity is an group automorphism, and every normalizing permutation is a left translation followed by one. The embedded copy of is normal and the identity stabilizer is its group automorphism group.
Least-prime divisibility constraint for a finite simple group Created 2026-10-14 Updated 2026-11-05
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.
Maximal subgroup normalizer criterion Created 2026-10-14 Updated 2026-11-05
For a maximal subgroup of a finite nonabelian simple group, take a minimal nontrivial normal subgroup of . It is a characteristically simple group. Its normalizer contains but cannot be the whole simple group, since . Maximality gives equality.
Maximal subgroups of A5 Created 2026-10-14 Updated 2026-11-05
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.