Alphabeta Math
CorollaryStatement: Literature-sourcedProof: 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 vertical Pieri rule

Statement

Assume the Axiom of Choice. Let V=Cr, r≥1, let λ be a partition with ℓ(λ)≤r and let d≥0. Then Sλ(V)⊗Λd(V)≅⨁νSν(V), the sum over those partitions ν of ∣λ∣+d with ℓ(ν)≤r and [λ]⊆[ν] for which the skew diagram ν/λ is a vertical strip (at most one box in each row, Skew diagrams and semistandard skew tableaux), each summand occurring with multiplicity one; equivalently sλed=∑ν/λ verticalsν in the rank-r Schur basis, where Λd(V) is the d-th exterior power (Symmetric and exterior powers over an arbitrary field).

Facts & Assumptions

Given: AC, V=Cr with basis e1,…,er, a partition λ with ℓ(λ)≤r, and an integer d≥0.

[F1]

The one-column Specht module S(1d) is the sign representation: its column stabilizer is all of Sd, and the signed sum of its distinct tabloids spans a line on which every permutation acts by its sign. Therefore S(1d)(V) is the subspace of alternating tensors. It is isomorphic to the quotient exterior power in Symmetric and exterior powers over an arbitrary field via v1∧⋯∧vd↦d!−1∑σ∈Sdsgn⁡(σ)σ(v1⊗⋯⊗vd). The displayed multilinear map vanishes when two inputs agree (pair permutations by their transposition), so it factors through the quotient. Conversely the quotient of this signed average is the original wedge, since a transposition changes a wedge's sign by expanding a repeated input u+v; the signed average fixes every alternating tensor. These are inverse equivariant maps (Schur modules and their characters, Column antisymmetrizers, polytabloids, and Specht modules). For d=0, (10) means ∅ and both spaces are C; for d>r both spaces vanish (If k>dim⁡V, then ΛkV=0).

[F2]

Littlewood--Richardson rule: for partitions λ,μ with ℓ(λ),ℓ(μ)≤r, Sλ(V)⊗Sμ(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλμν, where cλμν is the number of LR tableaux of shape ν/λ and content μ, vanishing unless λ⊆ν and ∣ν∣=∣λ∣+∣μ∣ (The Littlewood--Richardson tensor-product rule, Littlewood--Richardson tableaux and coefficients).

[F3]

Let U be a semistandard skew tableau of shape ν/λ and content (1d), i.e. with entries 1,2,…,d each occurring once. Its reading word w(U) is a permutation of 1,…,d; it is a lattice word exactly when w(U)=1 2⋯d, because the first letter of a lattice word of content (1d) must be 1, and inductively the k-th letter must be k. If ν/λ contains two boxes in the same row, at columns c<c′, then the right cell is read before the left cell in the reading order, while semistandardness gives the strictly smaller entry on the left, so in the reading word the larger entry T(i,c′) precedes the smaller entry T(i,c) and the word is not 1 2⋯d. Hence an LR tableau of content (1d) exists only if ν/λ is a vertical strip; conversely, if ν/λ is a vertical strip, filling the boxes with 1,2,…,d in the order in which they are read (equivalently, from top row to bottom row, since each row has at most one box) makes every column strictly increasing downward and gives the reading word 1 2⋯d, so the filling is the unique LR tableau of shape ν/λ and content (1d) (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers, Littlewood--Richardson tableaux and coefficients).

[F4]

The elementary symmetric polynomial ed=∑1≤i1<⋯<id≤rxi1⋯xid equals s(1d) by the one-column tableau expansion; e0=1 and ed=0 for d>r. It is the character of ΛdV, and the Schur characters sν, ℓ(ν)≤r, are linearly independent (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, The Littlewood--Richardson tensor-product rule).

Proof

1.1F1F2givenalgebra

If d>r, the tensor product is zero by [F1], and the proposed sum is empty because a vertical strip inside at most r rows has at most r boxes. For 0≤d≤r, apply the Littlewood--Richardson rule [F2] with μ=(1d) and use S(1d)(V)=ΛdV from [F1]: Sλ(V)⊗Λd(V)≅⨁ν: ℓ(ν)≤rSν(V)⊕cλ,(1d)ν.

2.1F1F2F3step 1.1algebra

By [F3] the coefficient cλ,(1d)ν is 1 when ν/λ is a vertical strip and 0 otherwise, and it vanishes unless λ⊆ν and ∣ν∣=∣λ∣+d by [F2]. Substituting into step 1.1 gives the decomposition, summed over precisely the vertical strips; for d>r the left-hand side is zero by [F1], and indeed a vertical strip ν/λ of size d inside the rank-r page has ℓ(ν)≤r<d, which is impossible with ∣ν/λ∣=d boxes at most one per row.

3.1F1F4step 1.1step 2.1algebra∎

Taking characters in step 2.1 and using ch⁡Sν(V)=sν and ch⁡ΛdV=ed [F4] gives sλed=∑ν/λ verticalsν in the rank-r Schur basis, the two statements being equivalent by the linear independence of the Schur characters [F4].

Depends on

Used by

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