Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Semistandard tableaux expand Schur characters

Statement

Assume the Axiom of Choice. Let V=Cr, r≥1 (Schur modules and their characters), and let λ be a partition with ℓ(λ)≤r (Partitions, English diagrams, and conjugation). Then ch⁡Sλ(V)=∑Txwt⁡(T), the sum over all semistandard tableaux T of shape λ with entries in {1,…,r}, where wt⁡(T)=(a1,…,ar) records the multiplicity of each entry (Semistandard tableaux and Kostka numbers, Skew diagrams and semistandard skew tableaux). Moreover this polynomial is the rank-r Schur polynomial sλ(x1,…,xr) of Stable Schur functions from bialternants, i.e. sλ(x1,…,xr)=aλ+δr(x1,…,xr)aδr(x1,…,xr)=∑Txwt⁡(T) for ℓ(λ)≤r, while sλ(x1,…,xr):=0 and ch⁡Sλ(V)=0 when ℓ(λ)>r. In particular Sλ(V)≠0 if and only if ℓ(λ)≤r, and the multiplicity of the weight α in Sλ(V) equals the number of semistandard tableaux of shape λ and weight α; by Bender--Knuth involutions permute the weights of semistandard tableaux this polynomial is symmetric in x1,…,xr.

Facts & Assumptions

Given: AC, V=Cr with basis e1,…,er, a partition λ with n=∣λ∣ and ℓ(λ)≤r, and the module Sλ(V)=Hom⁡Sn(Sλ,V⊗n) of Schur modules and their characters.

[F1]

Schur--Weyl decomposition: V⊗n≅⨁μ⊢n, ℓ(μ)≤rSμ⊗Sμ(V) as (Sn×GL⁡(V))-modules, and for every μ with ℓ(μ)≤r the module Sμ(V) is a nonzero irreducible polynomial GL⁡(V)-module, while Sμ(V)=0 for ℓ(μ)>r (Schur-Weyl decomposition and highest weights parts (1) and (2), Polynomial representations of GL_r and their highest weights).

[F2]

Young's rule: for partitions λ,ν⊢n the multiplicity of the Specht module Sλ in the Young permutation module Mν equals the Kostka number Kλν, the number of semistandard tableaux of shape λ and weight ν (Young's rule for complex permutation modules, Young subgroups, tabloids, and permutation modules, Semistandard tableaux and Kostka numbers); the Specht modules Sλ, λ⊢n, form a complete set of pairwise non-isomorphic simple CSn-modules (Specht modules classify the complex irreducibles of Sn, Column antisymmetrizers, polytabloids, and Specht modules).

[F3]

V⊗n has the basis of elementary tensors ei1⊗⋯⊗ein on which Sn acts by place permutations; the diagonal torus of GL⁡(V) acts on ei1⊗⋯⊗ein by the weight whose j-th component is the number of indices ik equal to j (Commuting symmetric-group and linear actions on a tensor power, Schur modules and their characters).

[F4]

At rank r the tableau expansion sλ(x1,…,xr)=∑Txwt⁡(T) holds over semistandard tableaux of shape λ with entries in {1,…,r} when ℓ(λ)≤r, and sλ(x1,…,xr)=0 when ℓ(λ)>r; the left-hand side is the bialternant quotient of Stable Schur functions from bialternants (Skew Jacobi–Trudi and tableau expansion with μ=∅).

[F5]

A homomorphism between non-isomorphic irreducible CSn-modules is zero. Also End⁡Sn(Sλ)=C: any endomorphism has an eigenvalue z over C, and its difference from zI has a nonzero kernel, so irreducibility makes that difference zero. Consequently the multiplicity of Sλ in a direct sum of simples equals the dimension of its Hom-space into that sum (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and End⁡G(V) is a division ring, Specht modules classify the complex irreducibles of Sn).

Proof

1.1F3givenconstruct

First fix a partition ν⊢n with at most r parts, padded by zeros to length r. By [F3] the weight-ν subspace Eν of V⊗n has as its basis the elementary tensors whose index word has content ν. The group Sn permutes these basis vectors by place permutations, and the action on the basis is transitive (any word with content ν is a rearrangement of 1ν1⋯rνr), with the stabilizer of a word of content ν being the subgroup of permutations preserving the letter classes, a conjugate of the Young subgroup Sν; hence Eν is isomorphic to the Young permutation module Mν (Young subgroups, tabloids, and permutation modules).

2.1F1F2step 1.1algebra

By Young's rule [F2] the multiplicity of the simple module Sλ in Eν≅Mν is the Kostka number Kλν, which by Semistandard tableaux and Kostka numbers is the number of semistandard tableaux of shape λ and weight ν.

3.1F1F2F5step 1.1step 2.1algebra

Compare the Sn-isotypic Sλ-component of V⊗n. By the Schur--Weyl decomposition [F1] and non-isomorphism of distinct Specht modules [F2], the Sλ-isotypic component of V⊗n is Sλ⊗Sλ(V), on which Sn acts on the first factor alone; therefore the Sλ-multiplicity in Eν equals dim⁡Sλ(V)ν, the dimension of the weight-ν space of the GL⁡(V)-module Sλ(V). Combined with step 2.1 this gives dim⁡Sλ(V)ν=Kλν=#{T: T semistandard of shape λ and weight ν}.

4.1F1F4F5step 3.1algebra

For an arbitrary weight α∈Z≥0r of total n, sort its entries into a partition ν. A permutation matrix carries the weight-α space of Sλ(V) isomorphically onto its weight-ν space, by conjugating the diagonal torus. The Bender--Knuth involutions of Bender--Knuth involutions permute the weights of semistandard tableaux likewise give a bijection between tableaux of weights α and ν; use a product of adjacent transpositions sorting α. Thus step 3.1 holds for every composition weight α, with Kλα denoting this tableau count. Summing these weight dimensions over all α and using the definition of the character of Schur modules and their characters gives ch⁡Sλ(V)=∑αKλαxα=∑Txwt⁡(T), summed over semistandard tableaux of shape λ with entries in {1,…,r}. By the tableau expansion of [F4] this equals sλ(x1,…,xr); the case ℓ(λ)>r is the vanishing definition Sλ(V)=0, matched by sλ(x1,…,xr)=0 in [F4]. In particular ch⁡Sλ(V)=0 exactly when ℓ(λ)>r or λ has no semistandard tableau with entries in {1,…,r}; the latter never happens for ℓ(λ)≤r (fill row i with the letter i), so Sλ(V)≠0 if and only if ℓ(λ)≤r, and the multiplicity of each weight α in Sλ(V) is the number of semistandard tableaux of shape λ and weight α.

5.1F4step 4.1algebra∎

The polynomial ∑Txwt⁡(T) is symmetric in x1,…,xr by Bender--Knuth involutions permute the weights of semistandard tableaux, consistently with sλ being the bialternant quotient, whose numerator and denominator are alternating and whose quotient is therefore a symmetric polynomial.

Depends on

Used by

Dependency tree · two levels

71 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