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.

Integral Garnir straightening and the field-uniform standard basis

Statement

Let n≥0 and let λ⊢n. Write MRλ for the free R-module on the λ-tabloids and SRλ for the R-span of the polytabloids over a commutative ring R (Integral and field-valued Specht modules). Then:

  1. (Integral Garnir relation.) Let t be a λ-tableau, let j,j+1 be adjacent columns, let X be a set of entries of column j and Y a set of entries of column j+1, with ∣X∣+∣Y∣>λj′. Let GX,Y:=∑g∈Tsgn⁡(g)g, where T is any set of representatives containing 1 for the left cosets of H:=SX×SY in SX∪Y (the transpositions in SX and SY act on the corresponding labels and fix all other labels). Then GX,Y et=0in MZλ; the same identity holds after base change in MFλ for every field F, for the same transversal T.
  2. (Straightening over Z.) For every λ-tableau t, the polytabloid et is a finite Z-linear combination of standard λ-polytabloids.
  3. (Integral and field-uniform basis.) The standard polytabloids {et:t standard} are a Z-basis of SZλ; for every field F, their images under coefficient reduction are an F-basis of SFλ. In particular dim⁡FSFλ=fλ for every field F, including F of characteristic 2.

Facts & Assumptions

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

[F1]

MRλ is free with the λ-tabloids as R-basis, and es=κs⋅{s}=∑γ∈Cssgn⁡(γ){γ⋅s} for every tableau s; for γ∈Cs, γ⋅es=sgn⁡(γ)es; moreover eσ⋅s=σ⋅es for every σ∈Sn, and SRλ is the R-span of all es (Integral and field-valued Specht modules).

[F3]

Cs and Rs are the subgroups of Sn preserving each column set and each row set of s; they act by permuting labels within columns and within rows respectively (Row and column stabilizers).

[F4]

Column j of [λ] has λj′ nodes and λj+1′≤λj′ (Partitions, English diagrams, and conjugation).

[F5]

A λ-tableau is a bijection [λ]→{1,…,n}; it is standard when entries strictly increase along rows and down columns, and it is column-standard when entries strictly increase down columns (Tableaux and standard tableaux, Tabloid and column orders for Specht straightening).

[F6]

The tabloids carry a finite strict total order, and the column-standard tableaux carry a finite strict total order ≺ in which s≺u means that the largest label lying in different columns in s and u is farther left in s (Tabloid and column orders for Specht straightening).

[F7]

If s is column-standard, then the coefficient of {s} in es is 1 and every other tabloid occurring in es is strictly below {s} in the tabloid order of [F6]; moreover distinct standard tableaux have distinct tabloids (Leading tabloid of a column-standard polytabloid).

Proof

technique · constructive straightening
1.1givenF1F2F3constructalgebra

[construct] Put Z:=X∪Y and AH:=∑h∈Hsgn⁡(h)h; then GX∪Y:=∑g∈SZsgn⁡(g)g satisfies GX∪Y=GX,YAH, because SZ is the disjoint union of the left cosets gH, g∈T, and sgn⁡(gh)=sgn⁡(g)sgn⁡(h) by [F2]. Since H permutes labels inside the two columns j and j+1 and fixes all other labels, H⊆Ct by [F3]; hence [F1] gives AHet=∑h∈Hsgn⁡(h)h⋅et=∑h∈Het=∣H∣et, a multiplication in MZλ by the positive integer ∣H∣=∣X∣! ∣Y∣!.

1.2givenF3F4F5algebra

Let h∈Ct and consider the tabloid {h⋅t} of the tableau h⋅t. The labels of X occupy, in the tableau h⋅t, the positions h−1(x) for x∈X; these lie in column j, because h preserves each column set by [F3], and they are pairwise distinct positions of that column, hence lie in pairwise distinct rows. Likewise the labels of Y lie in pairwise distinct rows, all of them rows ≤λj+1′≤λj′ by [F4], while the labels of X lie in rows ≤λj′. All ∣X∣+∣Y∣>λj′ labels of Z therefore lie in the first λj′ rows of the tabloid, and within this set two labels of X never share a row and two labels of Y never share a row; hence some row of {h⋅t} contains a label x∈X and a label y∈Y.

1.3givenF1F3F5constructalgebra

[construct] Let s be any λ-tableau. Sorting the entries of each column of s increasingly gives the unique column-standard λ-tableau scol with the same column sets as s, and the rule π(s(i,j))=scol(i,j) defines a unique π∈Cs with π⋅s=scol. By [F1] and [F5], escol=π⋅es=sgn⁡(π)es, so es=sgn⁡(π)escol: it suffices to straighten column-standard polytabloids over Z.

1.4F6F7algebra

The standard polytabloids are linearly independent over Z and over every field F. Indeed, let ∑scses=0 be a finite linear relation with coefficients in Z or in a field, not all zero, and let s be a standard tableau whose leading tabloid {s} is greatest, in the finite tabloid order of [F6], among the tabloids {s′} attached to the tableaux s′ with cs′≠0. By [F7] the coefficient of {s} in es′ is 0 for every such s′≠s (its leading tabloid is {s′}≠{s}, and all its other tabloids are strictly below {s′}, hence strictly below {s}), while the coefficient of {s} in es is 1; the coefficient of {s} in the relation is therefore cs≠0, a contradiction.

2.1givenF1F2F3step 1.2algebra

For h∈Ct let x∈X, y∈Y be labels in one row of {h⋅t}, as provided by step 1.2. Then (xy)⋅{h⋅t}={h⋅t} because a transposition of two labels in one row preserves the row sets. Choose representatives k for the right cosets k⟨(xy)⟩ in SZ. Since sgn⁡((xy))=−1 by [F2], GX∪Y=∑ksgn⁡(k)k(1−(xy)), so GX∪Y⋅{h⋅t}=0.

2.2givenF4F5step 1.3algebra

Because s is column-standard but not standard, some row contains adjacent entries with s(q,j)>s(q,j+1); fix such a descent, put h0:=λj′, and set xr:=s(r,j) for q≤r≤h0 and ya:=s(a,j+1) for 1≤a≤q. Column-standardness gives xq<xq+1<⋯<xh0 and y1<⋯<yq, while xq>yq; hence every element of X:={xq,…,xh0} is larger than every element of Y:={y1,…,yq}. Since the box (q,j+1) lies in [λ], we have q≤λj+1′, and ∣X∣+∣Y∣=(h0−q+1)+q=λj′+1>λj′.

3.1givenF1step 1.1step 2.1algebra

Summing step 2.1 over h∈Ct with coefficients sgn⁡(h) gives GX∪Yet=∑h∈Ctsgn⁡(h)GX∪Y{h⋅t}=0 by [F1]. By step 1.1 this is GX,YAHet=∣H∣GX,Yet=0 in MZλ. Expanding GX,Yet=∑TaT{T} in the tabloid basis, uniqueness of coefficients in the free module [F1] gives ∣H∣aT=0 in Z for every tabloid T, hence aT=0 since ∣H∣>0; therefore GX,Yet=0 in MZλ, which is claim 1 for integral scalars, and its image under Z→F gives the same identity in MFλ for every field F.

4.1givenF1step 2.2step 3.1constructalgebra

[construct] Fix a column-standard tableau s and the descent data X, Y of step 2.2, with p:=∣X∣ and Z=X∪Y. For each p-element subset A⊆Z write X∖A={a1<⋯<ar} and A∖X={b1<⋯<br} and put gA:=(a1 b1)⋯(ar br), the empty product being the identity; then gA(X)=A, the gA are pairwise distinct, and as A runs over the p-element subsets of Z they form a left-coset transversal for H in SZ with gX=1, because H is exactly the setwise stabiliser of X in SZ and the left cosets gH are distinguished by g(X). Applying step 3.1 to this transversal and using the covariance identity g⋅es=eg⋅s of [F1] yields, by isolating the identity term, es=−∑A≠Xsgn⁡(gA) egA⋅s with integer coefficients.

5.1givenF1F5F6step 2.2step 4.1algebra

For A≠X let xA be the greatest element of X∖A; then gA(xA)∈Y⊆ column j+1 of s, and every element of X∖A other than xA is smaller than xA, while every element of Y is smaller than every element of X by step 2.2. Under the left action gA⋅s, the changed labels are exactly the elements of (X∖A)∪(A∖X)⊆Z, and xA is the greatest of them, moving from column j in s to column j+1 in gA⋅s; all labels greater than xA are fixed by gA and stay in their columns. Sorting the columns of gA⋅s increasingly gives a column-standard tableau uA with the same column sets, so xA stays in column j+1, and by step 1.3 and [F5] we have egA⋅s=±euA; since the largest label in different columns of s and uA is xA, with cs(xA)=j<j+1=cuA(xA), the order of [F6] gives s≺uA.

6.1givenF6step 1.3step 4.1step 5.1algebra

There are finitely many column-standard λ-tableaux, ordered by ≺ in [F6]; list them as s1≺s2≺⋯≺sN. For the greatest element sN, if it were not standard then step 4.1 would produce tableaux uA with sN≺uA by step 5.1, contradicting maximality, so sN is standard. Now let k<N and suppose every esl with l>k is a finite Z-linear combination of standard polytabloids. If sk is standard there is nothing to prove; otherwise steps 4.1 and 5.1 express esk as a finite Z-linear combination of elements euA=±esl with l>k, which are of the required form by the supposition. Finite downward induction on k therefore proves claim 2 for column-standard tableaux, and step 1.3 removes the column-standard hypothesis: every polytabloid over Z is a finite Z-linear combination of standard polytabloids.

7.1givenF1F5step 1.4step 3.1step 6.1discharge-construct∎

By claim 2 every element of SZλ, which is spanned by the polytabloids by [F1], lies in the Z-span of the standard polytabloids, and step 1.4 shows that this family is Z-linearly independent; hence it is a Z-basis of SZλ. Reducing coefficients along Z→F, the images span SFλ because the reduction of every et is an F-linear combination of the images of standard polytabloids, and they are F-linearly independent by step 1.4 read in F; hence they form an F-basis of SFλ, so dim⁡FSFλ=fλ by [F5]. Claim 1 for fields is step 3.1, and the empty shape is included since SR∅=R with its single standard polytabloid. This proves all three claims.

Remarks

  • No division by factorials. The integral argument never divides by ∣H∣=∣X∣! ∣Y∣!: the proof of the Garnir relation first produces the identity ∣H∣GX,Yet=0 and then cancels the integer ∣H∣ inside the free, hence torsion-free, module MZλ. This is why the result survives in characteristic 2 and is not available from the complex-only Garnir relation (Adjacent-column Garnir relation over C) by base change.

  • Unitriangularity. The induction of step 6.1 straightens strictly upward in the column order ≺ of [F6], and each step has coefficients ±1; combined with the leading-tabioid unitriangularity of [F7] this gives the standard basis without the hook-length formula or RSK.

  • Consistency with the complex basis. For F=C the field case of claim 3 recovers the published Standard polytabloids form a basis of a complex Specht module without citing it; the two proofs use the same column order and the same Garnir mechanism, so they agree.

  • No choice. The transversals in claims 1 and 2 are given by explicit finite rules (a supplied transversal in claim 1, the swapping products gA in step 4.1), and the induction of step 6.1 runs over a finite ordered set; no selection principle is used.

Depends on

Used by

Dependency tree · two levels

16 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