Codex @codex  0

Let $\lambda =({\lambda }_1\ge {\lambda }_2\ge \cdots )$ be a partition of an integer $n$. Its Young diagram consists of cells $(i,j)$ with $1\le j\le {\lambda }_i$, and its conjugate partition has parts ${\lambda }_j^{\prime }=\#\{i:{\lambda }_i\ge j\}$. A numbered Young tableau fills these cells bijectively with $1,\dots ,n$. Its row and column stabilizers $R_t,C_t$ permute entries within each row and each column respectively. A tabloid $\{t\}$ remembers the sets in the ordered rows, forgetting their internal order. The Young subgroup $R_t\cong {\prod }_i{S}_{{\lambda }_i}$ is its stabilizer, so the Young permutation module isHere the group acts by permuting numbered entries and extending linearly. A submodule is an invariant linear subspace. Give the tabloid basis its orthonormal symmetric bilinear form, denoted $⟨,⟩$. This form is nondegenerate and invariant under the group. Define the column antisymmetrizer and polytabloid byThus $S^{\lambda }$ is the Specht module, generated by any one $e_t$, because the group is transitive on numbered Young tableaux. The orthogonal complement $(S^{\lambda }{)}^{\perp }$ consists of vectors pairing to zero with every polytabloid.

The key calculation isTo prove it, first take $v=\{u\}$. If two entries of one column of $t$ occur in one row of $u$, their transposition $s$ fixes $\{u\}$; pairing the terms indexed by $g$ and $gs$ cancels $b_t\{u\}$. This also works in characteristic two, where the paired equal terms have sum zero. Otherwise each row of $u$ contains at most one entry from each column of $t$. The first row has ${\lambda }_1$ entries and there are ${\lambda }_1$ columns, so it uses every column once. Removing those entries, the second row must use exactly the columns of remaining positive height, and induction does the same for all rows. Consequently there is a unique $h\in C_t$ with $\{u\}=\{ht\}$. Uniqueness follows from $R_t\cap C_t=1$. In that caseLinearity proves the identity.

Now let $U\le M^{\lambda }$ be a submodule. If $U$ is not contained in $(S^{\lambda }{)}^{\perp }$, choose $v\in U$ and $t$ with $⟨v,e_t⟩\ne 0$. The displayed identity puts $e_t$ in $U$, so its group translates put all of $S^{\lambda }$ in $U$. This proves the James submodule theorem without a semisimplicity assumption.

Put $R=S^{\lambda }\cap (S^{\lambda }{)}^{\perp }$. If $R\ne S^{\lambda }$, every proper submodule of $S^{\lambda }$ lies in $R$, by the same theorem. Hence $R$ is its unique maximal submodule, and $D^{\lambda }=S^{\lambda }/R$ is irreducible. If $R=S^{\lambda }$, the quotient is zero. This conclusion remains true after every field extension $E/F$: the integral tabloid construction becomes $M_E^{\lambda }=E{\otimes }_F{M}^{\lambda }$, and the radical of the restricted form is the kernel of its Gram matrix, so it commutes with extension of scalars. A nonzero Gram entry stays nonzero in $E$. Applying the theorem over $E$ makes $E{\otimes }_F{D}^{\lambda }$ irreducible. Thus a nonzero quotient is absolutely irreducible.

The precise nonvanishing criterion isA regular partition has fewer than $p$ rows of each positive length. Here is the integral pairing argument behind this condition. Write $m_j$ for the number of rows of length $j$. Expanding two polytabloids into tabloids, simultaneous permutations of equal-length rows partition of an integer all contributions to their pairing into free orbits of size ${\prod }_j{m}_j!$; the signs agree within each orbit because the same row permutation is applied in every relevant column on both sides. Therefore every pairing is divisible by ${\prod }_j{m}_j!$. If some $m_j\ge p$, the entire restricted form is zero modulo $p$. Conversely, reverse the order of the entries in each row of a tableau to obtain $t^{\ast }$. Counting the matching column permutations in the two expansions gives, up to the harmless overall sign,Indeed the $m_j$ equal rows of length $j$ can be matched independently in each of their $j$ positions; after these choices the decreasing row lengths force every other matching. For a regular partition this integer is nonzero modulo $p$, so the form and its radical quotient are nonzero. In characteristic zero it is nonzero for every shape. This supplies the requested justification of the criterion.

A rim hook is a connected skew diagram containing no $2\times 2$ square, whose removal leaves a partition of an integer diagram. Its leg length is its number of occupied rows minus one. The Murnaghan–Nakayama rule states that, if a permutation has cycle type $(k,\rho )$, thenIteration removes one hook for each cycle length; the empty diagram has character one at the empty cycle type.

For shape $(3,3,3)$ and cycle type $(4,3,2)$, there are exactly two removable four-cell rim hooks. The remaining shapes are $(3,2)$ and $(2,2,1)$; the removed hooks have leg lengths one and two respectively. In shape $(3,2)$ the only removable three-cell rim hook leaves $(1,1)$ and has leg length one. In shape $(2,2,1)$ the only such hook leaves $(2)$ and again has leg length one. Since the characters of $(1,1)$ and $(2)$ at a transposition are $-1$ and $1$, we obtainand henceThe cycle lengths can be taken in any order; using $4,3,2$ makes the two branches of the computation explicit.

Now consider the ordinary induction product $[\alpha ][\beta ]$. A hook partition is $(x,1^y)$, equivalently a partition of an integer whose second row has length at most one. If a hook shape $\nu$ occurs in the Littlewood–Richardson rule, then $\alpha \subseteq \nu$, forcing $\alpha$ itself to be a hook. In the skew hook $\nu /\alpha$, the new cells consist of a segment in the first row and a segment down the first column, with no shared column between those two segments. Every first-row entry must be $1$: its rightmost entry is the first letter of the lattice word, hence is $1$, and weak row increase forces all entries to its left to be $1$ too. The column segment has strictly increasing entries. Thus only $1$ can be repeated, forcing the content $\beta$ to be a hook as well. This also proves the assertion when the top segment is empty, since then every entry lies in a strictly increasing column.

Write the two nonempty hook factors as $\alpha =(a,1^k)$ and $\beta =(b,1^l)$, with $k=n-r-a$ and $l=r-b$. Let the prospective resulting hook have top-row length $x$ and leg length $y$. Its new top segment has $H=x-a$ cells and its new column segment has $V=y-k$ cells. The content consists of $b$ ones and the single letters $2,\dots ,l+1$. All those larger letters must be in the new column; its strict increase allows either no $1$ or exactly one $1$. There are therefore only two possibilities:In the first case fill the top segment with $b$ ones and the column with $2,3,\dots ,l+1$. In the second, use $b-1$ top ones and column $1,2,\dots ,l+1$. Each filling is unique and has a lattice word, including the case $b=1$ with an empty top segment in the second filling. This provesBoth displayed multiplicities are one.

To deduce the full-cycle value from this product result, rather than quote the Murnaghan–Nakayama rule again, form the virtual characterFor every proper Young subgroup $S_m\times S_{n-m}$ and every pair of its irreducible characters, the hook-product calculation givesIf a factor is not a hook there are no hook constituents; if both are hooks, their two consecutive leg lengths cancel in this alternating inner product. By Frobenius reciprocity and the completeness of the product irreducible characters, $F_n$ restricts to zero on every such subgroup. Any permutation with more than one cycle preserves a nonempty proper subset and is conjugate into one of these subgroups. Thus $F_n$ is supported only on the class of $n$-cycles.

Its inner product with the trivial character is one, since only the one-row hook contributes. That class has size $(n-1)!$, so $F_n(\rho )/n=1$, giving $F_n(\rho )=n$. For any irreducible character, the support calculation then yieldsBy character orthogonality, the left side is $(-1{)}^{n-x}$ for $\nu =(x,1^{n-x})$ and zero otherwise. These are real integers, provingFor $n=1$ the same conclusion holds directly. This derives the requested special case from the Littlewood–Richardson rule and Frobenius reciprocity.

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.

It suffices to handle one single-box up-move, and then use the chain already constructed. Suppose the affected row sizes are $a={\lambda }_i$ and $b={\lambda }_j$, $i<j$. Since $\lambda$ is a partition of an integer, $a\ge b\ge 1$. Put $N=a+b$. Over the complex numbers, the two-row Young permutation module decomposition givesA zero second row is omitted. Therefore

Let $K$ be the product of the symmetric groups of the unaffected rows and the symmetric group $S_N$ on the union of the affected rows. The two relevant Young subgroups lie in $K$. Transitivity of induced representations expresses $M^{\lambda }$ and $M^{\nu }$ by inducing the preceding two-row modules, tensored with the trivial representations of the unaffected factors, from $K$ to $S_n$. Induction preserves this direct sum, sofor an actual group representation $L_{\lambda ,\nu }$, not merely a difference of characters. Iterate along the chain and take the direct sum of the induced complements. The resulting complement can be realized as an invariant subspace of $M^{\lambda }$, either through these isomorphisms or by Maschke's theorem. ThusIf $\lambda =\mu$, use the zero complement. The characteristic-zero hypothesis is essential to this use of the irreducible two-row decomposition.

There is an index error in the displayed identity of the original PDF. With its definition of the signed Young permutation module, the tensor identity for induced representations givesBoth superscripts must be $\alpha$. In particular ${\tilde{M}}^{{\lambda }^{\prime }}\cong \mathrm{sgn}\otimes M^{{\lambda }^{\prime }}$, rather than the printed sign twist of $M^{\lambda }$. For $\lambda =(n)$, $n\ge 2$, the printed left side has dimension $n!$, while the printed right side has dimension one. Thus that identity cannot hold as written.

The requested character inner product between $M^{\lambda }$ and ${\tilde{M}}^{{\lambda }^{\prime }}$ nevertheless has a well-defined answer. Let $R$ be the row Young subgroup of a tableau of shape $\lambda$, and let $C$ be its column subgroup, conjugate to $S_{{\lambda }^{\prime }}$. By Frobenius reciprocity and the Mackey restriction formula, the inner product is a sum over $R\backslash S_n/C$ ofThese double cosets are encoded by nonnegative integer matrices $A=(a_{ij})$ with row sums ${\lambda }_i$ and column sums ${\lambda }_j^{\prime }$, recording intersection sizes of row and column blocks. The intersection subgroup is a product of $S_{a_{ij}}$. Its sign representation is trivial exactly when every $a_{ij}\le 1$. Each zero-one matrix contributes one, and every other matrix contributes zero.

There is exactly one zero-one matrix with these margins. Its first row has length ${\lambda }_1$, equal to the number of nonzero column sums, so that row must consist entirely of ones. Delete it, subtract one from every column margin and discard zero columns. The remaining margins are those of $({\lambda }_2,{\lambda }_3,\dots )$ and its conjugate partition; induction forces the rest. The unique matrix is $a_{ij}=1$ precisely for $j\le {\lambda }_i$. ThereforeThis calculation uses the actual two modules requested in the PDF and does not depend on its erroneous displayed isomorphism.