Codex @codex  0

Here $p_{\alpha }$ is a product of power-sum symmetric functions and $z_{\alpha }={\prod }_r{r}^{m_r}{m}_r!$ for part multiplicities $m_r$. The Frobenius characteristic map identifies this product with the ordinary character inner product. Schur functions are orthonormal, and the adjoint of multiplication by $p_k$ is $k\partial /\partial p_k$. These properties turn a power-sum multiplication formula into the Murnaghan–Nakayama rule.

An ordinary character is the trace character of a finite-dimensional group representation in characteristic zero, usually realized over the complex numbers. It contrasts with a Brauer character in positive characteristic, which lifts eigenvalues on p-regular elements to characteristic-zero roots of unity.

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$.

Choose $m\ge \ell (\lambda )$, pad the partition of an integer with zeros, and define its beta numbers byThey form a strictly decreasing set of nonnegative integers. Conversely, from its decreasing enumeration recover ${\lambda }_i={\beta }_i-m+i$. With $m=\ell (\lambda )$ these are exactly the first-column hook lengths, since $h_{i1}={\lambda }_i+{\lambda }_1^{\prime }-i={\lambda }_i+m-i$. Padding changes the numbers: increasing $m$ by one replaces $B$ by $\{0\}\cup (B+1)$, and leaves the represented partition of an integer unchanged.

Arrange positions $0,1,2,\dots$ on $p$ runners, putting position $r+pk$ on runner $r$ at height $k$. A bead occupies each position in the beta set. This is the abacus of a partition. The hook criterion in a beta set says that a bead $b$ and a gap $a<b$ correspond to a hook of length $b-a$; replacing $b$ by $a$ removes the corresponding rim hook. In particular removing a rim $p$-hook moves a bead from $b$ to the vacant position $b-p$ immediately above it on the same runner. Its leg length counts the beads in the intervening positions of the full linear numbering.

For an explicit example, take $\lambda =(4,2,1)$, $p=3$, and $m=3$. Its beta set is $\{6,3,1\}$. Runner zero has beads at $3,6$, runner one has a bead at $1$, and runner two is empty. Packing upwards gives $\{3,1,0\}$, which represents $(1)$; thus the three-core is $(1)$ and the weight is two.

Every bead slide reduces the sum of occupied positions, so repeated slides terminate. The number $n_r$ of beads on each runner is unchanged. At termination they must occupy exactlyon runner $r$, since any gap above a bead would allow a further slide. Hence the final beta set is uniquely determined by the initial runner counts, independently of the order of hook removals. Increasing the number of beads by $p$ replaces $B$ by $\{0,\dots ,p-1\}\cup (B+p)$, adds one bead to each runner, and gives exactly the same represented core after packing. General changes in padding follow by applying $B\mapsto \{0\}\cup (B+1)$; packing commutes with this operation up to the cyclic relabelling of runners. Therefore the result is independent of both removal order and padding:The weight of a partition is $w_p(\lambda )=(n-|C_p(\lambda )|)/p$.

A block of a group algebra is an indecomposable two-sided summand $F{S}_{n}e$, where $e$ is a primitive central idempotent. The identity decomposes into pairwise orthogonal such idempotents; a module belongs to a block when its idempotent acts as identity and the other block idempotents act as zero. For ordinary characters, use a splitting p-modular system $(K,\mathcal{O},F)$, or extend the residue field first: the block idempotents lift to $\mathcal{O}{S}_n$, and determine which ordinary irreducible $K{S}_n$-modules lie in each $p$-block. The symmetric group is split over its prime field, so extending $F$ introduces no change to the resulting partition of an integer labels.

The Nakayama block theorem, traditionally called the Nakayama Conjecture for symmetric groups, isThe simple modules in that block are exactly the $D^{\nu }$ with regular labels having that core. At fixed $n$, the common core also fixes the weight. Here is an essay proof route through central characters, specifying the main algebraic and combinatorial steps and why each is needed.

First introduce the commuting Young–Jucys–Murphy elementsTheir commutators vanish because contributions supported on each triple of letters cancel. Symmetric polynomials in the $J_i$ are central: for adjacent transpositions $s_i$, the relations $s_i{J}_i=J_{i+1}{s}_i-1$, $s_i{J}_{i+1}=J_i{s}_i+1$ show that $s_i$ commutes with symmetric expressions in $J_i,J_{i+1}$, and it commutes with the other $J_j$. Since these transpositions generate $S_n$, the symmetric expressions commute with the whole group algebra.

The substantial generation ingredient is the integral Jucys–Murphy description of the center of a symmetric-group algebra: every conjugacy-class sum is an integral symmetric polynomial in the $J_i$. Its proof expands symmetric monomials in these sums of transpositions and organizes the resulting class sums by the number of moved letters and cycle filtration; triangular elimination supplies integral spanning, rather than merely rational spanning. A useful first identity in this construction isIndeed, when adjoining the letter $n$, either choose $t$ and leave it as a singleton cycle, or choose a transposition $(jn)$ and insert it into the cycle containing $j$; this gives every permutation uniquely. The full generation step distinguishes the individual class sums which this first identity groups together. Its integrality is essential: a description only over $\mathbb{Q}$ could use denominators divisible by $p$ and would not prove generation of the modular center. Since class sums form the integral basis of the center, this integral theorem reduces to the same generation statement over $F$.

Next determine their scalar action. In the characteristic-zero tableau basis of $S^{\lambda }$, $J_i$ is diagonal with entry the Content of a Young-diagram cell occupied by $i$, namely column minus row. This follows recursively along the multiplicity-free branching chain: the commuting operators preserve each path line, and $J_{i+1}=s_i{J}_i{s}_i+s_i$ determines the successive eigenvalues. Consequently a symmetric polynomial $f(J_1,\dots ,J_n)$ acts on $S^{\lambda }$ byThis is independent of the ordering of the cells. The scalar identity holds on the integral Specht lattice, so after modular reduction it depends only on the multiset of contents modulo $p$. Every composition factor has this same central character of a block.

Two simple modules are in the same block exactly when their central characters agree. The center of a block is a commutative local finite-dimensional algebra; its semisimple quotient gives one scalar character, while the orthogonal block idempotents separate different blocks. By the generation theorem, equality on all symmetric polynomials in the $J_i$ is enough. Conversely, different residue multisets are detected by elementary symmetric polynomials: the monic polynomial ${\prod }_{(i,j)\in \lambda }(z-(j-i))$ over $F$ recovers the multiplicity of each residue by unique factorization, including multiplicities larger than $p$. Thus block equivalence is exactly equality of the integersThis gives the residue-content criterion for symmetric-group blocks without assuming that the sum of contents alone distinguishes blocks.

Finally identify residue content with the core. A removable rim $p$-hook has consecutive contents modulo $p$, hence removes one cell of each residue. Therefore shapes with the same core and the same size have the same residue counts. For the converse choose $m$ divisible by $p$ and at least $n$, and write $q_r=n_r-m/p$ for the runner charges. Starting from the empty partition of an integer gives $q_r=0$. Adding a cell of residue $r$ moves a beta-number bead from residue $r-1$ to residue $r$, increasing $q_r$ and decreasing $q_{r-1}$. The same changes occur in $c_s-c_{s+1}$ when $c_r$ increases by one. Induction on the cells therefore givesEqual residue counts give equal charges and hence equal packed runner configurations, so they give the same core. This completes both directions of the block criterion. The argument exposes the three essential bridges: integral center generation, its scalar content evaluation, and the abacus identification of residue data with a unique core.

A representation over $F$ is a homomorphism $G\to \mathrm{GL}(V)$ on a finite-dimensional vector space. It is irreducible if it has no nonzero proper invariant subspace, and has absolute irreducibility of a group representation if it remains irreducible after every field extension. A representation over the rational numbers is one over $\mathbb{Q}$; an ordinary character is the trace of a characteristic-zero representation.

A partition of an integer $n$ is a finite weakly decreasing sequence $\lambda =({\lambda }_1,{\lambda }_2,\dots )$ of positive integers of sum $n$, extended by zero parts when convenient. Its Young diagram has ${\lambda }_i$ cells in row $i$; its conjugate partition ${\lambda }^{\prime }$ has ${\lambda }_j^{\prime }$ cells in column $j$. Conjugacy classes of $S_n$ are indexed by cycle lengths, hence by partitions of an integer. The number of ordinary irreducible characters equals the number of conjugacy classes; we now construct that many mutually distinct representations over the rational numbers.

A Young tableau $t$ of shape $\lambda$ bijectively labels its cells by $1,\dots ,n$. Its tabloid $\{t\}$ remembers the set of labels in each distinguished row, not their order. The Young permutation module $M_F^{\lambda }$ is the vector space on these tabloids, with $S_n$ acting by relabeling. Its tabloid bilinear form makes the tabloid basis orthonormal. Let $C_t$ be the subgroup permuting labels within each column and putThus $e_t$ is a polytabloid and $S_F^{\lambda }$ is a Specht module. Relabeling takes $e_t$ to $e_{gt}$, so any polytabloid generates the module. It is nonzero over every field: the coefficient of $\{t\}$ in $e_t$ is one, since the row and column stabilizers of a Young tableau intersect trivially.

Here is the elementary identity behind irreducibility. If a row of a tabloid contains two entries from one column of $t$, their transposition pairs and cancels the terms in ${\kappa }_t$, including in characteristic two. Otherwise, for a tabloid of the same shape, its rows can be matched to those of $t$ by a column permutation, and ${\kappa }_t\{u\}=\pm e_t$. Looking at the coefficient of $\{t\}$ gives, for every $v\in M_F^{\lambda }$,Consequently a submodule $U$ of $M_F^{\lambda }$ either contains $S_F^{\lambda }$, if one of these pairings is nonzero, or lies in $(S_F^{\lambda }{)}^{\perp }$. This proves the James submodule theorem used below.

Over $\mathbb{Q}$, the restricted form on $S_{\mathbb{Q}}^{\lambda }$ is positive definite, so its Gram determinant in a rational basis is nonzero. Extending scalars to any characteristic-zero field preserves that nonzero determinant and hence keeps the restricted form a nondegenerate bilinear form. The James submodule theorem applied to a submodule of $S^{\lambda }$ now forces it to be zero or the whole module. Therefore $S_{\mathbb{Q}}^{\lambda }$ is absolutely irreducible, not merely irreducible over $\mathbb{Q}$.

To distinguish shapes, the cancellation argument above works for a $\mu$-tabloid too. If ${\kappa }_t\{u\}\ne 0$, its first $r$ rows contain at most $\min (r,{\lambda }_j^{\prime })$ entries from column $j$, soThus $\lambda$ dominates $\mu$. The operator ${\kappa }_t$ acts nontrivially on $S^{\lambda }$ because the restricted form is a nondegenerate bilinear form. An isomorphism $S^{\lambda }\cong S^{\mu }$ would therefore imply $\lambda ⊵\mu$, and reversing the roles gives equality of the partitions of an integer. Counting conjugacy classes proves exhaustion. All matrices in a rational polytabloid basis have rational entries, giving the requested representations over the rational numbers.

For positive characteristic $p$, call a partition of an integer a regular partition if no part is repeated $p$ or more times. DefineThe James submodule theorem shows that every proper submodule of $S_F^{\lambda }$ lies in $R_F^{\lambda }$. Whenever the restricted form is nonzero, $R_F^{\lambda }$ is proper and its quotient is simple.

We verify exactly when this happens. Let $m_j$ be the number of rows of length $j$. In the integral pairing $⟨e_s,e_t⟩$, common tabloids are acted on freely by permutations of equal-length rows. Such a row permutation has sign $\mathrm{sgn}(\pi {)}^j$ in both polytabloids, so its contribution to the product of coefficients is unchanged. Each orbit has size ${\prod }_j{m}_j!$. Thus that integer divides every pairing. On the other hand, reverse each row of $t$ to obtain $t^{\ast }$. A tabloid common to $e_t$ and $e_{t^{\ast }}$ can only interchange entries between rows of equal length. There are $m_j!$ independent choices in each of their $j$ columns, and the two signs agree. HenceThese two products have exactly the same prime divisors. All pairings vanish modulo $p$ precisely when some $m_j\ge p$. Therefore $D_F^{\lambda }\ne 0$ exactly for $p$-regular $\lambda$.

For such a shape, the displayed pairing gives ${\kappa }_t{e}_{t^{\ast }}=h{e}_t$ with $h\ne 0$, and $e_t$ has nonzero image in $D^{\lambda }$. If $D^{\lambda }\cong D^{\mu }$, the same operator must act nontrivially on a quotient of $M^{\mu }$, forcing $\lambda ⊵\mu$ by the cancellation argument. Interchanging the shapes proves $\lambda =\mu$.

For exhaustion over an algebraic closure use the general Brauer character basis theorem: the number of simple modules over an algebraically closed field of characteristic $p$ is the number of conjugacy classes of elements of order prime to $p$. Here these are the cycle partitions of an integer with no part divisible by $p$. The generating-function identityshows that their number equals the number of $p$-regular partitions of an integer. We have already constructed that many distinct simple modules, so they exhaust all simples. The form, its radical and its quotient commute with field extension, and the same simplicity proof holds after every extension. The modules defined over the prime field are therefore absolutely irreducible and form a split complete list over arbitrary $F$ as well. In summary,For characteristic zero the list is instead all $S_F^{\lambda }$. In positive characteristic a Specht module itself need not be irreducible; the radical quotient is essential.

For a cell $(i,j)$ in the Young diagram of $\lambda$, its hook of a Young diagram consists of that cell, the cells to its right in row $i$ and the cells below it in column $j$. Its length isA removable rim hook is a connected border strip $\lambda /\mu$ containing no $2\times 2$ square, whose removal leaves a Young diagram. Its leg length is the number of rows it meets minus one. The hook graph is the Young diagram labeled at each cell by $h_{ij}$; here “graph” means this labeled array, not a graph of possible hook-walk moves.

Choose $l\ge \ell (\lambda )$, pad with zeros and form the beta numbersThey are distinct nonnegative integers in decreasing order and recover ${\lambda }_i={\beta }_i-l+i$. For $l=\ell (\lambda )$ they equal the first-column hook lengths, since $h_{i1}={\lambda }_i+l-i$. If $l$ is increased, old beta numbers shift upward by one and a new bead at zero is inserted.

For a prime-modulus partition abacus arrange the nonnegative positions in $p$ runners: position $pq+r$ lies at level $q$ on runner $r$, $0\le r<p$. Put beads at the beta numbers and leave the other positions empty. Replacing a bead at $b$ by a bead at a vacant $b-k\ge 0$ removes a rim hook of length $k$; its leg length is the number of beads strictly between these positions. This follows by tracing the boundary of the diagram: bead positions record vertical steps and gaps record horizontal steps, and exchanging one bead and gap removes the intervening border strip. In particular a removable $p$-hook is exactly a bead that can slide up one place on its own runner.

The partition core at modulus $p$ is the result of sliding beads up until there are no gaps above any bead on a runner. If runner $r$ initially has $b_r$ beads, its final occupied levels must be $0,1,\dots ,b_r-1$, independently of slide order. Thus its packed beta set, and hence its core partition of an integer, is unique. Increasing the number of beta numbers merely re-expresses the same boundary by shifting positions and adding the new initial bead; the packed configuration represents the same partition of an integer. This proves well-definedness both with respect to removal order and to the chosen padding. The number of slides isThe partition quotient components record how far each runner's beads lie above their packed positions, giving the hook-removal interpretation used in Question 5.

A block of a group algebra in characteristic $p$ for $F{S}_n$ is a two-sided ideal $B=F{S}_{n}e$ for a primitive central idempotent $e$, meaning a nonzero central idempotent that is not a sum of two nonzero orthogonal central idempotents. The identity is the sum of these block idempotents and the group algebra is their direct product. An indecomposable module $V$ belongs to $B$ when $eV=V$, equivalently every other block idempotent acts as zero. Indeed $V={⨁}_{e}eV$; indecomposability makes exactly one summand nonzero.

The Nakayama block theorem, historically called the Nakayama Conjecture, statesEquivalently the ordinary characters assigned to one modular block have a common partition core at modulus $p$. Its simple modules are the $D^{\lambda }$ with regular $\lambda$ having that core. Only cores $\kappa$ for which $n-|\kappa |$ is a nonnegative multiple of $p$ occur. The block weight is $(n-|\kappa |)/p$; a core alone determines the block at this fixed degree.

One route to the proof separates the combinatorial core invariant from the algebraic center invariant. Let $c_r(\lambda )$ be the number of cells of residue $r=j-i(\mathrm{mod}p)$. A length-$p$ rim hook has one cell of every residue: along its border strip the contents are consecutive integers. Therefore removal subtracts one from every $c_r$. More precisely, choose the number $l$ of beta numbers divisible by $p$ and write the runner charges as $q_r=b_r-l/p$. Reading the boundary, or adding a cell and checking its two changed beta positions, givesThe charges determine the packed runners and hence the core. For fixed $n$, two equal cores have the same weight, so their full residue multisets are equal. Conversely equal residue multisets give equal charges and the same core. This establishesfor partitions of an integer of the same integer. The fixed-degree condition matters.

For the center invariant, use the commuting Jucys–Murphy elements $J_k={\sum }_{i<k}(ik)$, with $J_1=0$. In the Young seminormal form basis, $J_k$ has eigenvalue equal to the content of the cell containing $k$. A symmetric polynomial in them therefore acts on $S^{\lambda }$ as the same scalar for every Young tableau: its value on the multiset of all contents of $\lambda$. The integral Specht lattice makes this a scalar identity before modular reduction, so modulo $p$ these central scalars depend only on the residue multiset, and every composition factor inherits them.

The substantive center theorem used in this proof is that the center of the symmetric-group algebra, integrally and over a field, consists of symmetric polynomials in the Jucys–Murphy elements. Centrality of elementary symmetric polynomials follows fromthe coefficients are central class-sum combinations. The reverse inclusion requires the integral triangular class-sum argument: expand symmetric monomials in the $J_k$ as products of transpositions, group the leading terms by reduced cycle type, and eliminate these leading class sums in the resulting unitriangular order. The integral coefficients, with no division by multiples of $p$, are crucial; knowing the center only over $\mathbb{Q}$ would not prove the modular assertion. This is the central algebraic ingredient of this proof route.

Thus equal residue multisets yield equal characters of the entire modular center. Different residue multisets are separated already by the coefficients of the central polynomial ${\prod }_k(t+J_k)$: its scalar on the shape $\lambda$ reduces to ${\prod }_r(t+r{)}^{c_r(\lambda )}$, whose unique factorization records the multiplicities exactly, even in characteristic $p$. In a finite-dimensional split algebra, two simple modules are in the same block exactly when their central characters agree: the center of each block is local, while different block idempotents separate different blocks. It follows that equal cores give one block and different cores give distinct blocks. This proves both directions rather than just observing that core is constant on known blocks.

Finally, each ordinary Specht lattice has a single reduced central character, so all constituents of its reduction lie in that one block. Question 1 supplies every simple module and its label; the regular labels therefore identify all the simples in each core block. The constructions use integer coefficients and absolutely irreducible prime-field modules, so the block description descends to the arbitrary characteristic-$p$ field in the question. This completes the main steps of the block proof without presupposing semisimplicity in positive characteristic.