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 .
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 areFor 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 satisfyThe 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.
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, soFor a cyclic subgroup , commuting with the group generator is equivalent to commuting with all its powers, giving .
In the symmetric group , let and . ThenEvery 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.
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.
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]
Conjugacy class Created 2026-09-24 Updated 2026-10-14
For an element of a group , its conjugacy class is its orbit of a group action under the conjugation action:Thus conjugate group elements describe the same operation after a change of labels. In a symmetric group, conjugation renames the entries of every permutation cycle:For example, with and the transposition , this gives . Products use function composition of permutations, with the rightmost factor applied first. The complete six-element example is conjugacy classes of the symmetric group on three letters.
The conjugacy classes form a partition of a set of , since conjugacy is an equivalence relation. In a symmetric group, two permutations lie in the same conjugacy class precisely when they have the same cycle type: renaming preserves the lengths of permutation cycles, and matching equal-length permutation cycles constructs a renaming in the other direction. This compresses many labelled permutations into a few structural types. See McKernan, Conjugation in Sn, lemma 6.2 and proposition 6.6.
The stabilizer subgroup of under the conjugation action is its centralizer . Consequently the orbit-stabilizer theorem givesThe counting mechanism is the bijection from left cosets onto the conjugacy class: two choices of give the same result exactly when they differ on the right by an element of the centralizer. A large centralizer means many choices of labels leave the operation unchanged, hence a small conjugacy class. A conjugacy class has size one precisely when its element belongs to the center of a group. The class equation counts these orbits of a group action together.
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]
Conjugation module of a group ring 2026-09-24
The group ring becomes a -module under the conjugation action . Its basis splits into conjugacy classes, and the span of the class of is the permutation module on .
Normalizer Created 2026-09-24 Updated 2026-10-14
For a subgroup of a group , the normalizer isIt is the stabilizer subgroup of under the conjugation action on subgroups. Its elements can permute members of ; they need not commute with them. For in the symmetric group , the cyclic subgroup has normalizer , although the centralizer of has only three elements, as illustrated in centralizer and normalizer.
Every element of preserves under conjugation, so . Moreover, is a normal subgroup of , and this is the largest subgroup of with that property. Indeed, any subgroup in which is a normal subgroup consists entirely of elements preserving under conjugation. In particular, exactly when is a normal subgroup of .[ref]
The orbit-stabilizer theorem counts distinct conjugate subsets of a subgroup byFor in , there is just one, since . For the subgroup , preserving forces its unique nonidentity element to stay fixed. Hence , and its three distinct conjugate subsets are , and . This is the subgroup counterpart of counting a conjugacy class with a centralizer: the object being stabilized determines which denominator belongs in the count.[ref]
The equality in the definition is essential. For a subgroup that is a finite group, an inclusion already gives equality by equal cardinalities. For an infinite subgroup, that inference can fail: conjugation might carry it onto a proper subgroup. The normal subgroup criterion is therefore, with the explicit hypothesis ,No finiteness or commutativity assumption is needed. A normal subgroup is preserved as a set; its elements need not lie in the center of a group.
There is a second useful count, distinct from counting conjugate subgroups. The normalizer acts on itself by group automorphisms, giving the group homomorphismIts group kernel is , so the centralizer of a subset is a normal subgroup of and the first isomorphism theorem givesThis quotient group records the different rearrangements of induced by the surrounding group. It gives a faithful group action on , but need not be the entire automorphism group of . For example, take the ambient group . Since is an abelian group, , so the quotient group is trivial; nevertheless is a nonidentity group automorphism of . Returning to the ambient symmetric group makes that group automorphism available through a reflection, and . Its two cosets are the three rotations and the three reflections.
The subgroup itself need not be contained in : their intersection is the center of a group . It is contained precisely when is an abelian group. Thus , which exists because is a normal subgroup of its normalizer, and answer different questions and should not be substituted for one another.
For each , count the solutions of . Once a solution is fixed, every solution is uniquely with , the centralizer of . Thus each contributes to the sum in part (a).
The orbit-stabilizer theorem for the conjugation action gives . The intersection is the disjoint union of the conjugacy classes , and the character is constant on each such conjugacy class. HenceIf the intersection is empty, the empty sum gives zero. This is the conjugacy-class formula for an induced character.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 4 2 Solution Created 2026-10-03 Updated 2026-10-14
The isomorphic pair is ; is different. All three have order , so order alone does not settle the question; explicitly . We give a concrete realization and an element-order distinction.
On , the Pfaffian isIt is a nonsingular plus-type quadratic form: the three displayed pairs give a hyperbolic decomposition. Change of basis multiplies the Pfaffian by the determinant, which is always one in . Hence the exterior-square realization of PSL4 over F2 embeds into . The kernel of a group homomorphism is trivial: an element acting trivially on the exterior square fixes every decomposable two-space, then every one-space as an intersection of two-spaces, and hence is a scalar; over this scalar is one.
For a second model let be the even-weight vector subspace of and quotient by the all-one vector. The dot product descends to a nondegenerate alternating bilinear form on the six-dimensional quotient, andis well defined, since complementing an even subset changes half its weight from to . It has zero vectors, so is plus type. Coordinate permutations give a faithful action: fixing the quotient fixes each weight-two subset, because its complement has weight six, and fixing all two-subsets forces the identity permutation.
From the independently derived symplectic order and quadratic orbit count below,Thus and the image of is its index-two subgroup . The index-two subgroup is unique: a nontrivial group homomorphism sends every transposition to the same nonidentity element and is the sign map.
To separate , observe that contains of order 15. An odd-order projective element of lifts to a semisimple linear operator, since its order upstairs divides three times an odd order in characteristic two. The possible eigenspace degree patterns are , and . In the split case all eigenvalues have order dividing three, so the projective element has no order 15. In the case the eigenvalues are with ; its fifth power is scalar because , so its projective order divides five. In the irreducible case the determinant-one torus has order and quotienting its scalar subgroup of order three gives projective order dividing seven. There is therefore no element of order 15 in .
Several small-parameter coincidences connect the finite classical groups to permutation groups. The projective-line action immediately gives , , and by faithful actions of degrees three, four and five and their orders. Also : its involutions have Klein-four centralizers, giving five Sylow subgroups; their conjugation action is faithful and embeds its order-60 simple group into . Simplicity here can be checked from class sizes : no proper nontrivial normal class union has order dividing 60. The same five-subgroup action extends to , with trivial kernel of a group homomorphism and order 120, giving . Indeed its kernel intersects trivially, so centralizes that normal subgroup. Commuting projectively with both upper and lower elementary unipotents forces a representing matrix to be scalar, so this kernel is trivial.
The less immediate coincidence can be exhibited on the ten unordered triple partitions used in Question 4. Let , , , assign to and to , and label the other partitions by applying to the zero partition, with and . Inspection of these nine partitions givesTranslations and inversion generate : conjugating the upper unitriangular matrices by inversion gives the lower ones, and elementary elimination generates . Their projective action has order . These partition permutations come from even permutations of six letters, whose partition action is faithful as proved below; hence they fill .
Finally, on the even-weight module of modulo its all-one vector, coordinate permutations preserve a nondegenerate alternating bilinear form in dimension four and act faithfully, again by the weight-two-subset argument. Both and have order 720, proving , with commutator subgroup . These examples illustrate both the need to quotient group centers and the low-rank exceptions to general simplicity. They do not make equal orders sufficient for group isomorphism, as the two order-20160 examples already demonstrate.
Past exam of the mathematics course of the University of Cambridge 2005 ia Paper 3 5D Solution Created 2026-09-24 Updated 2026-10-14
A group action is a map from to satisfying and . Define the orbit of a group action and the stabilizer subgroup . The latter is a subgroup: the identity fixes , products of elements fixing fix , and inverses do too.
For finite , the orbit-stabilizer theorem statesTo prove it, send a left coset to . If , then and . Conversely, equality of the two images implies , hence equality of the cosets. Every point of the orbit of a group action has such a preimage. This is therefore a bijection, and each coset has elements, proving the formula.
For the action on subgroups, conjugation maps a subgroup to a subgroup because it preserves products and inverses. Furthermore andThus this is the conjugation action. The stabilizer subgroup of is its normalizer , and since each conjugates onto itself. Hence the number of distinct conjugate subgroups isNow suppose is proper. Put and list the distinct conjugate subgroups as . Each has elements and all contain the same identity. Counting the identity just once, even if other elements overlap, givesThus some element of lies in no conjugate of . This proves conjugates of a proper subgroup do not cover a finite group by an explicit count; it does not require the conjugates to intersect only at the identity.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 1 1 Solution Created 2026-10-03 Updated 2026-10-14
Work with finite groups, as required for these Sylow subgroup counts. Let act by conjugation on the set of Sylow -subgroups. The stabilizer of is . Since is the normal Sylow subgroup of its own normalizer, every -subgroup of that normalizer lies in . Consequently the stabilizer is exactly , and the orbit-stabilizer theorem gives orbit size . The orbit of has size one. Every other orbit size is a power of at least , hence is divisible by . Adding orbit sizes proves the strengthened Sylow congruence from intersections:Now suppose is simple of order . If , its Sylow -subgroup is normal because its number divides three and is one modulo five. If , an involution in the regular permutation action of swaps fifteen pairs, so its sign is negative. The sign of a permutation would give a nontrivial group homomorphism with a proper nontrivial normal kernel. Both cases contradict simplicity. Thus .
The Sylow theorems make a divisor of fifteen. It is not one, since a nontrivial Sylow subgroup would then be normal. It is not three, since the conjugation action on three Sylow subgroups would give a faithful group homomorphism , impossible by order. If , take a Sylow subgroup itself: its normalizer has subgroup index five. If , not all distinct Sylow subgroups can intersect in subgroup index at least four, since that would give . Choose with . Put , of order . It has subgroup index two in both , so is normal in each. Hence contains both distinct Sylow subgroups and has order greater than . It is proper: otherwise would be a nontrivial proper normal subgroup of . Its order is therefore or . The latter would give an index-three subgroup and again an impossible faithful action on three cosets. Thus .
In either case we have the requested subgroup of order or with index-five normalizer. The action on the five cosets of that normalizer is nontrivial and faithful by simplicity. Its image lies in , since composing with sign cannot give a nontrivial map from this simple group of order greater than two to . Thus divides , forcing and equality of orders. This proves the simple groups with order a power of two times fifteen conclusion:For , choose the first column: there are nonzero choices. For each, determinant one is a nonzero linear equation in the second column and has five solutions. Therefore . A central matrix commuting with has zero lower-left entry and equal diagonal entries; commuting also with makes the upper-right entry zero. It is scalar. Determinant one then givesTo establish the projective special linear group over the field with five elements isomorphism without assuming its simplicity, compute its classes. For determinant-one matrices, the characteristic polynomial is with trace . The possibilities over exhaust the group:For trace zero the eigenvalues are , so the determinant-one centralizer is the split diagonal torus of order four. For traces , the discriminant is the nonsquare : the centralizer is the norm-one subgroup of , of order six. In both semisimple cases the determinant map on the full linear centralizer is surjective onto ; consequently each trace type is a single special-linear class. For the noncentral traces , a Jordan block has full linear centralizer with determinant . The determinant image consists of the two squares, so each general-linear class splits into two special-linear classes; the determinant-one centralizer has order . These sizes sum to .
Quotienting by identifies a matrix with its negative. The trace-zero class gives one projective class of size fifteen; the two traces give one class of size twenty; the four noncentral unipotent classes give two classes of size twelve. Their respective projective orders are , by the characteristic polynomials. A normal subgroup is a union of classes containing the identity. The nontrivial proper possible union sizes are , none of which divides . Thus the quotient is simple. Applying the order- result above givesFinally, if over an odd-characteristic field, its minimal polynomial divides the square-free polynomial , so it is diagonalizable with eigenvalues . In dimension two, determinant one requires both eigenvalues equal. Hence or . This proves the unique involution in SL2 over an odd field assertion: the only element of order two in is . If an index-two subgroup existed, it would be normal and have order sixty. By Cauchy theorem it would contain an involution, hence contain . Then would be a normal subgroup of order thirty in the simple quotient , a contradiction. Thus has no index-two subgroup.
Past exam of the mathematics course of the University of Cambridge 2006 ia Paper 3 5D Solution Created 2026-09-24 Updated 2026-10-14
For the centralizer of a subset, the identity commutes with every . If commute with each member of , then for every such ,Also implies after multiplication by on both sides. Thus identity, products and inverses lie in , proving that it is a subgroup.
For the conjugation action, identity acts trivially, andThese are the defining laws of a left group action. Its orbits of a group action are the conjugacy classes. The stabilizer of is exactly its centralizer, since if and only if . The orbit-stabilizer theorem therefore givesA class has one element exactly when that element commutes with all of , so the singleton classes are precisely the elements of , the centre of a group. Partitioning into all its conjugacy classes now proves the class equationFor , Lagrange's theorem for finite groups makes every class size a power of . A nonsingleton class has size at least and is therefore divisible by . Reducing the class equation modulo yields , because . The identity lies in , so its order is positive and divisible by . ConsequentlyThis proves the nontrivial center of a finite p-group directly from the conjugation classes.
Past exam of the mathematics course of the University of Cambridge 2010 ia Paper 3 8D Solution Created 2026-09-24 Updated 2026-10-14
For each , conjugation sends a subgroup to , a subgroup of the same order and hence still proper. Identity conjugation fixes every subgroup, andThese verify the group action laws.
The stabilizer subgroup of for this conjugation action is its normalizer . Since , the orbit-stabilizer theorem gives the number of distinct conjugates asAll these conjugate subgroups contain the identity, so counting that element only once givesThe last inequality uses the properness of , so . There is therefore an element outside this union, which is not conjugate to any element of . This proves that conjugates of a proper subgroup do not cover a finite group, including the case .
Past exam of the mathematics course of the University of Cambridge 2011 ia Paper 3 7D a Solution Created 2026-09-24 Updated 2026-10-14
For a group action, the orbit-stabilizer theorem identifies the orbit of a group action of with the left cosets of its stabilizer subgroup:This is well defined and bijective because exactly when . In particular, for finite ,Under the conjugation action , a singleton orbit of a group action means that for every . This is equivalent to for every , so precisely these elements constitute the centre of a groupThe identity is central, and if commute with every element then so do and . Thus is a subgroup. Each central element is fixed under every conjugation, giving : the centre is a normal subgroup.
Past exam of the mathematics course of the University of Cambridge 2011 ia Paper 3 7D b Solution Created 2026-09-24 Updated 2026-10-14
By Lagrange's theorem, a stabilizer subgroup of has order for some . The orbit-stabilizer theorem therefore givesThus an orbit of a group action either has one element or has size divisible by , even if the acted-on set is infinite.
Apply this to the conjugation action. Its singleton orbits of a group action are the elements of the centre of a group, while every other orbit has size divisible by . Partitioning the finite group into these orbits gives the class equation, and henceSince the identity belongs to , its order is positive and divisible by . ConsequentlyNow suppose that . It is then proper, so choose . The centralizeris a subgroup: commuting with is preserved by multiplication and inverses. It contains and also , so . By Lagrange's theorem, its order is a power of dividing , forcing . But that would make central, a contradiction. Therefore
Past exam of the mathematics course of the University of Cambridge 2013 ib Paper 4 2G Solution Created 2026-09-24 Updated 2026-10-07
The conjugacy class of is its orbit under the conjugation action, and its stabilizer is the centralizer . The orbit-stabilizer theorem givesBy Lagrange's theorem, the order of the centralizer divides , so the index is a power of . A conjugacy class has size one exactly when its element belongs to the center of a group.
Separate these singleton classes in the class equation:where the sum takes one representative of each nonsingleton conjugacy class. Every summand is divisible by . Thus , and the identity ensures . Consequently . This is the nontrivial center of a finite p-group property.
Past exam of the mathematics course of the University of Cambridge 2015 ia Paper 3 8D a Solution Created 2026-09-24 Updated 2026-10-06
The identity belongs to the center of a group. If commute with every , then does too; rearranging also shows that commutes with . Hence is a subgroup. Moreover for , so it is a normal subgroup.
Suppose . The conjugation action partitions into conjugacy classes. The orbit-stabilizer theorem gives class size , where is the centralizer of . By Lagrange's theorem, this size is a power of ; it is one exactly when is central. Thus the class equation has the formIt follows that . Since the identity is central, , and thereforeThis is the nontrivial-centre property of a finite p-group.
Past exam of the mathematics course of the University of Cambridge 2016 ia Paper 3 7D Solution Created 2026-09-24 Updated 2026-10-06
For a group action of a finite group on a set and a point , the orbit-stabilizer theorem iswhere is the stabilizer subgroup. The map is well defined because elements of the same coset act identically on . If , then , so their cosets agree; every orbit point has the form , giving surjectivity. This is a bijection. Lagrange's theorem, for any subgroup , yields the counting formula.
Apply the conjugation action of the finite p-group to its nontrivial normal subgroup . Normality ensures the action stays inside . The singleton orbits of a group action are exactly the elements of . Every larger orbit of a group action has size a positive power of , by the orbit-stabilizer theorem and Lagrange's theorem. ThereforeSince is nontrivial, its order is divisible by . The intersection contains the identity and has cardinality a positive multiple of , so it contains a nonidentity element. This proves the central intersection property of normal subgroups of finite p-groups.
For the proper subgroup , let act by left multiplication on the left cosets . A coset is fixed by every exactly when . Both groups have the same finite size, so this inclusion is equality; the fixed cosets are precisely those with . Hence their number is . All non-singleton orbits of a group action have size divisible by , soSince is proper, is a positive power of greater than one. The fixed-coset count is nonzero, because itself is fixed, and is divisible by . Therefore the normalizer strictly contains :This is the normalizer condition for finite p-groups. The proof also covers , whose action fixes all cosets.
Past exam of the mathematics course of the University of Cambridge 2019 ib Paper 4 2G a Solution Created 2026-09-24 Updated 2026-09-29
The normalizer of in isIt is the stabilizer of the subgroup under the conjugation action of on its subgroups.


