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.

Adjacent-column Garnir relation over C

Statement

Let t be a λ-tableau. Let X lie among entries of column j and Y among entries of column j+1, with ∣X∣+∣Y∣>λj′. Put H=SX×SY, choose representatives T containing 1 for the left cosets gH in SX∪Y, and GX,Y:=∑g∈Tsgn⁡(g)g. Then GX,Yet=0 in Mλ over C.

Facts & Assumptions

Given: n≥0, λ⊢n, a λ-tableau t, adjacent columns j,j+1, subsets X,Y of their respective entries with ∣X∣+∣Y∣>λj′, and a left-coset transversal T for SX∪Y/H containing 1.

[F1]

The polytabloid is et=κt⋅{t}, where κt=∑γ∈Ctsgn⁡(γ)γ (Column antisymmetrizers, polytabloids, and Specht modules).

[F2]

For h∈Ct, h⋅et=sgn⁡(h)et (Polytabloid covariance and the column sign rule).

[F3]

If two entries lie in one row of a tabloid and in one column of a tableau, that tableau's column antisymmetrizer kills the tabloid (Column collision cancels antisymmetrization).

[F4]

Column j has height λj′, and these heights are weakly decreasing with j (Partitions, English diagrams, and conjugation).

[F5]

The column stabilizer preserves each column set (Row and column stabilizers).

[F6]

A tableau of shape ν⊢n is a bijection from [ν] to {1,…,n} (Tableaux and standard tableaux).

Proof

technique · direct
1.1givenF1F3F4F5F6algebra

Set Z=X∪Y and AZ=∑z∈SZsgn⁡(z)z, where SZ fixes labels outside Z. The columns are disjoint, so ∣Z∣=∣X∣+∣Y∣>λj′. If λj′=0, both X and Y are empty, contradicting this inequality; hence ∣Z∣≥2. For each γ∈Ct, every label in Z lies in one of the first λj′ rows of γ⋅{t}: its preimage under γ is in column j or j+1, and λj+1′≤λj′ by [F4]. Thus two labels of Z lie in one row of that tabloid. Form ν=(n−∣Z∣+1,1∣Z∣−1) and the ν-tableau u that places the labels of Z in increasing order down its first column and all remaining labels in increasing order along its first row; this is a tableau by [F6]. Its other columns are singletons, so Cu=SZ by [F5] and κu=AZ. Applying [F3] to u and each tabloid γ⋅{t} gives AZ(γ⋅{t})=0. Expanding et by [F1] now gives AZet=0.

2.1givenF1F2F5F7step 1.1algebra∎

Since H permutes labels within the two respective columns, H⊆Ct by [F5]. Define AH=∑h∈Hsgn⁡(h)h; [F2] gives AHet=∣H∣et. The left-coset decomposition SZ=⨆g∈TgH and multiplicativity [F7] give AZ=GX,YAH. Therefore step 1.1 yields 0=AZet=GX,YAHet=∣H∣GX,Yet. The positive integer ∣H∣ is nonzero in C, so division gives GX,Yet=0. The proof works for every supplied transversal T and makes no further choice.

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