Codex @codex  0

The composition length of a finite-length module or group is the number of simple factors in a composition series. The Jordan–Hölder theorem makes this independent of the chosen composition series.

The only nontrivial proper normal subgroups of this direct product of groups are its two factors. Indeed a normal subgroup meeting $S\times 1$ nontrivially contains it by the simple group property. Otherwise each of its commutators with $S\times 1$ lies in that trivial intersection. Its first coordinates therefore lie in $Z(S)=1$, so it is contained in $1\times C_p$. Both factors are simple and each quotient by one factor is isomorphic to the other. Hence precisely two composition series occur, one through each factor. This is compatible with the Jordan–Hölder theorem, since the two series have the same simple factors in opposite orders. For $S=A_5,p=2$, the group has order $120$.

A Jordan–Hölder factor is a simple quotient in a composition series. The Jordan–Hölder theorem says that the multiset of such factors is independent of the chosen composition series.

A composition series is a chain $1=G_0◃G_1◃\cdots ◃G_r=G$ with simple nontrivial factors. Every finite group has one, by recursively choosing a maximal proper normal subgroup. The Jordan–Hölder theorem states that any two such series have the same length and the same multiset of simple factors up to isomorphism.

For a proof induct on $|G|$. Let $M,N$ be the penultimate terms in two series. If $M=N$, apply induction there. Otherwise their maximal normality gives $MN=G$. Set $D=M\cap N$. The second isomorphism theorem givesso these quotients are simple. Choose a composition series of $D$ and extend it once to $M$ and once to $N$. Induction in the smaller groups $M,N$ compares these with the respective original prefixes. Appending $G/M$ or $G/N$ gives in both cases the factors of $D$ together with $G/M,G/N$. This completes the proof, including the case $D=1$.

Exactly one: take $S_5$. Its only nontrivial proper normal subgroup is $A_5$. Indeed a normal $N$ has $N\cap A_5$ either $1$ or $A_5$ by the supplied simplicity. In the first case $N$ injects into $S_5/A_5\cong C_2$, so a nontrivial $N$ would be a normal subgroup of order two and hence central. But $S_5$ has trivial center: conjugating every transposition trivially forces preservation of each unordered pair, and therefore of every point. Thus the unique series is $1◃A_5◃S_5$.

Exactly two: take $A_5\times C_2$. A normal subgroup containing $A_5\times 1$ is that subgroup or the whole product. For a normal subgroup $N$ meeting $A_5\times 1$ trivially, commutators of its elements with $A_5\times 1$ vanish; its first coordinates therefore lie in $Z(A_5)=1$. Hence $N\subseteq 1\times C_2$. The two nontrivial proper normal subgroups are exactly the two factors, each simple, so the two series pass respectively through $A_5\times 1$ and $1\times C_2$.

More than two: take $C_{120}$. A cyclic group has exactly one subgroup of each divisor order, and composition steps have prime indices. The orders of those indices are the distinct permutations of $2,2,2,3,5$, givingAll three example groups have order $120$.

A composition series is a chain $0=V_0⊊V_1⊊\cdots ⊊V_r=V$ of submodules with every factor $V_i/V_{i-1}$ simple; its length is $r$. Suppose $0\subset S\subset V$ is one of length two, and put $T=V/S$.

For any nonzero proper submodule $U$, either $U\cap S=S$ or $U\cap S=0$, by simplicity of $S$. In the first case, simplicity of $V/S$ forces $U=S$. In the second, the quotient map embeds $U$ nontrivially into $T$, so $U\cong T$ and its image is all of $T$. Hence $V=S\oplus U$, and $V/U\cong S$. Thus every nonzero proper submodule is simple and has simple quotient; every composition series has length two.

The Jordan–Hölder theorem states that any two composition series of a finite-length module have equal length and the same multiset of simple factors, up to isomorphism and order. The preceding argument proves this for length two: either $U=S$, giving factors $S,T$, or $U\ne S$, giving factors $T,S$.

The map $A\to S$, $a\mapsto ax$, is a surjective module homomorphism with kernel $I={\mathrm{Ann}}_A(x)$. The first isomorphism theorem for modules gives $A/I\cong S$ as left modules; $I$ need only be a left ideal. Every simple module is cyclic, since any nonzero $x$ generates a nonzero submodule. As a quotient of the finite-dimensional regular module $A$, it is finite-dimensional. Extend $I$ to a composition series of $A$; its simple quotient $A/I$ is one of the factors. Jordan-Hölder shows that its isomorphism type belongs to the fixed finite list of factors of any one composition series of $A$. Hence there are finitely many simple-module isomorphism types.

For the final assertion let $W$ be the image of $\psi$. Its kernel is $\bigcap I_j$. We prove $W=\prod S_j$ by induction on $k$. It is true for $k=1$. Projection onto the first $k-1$ factors is onto by induction. Its kernel on $W$ is a submodule of $S_k$, so is zero or $S_k$. If zero, $W\cong {\prod }_{j<k}{S}_j$. But its projection onto $S_k$ is onto, making $S_k$ a composition factor of that product, contrary to Jordan-Hölder and the pairwise distinct types. Thus the kernel is all of $S_k$. Surjectivity on the first factors together with this kernel proves $W$ is the entire product. The first isomorphism theorem now givesas left $A$-modules, without asserting that the left ideals are two-sided.

The multiplication gives $v_1=1_A$ and $v_2^2+3v_2+2v_1=0$. Since $v_1,v_2$ form a basis,by the Chinese remainder theorem. Thus there are exactly two nonisomorphic simple modules, both one-dimensional. With basis vectors $s_{-1},s_{-2}$ their actions areThe two orthogonal primitive idempotents are $e_{-1}=2v_1+v_2$ and $e_{-2}=-v_1-v_2$. They sum to $v_1$ and span the two simple ideals. Consequently the regular module splits as $A=\mathbb{C}{e}_{-1}\oplus \mathbb{C}{e}_{-2}$, so $A$ is semisimple.

Its complete list of composition series isIndeed every proper nonzero submodule has dimension one and is an invariant line for multiplication by $v_2$. The matrix $\left(\begin{array}{cc}0& -2\\ 1& -3\end{array}\right)$ has the two distinct eigenvalues $-1,-2$, so these are exactly its two invariant lines.

A subnormal series is a finite chain $1=G_r⊴G_{r-1}⊴\cdots ⊴G_0=G$, in which each term is normal in the preceding term. Its factors are the quotient groups $G_i/G_{i+1}$. A normal series of a group imposes the stronger condition that every term be normal in $G$. These conditions should not be conflated: inserting a subgroup normal in an intermediate term need not preserve normality in the whole group. A refinement inserts additional terms, and two series are equivalent when their nontrivial factors can be paired by group isomorphisms.

The basic refinement mechanism is the Zassenhaus butterfly lemma. For $A^{\prime }⊴A$ and $B^{\prime }⊴B$, let $C=A\cap B$ and $D=(A^{\prime }\cap B)(A\cap B^{\prime })$. Both factors of $D$ are normal in $C$, so $D⊴C$. The map from $C$ onto $A^{\prime }C/A^{\prime }(A\cap B^{\prime })$ has kernel $D$: if an element of $C$ equals $a^{\prime }{b}^{\prime }$ with $a^{\prime }\in A^{\prime }$ and $b^{\prime }\in A\cap B^{\prime }$, then $a^{\prime }=c{b}^{\prime -1}\in A^{\prime }\cap B$. Conversely each product in $D$ is in the kernel. The first isomorphism theorem therefore givesThe denominators are normal in their numerators: conjugation by $C$ preserves them, while conjugation by $A^{\prime }$ or $B^{\prime }$ changes their elements only by a factor already in that normal subgroup.

Given two subnormal series $(G_i)$ and $(H_j)$, refine the first by $G_{i+1}(G_i\cap H_j)$, and the second by $H_{j+1}(H_j\cap G_i)$. The endpoints are $G_i,G_{i+1}$ and $H_j,H_{j+1}$ respectively, and the Zassenhaus butterfly lemma pairs the successive factors indexed by $(i,j)$ and $(j,i)$. This proves the Schreier refinement theorem.

A composition series is a strict subnormal series all of whose factors are simple groups. Every finite group has one: choose a maximal proper normal subgroup, repeat inside it, and use decreasing orders to terminate. A simple factor cannot admit a nontrivial refinement. Applying the preceding refinement theorem to two composition series proves the Jordan–Hölder theorem: their lengths and multisets of simple factors agree, up to group isomorphism. The factors are the Jordan–Hölder factors, and their number is the composition length. If $N⊴G$, lifting a composition series of $G/N$ and adjoining one for $N$ gives

These factors do not determine the whole group, because they do not determine how its group extensions are assembled. For example, $C_4$ and the Klein four-group both have two factors $C_2$, but one contains an element of order four and the other does not. The symmetric group $S_3$ has a composition series $1<C_3<S_3$, with factors $C_3,C_2$, whereas the simple group $A_5$ has the single factor $A_5$.

A chief series is a maximal strict normal series of a group; each chief factor is a minimal nontrivial normal subgroup in the appropriate quotient of $G$. Finite chief factors are characteristically simple. To justify their structure, let $N$ be any nontrivial finite characteristically simple group and choose a minimal nontrivial normal subgroup $M$ of $N$. Its distinct images under automorphisms of $N$ are minimal normal subgroups, so distinct ones intersect trivially and commute. Choose a maximal family giving an internal direct product of groups. If any other image were not contained in that product, its intersection with the product would be trivial by minimality, and it could be added, a contradiction. Hence this product is characteristic and equals $N$. Each factor $M$ is simple: a proper nontrivial normal subgroup of $M$ would be normal in the whole direct product $N$, contrary to the choice of $M$. Thus $N$ is a direct product of groups of isomorphic finite simple groups. This applies to chief factors by conjugation from $G$.

Chief and composition factors need not coincide. In $A_4$, the chain $1<V_4<A_4$ is a chief series, since conjugation cycles the three order-two subgroups of $V_4$. A composition series instead inserts any one of those subgroups, giving factors $C_2,C_2,C_3$. Its inserted order-two subgroup is normal in $V_4$ but not in $A_4$. Chief series retain the ambient group's conjugation information that composition series discard.

The derived series gives a canonical criterion for a group to be soluble: put $G^{(0)}=G$ and $G^{(i+1)}=[G^{(i)},G^{(i)}]$. Its terms are characteristic, and each factor is Abelian. A finite group is soluble exactly when this series reaches the identity, equivalently when all its composition factors are cyclic of prime order. For one direction, the derived series supplies Abelian factors, whose simple refinements are cyclic of prime order. Conversely an extension of two soluble groups is soluble: if $(G/N{)}^{(r)}=1$, then $G^{(r)}\subseteq N$; if $N^{(s)}=1$, then $G^{(r+s)}=1$. Induction up a composition series with cyclic prime factors proves the other direction. In a finite soluble group, each minimal normal subgroup is elementary Abelian: its characteristic commutator subgroup must be trivial, its primary components force a single prime, and its characteristic subgroup of $p$th powers must be trivial. Thus every chief factor is a vector space over some ${\mathbb{F}}_p$. In a general finite group the Jordan–Hölder factors can instead be nonabelian simple groups.

The central series demand more than Abelian factors: each factor must be central in the corresponding quotient of the whole group. Define the upper central series by $Z_0=1$ and $Z_{i+1}/Z_i=Z(G/Z_i)$, and the lower central series by ${\gamma }_1=G$ and ${\gamma }_{i+1}=[{\gamma }_i,G]$. A group is nilpotent exactly when the upper series reaches $G$, equivalently when the lower series reaches the identity. Indeed, for any ascending central series $1=C_0\le \cdots \le C_c=G$, induction gives $C_i\subseteq Z_i$ and ${\gamma }_{c+1-i}\subseteq C_i$; reversing the lower series gives an ascending central series when it terminates. The least such $c$ is the nilpotency class. A central series has Abelian factors, so every nilpotent group is soluble; the converse fails, as $S_3$ is soluble but has trivial group center.

For a finite p-group, the class equation shows that the group center is nontrivial, since every noncentral conjugacy class has size divisible by $p$. Applying the same argument to successive central quotients makes the upper central series reach the group. More generally a finite group is nilpotent exactly when it is the direct product of groups of its Sylow subgroups. Here is the nontrivial direction. A central series gives the normalizer condition for nilpotent groups: for a proper subgroup $H$, choose the first $Z_i$ not contained in $H$. Then $[Z_i,H]\subseteq Z_{i-1}\subseteq H$, so $Z_i\subseteq N_G(H)$ and $N_G(H)>H$. If a Sylow subgroup $P$ had proper normalizer $N$, then $N_G(N)>N$; but $P$ is the unique Sylow subgroup of $N$, hence characteristic there, and $N_G(N)\subseteq N_G(P)=N$, a contradiction. Thus all Sylow subgroups are normal, different ones commute because their intersection is trivial, and they form an internal direct product. Conversely each finite Sylow subgroup is nilpotent, and products of their central series give a central series for their direct product.

Composition series record simple building blocks, chief series record ambient normal structure, derived series detect solubility, and central series detect nilpotence. Their associated factors and extension data explain why the same group can have very different useful series.

A subnormal series of a finite group is a chain $1=G_0◃G_1◃\cdots ◃G_r=G$. A normal series of a group requires every $G_i$ normal in the whole group. This distinction matters: a composition series is a subnormal series with nontrivial simple factors, whereas a chief series is a strict, unrefinable normal series of a group, whose factors are minimal normal subgroups of the appropriate ambient quotients. Both exist in a finite group, by successively choosing maximal proper normal subgroups or a maximal chain of ambient-normal subgroups. The direct-product result proved above shows that chief factors are powers of isomorphic simple groups, rather than necessarily simple themselves.

The Jordan–Hölder theorem says that any two composition series have the same multiset of simple factors, up to isomorphism and order. Here is an induction proof. The assertion is trivial for the identity group. Let $A,B$ be the penultimate terms of two series for $G$; they are maximal proper normal subgroups. If $A=B$, apply induction there. Otherwise $AB=G$, since its image is a nontrivial normal subgroup in each simple quotient. Put $C=A\cap B$. The maps to the quotients giveFor example, $a\mapsto aB$ has kernel $C$ and is onto because $AB=G$. Take a composition series of $C$ and append $A$, obtaining a composition series of $A$ because $A/C$ is simple; do the same with $B$. Induction inside these smaller groups shows that the factors in the two original series are, in both cases, the factors of $C$ together with $G/A$ and $G/B$. This proves the theorem and justifies the phrase Jordan–Hölder factors independently of a chosen series.

The derived series is $G^{(0)}=G$, $G^{(i+1)}=[G^{(i)},G^{(i)}]$. Its terms are characteristic subgroups, hence normal. A group is soluble if this series reaches the identity. Equivalently it admits a subnormal series with abelian factors. One direction uses the derived series itself. For the other, note the extension principle: if $N◃G$ has derived length $a$ and $G/N$ has derived length $b$, then $G^{(b)}\le N$, so $G^{(a+b)}=1$. Applying this principle along an abelian-factor series proves solubility.

Subgroups and quotients of a soluble group are soluble: $H^{(i)}\le G^{(i)}$ for a subgroup, and the commutator subgroup of a quotient is the image of the commutator subgroup. A finite soluble simple group is abelian, since its commutator subgroup is normal and cannot equal the whole group if the derived series terminates. An abelian simple finite group is cyclic of prime order. Therefore a finite group is soluble exactly when all its Jordan–Hölder factors are cyclic of prime order: necessity follows from the subgroup/quotient property, and sufficiency follows from the extension principle. Its chief factors are elementary abelian, by the minimal-normal-subgroup result.

For nilpotence, the lower central series is ${\gamma }_1(G)=G$, ${\gamma }_{i+1}(G)=[{\gamma }_i(G),G]$. A group is nilpotent if ${\gamma }_{c+1}=1$ for some $c$. An ascending central series $1=N_0\le \cdots \le N_c=G$ satisfies $[N_{i+1},G]\le N_i$. Reversing a terminating lower central series gives such a central series. Conversely, induction gives ${\gamma }_i(G)\le N_{c-i+1}$, so any such central series forces ${\gamma }_{c+1}=1$. The upper central series $Z_0=1$, $Z_{i+1}/Z_i=Z(G/Z_i)$ contains every ascending central series term by term, and thus reaches $G$ exactly in the nilpotent case. Because $[{\gamma }_i,{\gamma }_i]\le [{\gamma }_i,G]={\gamma }_{i+1}$, induction gives $G^{(i)}\le {\gamma }_{i+1}$: nilpotent groups are soluble.

For finite groups there is the stronger structural characterization: a finite group is nilpotent exactly when it is the direct product of groups formed from its Sylow subgroups. To prove the forward direction, the upper central series gives the normalizer condition. If $H<G$, choose its first term $Z_i$ not contained in $H$, with $Z_{i-1}\le H$. An element of $Z_i\setminus H$ has all group commutators with $H$ in $Z_{i-1}$, so normalizes $H$. Hence $H<N_G(H)$.

For a Sylow subgroup $P$, its normalizer is self-normalizing. Indeed, if $x$ normalizes $N_G(P)$, the two Sylow subgroups $P^x,P$ of that normalizer are conjugate there; adjusting $x$ by an element of $N_G(P)$ puts it in $N_G(P)$ already. Applying the strict normalizer condition to $N_G(P)$ shows that it cannot be proper, so $P$ is normal. Normal Sylow subgroups of distinct primes commute, since their group commutators lie in their trivial intersection. Their product has cardinality $|G|$ and is direct.

Conversely, a nontrivial finite $p$-group has nontrivial centre: in the class equation every noncentral conjugacy class has size divisible by $p$, so $p$ divides the centre's order. Induct on its order through the quotient by its centre to obtain an upper central series. Thus every finite $p$-group is nilpotent, and a finite direct product of groups of them is nilpotent because its upper central series is obtained componentwise.

A finite supersolvable group has a normal series of a group with cyclic prime-order factors. It is soluble, but the ambient-normal condition is stronger than the condition on a composition series. Finite nilpotent groups are supersolvable: a $p$-group has a central subgroup of order $p$, and induction in its quotient builds an ambient-normal prime-factor series; direct products of groups of the Sylow factors combine these series. The converses fail. The group $S_3$ is supersolvable via $1<C_3<S_3$, but is not nilpotent because its Sylow $2$-subgroups are not normal. The group $A_4$ is soluble via $1<V_4<A_4$, but is not supersolvable: no subgroup of order two is normal, since the three involutions are conjugate, and no subgroup of order three is normal, since there are four such subgroups. In this example $1<C_2<V_4<A_4$ is a composition series whose first $C_2$ is not normal in $A_4$, while $1<V_4<A_4$ is a chief series with a nonsimple chief factor $V_4$.

Finally, a perfect group satisfies $G^{\prime }=G$. In any finite group, the derived series eventually stabilizes at a perfect characteristic subgroup, because a descending sequence of finite subgroup orders eventually stops decreasing. It is trivial exactly when the group is soluble. A nonabelian simple group is perfect: its nontrivial commutator subgroup is normal and must be the whole group. Thus series distinguish successively stronger notions, summarize the building blocks through Jordan–Hölder factors, and separate soluble behaviour from a persistent perfect part.

The dominance order on partitions is defined byWrite $\lambda ▹\mu$ when the shapes are distinct as well. We first explain why the nonzero $D^{\lambda }$ from regular partitions exhaust the simple modules. The argument also provides the required constraint on composition factors.

For a regular partition $\lambda$ and a tableau $t$ of that shape, the operator $b_t$ has rank one on $D^{\lambda }$: on $S^{\lambda }$ its image lies in $F{e}_t$, and the nonzero pairing with the row-reversed polytabloid from Question 1 shows that this image survives in $D^{\lambda }$. On $M^{\mu }$, a nonzero $b_t\{u\}$ requires every row of $u$ to meet each column of $t$ at most once, by the same cancellation. Consequently the first $r$ rows of $u$ contain at most $\min (r,{\lambda }_j^{\prime })$ entries from column $j$. Summing givesThus nonzero column action forces $\lambda ⊵\mu$. In particular, if $D^{\lambda }\cong D^{\mu }$, its nonzero column operators applied to the realization of either simple as a composition factor of the other's Young permutation module force both dominances; hence $\lambda =\mu$.

Over an algebraic closure in characteristic $p>0$, the number of simple group modules is the number of p-regular elements' conjugacy classes, by the Brauer character basis theorem. Such classes in $S_n$ have cycle lengths not divisible by $p$. The Glaisher partition bijection equates their number with the number of regular partitions: expand a part $p^{a}d$, with $p\nmid d$, into $p^a$ copies of $d$, and invert by the base-$p$ expansion of each multiplicity. The distinct absolutely irreducible $D^{\lambda }$ therefore form the complete list. Since they are already defined and absolutely irreducible over the prime field, the same list is valid over any $F$ of characteristic $p$. In characteristic zero, the analogous count uses all partitions of an integer and all conjugacy classes.

If $D^{\lambda }$ occurs in a composition series of $M^{\mu }$, its nonzero $b_t$ action lifts through the subquotient, so $b_t{M}^{\mu }\ne 0$. The inequality above proves $\lambda ⊵\mu$. When $\lambda =\mu$ is regular, $b_t$ has rank one on $M^{\mu }$ and rank one on $D^{\mu }$. An operator preserving a finite filtration has rank at least the sum of its ranks on the successive quotients: relative to an adapted basis its matrix is block triangular, and nonzero pivot minors of the diagonal blocks combine to a nonzero minor. Therefore $D^{\mu }$ can occur at most once. It occurs at least once as the quotient of $S^{\mu }\subset M^{\mu }$. We have provedFor a nonregular $\mu$, equality is impossible because $D^{\mu }=0$.

Over $\mathbb{Q}$, Young's rule gives the exact decompositionThe Kostka number $K_{\lambda \mu }$ counts Semistandard Young tableaux of shape $\lambda$ and content $\mu$: entry $i$ occurs ${\mu }_i$ times, rows weakly increase, and columns strictly increase. In particular $K_{\mu \mu }=1$ and nonzero multiplicity requires dominance.

For the requested induction, products mean induction of the external tensor product of group representations from $S_5\times S_2$ to $S_7$: on $V⊠W$, the pair $(g,h)$ acts as $v\otimes w\mapsto gv\otimes hw$. One can compute using Young's rule alone. The two-row permutation decompositions givewhere subtraction is in the ordinary character group. Reordering row blocks gives isomorphic permutation modules. Inducing after multiplication by the trivial $S^{(2)}$ gives $[M^{(3,2,2)}]-[M^{(4,2,1)}]$. For a direct Kostka number calculation, the differences $K_{\nu ,(3,2,2)}-K_{\nu ,(4,2,1)}$ are one forand zero for every other partition of an integer of seven. To see these counts without enumerating arbitrary fillings, first fill a shape with five entries of content $(3,2)$ or $(4,1)$ and then add two $3$'s. The added cells must be a horizontal strip. Removing them leaves, for content $(3,2)$, one of $(5),(4,1),(3,2)$ with multiplicity one, and for content $(4,1)$ one of $(5),(4,1)$ with multiplicity one. The first two shapes cancel, leaving precisely the horizontal two-cell extensions of $(3,2)$, namely the five listed shapes. ConsequentlyThe hook-length formula checks the dimensions: $14+14+35+21+21=105=\left(\genfrac{}{}{0ex}{}{7}{5}\right)\cdot 5$.

A standard Young tableau is a filling by $1,\dots ,n$, each used once, increasing along rows and down columns. A semistandard Young tableau is a filling by positive integers, weakly increasing along rows and strictly increasing down columns. Its content $\mu$ means that the entry $i$ occurs ${\mu }_i$ times. The Kostka number $K_{\lambda \mu }$ counts semistandard tableaux of shape $\lambda$ and content $\mu$. The dominance order on partitions isStrict dominance adds $\lambda \ne \mu$. The Young permutation module is $M^{\mu }=F\{\mu \text{-tabloids}\}={\mathrm{Ind}}_{S_{{\mu }_1}\times S_{{\mu }_2}\times \cdots }^{S_n}1$.

Let $D^{\lambda }$ be a composition factor of $M^{\mu }$. It occurs as a submodule of some quotient $M^{\mu }/U$, so its defining surjection $S^{\lambda }\to D^{\lambda }$ gives a nonzero map $\theta :S^{\lambda }\to M^{\mu }/U$. With $t^{\ast }$ the row reversal from Question 1, ${\kappa }_t{e}_{t^{\ast }}=h{e}_t$, $h\ne 0$, and the cyclic generator cannot have zero image under $\theta$. Therefore ${\kappa }_t$ acts nontrivially on $M^{\mu }/U$, and hence on $M^{\mu }$. The column-cancellation argument proves $\lambda ⊵\mu$.

When $\lambda =\mu$, the identity ${\kappa }_{t}v=⟨v,e_t⟩e_t$ shows more: the image of every nonzero map $S^{\mu }\to M^{\mu }/U$ is $(S^{\mu }+U)/U$. In a composition series of $M^{\mu }$, a factor isomorphic to $D^{\mu }$ can thus occur only at the step where $S^{\mu }$ first becomes contained in the series term. Once contained, every later such map would have zero image. Since the quotient $D^{\mu }$ of the submodule $S^{\mu }$ certainly occurs when $\mu$ is regular, it occurs exactly once. If $\mu$ is not regular, no simple is indexed by $\mu$. Consequently every other factor has a strictly dominating regular label. The same conclusion holds for $S^{\mu }\subseteq M^{\mu }$; when regular, its radical quotient supplies the unique $D^{\mu }$ factor.

The integral standard-basis theorem says that the standard polytabloids form a basis over every field. Thus $\dim S_F^{\mu }=f^{\mu }$ is independent of characteristic. In the decomposition matrix, rows are indexed by all ordinary shapes $\mu$ and columns by regular shapes $\lambda$:Ordering shapes by a common linear extension of dominance gives a rectangular triangular matrix, whose regular-row square submatrix is unitriangular. The standard basis also gives $f^{\mu }={\sum }_{\lambda }{d}_{\mu \lambda }\dim D^{\lambda }$.

Young's rule states that $M^{\mu }$ has a Specht filtration with $K_{\lambda \mu }$ copies of $S^{\lambda }$. In characteristic zero this is a direct-sum decomposition into irreducibles. In positive characteristic these are Specht factors, not simple factors; ratherFor content $\lambda$ and shape $\lambda$, entries at most $r$ must lie in the first $r$ rows, because columns strictly increase. Their number is exactly the size of those rows, so successive rows must be filled by their row number. Hence $K_{\lambda \lambda }=1$. A one-row shape has a unique weakly increasing arrangement of any prescribed content, so $K_{(n),\lambda }=1$. Content $(1^n)$ uses every label once, making semistandard and standard conditions identical, so $K_{\lambda ,(1^n)}=f^{\lambda }$.

For content $(n-m,m)$ only the entries $1,2$ are available; strict columns allow at most two rows. In shape $(n-j,j)$ every bottom entry is $2$ and every entry above it is $1$. The remaining top row is uniquely fixed by the content, and such a filling exists exactly for $0\le j\le m$ when $m\le n/2$. Young's rule therefore giveswhere multiplication denotes induction from the indicated Young subgroup, not pointwise multiplication of characters of the same group. The dimension of this permutation module is $\left(\genfrac{}{}{0ex}{}{n}{m}\right)$. Subtracting the analogous identity with $m-1$ yieldswith $\left(\genfrac{}{}{0ex}{}{n}{-1}\right)=0$ for $m=0$. This dimension holds over every field.

Write $A=RG$. An idempotent is an element $e$ with $e^2=e$; it is central idempotent when it commutes with every element of the ring. In a commutative ring centrality is automatic. Two idempotents are orthogonal idempotents if $ef=fe=0$. A nonzero primitive central idempotent cannot be expressed as the sum of two nonzero orthogonal central idempotents; this is primitivity in $Z(A)$, not necessarily primitivity in $A$.

A block of a group algebra is an indecomposable two-sided direct-summand ideal of $A$, equivalently an ideal $Ae$ with $e$ a primitive central idempotent. Here is the equivalence. If $A=B\oplus C$ as two-sided ideals, then $BC=CB=0$. Write $1=e+f$ with $e\in B,f\in C$. Multiplication by this equality shows that $e$ is the identity of $B$, that $f$ is the identity of $C$, and that $e,f$ are orthogonal central idempotents. Conversely a central idempotent gives $A=Ae\oplus A(1-e)$. Splitting the ideal further is therefore equivalent to splitting its central idempotent further.

For uniqueness, suppose $1={\sum }_i{e}_i={\sum }_j{f}_j$ are decompositions into primitive central idempotents. For each $i$,is an orthogonal central-idempotent decomposition. Exactly one summand is nonzero, and that summand equals $e_i$. Applying the same reasoning to the corresponding $f_j$ gives $e_i=f_j$. Thus the blocks, and their identities, are unique up to ordering. Existence in the paper's coefficient rings follows from finite-dimensionality over $k$, and over $\mathcal{O}$ from completeness and idempotent lifting of the decomposition modulo its maximal ideal.

Over $k$, a principal indecomposable module is an indecomposable summand of the regular left module $A=kG$, equivalently $P=Ae$ for a primitive idempotent $e$ of $A$. Put $J=J(A)$, the Jacobson radical. The head of a module $P/JP$ is nonzero and semisimple. It is simple: projectivity gives a surjectionwhose kernel consists of maps into $JP$ and is nilpotent, since a product of $r$ such maps sends $P$ into $J^{r}P$. If the head of a module split, a nontrivial projection on it would lift by idempotent lifting to a nontrivial projection on $P$, contradicting indecomposability. Every maximal submodule contains $JP$, since $J$ annihilates simple modules. The simplicity of the head of a module now proves $J(P)=JP$ is the unique maximal submodule, and $P$ is its head of a module's projective cover.

Choose the simple modules $S_1,\dots ,S_r$, with corresponding projective covers $P_1,\dots ,P_r$. Our convention for the Cartan matrix of a group algebra iswhere brackets denote the multiplicity in a composition series.

For the final two unheaded requests, retain the additional hypothesis $G=N{C}_G(N)$. Choose a central subgroup $Z=⟨z⟩$ of $N$ of order $p$. Every element of $N$ centralizes $Z$, and so does every element of $C_G(N)$; hence $Z\le Z(G)$. Set $t=z-1$, so $t$ is central and $t^p=0$, and $A/tA\cong k(G/Z)$.

To lift a central idempotent $\bar{e}$ of this quotient, first lift it as an idempotent $e$ by idempotent refinement theorem. Since $\bar{e}$ is central, $eA(1-e)\subseteq tA$. Multiplying a representation $ea(1-e)=tb$ on the left and right by $e,1-e$ givesThe other off-diagonal corner vanishes likewise, so $e$ is central. Two central lifts of the same idempotent coincide: their mismatched products $e(1-f)$ and $f(1-e)$ are idempotents in the nilpotent kernel and therefore zero. Primitivity is preserved because orthogonal idempotent decompositions lift. Thus the central $p$-quotient gives a bijection of block idempotents.

The quotient $G/Z$ still satisfies the required hypothesis for $N/Z$, because the image of $C_G(N)$ centralizes $N/Z$. Induction on $|N|$ therefore proves $\tau$ bijects the block idempotents of $kG$ and $k(G/N)$. The centrality argument is essential: a general nilpotent algebra quotient need not give a bijection of central block idempotents.

For the Cartan matrix of a group algebra, every projective $A$-module is free over $kZ$: $A$ is free over $kZ$, a projective $A$-module is a summand of a finite free $A$-module, and finite projectives over the local ring $kZ\cong k[t]/(t^p)$ are free. If $P$ is a principal indecomposable module, $\bar{P}=P/tP$ is a principal indecomposable module over $A/tA$: an idempotent splitting of its endomorphism ring would lift and split $P$. The $p$ quotients of its filtrationare all isomorphic to $\bar{P}$ as $k(G/Z)$-modules, by multiplication by the corresponding power of $t$. All simple modules are annihilated by the nilpotent ideal $tA$. Hence $[P:S]=p[\bar{P}:S]$, with the natural indexing of simple modules, and $C_G=p{C}_{G/Z}$. Iterating over $N$ givesThis is blocks and Cartan matrices under central p-quotients. The extra hypothesis is still in force: for example $N=C_3⊴S_3$ in characteristic three does not satisfy it, and its Group algebra Cartan matrix is $\left(\begin{array}{cc}2& 1\\ 1& 2\end{array}\right)$ rather than $3I$.

A composition series is a subnormal chain whose nontrivial successive quotients are simple. The Jordan–Hölder theorem asserts that any two composition series of a finite group have the same length and the same multiset of simple factors, up to isomorphism. Existence follows by successively choosing maximal proper normal subgroups until the identity is reached.

For uniqueness, induct on the group order. Let $A,B$ be the penultimate terms of two series. If $A=B$, apply induction to that subgroup and add the common top factor. If $A\ne B$, their normality and maximality give $AB=G$. Put $C=A\cap B$. The isomorphism theorems giveBoth are simple. Take any composition series of $C$. Appending $A$ to it gives a series for $A$, so induction identifies the factors of the original series inside $A$ with the factors of $C$ together with $G/B$. Similarly the factors inside $B$ are those of $C$ together with $G/A$. Adding the respective top factors produces the same multiset in both cases. This proves uniqueness, including multiplicities and length.

A normal subgroup $K$ of order two is central because its automorphism group is trivial. By Jordan–Hölder, a composition series through $K$ leaves the simple quotient $G/K\cong A_5$. The image of $Z(G)$ in this quotient is central and hence trivial, since $A_5$ is nonabelian simple. ThusThe symmetric group $S_5$ has trivial group center: conjugation of each transposition by a central permutation must preserve its two-element support, forcing the permutation to fix every point. Since its Jordan–Hölder factors are $A_5$ and $C_2$, a normal subgroup of order two would equal that trivial group center, a contradiction.

Identify $C_2=\{1,-1\}$ and put $D=1\times A_5$ in $C_2\times S_5$. Its three maximal normal subgroups areThey are the three kernels of nonzero maps from the abelianization $C_2^2$ to $C_2$. There is no quotient $A_5$: a central $C_2$ must map trivially, while $S_5$ has no quotient $A_5$. The latter follows from its normal subgroups $1,A_5,S_5$, which can themselves be obtained by intersecting with the simple subgroup $A_5$ and using its trivial centralizer. The complete list of composition series isWithin $M_1$ the two direct factors are the only maximal normal subgroups; within each of $M_2,M_3\cong S_5$ the only such subgroup is its copy of $A_5$. Hence there are exactly four series.

For $S_5\times S_5$, put $D=A_5\times A_5$, $X=A_5\times 1$, $Y=1\times A_5$ andAgain these are exactly the maximal normal subgroups: they are the three cyclic quotient kernels, and there is no simple quotient $A_5$ of the whole product. All series aretogether withTo verify exhaustiveness, $M_L$ has maximal normal subgroups $D$ and $1\times S_5$, and $M_R$ has $D$ and $S_5\times 1$. A quotient $A_5$ of a direct product can receive a nontrivial image from only one simple factor, since the images commute and $A_5$ has trivial group center. The remaining maximal-normal possibility is $M_D$. Its derived subgroup is $D$, because both alternating factors are perfect. A hypothetical quotient $A_5$ would project one alternating factor isomorphically and kill the other, but conjugation by an odd diagonal element induces an outer automorphism on that surviving factor, impossible inside $A_5$. Odd conjugation is outer because otherwise an odd permutation times an even one would centralize $A_5$; a permutation commuting with every three-cycle fixes every three-element support and is the identity. Thus $D$ is the only maximal normal subgroup of $M_D$. Finally the only maximal normal subgroups of $D$ are $X,Y$: normal subgroups of a product of two centerless simple groups are products of the factors, as follows by commutating with each factor. This proves exactly eight series and the classification of composition chains in products with S5.

For $S{L}_2(5)$, commuting with both elementary upper and lower transvections forces a central matrix to be scalar. A scalar $\lambda I$ has determinant ${\lambda }^2$, soIf $g^2=I$, characteristic five makes $g$ diagonalizable with eigenvalues in $\{1,-1\}$. Determinant one rules out one of each, so the unique nonidentity involution is $-I$. An index-two subgroup would have order $60$ and, by the Cauchy theorem for groups, contain that involution and hence the group center. Its image in $PS{L}_2(5)$ would have index two. The simplicity and identification $PS{L}_2(5)\cong A_5$ are established by the independent matrix argument in Solution 4; a simple group has no proper index-two subgroup. Therefore $S{L}_2(5)$ has no subgroup of index two.

For a finitely generated associative algebra $A$, the representation variety of an associative algebra consists of generator matrices satisfying all defining polynomial relations. With fixed orthogonal idempotents $1={\sum }_{i=1}^m{e}_i$, require a representation on ${⨁}_i{k}^{n_i}$ to send $e_i$ to the standard vertex projector. This is the meaning of ${\mathrm{Rep}}_A(\mathbf{n})$; without specified idempotents, use the usual single dimension $r$ and ${\mathrm{Rep}}_A(r)={\mathrm{Hom}}_{k\text{-alg}}(A,M_r(k))$. Polynomial relations cut out a closed affine variety in the space of generator matrices.

The group $G={\prod }_i{\mathrm{GL}}_{n_i}(k)$ acts by conjugation, preserving the prescribed projectors. Its stabilizer is ${\mathrm{Aut}}_A(X)$, a nonempty open subset of ${\mathrm{End}}_A(X)$. The orbit dimension formula consequently givesA degeneration of a module $X$ to $Y$ means that ${\mathcal{O}}_Y\subseteq \overline{{\mathcal{O}}_X}$, equivalently that one representative of $Y$ lies in this closure.

For $0\to X^{\prime }\to X\to X^{\prime \prime }\to 0$, choose a vector-space splitting, so every generator has block matrix $x_g=\left(\begin{array}{cc}{x}_g^{\prime }& b_g\\ 0& x_g^{\prime \prime }\end{array}\right)$. Conjugation by $\mathrm{diag}(tI,I)$, $t\ne 0$, givesThis polynomial family extends to $t=0$, retains all algebra relations, and at zero represents $X^{\prime }\oplus X^{\prime \prime }$. Thus splitting an extension gives a module degeneration. Iterating along a composition series gives $X⇝\mathrm{gr}X={⨁}_j{X}_j/X_{j-1}$. Degenerations are transitive because an orbit closure is closed and invariant under base change.

For the one-arrow quiver with dimension vector $(n_1,n_2)$,The action is $A\mapsto g_{2}A{g}_1^{-1}$. Its rank orbits of a matrix under left-right multiplication are indexed by $r=0,\dots ,\min (n_1,n_2)$, with a representative containing an $r\times r$ identity block and zeros elsewhere. Their dimensions are $r(n_1+n_2-r)$; their closures contain exactly matrices of rank at most $r$.

Put $q=p^n$. A finitely generated module over $A=k[X]/(X^q)$ is finite-dimensional over $k$, and multiplication by $X$ is a nilpotent linear map $T$ with $T^q=0$. Its Jordan normal form exists over $k$ because its minimal polynomial is a power of $X$. Each Jordan block has size $r\le q$ and is the cyclic module $M_r=k[X]/(X^r)$. HenceA submodule of $M_r$ is an ideal of $k[X]/(X^r)$, and its inverse image is an ideal of the principal ideal domain $k[X]$ containing $(X^r)$. The only possibilities are $(X^j)$ with $0\le j\le r$. Thus all submodules form the chainEvery successive quotient is the one-dimensional simple module on which $X$ acts as zero. This is its unique composition series, so $M_r$ is a uniserial module and is an indecomposable representation: two nonzero direct summands would be incomparable submodules. Only $M_1$ is simple.

For $G=⟨g⟩$ of order $q$, the group algebra satisfiessince $(T-1{)}^q=T^q-1$ in characteristic $p$. Consequently, up to isomorphism, $\boxed{M_1,\dots ,M_{p^n}}$ are precisely the finite-dimensional indecomposable modules, and $\boxed{M_1\text{ is the unique simple module}}$. The finite-dimensional convention follows from the finite-generation hypothesis; “exactly” counts isomorphism classes.

Completeness permits idempotent lifting from $kG$ to $\mathcal{O}G$. In particular, each projective cover $P_j$ lifts to a finite projective $\mathcal{O}G$-lattice ${\tilde{P}}_j$; one can lift an idempotent presenting it as a summand of a finite free module. Set $Q_j=K{\otimes }_{\mathcal{O}}{\tilde{P}}_j$.

For a simple $S_{\ell }$, every map $P_j\to S_{\ell }$ factors through its simple head $S_j$. Splitting and Schur lemma give ${\dim }_k{\mathrm{Hom}}_{kG}(P_j,S_{\ell })={\delta }_{j\ell }$. Exactness of this Hom functor along a composition series therefore givesPart (iii) identifies this with ${\dim }_K{\mathrm{Hom}}_{KG}(Q_j,V_i)$. By Maschke's theorem and splitting, $KG$ is split semisimple, soThe reductions of any two integral forms of the same ordinary module have identical Brauer characters, hence identical composition multiplicities. We may thus reduce a direct-sum form for the displayed decomposition instead of ${\tilde{P}}_j$. In the modular representation ring this givesComparing the simple basis coefficients proves $c_{\ell j}={\sum }_i{d}_{i\ell }{d}_{ij}$, or $\boxed{C=D^{T}D}$.