For the fixed degree-two irreducible polynomial , a matrix with minimal polynomial a power of has only one primary component. Its conjugacy classes correspond to integer partitions of . By the primary matrix centralizer formula, its centralizer has exactly the same order as the centralizer of the corresponding unipotent matrix in .
Sum the conjugacy class sizes:
The same sum times is the number of unipotent matrices of , which 5(c) shows is . Hence counting matrices with a fixed primary polynomial gives
In particular the exponent of the minimal polynomial is not fixed in advance: summing all integer partitions includes every possible largest block size. The usual statement takes ; dimension zero can instead be included with its identity convention.
Take finite-dimensional modules over and finite -free lattices over the complete valuation ring, the usual integral modular representation theory convention. If a completion has several local factors, use the factor supporting the modular block. A block of a group algebra is an indecomposable two-sided ideal , where is a primitive central idempotent. The identity decomposes as the sum of orthogonal block idempotents, and for every module. Hence an indecomposable module belongs to exactly when .
A defect group of a block in characteristic is a maximal p-subgroup with . Equivalently, it is minimal with ; the trace criterion for defect groups and conjugacy are proved below. For a complete discrete valuation ring, use the corresponding reduced modular block; modular reduction of block idempotents preserves its defect groups. The equivalent bimodule description says that the module vertices of , with acting by , are conjugates of . This basic characterization follows from the relative-projectivity trace criterion for the bimodule action.
Fix a Sylow subgroup containing . The regular group algebra is the permutation module for , and multiplication by is its block projection. Restriction to a subgroup containing a chosen module vertex retains a summand with that module vertex: a module source at that module vertex is a summand of the module restriction, and the Mackey restriction formula and minimality prevent all the restricted summands from having smaller module vertices. Thus has an indecomposable summand with module vertex .
For a finite p-group , the transitive permutation module is indecomposable: the group algebra of a p-group in characteristic p is local, and this module has a one-dimensional top, incompatible with a sum of two nonzero modules. Its module vertex is , because it is induced from the trivial -module and its Brauer quotient of a module at has the nonzero fixed coset . The fixed-basis rule for this quotient follows by removing nonsingleton orbit sums, which are proper-subgroup traces. It excludes a smaller module vertex. Reduction gives the same statements for permutation lattices. Therefore Krull-Schmidt decomposition identifies the chosen block summand with an entire transitive orbit in .
Choose a point in that orbit whose stabilizer is exactly . Being fixed by every gives . Its full stabilizer is
Equality with gives . Conjugating, and using that centralizes , proves
This is defect groups are centralizer-conjugate Sylow intersections.
If is a p-subgroup, then is a p-subgroup for every Sylow , so . It lies in both Sylow factors above. Thus every normal p-subgroup of is contained in .
Finally put , choose , and extend it to a Sylow of . Then and . Apply the proved intersection result to this . Its element belongs to , so is Sylow in too. Hence . The p-core is contained in both factors, whereas normality of in gives the opposite inclusion. Therefore , so is a p-radical subgroup. The centralizer condition on the conjugating element is important for this deduction.
The Brauer morphism retains precisely the fixed group-basis elements under conjugation by :
It is unital and surjective because . For multiplicativity, fix . Its coefficient in a product is . Conjugation by permutes these pairs and the summand is constant on each orbit. Nonsingleton orbits have p-divisible size and contribute zero. Singleton pairs have both entries in , so they give exactly the coefficient in . This proves the ring-homomorphism assertion.
Orbit sums form a basis of . A nonfixed orbit sum of is , a proper-subgroup relative trace. Conversely any proper-subgroup trace has zero coefficient on a fixed basis element, since that coefficient is multiplied by in . Thus
There is no assertion that this whole kernel is nilpotent.
Brauer first main theorem bijects the modular blocks of with defect and those of with defect , matching their nonzero Brauer images. Here is a proof with its auxiliary ingredients.
Write , and define
These are ideals in the indicated commutative algebras, since an invariant multiplier passes through a relative trace. The Brauer morphism and relative trace identity
follows by letting act on . Fixed cosets have representatives in ; projection onto gives equal contributions on each other orbit, whose p-divisible size makes the contribution zero. Thus surjects onto .
To prove the trace criterion for defect groups, choose a p-subgroup of least order with a given block idempotent in . Such a choice exists because a Sylow gives . Write and replace by . If , the kernel formula and trace transitivity give . But is an Artinian local ring, and a finite sum of proper ideals cannot contain its identity. Multiplication by therefore forces for some smaller , a contradiction. Hence .
If is not conjugate into , its action on has no fixed coset and the same orbit argument gives . Every subgroup with nonzero Brauer image of is therefore conjugate into . Its maximal such subgroups are exactly the conjugates of , proving the definition's conjugacy assertion and
Among block idempotents in this ideal, the Brauer image at survives precisely when their defect is .
We also use primitive idempotents under a surjection of commutative Artinian ideals. Decompose the ambient algebras into local factors. The component of an ideal in a local factor is either the whole factor, possessing its identity, or a proper ideal in its nilpotent radical, possessing no nonzero idempotent. A nonzero quotient of a local algebra is local. A surjection of these ideals consequently bijects its surviving primitive idempotents with those of the target. Entire factors may be killed; the whole kernel need not be nilpotent.
Apply this result to . Its surviving primitive idempotents are exactly the modular blocks of with defect . Apply it also to , where the target is identical since and . Its surviving primitive idempotents are exactly the modular blocks of with defect . Matching images in proves Brauer first main theorem, in both directions and with uniqueness.
For the last construction, the intended hypothesis is that is a defect group of the source modular block . Put and use the theorem inside to obtain the corresponding modular block of . The centralizer condition gives , so maps into . Let be the central character of a block, retaining its residue field rather than assuming it equals . The unital composite
sends exactly one global block idempotent to one, because their orthogonal idempotent images sum to one in a field. Define to be this unique modular block. This is block induction, independent of the chosen -conjugate of . It needs no containment of in , and its defect may be larger than . With that containment it agrees with the first-main-theorem correspondence.
The printed PDF does not require to be a defect group of . Its literal conditions do not always define the usual induced modular block. For example, over an algebraically closed field of characteristic three, take , as a point stabilizer, and . Then . The ordinary degree-three irreducible of gives a defect-zero modular block on reduction. The two distinct ordinary degree-three irreducibles of give distinct defect-zero modular blocks and . Both restrict to that same character of , with values on its identity, double transpositions and three-cycles.
The standard defect-zero lifting theorem says that these reductions are simple projective modules and their block algebras are full matrix algebras. Thus both module restrictions and contain the same modular block bimodule ; indeed each module restriction is isomorphic to it here. The actual defect of is 1, whose centralizer is , not a subgroup of . The unrelated subgroup cannot select between the two modular blocks. This is block induction requires the block's defect centralizer; the qualified construction above answers the intended request.
The conjugate group elements relation is when for some . It is reflexive by taking the identity, symmetric because , and transitive because and imply . Hence it is an equivalence relation.
For a finite group, the centralizer is a subgroup. The map has equal values at exactly when . Its fibers are therefore the left cosets of , giving
By Lagrange's theorem, this index divides . This is also the orbit-stabilizer theorem for the conjugation action, with the centralizer as stabilizer.
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 gives
To 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 gives
Finally, 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.
First prove Simplicity of alternating groups. The -cycles generate : express an even permutation as an even number of transpositions and pair them. A pair sharing a point is a -cycle, an identical pair cancels, and a disjoint pair can be written . All -cycles are conjugate in when : a conjugator in can have its parity corrected by a transposition on two points outside the target triple, without changing its effect on that triple.
Let and choose . Some -cycle does not commute with . Indeed, commuting with every -cycle would preserve every triple setwise; intersecting all triples containing a given point forces that point to be fixed, so would make . The nonidentity group commutator is supported on at most six points. Its possible nontrivial even cycle types are a -cycle, a double transposition, a -cycle, two disjoint -cycles, or a -cycle times a transposition. Each yields a -cycle in by explicit group commutators:
For , use with a fifth point ; conjugation reverses , so the group commutator is . For , use : the group commutator is . The same calculation works for . For , use ; its conjugate is , and the product is a -cycle, reducing to the preceding case. Thus contains a -cycle, hence the whole conjugacy class of -cycles, and hence all of . Therefore
For the exceptional automorphism, a duad is an unordered pair of six points, a syntheme is a partition into three duads, and a pentad is a set of five synthemes covering every duad once. There are fifteen synthemes. To count pentads, fix , where bars separate duads. A syntheme disjoint from it in duads is one of eight; the union of the two matchings is a six-cycle, so the stabilizer of the fixed syntheme is transitive on these eight choices. For the choice , the remaining compatible synthemes are , , and . The last shares a duad with each of the first three and cannot belong to a completion; the first three form the unique completion. Thus each of the eight choices has a unique completion through the fixed syntheme. Each completion contains four of them, so exactly two pentads contain a fixed syntheme, and there are pentads in total.
Here is the complete list, which also defines concrete labels for the induced action:
Relabelling points gives a group homomorphism on these pentads. Direct substitution in the table gives
The restriction to is nontrivial, hence faithful by the simplicity just proved. Therefore the full kernel has order at most two. An order-two normal subgroup would be central, whereas has trivial centre: an element centralizing every transposition fixes every unordered pair and consequently every point. The kernel is trivial, and equal orders make an automorphism. It preserves , because that is the unique index-two subgroup of : any nontrivial group homomorphism to sends every conjugate transposition to the nonidentity element, and is therefore the sign map. Its restriction is the pentad construction of the exceptional alternating-group automorphism. It maps a -cycle to two disjoint -cycles, while conjugation in preserves cycle type. Hence this automorphism of is not induced by any element of .
For the other degrees, recover the points from -cycles. An element of order three has type . Its centralizer in has order . That centralizer contains an odd permutation: either swap two fixed points, or, when , swap two three-cycles by three transpositions. Thus
For , only is possible. For , the value is strictly largest. For equality first occurs at , and the ratio increases strictly with . For , already at one has : it holds at , and the inductive ratio is . Increasing again increases the ratio. Consequently every automorphism preserves the set of -cycles when .
Each cyclic subgroup generated by a -cycle corresponds to its three-point support. Two distinct such subgroups commute exactly when the supports are disjoint. If they meet in one point, products of their nonidentity generators have order five. If they meet in two points, those products have order two or three. These intrinsic tests recover adjacency in the Johnson graph , so the automorphism acts on its vertices.
We can reconstruct the underlying points without an additional group-theoretic bound. The maximal cliques of a Johnson graph in are the triples containing a fixed pair, and the four triples contained in a fixed four-set. To verify the classification, take adjacent triples and with . Any common adjacent triple either contains or lies in . A triple of the first kind outside that four-set is not adjacent to a triple of the second kind omitting a point of , so a clique cannot mix the two alternatives. Extending a clique therefore gives exactly one of the two listed families.
For , , their sizes distinguish the pair-containing cliques. Their intersections reconstruct the pair graph : two such cliques intersect precisely when their defining pairs meet in one point. In this graph the maximal cliques are stars of pairs through a point and triangles of three pairs within a triple. These sizes are different for , so its automorphisms permute the stars and hence the points. Every pair is the intersection of its two point stars, and every triple is determined by its three pairs. Thus the original graph action comes from some .
Undo conjugation by . The remaining group automorphism fixes each cyclic -subgroup, so it fixes or inverts each generator. For adjacent supports, inverting exactly one generator changes the order of their product between two and three; inverting both preserves that order. Hence the two inversion choices must agree. The triple-support graph is connected, since one can replace differing points one at a time, so the choice is uniform. Inverting every -cycle is impossible: take , , whose product is the -cycle . Then , whereas the group homomorphism property would give ; these are unequal because do not commute. Therefore fixes every -cycle and is the identity. Conversely, conjugation by acts faithfully on , since centralizing all -cycles fixes every triple and every point. The automorphisms of alternating groups from triple supports are exactly
Choose a minimal nontrivial normal subgroup of itself. Every conjugate for is also a minimal normal subgroup of , since is normal in . Distinct such subgroups intersect trivially: their intersection is normal in and minimality forces either equality or trivial intersection. Moreover , so distinct ones commute.
Choose a maximal family of these conjugates whose product is direct. For any further conjugate , its intersection with is normal in and is either all of or trivial. In the latter case it commutes with all the existing factors and could be adjoined to the direct product of groups, contrary to maximality. Thus every conjugate is contained in . The product of all conjugates is consequently , which is nontrivial and normal in . Minimality of as a -normal subgroup gives .
Any normal subgroup of a factor is normal in : the other direct factors commute with it, and normalizes it. Minimality of as a -normal subgroup makes it simple. All factors are isomorphic because they are conjugate to . This proves the direct-product structure of a finite minimal normal subgroup:
An abelian simple group is cyclic of prime order, so the abelian case is elementary abelian. Now let be a maximal proper subgroup of a nonabelian simple group . It is nontrivial, since has nontrivial proper cyclic subgroups. Choose a minimal normal subgroup of . Then . This normalizer cannot be , since that would make normal in . Maximality gives
For each of the two groups in this question, the allowed absence of proper nonabelian simple subgroups makes the factors of such a cyclic of prime order. Hence it suffices to examine normalizers of nontrivial elementary abelian subgroups.
In , the possible primes are two, three and five. The Sylow subgroups for the last two primes are cyclic of orders three and five. Every involution is a double transposition; for the centralizer in is
the Klein four-group fixing point five. Thus an elementary abelian -subgroup is cyclic of order two or a Klein four-group. The normalizer of a cyclic order-two subgroup equals its centralizer and has order four, so is contained in a point stabilizer of order twelve. A Klein four-group's common fixed point is intrinsic, and the full point stabilizer normalizes it; its normalizer is therefore exactly that stabilizer.
An order-three subgroup has support a triple. Its normalizer preserves the triple and the remaining pair, and is , of order six. An order-five subgroup acts regularly on all five points. Label the points by , with the subgroup acting by translations. Its normalizer in is the twenty affine maps . The translations are even, whereas multiplication by a generator of is a four-cycle and is odd. Exactly half these maps are even, so the normalizer in has order ten.
The only candidates for maximal subgroups are thus the normalizers of orders twelve, ten and six. They are all maximal: none can lie in a larger candidate, except potentially an order-six subgroup in an order-twelve . But an index-two subgroup of would contain every order-three element; there are eight such elements, plus the identity, already more than six. Hence that containment is impossible. Point stabilizers are conjugate; order-three and order-five subgroup normalizers each form one class by the Sylow theorems. Therefore the maximal subgroups of A5 form precisely
Their numbers are five, six and ten respectively, since these proper maximal subgroups are self-normalizing in the simple group.
For , choosing independent columns gives . If is an involution, write . Field characteristic two gives , and in dimension three forces its nonzero rank to be one. Thus , with nonzero vector , nonzero linear functional and . This transvection fixes the plane and has image line . Every flag consisting of an incident line and plane occurs, giving involutions, all conjugate. Its centralizer, and hence the normalizer of its cyclic subgroup, is the flag stabilizer of order . It lies in both the line and plane stabilizers of order , so cannot be maximal.
For the elementary abelian subgroups in GL3 over F2, consider commuting transvections , . Their rank-one parts satisfy
If are independent, equality forces both sides zero; thus vanish on and are the same nonzero functional. If , they have a common image line. Consequently the two types of order-four elementary abelian subgroup are
No extra transvection can commute with all elements of : if its image were different, its functional would have to equal each of the two independent functionals occurring in . Dually, the same holds for . Thus these exhaust the elementary abelian -subgroups of rank at least two. The normalizer of is the line stabilizer and the normalizer of is the plane stabilizer, each of order . They give different conjugacy classes because their common fixed spaces have dimensions one and two. All line stabilizers are conjugate, as are all plane stabilizers.
For an order-three element, its minimal polynomial is : it has a fixed line and an invariant complementary irreducible plane. Its normalizer preserves both and is the full on that plane, of order six, since the order-three subgroup is normal in . This normalizer lies in the corresponding line and plane stabilizers, so is not maximal.
An order-seven element is irreducible. Over the finite field one has , and both cubic factors are irreducible because neither has a root in . Its minimal polynomial divides this square-free product and cannot be just , since the element is not the identity. It therefore contains a cubic factor; the three-dimensional space forces that irreducible cubic to be the whole minimal polynomial. Identify the space with and the element with multiplication by a generator of . Its centralizer consists of the seven nonzero multiplication maps. A normalizer induces an -automorphism of this field, so it sends to , or . All three possibilities occur via the field automorphisms . Therefore the normalizer of the Singer cycle has order , and all such normalizers are conjugate by the Sylow theorems.
The maximal-normalizer reduction leaves exactly the two order-twenty-four stabilizer types and the order-twenty-one type. Each is maximal because it cannot be contained in any larger remaining candidate; equal-order subgroups cannot properly contain one another and does not divide . Thus
For of finite subgroup index, let and choose a right-coset transversal for the cosets . For each write
The transfer homomorphism is
The product is taken in the abelianization, so its order is irrelevant. If another transversal has representative for , with , its factor is . The map permutes , so the extra factors cancel in . This proves independence of the transversal. Also
Multiplying over and again permuting the second indices proves . Thus it is indeed a group homomorphism.
The Burnside transfer theorem states that if a Sylow -subgroup of a finite group satisfies , then has a normal -complement: a normal subgroup of order . The hypothesis first makes abelian. It also makes fusion inside trivial. To prove this, suppose and , using . Both and lie in : the former because is abelian, and the latter because . They are Sylow subgroups of that centralizer. Choose with . Then and , while the central-normalizer hypothesis gives . Thus .
Evaluate transfer to the abelian group on . In the action of on right cosets, a cycle of length contributes
with . This is a conjugate of inside and hence equals by the fusion argument. Summing the cycle lengths therefore gives
The exponent is coprime to , so this power map is an automorphism of the finite abelian -group . Transfer is consequently onto , and its kernel is normal of subgroup index and of order prime to . This proves the theorem. Notice also that a normal -complement consists exactly of the elements of prime-to- order: they map trivially to the -group quotient, while all elements of the complement have such order. It is therefore unique and a characteristic subgroup.
Now let be primitive of degree , with prime. Every nontrivial normal subgroup of a faithful primitive group action is transitive: its orbits form a -invariant block partition, and singleton orbits would make it trivial. Such a subgroup has order divisible by . A Sylow -subgroup has order , since contains only one factor . The normalizer of a regular -cycle in is the affine group on , of order . Translations are even, whereas a generating multiplier gives a -cycle and is odd. Its normalizer in therefore has order .
Suppose is not simple and choose proper. It is transitive, so we can choose . The Frattini argument gives : for each , the subgroup is a Sylow subgroup of and can be conjugated back to within . Since contains and lies in the order- normalizer, it has order or . If its order were , the Burnside theorem applied to would give a normal -complement. A nontrivial such complement cannot be transitive because its order is prime to , contradicting primitivity. It must be trivial, giving , contrary to the choice of . Thus .
The intersection again has order or . If it had order , the whole normalizer would lie in and the Frattini equality would give . Hence . Applying Burnside transfer within gives its normal -complement . By the uniqueness argument, is a characteristic subgroup of , and so normal in . Primitivity again forces this prime-to- subgroup to be trivial. Thus is normal in , and has order . The even primitive groups of safe-prime degree conclusion is
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, and
These 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 gives
A 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 equation
For , 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 . Consequently
This proves the nontrivial center of a finite p-group directly from the conjugation classes.
Suppose is proper. The defining property makes cyclic of order . Conjugation gives a homomorphism
whose kernel is the centralizer . The automorphism group has order , so the kernel has finite index in . It contains , because is abelian. If this kernel were proper, it would be an order- subgroup, and its finite index would force itself to be finite. Therefore , so is central.
Choose . Part (i) shows that has order . Its cyclic subgroup meets trivially, since two order- subgroups with nontrivial intersection are equal. Since is central,
This subgroup has order and is proper because is infinite, contradicting the assumed order of every proper nontrivial subgroup. Thus no such exists:
Together with part (i), this proves that Tarski monster groups are two-generated and simple.