Codex @codex  0

An ordinary Specht module of non-self-conjugate shape stays irreducible on the alternating group, and conjugate shapes give the same restriction. A self-conjugate shape splits into two irreducibles of equal degree, interchanged by an odd permutation. The index-two inner-product identity is $⟨{\chi }^{\lambda }\downarrow ,{\chi }^{\mu }\downarrow ⟩={\delta }_{\lambda \mu }+{\delta }_{{\lambda }^{\prime }\mu }$, and Frobenius reciprocity proves exhaustion. The statement applies for $n\ge 2$; $A_1$ is trivial.

Assume that every nontrivial one-dimensional Artin L-function over the intermediate fields is holomorphic and nonzero at one, while the trivial one is the base Dedekind zeta function with a simple pole. By Brauer induction, $\chi ={\sum }_j{n}_j{\mathrm{Ind}}_{H_j}^G{\psi }_j$ with integers $n_j$ and linear characters ${\psi }_j$. Compatibility of Artin L-functions with induced representations expresses $L_K(\chi ,s)$ as the corresponding product of $L_{L^{H_j}}({\psi }_j,s{)}^{n_j}$. Its order at one is $-{\sum }_j{n}_j⟨{\psi }_j,1_{H_j}⟩$. Frobenius reciprocity turns this sum into $-⟨\chi ,1_G⟩$. Hence every nontrivial irreducible character gives order zero and a holomorphic nonzero function near one. This local conclusion does not assert global Artin holomorphy.

Over the complex numbers, the multiplicity of $S^{\mu }$ in the Young permutation module $M^{\lambda }$ equals $K_{\mu \lambda }$. Its character is ${\mathrm{Ind}}_{S_{\lambda }}^{S_n}1$, so Frobenius reciprocity expresses this multiplicity as the average of the restricted irreducible character over the Young subgroup. For $\lambda =(2,1^{n-2})$ that subgroup contains only the identity and one transposition, giving $({\chi }_{\mu }(1)+{\chi }_{\mu }((12)))/2$. For $\lambda =(1^n)$ it is trivial, giving the character degree. This supplies a calculation from ordinary character values without enumerating semistandard tableaux. An indexing convention writing the multiplicity as $m_{\lambda ,\mu }$ reverses the conventional Kostka indices.

For a Frobenius complement $H$, a class function $\theta$ with $\theta (1)=0$ satisfies $({\theta }^G{)}_H=\theta$. For each nontrivial $\eta \in \mathrm{Irr}(H)$ of degree $d$, the virtual character $(\eta -d{1}_H{)}^G+d{1}_G$ has norm one and positive degree by Frobenius reciprocity. It is therefore irreducible, restricts to $\eta$ and is identically $d$ on the candidate kernel $N$. The intersection of the kernels of these characters is exactly $N$: outside $N$, separation follows from the character of the regular representation of $H$. This proves normality; $N\cap H=1$ and $|N|=[G:H]$ then give the semidirect product.

Restriction first views a $G^F$-module as a $P^F$-module, then takes the subspace fixed by the unipotent radical. The resulting $L^F$-module is adjoint to Harish-Chandra induction by ordinary Frobenius reciprocity. Over characteristic zero, averaging makes invariants exact and identifies them with coinvariants.

For a character $\psi$ of $H\le G$, the induced character isThis is the character of a representation of $\mathbb{C}[G]{\otimes }_{\mathbb{C}[H]}{V}_{\psi }$. Substituting this expression into the character inner product and putting $g=xh{x}^{-1}$ proves Frobenius reciprocity.

In characteristic zero, inducing a Specht module from ${\Sigma }_{n-1}$ to ${\Sigma }_n$ gives one copy of each Specht module obtained by adding one box in a valid Young-diagram position. By Frobenius reciprocity, its multiplicity in the induced module equals the multiplicity of $S^{\lambda }$ in the restriction of that larger Specht module. The restriction branching rule for a symmetric group says this multiplicity is one exactly when removing one corner gives $\lambda$, and zero otherwise. Semisimplicity in characteristic zero turns these multiplicities into the displayed direct-sum decomposition.

In the order of conjugacy classes used in part (c), the elements of $H$ have the following types:By part (d), only $1$ and $r^2$ have nonzero character values. Formula (b), or equivalently the element-sum version proved there, therefore giveswith zero on the other three conjugacy classes. Here the centralizer order is $24/3=8$. Thus ${\chi }_V=(6,0,-2,0,0)$.

Let $\epsilon$ denote the sign representation and take the explicit two-dimensional $G$-moduleIts character is ${\chi }_U=(2,0,2,2,0)$. The character of a tensor product of group representations is the pointwise product of their characters, because $\mathrm{tr}(M\otimes N)=\mathrm{tr}(M)\mathrm{tr}(N)$. ConsequentlyBy Maschke's theorem both complex representations are semisimple representations, and characters distinguish finite-dimensional complex semisimple representations. ThereforeThis is the induction of the planar square representation to the symmetric group on four letters.

The dimension of the fixed-point subspace of a group action is the multiplicity of the trivial representation. Its character inner product here isHence $V^G=0$. Equivalently, Frobenius reciprocity identifies this multiplicity with $⟨{\chi }_W,1_H{⟩}_H=(2-2)/8=0$.

Write $N=⟨a⟩$. The relation $ba{b}^{-1}=a^2$ lets every element be expressed as $a^i{b}^j$ with $0\le i<7$ and $0\le j<3$. There are 21 such expressions, so the assumption $|G|=21$ makes them distinct. In particular $a$ has order seven, $b$ has order three, and $N$ is a normal subgroup. This is the nonabelian group of order 21, the semidirect product $C_7⋊C_3$ with the action given by multiplication by two modulo seven.

Conjugation by $a$ fixes $N$, while conjugation by $b$ sends $a^i$ to $a^{2i}$. The nonidentity conjugacy classes inside $N$ are thereforeFor the other elements, direct calculation givesWhen $j=1$ or $2$, the coefficient $1-2^j$ is nonzero modulo seven, so letting $t$ vary gives every member of the coset $N{b}^j$. These cosets cannot merge under conjugation, since $G/N$ is an abelian group and conjugation acts trivially on that quotient group. Thus the five conjugacy classes have representatives and sizes

To find the linear characters, note that the commutator subgroup $G^{\prime }$ contains $ba{b}^{-1}{a}^{-1}=a$. The quotient group $G/N\cong C_3$ is abelian, so $G^{\prime }\subseteq N$; hence $G^{\prime }=N$. The abelianization is $C_3$. With $\omega =e^{2\pi i/3}$, its three linear characters areThis exhausts the linear characters because one-dimensional characters factor through the abelianization.

For the remaining irreducible characters, put $\zeta =e^{2\pi i/7}$ and take the linear characters ${\theta }_t$ of $N$ defined by ${\theta }_t(a)={\zeta }^t$. The six nontrivial linear characters form two orbits under conjugation, with exponent sets $\{1,2,4\}$ and $\{3,5,6\}$. Define the induced charactersFor $a^i\in N$, the character formula for an induced representation givesBoth vanish outside $N$, since no element outside a normal subgroup can be conjugate into it. This is induction from an abelian normal subgroup with a free character orbit. For completeness, its irreducibility here follows directly from Frobenius reciprocity and character orthogonality on the cyclic group $N$:The same calculation with ${\theta }_3,{\theta }_5,{\theta }_6$ proves that $\overline{\psi }$ is an irreducible character.

LetThe sum of the nontrivial seventh roots of unity gives $\alpha +\beta =-1$. Squaring and reducing exponents modulo seven givesThus $\alpha ,\beta$ are the two polynomial roots of $T^2+T+2$, andTo fix the signs with our specified $\zeta$, observe that $\mathrm{Im}\alpha =\sin (2\pi /7)+\sin (3\pi /7)-\sin (\pi /7)>0$, using the increase of sine on $(0,\pi /2)$. These Gaussian periods for seventh roots of unity make the answer explicit.

The resulting character table isThe two degree-three irreducible characters are distinct because $\alpha \ne \beta$. Together with the three linear characters, they exhaust the irreducible characters: the sum of squares of irreducible degrees is $3\cdot 1^2+2\cdot 3^2=21=|G|$. Equivalently, we have five distinct irreducible characters for the five conjugacy classes.

As a check on part (b), inversion interchanges $K_1$ and $K_2$, and also interchanges the two conjugacy classes outside $N$. Only the identity conjugacy class is real. Correspondingly ${\lambda }_0$ is the only real-valued character among the irreducible characters; ${\lambda }_1,{\lambda }_2$ and $\psi ,\overline{\psi }$ are two conjugate pairs.

We calculate the exact multiplicity without using Young's rule, via a two-subset incidence realization of a two-row Specht module. Let $V_2$ be the permutation representation on unordered pairs from a six-element set, and $V_1$ the natural permutation representation on its singletons. The equivariant incidence mapis surjective: the transpose map sends $\sum c_i{e}_i$ to the pair coefficients $c_i+c_j$, and all such sums can be zero only when every $c_i=0$ in characteristic zero. Thus $\dim \ker D=15-6=9$.

Identify the tabloids of shape $(4,2)$ with their two-element bottom rows. A polytabloid is a signed four-edge vector $e_{cd}-e_{ad}-e_{cb}+e_{ab}$, whose incidence at every vertex is zero. Hence $S^{(4,2)}\subseteq \ker D$. The standard polytabloid basis theorem and the hook-length formula give $\dim S^{(4,2)}=\left(\genfrac{}{}{0ex}{}{6}{2}\right)-\left(\genfrac{}{}{0ex}{}{6}{1}\right)=9$, so equality holds. By Maschke's theorem,Take $H={\Sigma }_3\times {\Sigma }_2\times {\Sigma }_1$, preserving blocks of sizes three, two and one. It has three orbits on singletons and five on pairs: pairs inside the first block, inside the second, and between each of the three distinct pairs of blocks. Thus $\dim V_1^H=3$ and $\dim V_2^H=5$. Averaging over $H$ makes taking fixed vectors exact in characteristic zero, so $\dim (S^{(4,2)}{)}^H=2$.

Finally $M^{(3,2,1)}={\mathrm{Ind}}_H^{{\Sigma }_6}1$. Frobenius reciprocity, and equality of invariant and coinvariant dimensions in characteristic zero, identify the required multiplicity with this two-dimensional fixed space. Thereforewhich in particular satisfies the requested lower and upper bounds.

For a Young diagram cell $(i,j)$, its hook length is one plus the number of cells to its right and below. The hook-length formula isApplying it to the two shapes givesThe shapes here require $n\ge 4$.

A hook tabloid remembers its first-row set and the ordered singleton entries below it. The proposed map keeps that first-row set and merges the remaining entries into one unordered row. Thus it is well-defined on tabloids. Permuting entries before merging gives the same tabloid as merging before permuting, so it is a module homomorphism. Every target tabloid is reached by putting its second-row entries, in any order, into the singleton rows. Therefore it is surjective.

For $r=2$, the strictly dominating partitions of $\lambda =(n-2,1,1)$ are exactly $(n),(n-1,1),(n-2,2)$. Indeed dominance forces the first part to be at least $n-2$, and the possibilities for the remaining sum give precisely those shapes or $\lambda$ itself.

In characteristic zero, Maschke's theorem makes the permutation module semisimple, and Young's rule gives one copy of $S^{\lambda }$ and only strictly dominating additional shapes. The trivial multiplicity is one, since a transitive permutation module has a one-dimensional invariant space. For the standard representation $S^{(n-1,1)}$, Frobenius reciprocity identifies its multiplicity with the dimension of fixed vectors under the row stabilizer $S_{n-2}$. In its realization $\{(z_1,\dots ,z_n):\sum z_i=0\}$, those fixed vectors have the form $(c,\dots ,c,a,b)$ with $(n-2)c+a+b=0$, a two-dimensional space. Thus its multiplicity is two.

Finally $\dim M^{\lambda }=n(n-1)$. Subtracting the dimensions of one $S^{\lambda }$, one trivial module and two standard modules leaves $n(n-3)/2$, exactly one $S^{(n-2,2)}$. ThereforeThe additional multiplicities are $1,2,1$ respectively. If the printed weak summation index is read literally alongside its separate $S^{\lambda }$, then $m_{\lambda ,\lambda }=0$; the total multiplicity of $S^{\lambda }$ is one.

Suppose first that $N$ is the Frobenius kernel. An element $g\notin N$ fixes a point in the Frobenius action. If $n\in C_N(g)$, then $n$ maps that point to another point fixed by $g$. Since $g$ has only one fixed point and $N$ acts regularly, $n=1$. ThusNo nonidentity conjugacy class of $N$ can be fixed by such a $g$. If the class of $n\ne 1$ were fixed, $gn{g}^{-1}=vn{v}^{-1}$ for some $v\in N$, so $v^{-1}g\notin N$ would centralize $n$, a contradiction. Conjugation by $g$ consequently fixes just the identity class. By Brauer's permutation lemma it fixes just one irreducible character, necessarily $1_N$.

For every nonprincipal $\phi \in \mathrm{Irr}(N)$, its inertia group of a character is therefore $I_G(\phi )=N$. Since $N$ is normal, the restriction of the induced character is the sum of its conjugates, counted over $G/N$:Frobenius reciprocity and character orthogonality giveAn actual character of norm one is irreducible. Every nonprincipal irreducible character of $N$ therefore induces irreducibly to $G$.

Frobenius reciprocity is the adjointness of character induction and restriction: for class functions $f$ on $H$ and $u$ on $G$,For characters this says that the multiplicity of an irreducible $G$-character in an induced character equals the corresponding multiplicity after restriction. To prove the identity directly, insert the induced class function formula and interchange the two finite sums. For each $x$, substitute $g=xh{x}^{-1}$ with $h\in H$. Since $u$ is constant on conjugacy classes,This proves the theorem for all class functions, not just irreducible characters.

For the group-theoretic conclusion, suppose that $p$ divides $|G^{\prime }\cap Z(G)|$. A central element of order $p$ lies in every Sylow p-subgroup: adjoining it to a Sylow subgroup gives a p-subgroup, so maximality forces it into that subgroup. Hence there is a subgroup $Q\le P\cap G^{\prime }\cap Z(G)$ of order $p$. Choose a nontrivial linear character $\lambda$ of $Q$.

Since $P$ is abelian, $\lambda$ extends to a linear character $\mu$ of $P$. One direct justification is to extend from an abelian subgroup $A$ to $⟨A,x⟩$ one generator at a time: if $d$ is the least positive exponent with $x^d\in A$, choose a complex $d$th root of $\lambda (x^d)$ as the value at $x$. The formula on $a{x}^j$ is then well defined and multiplicative. Iteration yields the claimed extension to $P$.

The induced character ${\mu }^G$ has degree $[G:P]$, which is prime to $p$. In its decomposition into irreducible characters, at least one constituent $\chi$ must have degree prime to $p$; otherwise the total degree would be divisible by $p$. Frobenius reciprocity also gives $⟨{\chi }_P,\mu {⟩}_P>0$ for this constituent. Restriction to the central subgroup $Q$ forcesIndeed, the induced representation itself restricts to $Q$ as copies of $\lambda$, because conjugation by every coset representative is trivial on $Q$; alternatively this follows from Schur's lemma and the positive multiplicity after restriction.

Each $q\in Q$ consequently acts in the representation affording $\chi$ as the scalar $\lambda (q)$. Taking its determinant character givesThe left side is trivial since $Q\le G^{\prime }$ and every linear character kills $G^{\prime }$. The right side is nontrivial since $\lambda$ has order $p$ and $p\nmid \chi (1)$. This contradiction provesThe argument is the central commutator has no torsion from an abelian Sylow subgroup determinant obstruction.

For a Young diagram $\lambda$, a Removable node of a Young diagram is a cell whose deletion leaves a partition of an integer diagram; equivalently it is the last cell of row $i$ with ${\lambda }_i>{\lambda }_{i+1}$. Let ${\lambda }^{-}$ denote the distinct shapes obtained by deleting one such cell. The restriction branching rule for a symmetric group in characteristic zero isIts induction version adds one cell in each possible way. Over an arbitrary field, restriction instead has a Specht filtration with these successive quotients, each once; it need not split.

To prove restriction, list the removable nodes from top to bottom. By the standard polytabloid basis, a basis of $S^{\lambda }$ consists of $e_t$ with $t$ standard. Its entry $n$ is necessarily at a removable node. Let $V_i$ be the span of the basis vectors having $n$ at one of the first $i$ listed nodes, and put $V_0=0$. These are $S_{n-1}$-invariant. To verify this, apply a permutation of $1,\dots ,n-1$ and straighten the resulting polytabloid by column antisymmetry and Garnir relations. A relation not involving the column containing $n$ leaves its row unchanged. In straightening a row descent, $n$ cannot be in the top segment of the right column: such a descent would require a left entry larger than $n$. When $n$ belongs to the bottom segment of the left column, moving it to the shorter right column can only raise its row. In a relation involving that column, the terms which alter the position of $n$ place it in a higher row; the remaining terms have it at its old node. Thus straightening never moves it past the current top-to-bottom cutoff.

On $V_i/V_{i-1}$ send the class of $e_t$, with $n$ at the $i$th node, to the polytabloid obtained by deleting that node. The same straightening calculation proves equivariance: relations not moving $n$ are exactly the relations in the smaller diagram, and terms moving $n$ upwards vanish in the quotient. Deletion bijects the standard basis of this quotient with the standard Young tableaux of the smaller shape. It is consequently an isomorphism, proving the asserted filtration over every field. In characteristic zero, Maschke's theorem splits the filtration and gives the direct sum. Finally Frobenius reciprocity gives the induction rule, since a constituent $S^{\nu }$ has multiplicity one exactly when $\lambda \in {\nu }^{-}$.

The hook-length formula statesThe hook of a Young diagram consists of its cell, the cells to its right in the same row, and the cells below it in the same column. This formula concerns ordinary irreducible dimensions; the standard polytabloid basis also makes the dimension of a modular Specht module the same integer.

All transpositions are conjugate, have order two, and generate $S_n$. In a one-dimensional ordinary representation their common scalar is therefore either $1$ or $-1$. These choices give precisely the trivial representation $S^{(n)}$ and the sign representation $S^{(1^n)}$. At $n=1$ they coincide. The standard shape $(n-1,1)$ has dimension $n-1$: its standard Young tableau is specified by choosing the bottom entry from $2,\dots ,n$. Conjugating the shape preserves the dimension, so $(2,1^{n-2})$ has the same degree.

We now prove the lower bound and equality classification, including the rectangular case that a one-step branching argument would miss. Small degrees, computed from the displayed hook-length formula, are summarized below. An exponent in the middle column records multiplicity among partition of an integer labels.

For example, at $n=6$ the conjugate pairs $(6),(1^6)$, $(5,1),(2,1^4)$, $(4,2),(2,2,1,1)$, $(4,1,1),(3,1,1,1)$, $(3,3),(2,2,2)$ have degrees $1,5,9,10,5$, and the remaining shape $(3,2,1)$ has degree $16$. These checks also identify every small equality case.

Induct on $n\ge 9$, assuming the lower bound for all smaller degrees. If a non-linear, nonstandard shape has at least two removable nodes, none of its predecessors is a single row or single column: adding one cell to a row or column could produce only a linear or standard shape. Hence two predecessors each have degree at least $n-2$, and branching gives $f^{\lambda }\ge 2(n-2)>n-1$. If it has only one removable node, it is a rectangle $(a^b)$ with $a,b\ge 2$. Its sole predecessor is $(a^{b-1},a-1)$, which has two removable nodes. Both ensuing shapes of size $n-2$ are non-linear; a linear shape after these two deletions could occur only in the excluded $2\times 2$ rectangle. Therefore two-step branching gives $f^{\lambda }\ge 2(n-3)>n-1$. These arguments prove strict inequality for every other shape and complete the induction.

Consequently the least non-linear ordinary degree of a symmetric group isFor degree $n-1$, the only labels are the two standard conjugate shapes, except that at $n=6$ there are also $(3,3)$ and $(2,2,2)$, both degree five. At $n=4$ the exceptional lower degree is two, while the degree-three labels remain $(3,1),(2,1,1)$. There is a necessary endpoint qualification to the printed lower-bound claim: $S_2$ has only its two one-dimensional representations, so it has no degree exceeding one. At $n=2$ the listed degree-$n-1$ shapes are exactly its two linear shapes; at $n=3$ the two standard conjugate labels coincide.

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.

For $n\ge 2$, a cycle type $\alpha ⊢n$ lies in $A_n$ exactly when $n-\ell (\alpha )$ is even. Its $S_n$ conjugacy class is either one $A_n$ class or two equal-sized classes. Splitting occurs exactly when its centralizer in $S_n$ contains no odd permutation. An even-length cycle is itself odd; two equal odd-length cycles can be interchanged by an odd permutation. Conversely, for distinct odd cycle lengths the centralizer is a product of cyclic groups of odd order, all contained in $A_n$. Thus the classes that split are exactly the partitions of an integer into distinct odd parts. Repeated fixed points count as repeated parts of length one.

For $n=1$ the group is trivial, with its single trivial representation. Assume $n\ge 2$ for the index-two argument that follows. For ordinary representations work over $\mathbb{C}$. Tensoring $S^{\lambda }$ by the sign representation gives $S^{{\lambda }^{\prime }}$. The index-two restriction identity, obtained by Frobenius reciprocity, isIf $\lambda \ne {\lambda }^{\prime }$, restriction is irreducible, and the conjugate pair gives the same irreducible. If $\lambda ={\lambda }^{\prime }$, the norm is two, so restriction is the sum of two distinct irreducibles. An odd permutation interchanges them, so both have degree $f^{\lambda }/2$. Every irreducible of $A_n$ occurs in some such restriction: induce it to $S_n$ and choose an irreducible constituent, then apply reciprocity. The displayed inner product distinguishes all the listed constituents. HenceThe first family has degree $f^{\lambda }$, the second degree $f^{\lambda }/2$. A choice of labels for the two split classes and constituents fixes the otherwise interchangeable signs.

The one-dimensional representations are characters of the abelianization. For $n\ge 5$, simplicity and noncommutativity of $A_n$ make its abelianization trivial. For $n=4$, its commutator subgroup is the Klein four-group and its abelianization is $C_3$, giving the three characters obtained by sending a quotient generator to $1,\omega ,{\omega }^2$. For $n=3$, $A_3=C_3$ has the same three characters; for $n=1,2$ the group is trivial and has just one. The two additional linear characters at $n=4$ are the split constituents of shape $(2,2)$; at $n=3$ they come from $(2,1)$.

Here is a dimension argument that also proves the asserted uniqueness without assuming a classification of small character degrees. Write $f^{\lambda }$ for the number of standard tableaux. Removing the cell containing the largest label givesHook lengths, or direct Young tableau counting, give the following small cases: for $S_5,S_6$ every non-linear degree is at least $4,5$, respectively. Among non-self-conjugate shapes excluding the row, column and standard pair, the minimum degree at $n=5,6,7$ is respectively $5,5,14$. The self-conjugate shapes at these sizes have half-degrees $3,8,10$, respectively, from $(3,1^2),(3,2,1),(4,1^3)$.

Inductively, for every $n\ge 7$, a shape other than the row, column or standard pair has all its one-cell predecessors non-linear. If it has at least two removable corners, each predecessor has degree at least $n-2$, so its degree is at least $2(n-2)$. If it has only one corner, it is a nontrivial rectangle $(a^b)$. Remove that corner and then either of the two corners of $(a^{b-1},a-1)$. For $n\ge 8$ these two size-$n-2$ shapes are non-linear, so its degree is at least $2(n-3)$. At $n=7$ there is no nontrivial rectangle. Together with the size-5 and size-6 checks this proves by induction that the standard pair is the only pair of shapes of degree $n-1$ for $n\ge 7$, and that every other non-linear degree is larger.

We must additionally exclude a self-conjugate shape of degree $2(n-1)$, since its restriction splits. For $n\ge 8$, if such a shape has at least three corners, the preceding lower bound gives $f^{\lambda }\ge 3(n-2)>2(n-1)$. With two corners, its predecessors are a conjugate pair and are not standard shapes; the bounds just proved give $f^{\lambda }\ge 4(n-4)>2(n-1)$. With one corner it is a square $(a^a)$. For $a\ge 4$, the two size-$n-2$ predecessors obtained after two removals are nonstandard, giving $f^{\lambda }\ge 4(n-5)>2(n-1)$. The remaining square $(3^3)$ has degree $42>16$ by the hook-length formula. The size-7 self-conjugate case has degree $20>12$. This excludes both smaller split degrees and equality with the standard degree.

It follows that the lowest non-linear ordinary degree is $3$ for $A_4$ and $n-1$ for every $n\ge 6$. For $A_1,A_2,A_3$ no non-linear irreducible exists. The excluded case $A_5$ has lowest degree $3$, although its standard degree-$4$ representation is unique. At $A_6$ there are two degree-$5$ irreducibles, from the standard conjugate pair and the pair $(3,3),(2,2,2)$.

Finally, for every $n\ge 7$ the preceding proof gives a unique degree-$n-1$ irreducible, namely the restriction of $S^{(n-1,1)}$. The small cases $n=4,5$ have unique degree $3,4$, respectively, and $A_2$ has its unique trivial degree-$1$ representation. These prove exactly the requested uniqueness range; the omitted cases $n=3,6$ genuinely fail.

Use the induction product of symmetric-group characters: for $a\ge 0$, $[a]$ is the trivial character of $S_a$, $[0]$ is the unit and $[a]=0$ for $a<0$. Products mean induction of external tensor products. The determinantal form iswhere $r\ge \ell (\lambda )$. Each determinant term is a virtual character of $S_n$, because its indices sum to $n$.

Here is a proof. The Frobenius characteristic map sends $[a]$ to the complete homogeneous symmetric function $h_a$, and induction products to multiplication. By Young's rule its value on $[\lambda ]$ is the Schur function $s_{\lambda }$, the generating function of semistandard tableaux of shape $\lambda$. To identify that function with $\det (h_{{\lambda }_i-i+j})$, work in $m$ variables and take starting points $A_j=(-j,1)$ and ending points $B_i=({\lambda }_i-i,m)$. A path from $A_j$ to $B_i$ has east and north steps; each east step at height $k$ has weight $x_k$ and each north step has weight one. Its east-step count is ${\lambda }_i-i+j$, so its weight sum is $h_{{\lambda }_i-i+j}$. Expanding the determinant sums signed systems of paths with permuted endpoints. For a system with an intersection, exchange the two tails after the first intersection. This preserves its monomial weight and reverses the endpoint permutation's sign, so all intersecting systems cancel in pairs. Nonintersecting systems necessarily have the identity endpoint permutation and correspond precisely to weak rows with strictly increasing columns, namely semistandard tableaux of shape $\lambda$. Their signs are positive. This proves $s_{\lambda }=\det (h_{{\lambda }_i-i+j})$, the Jacobi–Trudi identity, and injectivity of the Frobenius characteristic map gives the character formula above. The path sum may be taken in finitely many variables first and then stabilized, so no infinite formal sum is required in the argument.

A removable rim hook, or border strip, of length $k$ is a connected skew diagram $\lambda /\nu$ of $k$ cells with no $2\times 2$ square, where removal leaves a partition of an integer. Its leg length is the number of occupied rows minus one. The Murnaghan–Nakayama rule statesA proof sketch follows directly from the alternant form of Schur functions. Multiply an alternant by $p_k={\sum }_j{x}_j^k$. In each term one alternant exponent increases by $k$. Equal exponents cancel; otherwise reordering the exponents contributes the sign of the number crossed. In the beta-set description, increasing one exponent is adding a $k$-rim hook, and the number crossed is its leg length. Therefore $p_k{s}_{\nu }={\sum }_{\lambda }(-1{)}^{\mathrm{leg}(\lambda /\nu )}{s}_{\lambda }$. Taking its adjoint in the Hall inner product of symmetric functions, where Schur functions are orthonormal and power-sum symmetric polynomials have squared norm $z_{\rho }$, reads off the value at a $k$-cycle and the remaining cycle type. This gives the stated rule and explains its sign.

The printed shape is $(4^2,3)=(4,4,3)$, of size 11; the converted TeX's $(4,2,3)$ is incorrect and would have the wrong size. There are two removable length-5 rim hooks. They leave $(3,2,1)$ with leg length 2 and $(4,2)$ with leg length 1. ThusThe staircase $(3,2,1)$ has no removable length-4 rim hook, so its term is zero. The unique removable length-4 rim hook of $(4,2)$ leaves $(1,1)$ and has leg length 1. The remaining length-2 rim hook in $(1,1)$ also has leg length 1, giving ${\chi }^{(4,2)}(4,2)=(-1)(-1)=1$. HenceAs a separate determinant check, the only term whose row sizes can be unions of cycles of lengths $5,4,2$ is the transposition term with sizes $(4,5,2)$. Its permutation character has value one and its determinant sign is negative.

Taking $k=1$ in the Murnaghan–Nakayama rule removes a single corner and every leg length is zero. Evaluating on a permutation fixing the distinguished point therefore givesThis is the restriction branching rule for a symmetric group; ordinary semisimple representation theory converts the character equality into a direct-sum decomposition. Frobenius reciprocity gives the corresponding add-one-cell induction rule.

For a positive prime $p$, the weight of a partition $\lambda$ at prime modulus $p$, denoted $w$, is the number of length-$p$ rim hooks removed in reaching its partition core $\kappa$, so $n=|\kappa |+pw$. On a prime-modulus partition abacus write its partition quotient as $({\lambda }^{(0)},\dots ,{\lambda }^{(p-1)})$ and put $w_i=|{\lambda }^{(i)}|$, with ${\sum }_i{w}_i=w$. Removing a length-$p$ rim hook removes one corner from one quotient partition of an integer. Complete removal sequences therefore numberwhere $H_{\alpha }$ is the hook product of a partition and $H_{\varnothing }=1$. Each component's standard tableaux encode its possible removal orders, and the multinomial coefficient interleaves the components.

All these sequences have the same total sign ${\epsilon }_p(\lambda )$. To see this, label the beads on each runner in their preserved order. Each slide crosses exactly the beads counted by its rim-hook leg. Its sign is the change in the total order of bead labels, and the product telescopes to the permutation from the initial ordering to the final packed-core ordering, independently of the slides chosen. Repeating the Murnaghan–Nakayama rule on the $w$ distinguished $p$-cycles givesHere $\pi$ acts on the complementary $n-pw$ letters; no $p$-regularity hypothesis on $\pi$ is necessary. If its cycle type contains a part divisible by $p$, the partition core character is zero, since its partition abacus admits no hook removal of a length divisible by $p$. For $w=0$ the coefficient and sign are one.

Use the usual Krull–Schmidt theorem setting, in which indecomposable summands have local endomorphism rings; the paper's rings $\mathcal{O},k$ satisfy it for the subgroups involved. The relative projective module condition for $H$ means that $M$ is a direct summand of a module induced from $H$, equivalently, $M$ is a summand of ${\mathrm{Ind}}_H^G{\mathrm{Res}}_H^{G}M$. A vertex of an indecomposable module is an inclusion-minimal such subgroup. A source of an indecomposable module at its module vertex $D$ is an indecomposable $RD$-summand $S$ of $M{\downarrow }_D$ such that $M\mid S{\uparrow }^G$.

Existence of a module source follows by decomposing $M{\downarrow }_D$ and using Krull–Schmidt theorem on the induced decomposition: the indecomposable summand $M$ must occur in the induction of one indecomposable summand $S$. Such $S$ has module vertex $D$ as a $D$-module, since relative projectivity of $S$ for a proper subgroup would make $M$ relatively projective for that subgroup.

In the paper's modular coefficient rings, an indecomposable module is a trivial source module when its module source is the rank-one trivial module $R$ of its module vertex. It is then a summand of $R[G/D]$, a permutation module. Conversely suppose $M$ is an indecomposable summand of a permutation module. Restriction to a module vertex $D$ is a sum of modules $R[D/E]$, one for each $D$-orbit of the permutation basis. For a $p$-group $D$, each transitive permutation module is indecomposable: over $k$ it has simple head of a module over the local ring $kD$, and over $\mathcal{O}$ a nontrivial splitting would give a nontrivial splitting after reduction. A module source $S$ must be one of these summands by Krull–Schmidt theorem. Its module vertex is $D$, whereas $R[D/E]$ is relatively $E$-projective. Thus $E=D$, and $S\cong R$. Therefore trivial module source is equivalent to being an indecomposable permutation-module summand.

The rank-one formulation uses the paper's coefficient rings. If the earlier general coefficient-ring wording were applied to a disconnected ring, it would need qualification: for $R=k\times k$ and $G=1$, $(k,0)$ is an indecomposable summand of the permutation module $R$, but is not the rank-one trivial module $R$. One can instead allow indecomposable summands of the trivial coefficient module as module sources in that generality.

For the homomorphism request, take $M_i=\mathcal{O}[G/H_i]$. Frobenius reciprocity and Mackey decomposition giveThe summand for $g$ is generated by the sum of the cosets in the $H_1$-orbit of $g{H}_2$. The identical orbit-sum construction over $k$ gives one copy of $k$ per double coset. These are free bases in both characteristics, since invariance means coefficients are constant on orbits, with no division by orbit size. HenceThe same argument applies to direct sums of coset permutation modules.