Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Young's rule for complex permutation modules

Statement

Let n≥0, let λ,μ⊢n, let Mμ be the complex Young permutation module of shape μ with its tabloid basis (Young subgroups, tabloids, and permutation modules), and let Sλ⊆Mλ be the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules). Write Kλ,μ for the Kostka number (Semistandard tableaux and Kostka numbers) and, for an integer r≥0, let (Sλ)⊕r denote a direct sum of r copies of Sλ, the zero module when r=0. Then:

  1. (Isomorphism type.) Mμ is completely reducible and there is an isomorphism of CSn-modules Mμ≅⨁λ⊢n(Sλ)⊕Kλ,μ, the sum being over the finitely many partitions of n.
  2. (Multiplicity.) In every decomposition of Mμ as a direct sum of irreducible subrepresentations the number of summands isomorphic to Sλ equals Kλ,μ; that is, the multiplicity [Mμ:Sλ] is well defined and equal to the Kostka number Kλ,μ, independently of the decomposition.

Facts & Assumptions

Given: an integer n≥0, partitions λ,μ⊢n, the complex Young permutation module Mμ with its tabloid basis, the Specht module Sλ⊆Mλ, the standard reference λ-tableau t0 and the homomorphisms θu:Mλ→Mμ attached to the fillings u of [λ] with content μ.

[F1]

The tabloids of shape μ form a basis of Mμ, on which Sn acts by σ⋅{t}={σ⋅t}; the finite set Ωμ of tabloids is nonempty, so Mμ≠0, and Mμ is a finite-dimensional complex representation of Sn. For n=0 one has μ=∅, M∅=C with basis the empty tabloid and trivial S0-action, and S∅=C (Young subgroups, tabloids, and permutation modules, Column antisymmetrizers, polytabloids, and Specht modules).

[F2]

For every filling u of [λ] with content μ the rule θu({t0})=∑v∈Rt0⋅uv, extended Sn-equivariantly, defines an Sn-module homomorphism θu:Mλ→Mμ, and its restriction θT∣Sλ:Sλ→Mμ to the Specht module is again Sn-linear, for every semistandard T of content μ (Semistandard fillings construct Specht-to-permutation homomorphisms, Semistandard tableaux and Kostka numbers).

[F3]

If T1,…,Tr are pairwise distinct semistandard λ-tableaux of content μ, then θT1∣Sλ,…,θTr∣Sλ are linearly independent over C, so dim⁡CHom⁡Sn(Sλ,Mμ)≥Kλ,μ; moreover Kλ,λ=1, and Kλ,μ≠0 implies λ⊵μ in the dominance order (Semistandard maps are independent and respect dominance).

[F4]

The restrictions θT∣Sλ of the semistandard λ-tableaux T of content μ span Hom⁡Sn(Sλ,Mμ) over C (Semistandard maps span the Hom space in characteristic zero).

[F5]

Kλ,μ is the number of semistandard λ-tableaux of content μ; the set of fillings of [λ] with content μ is finite; every entry of such a filling lies between 1 and the number l(μ) of parts of μ; and K∅,∅=1 (Semistandard tableaux and Kostka numbers).

[F6]

Every finite-dimensional complex representation of Sn is completely reducible, that is, a direct sum of finitely many irreducible subrepresentations (with the empty sum allowed for the zero representation); this is Maschke's theorem for the finite group Sn in characteristic 0, where char⁡C=0 does not divide ∣Sn∣=n! (If char⁡k∤∣G∣, every finite-dimensional representation of G is completely reducible, Maschke's theorem for finite groups over fields whose characteristic does not divide ∣G∣, A completely reducible representation as a finite direct sum of irreducible subrepresentations).

[F7]

The modules {Sλ:λ⊢n} form a complete irredundant list of the finite-dimensional irreducible complex Sn-representations: each Sλ is irreducible, every finite-dimensional irreducible complex Sn-representation is isomorphic to some Sλ, and Sλ≅Sσ if and only if λ=σ (Specht modules classify the complex irreducibles of Sn).

[F8]

A nonzero intertwiner between irreducible representations over any field is an isomorphism, so Hom⁡Sn(Sλ,Sσ)=0 for non-isomorphic irreducibles; and over the algebraically closed field C every endomorphism of an irreducible representation is a scalar, so End⁡Sn(Sλ)=C idSλ (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and End⁡G(V) is a division ring, Over an algebraically closed field, every endomorphism of an irreducible representation is scalar).

Proof

technique · constructive
1.1F2F3F4F5constructalgebra

[construct] The restrictions θT∣Sλ:Sλ→Mμ of the semistandard fillings T of content μ form a basis of the complex vector space Hom⁡Sn(Sλ,Mμ): they span by [F4], they are linearly independent by [F3], and by [F5] there are exactly Kλ,μ of them. Hence dim⁡CHom⁡Sn(Sλ,Mμ)=Kλ,μ, and in particular a nonzero intertwiner Sλ→Mμ exists exactly when Kλ,μ≠0.

1.2F1F6F7construct

By [F6] the finite-dimensional complex representation Mμ is completely reducible, so there are irreducible subrepresentations U1,…,Ur with Mμ=U1⊕⋯⊕Ur; here r≥1 because the tabloid basis of [F1] is nonempty. By [F7] each Ui is isomorphic to Sσ(i) for exactly one partition σ(i)⊢n, and Sλ≅Sσ holds only for σ=λ.

1.3constructalgebra

Let W be a CSn-module and let M=U1⊕⋯⊕Ur be a direct sum of subrepresentations with projections πi:M→Ui along the other summands. Then πi is Sn-linear, so the rule f↦(π1f,…,πrf) maps Hom⁡Sn(W,M) into Hom⁡Sn(W,U1)⊕⋯⊕Hom⁡Sn(W,Ur); this map is C-linear, it is injective because f(w)=∑ifi(w) is determined by its components fi=πif, and it is surjective because a tuple of intertwiners (f1,…,fr) defines the intertwiner w↦∑ifi(w) of which it is the tuple of components. Hence Hom⁡Sn(W,U1⊕⋯⊕Ur)≅⨁i=1rHom⁡Sn(W,Ui).

1.4F7F8algebra

For irreducible Sλ and Sσ one has dim⁡CHom⁡Sn(Sλ,Sσ)=1 when σ=λ and 0 otherwise. If σ≠λ, then Sλ and Sσ are non-isomorphic by the irredundancy in [F7], so every intertwiner between them is zero by [F8]. If σ=λ, the same fact of [F8] makes every endomorphism of the irreducible Sλ a scalar multiple of idSλ, so End⁡Sn(Sλ)=C idSλ has dimension one.

2.1step 1.2step 1.3step 1.4algebra

Applying step 1.3 with W=Sλ to the decomposition of step 1.2 gives Hom⁡Sn(Sλ,Mμ)≅⨁i=1rHom⁡Sn(Sλ,Ui), and substituting the isomorphism Ui≅Sσ(i) of step 1.2 into step 1.4 gives dim⁡CHom⁡Sn(Sλ,Ui)=1 when σ(i)=λ and 0 otherwise. Hence dim⁡CHom⁡Sn(Sλ,Mμ) equals the number #{i:σ(i)=λ} of summands of this decomposition isomorphic to Sλ.

3.1step 1.1step 1.2step 2.1algebra

By step 1.1 the dimension in step 2.1 is Kλ,μ, so the decomposition of step 1.2 contains exactly Kλ,μ summands isomorphic to Sλ. Steps 1.2 and 2.1 apply verbatim to every decomposition of Mμ into irreducible subrepresentations, and the quantity they compute, dim⁡CHom⁡Sn(Sλ,Mμ), depends only on Mμ and λ; hence every such decomposition contains exactly Kλ,μ summands isomorphic to Sλ and the multiplicity [Mμ:Sλ] is well defined and equal to Kλ,μ. Grouping the summands of step 1.2 by their isomorphism classes gives the asserted isomorphism Mμ≅⨁λ⊢n(Sλ)⊕Kλ,μ.

4.1F1F3F5F6F7givenstep 3.1discharge-construct∎

Boundary, degenerate, characteristic and choice audit. For n=0 the only partition is ∅, and M∅=C, S∅=C, K∅,∅=1 by [F1] and [F5], so claim 1 reads M∅≅S∅ and steps 1.2 and 2.1 give r=1 with σ(1)=∅. If Kλ,μ=0, the summand (Sλ)⊕0=0 is omitted and claim 2 says that Sλ does not occur in Mμ; this happens for instance when l(λ)>l(μ), since every entry of a semistandard filling of content μ lies in {1,…,l(μ)} by [F5] while the first column of [λ] has l(λ) boxes carrying strictly increasing entries, and also for μ=(n) with λ≠(n), where all entries of a filling of content (n) are equal to 1 and a column of length at least two cannot strictly increase. If Kλ,μ=1, the summand is a single copy of Sλ: by [F3] this happens for λ=μ, so every Mλ contains exactly one copy of Sλ; and it happens for the one-row shape λ=(n) for every μ⊢n, since a semistandard filling of the single-row diagram (n) with content μ is exactly the weakly increasing word 1μ12μ2⋯ of content μ, which exists and is unique. The argument is particular to C: [F6] uses that char⁡C=0 does not divide ∣Sn∣=n! and [F8] uses that C is algebraically closed, and no analogue over a field of positive characteristic is asserted. The only selection made is the decomposition of the finite-dimensional module Mμ into finitely many irreducible summands, whose existence is supplied by [F6]; step 3.1 shows the multiplicities do not depend on this selection, and no choice principle is invoked. This proves claims 1 and 2.

Remarks

  • The two computations of one number. Young's rule is the equality of two counts of dim⁡CHom⁡Sn(Sλ,Mμ): the semistandard construction of Semistandard maps are independent and respect dominance and Semistandard maps span the Hom space in characteristic zero exhibits a basis indexed by the semistandard tableaux, while complete reducibility of Mμ and Schur's lemma compute the same dimension as the multiplicity of Sλ. Equivalently, for complex representations [Mμ:Sλ]=dim⁡CHom⁡Sn(Sλ,Mμ).

  • No Robinson-Schensted-Knuth input. The count Kλ,μ of semistandard tableaux enters only through its definition (Semistandard tableaux and Kostka numbers); the spanning argument behind the basis of the Hom space is the Garnir straightening computation of Integral Garnir straightening and the field-uniform standard basis, not the Robinson-Schensted-Knuth correspondence used in Craven's dimension count (Craven Theorem 2.16, printed pp. 28-31).

  • Dominance. Combining claims 1 and 2 with the dominance part of [F3] shows that the sum in claim 1 is supported on the shapes λ⊵μ: the permutation module Mμ is a direct sum of Specht modules of shapes dominating μ, with Sμ itself occurring exactly once, in agreement with Semistandard maps are independent and respect dominance.

Depends on

Used by

Dependency tree · two levels

52 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources