Alphabeta Math
DefinitionDefinition: 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 Specht lattice and base change

Definition

Let n≥0, let λ⊢n, and let Ωλ be the finite set of λ-tabloids; for a λ-tableau t write {t} for its tabloid (Young subgroups, tabloids, and permutation modules). The integral tabloid module is the free abelian group on Ωλ,

MZλ:=Z(Ωλ)={∑T∈ΩλaT T: aT∈Z, only finitely many aT≠0},

with the tabloids as standard Z-basis (The free module on a set and its standard basis). The left action of Sn on tabloids extends Z-linearly to MZλ, so that MZλ is a Z[Sn]-module. For every λ-tableau t put

κt:=∑γ∈Ctsgn⁡(γ)γ∈Z[Sn],et:=κt⋅{t}=∑γ∈Ctsgn⁡(γ) {γ⋅t}∈MZλ,

the integral column polytabloid; every coefficient lies in {0,1,−1} (Column antisymmetrizers, polytabloids, and Specht modules). The integral Specht lattice is the Z[Sn]-submodule

SZλ:=the Z-span of { es: s a λ-tableau }⊆MZλ.

For a commutative ring R let MRλ:=R(Ωλ) be the free R-module on the tabloids and let SRλ⊆MRλ be the R-span of the polytabloids ∑γ∈Ctsgn⁡(γ){γ⋅t}, t a λ-tableau. The standard polytabloids are the es with s a standard λ-tableau (Tableaux and standard tableaux).

This item records three facts. First, the standard polytabloids form a Z-basis of SZλ, so the integral Specht lattice has explicit finite rank. Second, for every commutative ring R the canonical map R⊗ZSZλ→R⊗ZMZλ≅MRλ is injective onto SRλ: the lattice is a direct summand of the free tabloid module and is compatible with base change, including rings of prime characteristic. Third, for λ=∅ the module has rank one and is generated by the empty polytabloid.

Facts & Assumptions

Given: An integer n≥0, a partition λ⊢n, and the definitions above.

[F1]

The tabloids form a basis of Mλ, the tabloid of t is {t}={ρ⋅t:ρ∈Rt}, and the left action of Sn extends linearly (Young subgroups, tabloids, and permutation modules).

[F2]

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

[F3]

Ct∩Rt={1} for every tableau, so the tabloids γ⋅{t} for γ∈Ct are pairwise distinct and the coefficient of {t} in et is 1 (Column antisymmetrizers, polytabloids, and Specht modules).

[F4]

The tabloid order is a finite strict total order on Ωλ and the column order ≺ is a finite strict total order on the column-standard λ-tableaux (Tabloid and column orders for Specht straightening).

[F5]

If X,Y lie in adjacent columns and ∣X∣+∣Y∣>λj′, then for every left-coset transversal T containing 1 the integral group-algebra element GX,Y=∑g∈Tsgn⁡(g)g satisfies GX,Yet=0 over C (Adjacent-column Garnir relation over C).

[F6]

Over C, every polytabloid is a finite complex linear combination of standard polytabloids (Garnir straightening spans the complex Specht module).

[F7]

For a column-standard tableau t, the coefficient of {t} in et is 1 and every other tabloid occurring in et is strictly below {t} in the tabloid order; consequently the standard polytabloids are linearly independent over C (Leading tabloid of a column-standard polytabloid).

[F8]

Over C one has eσ⋅t=σ⋅et for σ∈Sn and γ⋅et=sgn⁡(γ)et for γ∈Ct (Polytabloid covariance and the column sign rule).

[F9]

MZλ=Z(Ωλ) is free with the tabloids as a Z-basis, so every element has a unique finite integer coordinate expression and a vector vanishes exactly when all its tabloid coefficients vanish (The free module on a set and its standard basis).

[F10]

For a commutative ring R there are natural isomorphisms R⊗Z(⨁TZ)≅⨁T(R⊗ZZ) and R⊗ZZ≅R, hence a natural isomorphism R⊗ZMZλ≅MRλ carrying 1⊗T to the tabloid T (Tensor products commute with arbitrary direct sums, The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M).

[F11]

The standard λ-tableaux are the tableaux strictly increasing along rows and down columns; for λ=∅ the empty tableau is the unique standard tableau (Tableaux and standard tableaux).

Proof

technique · direct
1.1givenF2F3algebra

By [F3] the tabloids γ⋅{t} with γ∈Ct are pairwise distinct, so in the expansion et=∑γsgn⁡(γ){γ⋅t} no tabloid occurs twice; every coefficient is 0 or ±1, the coefficient of {t} is 1, and et≠0. In particular et is a genuine nonzero integral vector of MZλ.

1.2givenF1F2F8algebra

For σ∈Sn the column sets satisfy Cσ⋅t=σCtσ−1, and the substitution γ=σδσ−1 gives eσ⋅t=∑δ∈Ctsgn⁡(δ){σδ⋅t}=σ⋅et. This identity of two integral vectors holds over C by [F8], and by the uniqueness of tabloid coordinates it therefore holds in MZλ. Since every λ-tableau is σ⋅t0 for the tableau t0 that lists 1,…,n along the rows of [λ], the lattice SZλ is generated over Z[Sn] by the single polytabloid et0.

1.3givenF5algebra

The Garnir element of [F5] is an integral group-algebra element, and GX,Yet=∑g∈T∑γ∈Ctsgn⁡(g)sgn⁡(γ){gγ⋅t} has integer coefficients in the tabloid basis. The identity GX,Yet=0 holds in MCλ between two integral vectors, so by uniqueness of tabloid coordinates it holds in MZλ: the Garnir relation is integral.

1.4givenF1F2F11

For λ=∅ there is exactly one tabloid and one tableau, with Ct={1}, κt=1 and et={∅}; the empty tableau is standard by [F11]. Thus MZ∅=Z{∅}≅Z and SZ∅=Z{∅} has rank one with the empty polytabloid as basis.

2.1givenF4F5F6step 1.2step 1.3algebra

Run the published spanning argument inside MZλ: for column-standard s that is not standard, the integral Garnir relation of step 1.3 with the explicit transversal containing 1 isolates the identity term and gives es=−∑A≠Xsgn⁡(gA)egA⋅s with each gA an explicit product of disjoint swaps; sorting columns and using the covariance of step 1.2 rewrites each egA⋅s as ±eu with u column-standard and s≺u in the finite order [F4]; and any tableau is taken to column-standard form by a column permutation, again by step 1.2. Reverse induction along [F4] therefore gives, for every λ-tableau t, an identity et=∑u standardctueu with integer coefficients ctu. Hence the standard polytabloids span SZλ over Z.

3.1givenF4F7step 2.1algebra

Order the standard λ-tableaux t1,…,td so that {t1}<⋯<{td} in the tabloid order of [F4], possible since distinct standard tableaux have distinct tabloids and the order is total. By [F7], eti={ti}+∑T<{ti}cTT with integer cT, so the coefficient of {tj} in eti is 0 for j>i and 1 for j=i. A relation ∑iaieti=0 with integral ai therefore forces ad=0, then ad−1=0, and so on; the standard polytabloids are Z-linearly independent and, with step 2.1, form a Z-basis of SZλ.

4.1givenF9step 3.1algebra

Let P:Zd→MZλ send the i-th standard basis vector to eti, so that im⁡P=SZλ by step 3.1, and let π:MZλ→Zd take tabloid coordinates at {t1},…,{td}. By step 3.1 the matrix of π∘P is upper unitriangular with integer entries, hence invertible over Z by integer back-substitution, and ρ:=(π∘P)−1∘π satisfies ρ∘P=id. Thus P is injective and split, SZλ is a direct summand of the free Z-module MZλ, and MZλ/SZλ is free: the lattice is saturated.

5.1givenF10step 2.1step 4.1algebra

Let R be a commutative ring and use the identification R⊗ZMZλ≅MRλ of [F10]. The map idR⊗P has image R⊗ZSZλ and idR⊗ρ is a left inverse of it, so idR⊗P is injective; hence the canonical map R⊗ZSZλ→MRλ is injective onto the R-span of the vectors 1⊗eti, which is the R-span of the standard polytabloids. By the identity of step 2.1 every polytabloid is an integral combination of standard ones, so this span is exactly SRλ; therefore SRλ≅R⊗ZSZλ for every commutative ring R, including rings of prime characteristic.

6.1givenstep 1.4step 3.1step 4.1step 5.1∎

Taking R=Z in step 5.1 returns SZλ, and taking λ=∅ returns the rank-one lattice Z{∅} of step 1.4; the standard-polytabloid basis is step 3.1 and saturation is step 4.1. This proves the three asserted properties for all n≥0, including n=0.

Depends on

Used by

Dependency tree · two levels

25 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