Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

The product s(2,1)s(1) by Pieri

Example

Assume the Axiom of Choice. Let r≥2, V=Cr, and let sν(x1,…,xr) denote the rank-r Schur polynomial, with sν(x1,…,xr)=0 for ℓ(ν)>r (Stable Schur functions from bialternants, Semistandard tableaux expand Schur characters). Then s(2,1)(x1,…,xr) s(1)(x1,…,xr)=s(3,1)(x1,…,xr)+s(2,2)(x1,…,xr)+s(2,1,1)(x1,…,xr), where the last term is read as 0 when r=2; correspondingly, in the notation of Schur modules and their characters, S(2,1)(V)⊗V≅S(3,1)(V)⊕S(2,2)(V)⊕S(2,1,1)(V) with LR coefficient one for each listed shape; when r=2 the final Schur module is zero, so only the first two are nonzero summands (The Littlewood--Richardson tensor-product rule, The horizontal Pieri rule). The three partitions ν are exactly the partitions of 4 with [(2,1)]⊆[ν] for which the skew diagram ν/(2,1) is a horizontal strip, namely the three legal ways of adding one box to the diagram of (2,1) (Skew diagrams and semistandard skew tableaux). The rank bound is visible in the dimensions: for r=3 the identity reads 15+6+3=24=8⋅3, and for r=2 the shape (2,1,1) has more rows than variables and drops out, leaving 3+1=4=2⋅2.

Facts & Assumptions

Given: AC, an integer r≥2 and the rank-r Schur polynomials.

[F1]

Horizontal Pieri: for ℓ(λ)≤r and d≥0, the nonzero Schur summands in Sλ(V)⊗Sym⁡d(V) are exactly those indexed by horizontal strips ν/λ with ℓ(ν)≤r, each with multiplicity one; the character identity is sλhd=∑ν/λ horizontalsν, where terms with ℓ(ν)>r are zero. Here S(1)(V)=V and h1=s(1)=x1+⋯+xr (The horizontal Pieri rule, Schur modules and their characters).

[F2]

A skew diagram ν/(2,1) for a partition ν of 4 is a horizontal strip of size one exactly when ν is obtained by adding one box to [(2,1)], and additions are legal exactly at the ends of rows, giving the three partitions (3,1), (2,2), (2,1,1) (Skew diagrams and semistandard skew tableaux, Partitions, English diagrams, and conjugation).

[F3]

For a three-row partition (a,b,c), padded by zeros, deleting all entries 3 from a semistandard tableau leaves a two-row shape (p,q) with a≥p≥b≥q≥c: equal entries 3 cannot share a column. Conversely these inequalities make the removed boxes a horizontal strip, so any tableau of shape (p,q) on {1,2} extends uniquely by filling the removed boxes with 3. Its q columns of height two are forced to be 1 above 2, and the remaining p−q first-row boxes contain a weakly increasing string of 1's followed by 2's, with p−q+1 choices. Thus s(a,b,c)(1,1,1)=∑p=ba∑q=cb(p−q+1)=(a−b+1)(b−c+1)(a−c+2)/2. At rank two the same column argument gives s(a,b)(1,1)=a−b+1. Hence the rank-two values for (3,1),(2,2),(2,1) are 3,1,2, and the rank-three values for (3,1),(2,2),(2,1,1),(2,1),(1) are 15,6,3,8,3. The shape (2,1,1) vanishes at rank two (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants).

Verification

1.1F1givenalgebra

Apply [F1] with λ=(2,1) and d=1, using S(1)(V)=V and h1=s(1): the summands are the partitions ν of 4 with [(2,1)]⊆[ν] whose complement is a horizontal strip of one box.

2.1F1F2F3step 1.1algebra

By [F2] those partitions are exactly (3,1), (2,2) and (2,1,1), and the LR coefficient for each is one. The character identity of the Statement includes all three terms, with s(2,1,1)=0 at rank 2; the module decomposition has only the nonzero Schur summands, so the final term is omitted there by [F3].

3.1F3step 2.1algebra∎

Dimension check at r=3: using the values of [F3], 8⋅3=24=15+6+3; dimension check at r=2: 2⋅2=4=3+1. Both identities match the displayed decomposition.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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