Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

A partition with too many rows vanishes at fixed rank

Statement refuted

In the Littlewood--Richardson tensor-product rule Sλ(V)⊗Sμ(V)≅⨁νSν(V)⊕cλμν the row bound ℓ(ν)≤r=dim⁡V on the summands may be suppressed: every partition ν with cλμν≠0 contributes a nonzero summand Sν(V) of the tensor product (The Littlewood--Richardson tensor-product rule, Schur modules and their characters).

Facts & Assumptions

Given: AC, V=C2 and the partitions λ=(1,1), μ=(1), ν=(1,1,1).

[F1]

For a partition η, the Schur module Sη(V)=Hom⁡S∣η∣(Sη,V⊗∣η∣) is the zero module when ℓ(η)>dim⁡V, and for ℓ(η)≤dim⁡V it is a nonzero irreducible polynomial module with character sη(x1,…,xr); the Schur polynomial sη(x1,…,xr) is defined to be 0 when ℓ(η)>dim⁡V (Schur modules and their characters, Stable Schur functions from bialternants, Littlewood--Richardson coefficients stabilise with rank).

[F2]

Λ3C2=0 and Λ3C3≅C; in each case the exterior power is the Schur module of the column (1,1,1) (If k>dim⁡V, then ΛkV=0, On ΛnV, the induced map ΛnT is multiplication by det⁡T, The vertical Pieri rule).

[F3]

Vertical Pieri gives LR coefficient one for each of the two partitions (2,1) and (1,1,1) containing (1,1) whose skew complement is a vertical strip. At rank 2, S(1,1,1)(V)=0, so only S(2,1)(V) is a nonzero summand; at rank 3 both terms are nonzero (The vertical Pieri rule, Schur modules and their characters).

Counterexample

Given: V=C2, λ=(1,1), μ=(1) and ν=(1,1,1) (Partitions, English diagrams, and conjugation).

1.1F1F2given

S(1,1,1)(C2)=0, because ℓ((1,1,1))=3>2=dim⁡V [F1]. In rank 3 the same module is nonzero, since S(1,1,1)(C3)=Λ3C3≅C [F2]; so the vanishing is a fixed-rank phenomenon, not a vanishing of the coefficient.

1.2F3givenalgebra

The coefficient is nonzero: c(1,1),(1)(1,1,1)=1, because the skew diagram (1,1,1)/(1,1) is the single box (3,1), the unique semistandard tableau of that shape and content (1) carries the letter 1, and its reading word 1 is a lattice word. Equivalently, vertical Pieri [F3] assigns coefficient one to this shape; at rank 2 its Schur module is zero, while at rank 3 it is a nonzero summand.

2.1F1F3step 1.1step 1.2algebra

At rank r=2 the honest decomposition is S(1,1)(C2)⊗C2≅S(2,1)(C2) without the summand S(1,1,1)(C2)=0 of step 1.1; its dimensions follow directly from tableaux: shape (1,1) on two letters has its unique column 1,2, while shape (2,1) has that forced first column and a top-right entry 1 or 2 (Semistandard tableaux expand Schur characters). Hence dim⁡S(1,1)(C2)⋅dim⁡C2=1⋅2=2=dim⁡S(2,1)(C2), so no room remains for a second nonzero summand. Hence the term with ℓ(ν)>r is a zero module: suppressing the bound ℓ(ν)≤r and claiming that every ν with cλμν≠0 contributes a nonzero summand of the tensor product is false, although the coefficient itself is 1 and the corresponding stable statement at large rank is true.

3.1F1F2step 2.1algebra∎

Consistently, the rank-2 Schur polynomial vanishes, s(1,1,1)(x1,x2)=0, whereas s(1,1)s(1)=s(2,1)+s(1,1,1) holds as an identity of symmetric functions; the specialization to two variables drops the second term by definition, and at rank 3 it is a genuine summand.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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