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

Vertex-operator generating series for the padded Schur functions

Statement

Let α be a partition and t a formal variable. With the Jacobi-Trudi convention of The Jacobi–Trudi completion sμ, the operators Un and V, and stab⁡(α,β) for the integer sequences α[n]=(n−∣α∣,α1,α2,… ), one has an identity of formal Laurent series with coefficients in the symmetric function ring (Specializations of symmetric functions and the series σ): ∑n∈Zsα[n][X] tn=σ[tX]⋅sα[tX−1]=t∣α∣⋅σ[tX]⋅sα[X−t−1], where sα[tX−1] is evaluated through pk↦tkpk[X]−1 and sα[X−t−1] through pk↦pk[X]−t−k. Equivalently, ∑n∈Zsα[n][X] tn=σ[tX]∑μ: α/μ a vertical strip(−1)∣α∣−∣μ∣t∣μ∣sμ[X].

Facts & Assumptions

Given: A partition α of length k; formal variables X and t; a partition ν⊢m.

[F1]

pk[−1]=−1, pk[tX−1]=tkpk[X]−1, pk[X−t−1]=pk[X]−t−k, and hn[tX]=tnhn[X] by homogeneity of hn in the power sums (Specializations of symmetric functions and the series σ, Power sums pk and complete homogeneous symmetric polynomials hk).

[F2]

σ[tX]=∑ntnhn[X] and the Cauchy identity σ[XY]=∑λsλ[X]sλ[Y] hold for all specializations (The series σ: product formula, Cauchy identity, adjunction and reproducing kernel).

[F3]

sα[A+B]=∑μ,νcμναsμ[A]sν[B] and sα[AB]=∑μ,νgμναsμ[A]sν[B] for all specializations; in particular the coproduct applies to A=tX, B=−1 (Schur functions on sums and products of alphabets).

[F4]

cμνλ=⟨sλ,sμsν⟩H and cμνλ=cνμλ: the first by the LR product expansion and Schur orthonormality, the second because sμsν=sνsμ (The Littlewood–Richardson rule for products of Schur functions, Schur functions form an orthonormal integral basis); and sλ/μ=∑νcμνλsν (Skew Schur functions by Hall adjointness).

[F5]

Jacobi–Trudi: for every partition λ and every r≥ℓ(λ), sλ=det⁡(hλi−i+j)1≤i,j≤r with h0=1, hq=0 for q<0; and for μ⊆λ, sλ/μ=det⁡(hλi−μj−i+j), with sλ/μ=0 if μ⊈λ (Jacobi–Trudi and dual Jacobi–Trudi identities, Skew Jacobi–Trudi and tableau expansion).

[F7]

A Littlewood–Richardson tableau of shape α/μ and content ν is a semistandard skew tableau whose reading word (rows right to left, top to bottom) satisfies the lattice condition: in every prefix and for every j, the number of j's is at least the number of (j+1)'s; cμνα counts them (Littlewood--Richardson tableaux and coefficients).

[F8]

α[n]=(n−∣α∣,α1,α2,… ) is a partition of n exactly when n≥∣α∣+α1, and sα[n] is the Jacobi–Trudi determinant of the integer sequence α[n], equal to 0 for n<0 (First-row padding of a partition, The Jacobi–Trudi completion sμ, the operators Un and V, and stab⁡(α,β)).

Proof

technique · direct
1.1F2F5

Negative one-letter evaluation. By [F2], σ[−t]=1−t, so homogeneity gives h0[−1]=1, h1[−1]=−1 and hj[−1]=0 for j≥2. If ν1≥2, every entry in the first row of its Jacobi–Trudi determinant [F5] has index at least two, so sν[−1]=0. If ν=(1m), the matrix is lower triangular with diagonal h1[−1]=−1, hence sν[−1]=(−1)m. The empty determinant gives s∅[−1]=1. Thus sν[−1]=(−1)mδν,(1m).

1.2F4

Consequences for skew functions. For all partitions λ,μ,ν one has cμνλ=cνμλ by [F4], so the skew expansion [F4] gives sα/(1i)=∑μc(1i),μαsμ=∑μcμ,(1i)αsμ for every i≥0, where (10)=∅ and sα/∅=sα.

2.1F1F3step 1.1step 1.2

Coproduct at tX−1. Apply [F3] with A=tX, B=−1, and expand over ν using step 1.1: sα[tX−1]=∑μ,νcμναsμ[tX]sν[−1]=∑i≥0(−1)i(∑μcμ,(1i)αsμ[tX])=∑i=0k(−1)isα/(1i)[tX] by step 1.2, using that sα/(1i)=0 for i>ℓ(α) and sν[−1]=0 for ν not a column. Since sα/(1i) is homogeneous of degree ∣α∣−i and pj[tX]=tjpj[X], homogeneity in the power sums gives sα/(1i)[tX]=t∣α∣−isα/(1i)[X], so sα[tX−1]=∑i=0k(−1)it∣α∣−isα/(1i)[X].

3.1F2F5F8step 2.1

Coefficient of tn and the Jacobi–Trudi expansion. By [F2], σ[tX]=∑mtmhm[X], so the coefficient of tn in σ[tX]sα[tX−1] is ∑i=0k(−1)ihn−∣α∣+i[X] sα/(1i)[X], where hq=0 for q<0 by [F5]. Expand the Jacobi–Trudi determinant sα[n]=det⁡(hα[n]r−r+j)1≤r,j≤k+1 of [F8] and [F5] along its first row: the entry in column j=t+1 is hα[n]1−1+t+1=hn−∣α∣+t, its cofactor sign is (−1)1+(t+1)=(−1)t, and deleting row 1 and column t+1 leaves the matrix with entries hαr−r+c over column offsets c∈{0,1,…,k}∖{t}, which is exactly the skew Jacobi–Trudi determinant det⁡(hαr−1j≤t−r+j)=sα/(1t) of [F5], the first t columns being shifted by one. Hence sα[n][X]=∑t=0k(−1)thn−∣α∣+t[X]sα/(1t)[X] for every n∈Z, which is the coefficient of tn computed above; for n<0 all indices n−∣α∣+t are negative, both sides vanish, and for t>ℓ(α) the skew functions vanish.

4.1F2F7step 1.2step 2.1step 3.1

Vertical strips and the second form. By the definition of the Littlewood–Richardson coefficients [F7], cμ,(1i)α counts semistandard skew tableaux of shape α/μ with content (1i) whose reading word is lattice. A word using each of 1,…,i exactly once is lattice if and only if it is the increasing word 1,2,…,i: the lattice condition at the position of the letter j+1 forces j to occur earlier, for every j<i. Hence such a tableau exists precisely when each row of α/μ has at most one box (a vertical strip), the filling being then forced row by row top to bottom, with the empty skew shape giving the case i=0; so sα/(1i)=∑μ: α/μ vertical strip, ∣α∣−∣μ∣=isμ. Substituting into step 2.1 and collecting by ∣μ∣=∣α∣−i gives sα[tX−1]=∑μ: α/μ vertical strip(−1)∣α∣−∣μ∣t∣μ∣sμ[X], which combined with [F2] and step 3.1 is the second displayed formula.

5.1F1F5step 2.1step 3.1∎

Second evaluation of the shift. By [F1], pj[tX−1]=tjpj[X]−1=tj(pj[X]−t−j)=pj[t(X−t−1)], so sα[tX−1]=sα[t(X−t−1)]=t∣α∣sα[X−t−1] by homogeneity; this gives the middle equality of the first display. All coefficient sums are finite in each degree: for fixed n only t=0,1,…,k contribute, with hn−∣α∣+t=0 whenever n−∣α∣+t<0, and each sα/(1t) is a finite Z-combination of Schur functions. No convergence of a scalar series is asserted, no value σ[1] is evaluated, and no choice principle is used.

Depends on

Used by

Dependency tree · two levels

46 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