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

Polytabloid covariance and the column sign rule

Statement

For every λ⊢n, n≥0, λ-tableau t, and σ∈Sn, one has κσ⋅t=σκtσ−1,eσ⋅t=σ⋅et. For every γ∈Ct, γ⋅et=sgn⁡(γ)et. Consequently Sλ is an Sn-submodule of Mλ and is generated by any one et.

Facts & Assumptions

Given: n≥0, λ⊢n, a λ-tableau t, σ∈Sn, and γ∈Ct.

[F1]

The column antisymmetrizer is the finite group-algebra sum κt=∑c∈Ctsgn⁡(c)c (Column antisymmetrizers, polytabloids, and Specht modules).

[F2]

The polytabloid is et=κt⋅{t} (Column antisymmetrizers, polytabloids, and Specht modules).

[F3]

Sλ is the complex span of all es for λ-tableaux s (Column antisymmetrizers, polytabloids, and Specht modules).

[F4]

Ct is the direct product of the symmetric groups on its pairwise disjoint column sets (Row and column stabilizers).

[F5]

Cσ⋅t=σCtσ−1 (Tableau stabilizers transform by conjugation).

[F7]

A λ-tableau is a bijection from [λ] to {1,…,n} (Tableaux and standard tableaux).

[F8]

The tabloid module has the tabloids as basis and carries the linear extension of their left Sn-action (Young subgroups, tabloids, and permutation modules).

Proof

technique · direct
1.1givenF1F4F6algebra

Write Bj for the set of labels in column j and Hj=S(Bj). By [F4], the Hj have pairwise disjoint supports and every c∈Ct has a unique factorization c=c1⋯cr with cj∈Hj. The product ∏j=1rκBj expands over these tuples, and by [F6] the coefficient at c1⋯cr is ∏jsgn⁡(cj)=sgn⁡(c). Hence κt=∏j=1rκBj, where κBj=∑h∈Hjsgn⁡(h)h. If n=0, both sides are the empty product 1.

1.2givenF6algebra

For every c∈Ct, [F6] gives sgn⁡(σcσ−1)=sgn⁡(σ)sgn⁡(c)sgn⁡(σ−1)=sgn⁡(c), since the homomorphism property makes sgn⁡(σ−1)=sgn⁡(σ)−1.

1.3givenF1F2F6algebra

For γ∈Ct, reindex [F1] by d=γc. Since sgn⁡(c)=sgn⁡(γ−1d)=sgn⁡(γ)sgn⁡(d), this gives γκt=sgn⁡(γ)κt. Applying both sides to {t} and using [F2] proves γ⋅et=sgn⁡(γ)et.

2.1givenF1F5step 1.2algebra

By [F5], conjugation by σ bijects Ct with Cσ⋅t. Reindexing [F1] by d=σcσ−1 and using step 1.2 gives κσ⋅t=σκtσ−1.

3.1givenF2F8step 2.1algebra

From [F2], step 2.1, and the left module action [F8], eσ⋅t=κσ⋅t⋅{σ⋅t}=σκtσ−1⋅(σ⋅{t})=σ⋅(κt⋅{t})=σ⋅et.

4.1givenF3F8step 3.1

Every spanning vector of Sλ has the form es by [F3], and step 3.1 sends it under σ to eσ⋅s, which is again a spanning vector. Thus Sλ is an Sn-submodule of Mλ.

5.1givenF3F7step 3.1algebra∎

Fix any λ-tableau t and let s be any other one. By [F7], the rule σ(t(i,j))=s(i,j) defines a unique permutation σ∈Sn; for n=0 it is the identity. Then s=σ⋅t and step 3.1 gives es=σ⋅et. Therefore the orbit of et spans all the generators of Sλ, so et generates Sλ as an Sn-module. This holds for every choice of t.

Depends on

Used by

Dependency tree · two levels

13 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