Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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.

Semistandard fillings construct Specht-to-permutation homomorphisms

Statement

Let λ,μ⊢n, and fix a λ-tableau t. Let Tλ,μ be the set of fillings of the boxes of [λ] by positive integers with content μ (Semistandard tableaux and Kostka numbers). Identifying μ-tabloids with the elements of Tλ,μ by recording, at the box that t labels x, the row of x in the tabloid, one obtains an Sn-module isomorphism C(Ωμ)≅CTλ,μ for the transported left action (σ⋅f)(x)=f(x′),t(x′)=σ−1(t(x)). For u∈Tλ,μ let Rt⋅u⊆Tλ,μ be its orbit under this restricted action and put θu({t}):=∑v∈Rt⋅uv ∈ CTλ,μ, extended to a map θu:Mλ→Mμ by θu(σ⋅{t}):=σ⋅θu({t}). Then θu is a well-defined Sn-module homomorphism, and for every semistandard λ-tableau T of content μ the restriction θT∣Sλ:Sλ→Mμ is a homomorphism of Sn-modules. No assertion is made here that this restriction is nonzero.

Facts & Assumptions

Given: partitions λ,μ⊢n, a fixed λ-tableau t, and a filling u of [λ] with content μ.

[F1]

A μ-tabloid is a row-equivalence class {s} of μ-tableaux; the tabloids form a basis of Mμ, and Sn acts on Mμ by σ⋅{s}={σ⋅s}, where (σ⋅s)(i,j)=σ(s(i,j)) (Young subgroups, tabloids, and permutation modules).

[F2]

The stabilizer in Sn of the tabloid {t} is the row stabilizer Rt (Young subgroups, tabloids, and permutation modules).

[F3]

Every λ-tabloid is σ⋅{t} for some σ∈Sn, because the action on tabloids is transitive (Young subgroups, tabloids, and permutation modules).

[F4]

Rt={ρ∈Sn:ρ(Ai)=Ai for every row i} where Ai={t(i,j)}, and Rt is the direct product of the symmetric groups on the pairwise disjoint sets A1,…,Ak (Row and column stabilizers).

[F5]

A λ-tableau is a bijection [λ]→{1,…,n}, and σ⋅t is characterised by (σ⋅t)(i,j)=σ(t(i,j)) (Tableaux and standard tableaux, Row and column stabilizers).

[F6]

A semistandard λ-tableau of content μ is a filling satisfying weak row increase, strict column increase and content μ (Semistandard tableaux and Kostka numbers).

[F7]

Sλ⊆Mλ is the complex span of the polytabloids es=κs⋅{s} (Column antisymmetrizers, polytabloids, and Specht modules), and it is an Sn-submodule of Mλ (Polytabloid covariance and the column sign rule).

Proof

technique · constructive
1.1F1F5constructalgebra

[construct] For a μ-tabloid {s} write B1,…,Bk for its row sets, so ∣Bi∣=μi; define φ({s})∈Tλ,μ to be the filling f with f(x):=i whenever t(x)∈Bi, which has content μ because t is a bijection, and conversely for f∈Tλ,μ put Bi:={t(x):f(x)=i}, so that the pairwise disjoint sets Bi cover {1,…,n} with ∣Bi∣=μi and are the rows of a μ-tabloid {s} with φ({s})=f; the two rules are inverse and φ:Ωμ→Tλ,μ is a bijection.

2.1F1step 1.1algebra

The left action on the tabloid basis transports along φ to the left action (σ⋅f)(x)=f(x′) with t(x′)=σ−1(t(x)), because the row of the label t(x) in σ⋅{s}={σ⋅s} is the row of σ−1(t(x)) in {s} by [F1]; hence the display in the Statement is a left action of Sn on Tλ,μ and φ is an isomorphism of Sn-modules, so we may compute with fillings and translate back along φ−1 at the end.

3.1F4F5step 2.1algebra

Let ρ∈Rt and f∈Tλ,μ. By [F5], ρ−1(t(x))=t(x′′) for the box x′′ in the same row i of [λ], since ρ preserves the row sets Ai of t by [F4], so (ρ⋅f)(x)=f(x′′): the entries of f are permuted within each row of [λ] and none leaves its row; conversely each permutation of the entries within the rows of f arises this way, because Rt is the full direct product of the symmetric groups on the disjoint sets A1,…,Ak by [F4] and the boxes of row i correspond bijectively to Ai via t by [F5]. Hence Rt⋅f is exactly the finite nonempty set of fillings obtained from f by permuting entries within rows.

4.1step 2.1step 3.1algebra

Let θu({t}):=∑v∈Rt⋅uv as in the Statement, a finite sum over the orbit of step 3.1; for every ρ∈Rt one has ρ⋅(Rt⋅u)=Rt⋅u because Rt is a subgroup acting on Tλ,μ by step 2.1, so ρ⋅θu({t})=θu({t}) and the orbit sum is Rt-invariant.

5.1F1F2F3step 4.1algebra

Define θu(σ⋅{t}):=σ⋅θu({t}) for σ∈Sn. This is well defined: if σ⋅{t}=τ⋅{t}, then τ−1σ∈Rt by [F2], so by step 4.1 and the left action axioms σ⋅θu({t})=τ⋅((τ−1σ)⋅θu({t}))=τ⋅θu({t}); since every tabloid is σ⋅{t} by [F3] and the tabloids form a basis of Mλ by [F1], the formula defines a unique C-linear map θu:Mλ→Mμ.

6.1step 5.1algebra

The map θu is Sn-linear: for γ,σ∈Sn, the left action axioms and step 5.1 give θu(γ⋅(σ⋅{t}))=θu((γσ)⋅{t})=(γσ)⋅θu({t})=γ⋅(σ⋅θu({t}))=γ⋅θu(σ⋅{t}), and the elements σ⋅{t} span Mλ.

7.1F6F7step 4.1step 6.1discharge-construct∎

Restricting along the inclusion Sλ⊆Mλ of the Sn-submodule [F7] gives a linear map θu∣Sλ:Sλ→Mμ with θu(γ⋅e)=γ⋅θu(e) for e∈Sλ and γ∈Sn by step 6.1, that is, a homomorphism of Sn-modules; if u=T is semistandard of content μ by [F6], this is the map θT of the Statement, whose value on {t} is the row-orbit sum ∑v∈Rt⋅Tv of step 4.1, and no nonvanishing of θT∣Sλ is asserted.

Remarks

  • The map depends only on the row class. If u′=ρ⋅u for some ρ∈Rt, then Rt⋅u′=Rt⋅u, so θu′=θu by step 4.1. The construction therefore attaches a homomorphism to each Rt-orbit of fillings of content μ, in agreement with the source's "sum of all members row equivalent to s" (Row and column stabilizers).

  • Dependence on the reference tableau. A different reference tableau t′=π⋅t produces the conjugate orbit sum and the same θ up to the identification Mμ→Mμ it induces; the homomorphisms relevant below are attached to semistandard fillings of a fixed reference tableau, which is all that is used.

  • The empty and singleton cases. For n=0 we have λ=μ=∅, the only filling is empty, Rt={1}, and θ is the identity C→C. For n=1, λ=μ=(1), again Rt={1} and θ is the identity.

  • No choice. The orbit sum is a finite sum over the finite group Rt, and the linear extension uses the tabloid basis of [F1]; no selection principle is used.

Depends on

Used by

Dependency tree · two levels

11 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