Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Column antisymmetrization gives the exact Schur–Weyl length cutoff

Statement

Let V be a finite-dimensional complex vector space of dimension d, let n≥0, and let E:=V⊗n with the left place action of Sn of Commuting symmetric-group and linear actions on a tensor power. For every λ⊢n, Hom⁡Sn(Sλ,E)≠0⟺ℓ(λ)≤d, where ℓ(λ) is the number of nonzero rows of λ and Sλ⊆Mλ is the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules). Equivalently, the complex irreducible Sn-module Sλ occurs in V⊗n exactly for the partitions of n with at most d rows.

Facts & Assumptions

Given: a finite-dimensional complex vector space V of dimension d, an integer n≥0, a partition λ⊢n, and the module E=V⊗n with its left Sn-action.

[F1]

σ⋅(v1⊗⋯⊗vn)=vσ−1(1)⊗⋯⊗vσ−1(n) defines a left Sn-action on E with E=V⊗n finite-dimensional and E=C for n=0 (Commuting symmetric-group and linear actions on a tensor power).

[F2]

Mλ is free with the λ-tabloids as basis, et=κt⋅{t} with κt=∑γ∈Ctsgn⁡(γ)γ, Sλ is the span of the polytabloids, Ct∩Rt={1}, and eσ⋅t=σ⋅et, γ⋅et=sgn⁡(γ)et for γ∈Ct (Column antisymmetrizers, polytabloids, and Specht modules, Polytabloid covariance and the column sign rule).

[F3]

Sλ is a nonzero irreducible C[Sn]-module, and Sλ is generated by et for any single λ-tableau t (Complex Specht modules are irreducible, Polytabloid covariance and the column sign rule).

[F4]

Rt and Ct preserve each row set and each column set of t respectively, and the row stabilizer of the tabloid {t} is Rt; every λ-tabloid is σ⋅{t} for some σ∈Sn, and Ct=∏jSBj over the disjoint column label sets Bj (Row and column stabilizers, Young subgroups, tabloids, and permutation modules).

[F5]

If e1,…,ed is a basis of V, the elementary tensors ea1⊗⋯⊗ean form a basis of E, so distinct such tensors are linearly independent; ℓ(λ)=λ1′ is the height of the first column of [λ] (The elementary tensors of two bases form the product basis of the tensor product, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Partitions, English diagrams, and conjugation).

[F6]

sgn⁡ is multiplicative and sgn⁡((ab))=−1 for a transposition (The sign is a homomorphism Sn→{+1,−1}, surjective exactly when n≥2).

Proof

technique · constructive
1.1givenF1F4F5constructalgebra

[construct] Assume ℓ(λ)≤d and fix a λ-tableau t and a basis e1,…,ed of V. Let wt∈E be the tensor with factor ei in every place labelled by an entry of row i of t, that is, the place carrying label a holds er(a), where r(a) is the row of the box of t containing a; define Φ(σ⋅{t}):=σ⋅wt for σ∈Sn and extend linearly. If ρ∈Rt, then ρ permutes only the places inside each row of t, all of which carry the same basis vector, so ρ⋅wt=wt; hence, since the stabilizer of {t} is Rt and every tabloid is σ⋅{t} by [F4], Φ is a well-defined C-linear map Mλ→E, and it is Sn-linear by construction.

1.2givenF4F5F6algebra

Conversely, assume ℓ(λ)>d, and let Z be the set of labels in the first column of a λ-tableau t, so ∣Z∣=λ1′=ℓ(λ)>d by [F4, F5]. Let AZ:=∑z∈SZsgn⁡(z)z, acting on E through place permutations. Then AZ annihilates E: it suffices by linearity and [F5] to check this on a basis tensor w=ea1⊗⋯⊗ean, where the place carrying label a holds eaa for basis indices aa∈{1,…,d}. Since ∣Z∣>d, two labels a≠b of Z carry the same basis vector, so the transposition τ=(ab) fixes w. Choose representatives k for the right cosets k⟨τ⟩ in SZ. By [F6], AZ=∑ksgn⁡(k)k(1−τ), and therefore AZw=0.

2.1givenF2F4F5step 1.1algebra

For γ∈Ct, the tensor γ⋅wt has at the place carrying label a the factor er(γ−1(a)), so γ⋅wt=wt holds exactly when γ−1 maps every row set of t to itself, that is, exactly when γ∈Rt; since Ct∩Rt={1} by [F2], the tensors γ⋅wt, γ∈Ct, are pairwise distinct, and the coefficient of wt in κt⋅wt=∑γ∈Ctsgn⁡(γ) γ⋅wt is the coefficient of the single term γ=1, namely 1. By [F5] and [F2], Φ(et)=Φ(κt⋅{t})=κt⋅wt≠0.

2.2givenF2F3F4F6step 1.2algebra

Write B1,…,Br for the column label sets of t. By [F4], Ct=∏jSBj is the direct product over disjoint supports, so with ABj:=∑z∈SBjsgn⁡(z)z the multiplicativity of the sign [F6] gives κt=AB1AB2⋯ABr in C[Sn]; here B1=Z. Since AB1 annihilates E by step 1.2 and the operators commute, κt acts as the zero operator on E. Also κt⋅et=∑γ∈Ctsgn⁡(γ) γ⋅et=∑γ∈Ctet=∣Ct∣et by [F2], so et=∣Ct∣−1κt⋅et with ∣Ct∣≠0 in C. If f:Sλ→E is Sn-linear, then f(et)=∣Ct∣−1f(κt⋅et)=∣Ct∣−1κt⋅f(et)=0; since et generates Sλ by [F3], f=0. Hence Hom⁡Sn(Sλ,E)=0 when ℓ(λ)>d.

3.1givenF2F3step 1.1step 2.1algebra

The restriction Φ∣Sλ:Sλ→E is a map of Sn-modules, because Sλ⊆Mλ is an Sn-submodule and Φ is Sn-linear by step 1.1; it is nonzero at et by step 2.1. Its kernel is a proper Sn-submodule of Sλ, hence zero because Sλ is irreducible by [F3]; therefore Φ∣Sλ is injective and Hom⁡Sn(Sλ,E)≠0 when ℓ(λ)≤d.

4.1givenF1F3step 2.2step 3.1discharge-construct∎

Steps 3.1 and 2.2 prove the equivalence for n≥1; for n=0 we have λ=∅, ℓ(λ)=0≤d, S∅=C=E and Hom⁡(C,C)≠0, in agreement. If d=0 and n≥1 then E=0, so every homomorphism into E is zero, and indeed ℓ(λ)≥1>0=d; if d=0 and n=0 the previous case applies. This proves the claimed equivalence in all cases.

Remarks

  • Where irreducibility and nonvanishing are used. The forward direction uses irreducibility of Sλ only to convert a nonzero map into an injection, and uses the nonvanishing of κtwt to produce that map; the reverse direction uses ∣Ct∣≠0 in C, so it does not survive in characteristic p≤n, where the corresponding multiplicity question is a modular branching question treated elsewhere.

  • Interpretation. For λ=(n) and λ=(1n) the cutoff requires 1≤d and n≤d; the corresponding multiplicity factors below are the symmetric and exterior powers of V, of dimensions (n+d−1n) and (dn), and the second vanishes exactly when n>d.

  • No choice. The basis of V, the tableau t and the tensor wt are fixed explicitly, and Z is a finite set; no selection principle is used.

Depends on

Used by

Dependency tree · two levels

47 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