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.

The antisymmetrizer image in its own tabloid module is one-dimensional

Statement

For every n≥0, partition λ⊢n, and λ-tableau t, the image of the column antisymmetrizer on the tabloid module is exactly the nonzero line

κtMλ=Cet,et≠0.

Facts & Assumptions

Given: n≥0, λ⊢n, and a λ-tableau t.

[F1]

The column antisymmetrizer is κt=∑γ∈Ctsgn⁡(γ)γ (Column antisymmetrizers, polytabloids, and Specht modules).

[F8]

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

[F2]

The coefficient of {t} in et is 1 (Column antisymmetrizers, polytabloids, and Specht modules).

[F3]

The λ-tabloids form a basis of Mλ, and its Sn action extends linearly from the left action on tabloids (Young subgroups, tabloids, and permutation modules).

[F4]

The stabilizer of the tabloid {s} is Rs (Young subgroups, tabloids, and permutation modules).

[F5]

If a row of a tabloid contains two entries from one column of t, then κt sends that tabloid to zero (Column collision cancels antisymmetrization).

[F6]

If every row of a tableau s meets every column of t in at most one entry and s,t have shape λ, then there are ρ∈Rs and γ∈Ct with ρ⋅s=γ⋅t (Basic row-column incidence lemma).

[F7]

The sign function is a group homomorphism to {+1,−1} (The sign is a homomorphism Sn→{+1,−1}, surjective exactly when n≥2).

Proof

technique · direct
1.1givenF2

The coefficient of {t} in et is 1 by [F2], so et≠0.

1.2givenF4F5F6

Let {s} be any basis tabloid. If κt⋅{s}=0, its image already lies in Cet. Otherwise, [F5] implies that each row of s meets each column of t in at most one entry, and [F6] gives ρ∈Rs and γ∈Ct with ρ⋅s=γ⋅t; since ρ stabilizes {s} by [F4], this yields {s}=γ⋅{t}.

2.1step 1.2F1F3F7algebra

For any γ∈Ct, reindex the defining sum by d=cγ to obtain κtγ=∑c∈Ctsgn⁡(c)cγ=∑d∈Ctsgn⁡(dγ−1)d=sgn⁡(γ)κt, using [F1,F7] and sgn⁡(γ−1)=sgn⁡(γ); applying this to the tabloid equality of step 1.2 gives κt⋅{s}=sgn⁡(γ)et in its nonzero case. Thus every basis tabloid maps into Cet, and linearity with [F3] gives κtMλ⊆Cet.

3.1step 1.1step 2.1F8

Since et=κt⋅{t} by [F8], the vector et belongs to the image κtMλ; step 1.1 makes its span nonzero, so step 2.1 gives κtMλ=Cet and proves the statement.

∎

Depends on

Used by

Dependency tree · two levels

15 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