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.

The Jacobi–Trudi completion is compatible with the internal product

Statement

For partitions α,β put a=∣α∣, b=∣β∣ and define Rα,β[Z]:=⟨sα[A]sβ[B] ∣ σ[ZAB+ZA+ZB+AB]⟩A,B, the Hall pairing in the alphabet variables A,B (The Hall inner product on symmetric functions, Specializations of symmetric functions and the series σ).

  1. Rα,β is a finite symmetric-function polynomial in Z of degree at most a+b.
  2. For every integer n≥0, (Unsα)∗(Unsβ)=UnRα,β, where Un is the Jacobi–Trudi completion and ∗ the internal product (The Jacobi–Trudi completion sμ, the operators Un and V, and stab⁡(α,β), The internal (Kronecker) product on symmetric functions); this holds for every n≥0, including those n for which the padded sequences α[n], β[n] are not partitions. Equivalently, with t a one-letter formal alphabet, ∑n≥0(Unsα)∗(Unsβ) tn=σ[tX] Rα,β[tX−1].
  3. The same polynomial is the finite Littlewood expression Rα,β=∑δ,ϵ,τ((sδsτ)⊥sα)((sϵsτ)⊥sβ)(sδ∗sϵ), the sum over all triples of partitions, all factors evaluated at Z.

Facts & Assumptions

Given: Partitions α,β with a=∣α∣, b=∣β∣; specializations A,B,X,Z; a formal variable t.

[F1]

Un is the Z-linear endomorphism with Un(sλ)=sλ[n] on the Schur basis, where sλ[n] is the Jacobi–Trudi determinant of the integer sequence λ[n]; sλ[n]∈Λn for n≥0 and sλ[n]=0 for n<0 (The Jacobi–Trudi completion sμ, the operators Un and V, and stab⁡(α,β)).

[F2]

σ[tA]=∑ntnhn[A], the Cauchy identity σ[XY]=∑λsλ[X]sλ[Y]=∑λzλ−1pλ[X]pλ[Y], the adjunction σ[AX⊥]f[X]=f[X+A], and the reproducing kernel ⟨σ[AX]∣f[X]⟩X=f[A] hold for all specializations (The series σ: product formula, Cauchy identity, adjunction and reproducing kernel).

[F3]

∑n∈Zsα[n][A]tn=σ[tA]sα[tA−1] for every partition α; the identity is linear in the Schur index, so for every f∈Λ with finite degree: the degree-n component of σ[A]f[A−1] is Unf, and [tn](σ[tX]f[tX−1])=Unf (Vertex-operator generating series for the padded Schur functions).

[F4]

sα[U+V]=∑μ,νcμναsμ[U]sν[V] and sα[UV]=∑μ,νgμναsμ[U]sν[V] for all specializations; cδ,σ,τα=⟨sα,sδsσsτ⟩H=[sα]sδsσsτ and ⟨(sδsτ)⊥sα,sσ⟩H=cδ,σ,τα (Schur functions on sums and products of alphabets, Threefold Schur coefficients ca,b,cδ, The Littlewood–Richardson rule for products of Schur functions).

[F5]

For f=∑ρaρpρ and g=∑ρbρpρ of equal degree one has ⟨f,pρ⟩H=aρzρ, pρ∗pσ=δρσzρpρ and f∗g=∑ρaρbρzρpρ (Power sums diagonalize the internal product, Power sums are orthogonal for the Hall form, The internal (Kronecker) product on symmetric functions).

[F6]

sμ∗sν=∑λgμνλsλ and ⟨sλ,sμ⟩H=δλμ (Kronecker coefficients and the internal tensor product, Schur functions form an orthonormal integral basis).

[F7]

All elements are Q-linear combinations of the power-sum basis of ΛQ (Power sums form a rational but not integral stable basis).

Proof

technique · generating functions and Hall adjunction
1.1F2F5F7

Internal-product kernel. For f,g∈ΛQd and independent formal alphabet variables U,V, with any specialization W, one has ⟨f[U]g[V] ∣ σ[UVW]⟩U,V=(f∗g)[W]. Indeed, by the power form of the Cauchy identity [F2], σ[UVW]=∑ρ⊢dzρ−1pρ[U]pρ[V]pρ[W] in the relevant degree and the pairing is a finite sum, since only ρ⊢d matches the bidegree (d,d) of f[U]g[V]. Writing f=∑ρaρpρ and g=∑ρbρpρ, [F5] gives ⟨f[U]g[V],pρ[U]pρ[V]pρ[W]⟩U,V=aρzρ⋅bρzρ⋅pρ[W], so the left side is ∑ρ⊢daρbρzρpρ[W]=(f∗g)[W] by [F5].

1.2F2

Finiteness of R. Factor the kernel of R as σ[ZAB]σ[ZA]σ[ZB]σ[AB]. In the (a,b)-bidegree of the pairing, the four factors contribute bidegrees (j,j), (m,0), (0,n), (l,l) with j+m+l=a and j+n+l=b, so 0≤j,m,n,l≤a+b and the Z-degree is j+m+n=b+m−l≤a+b. For each fixed Z-degree only finitely many such (j,m,n,l) occur, and each homogeneous component of σ is a finite sum over partitions; hence Rα,β is a finite polynomial in Z of degree at most a+b, with coefficients extracted from finitely many bidegree pieces of σ. No infinite sum of symmetric functions is evaluated.

2.1F1F2F3step 1.1

The generating function F(t)=∑n≥0(Unsα)∗(Unsβ)tn. By [F1] and [F3], the degree-n part of σ[A]sα[A−1] is Unsα, and likewise for β; the bidegree-(n,n) part of the product σ[A]sα[A−1] σ[B]sβ[B−1] is therefore (Unsα)[A](Unsβ)[B]. Pairing against σ[tXAB]=∑ntnhn[XAB] and applying step 1.1 in each degree gives F(t)=⟨σ[A]sα[A−1] σ[B]sβ[B−1] ∣ σ[tXAB]⟩A,B, a formula in which the coefficient of tn is finite by [F1].

3.1F2step 2.1

Hall adjunction. For a polynomial u and a formal series W[A], interpreted coefficientwise in t, the adjunction of [F2] with the one-letter alphabet 1 reads σ[A⊥]u[A]=u[A+1]; equivalently ⟨σ[A]u[A],W[A]⟩A=⟨u[A],W[A+1]⟩A and, in the reverse direction, ⟨u[A−1],W[A]⟩A=⟨u[A],σ[−A]W[A]⟩A. Applying this in the A-variable and then in the B-variable to the identity of step 2.1 turns σ[A]σ[B] into the translation A↦A+1, B↦B+1 of the kernel and moves the shifts −1 of sα,sβ onto the kernel: F(t)=⟨sα[A]sβ[B] ∣ σ[tX(A+1)(B+1)−A−B]⟩A,B. Each coefficient of tn in the kernel before translation is polynomial in A,B of bidegree (n,n), so both adjunctions are finite coefficientwise.

4.1F1F2F3step 3.1step 1.2

Factorization and the coefficient identity. Expanding tX(A+1)(B+1)−A−B=tX+(tX−1)AB+(tX−1)A+(tX−1)B+AB and using σ[C+D]=σ[C]σ[D] from the product formula [F2], the kernel of step 3.1 is σ[tX] times σ[(tX−1)AB+(tX−1)A+(tX−1)B+AB], so F(t)=σ[tX]Rα,β[tX−1]. By [F3], the coefficient of tn in σ[tX]h[tX−1] is Unh for every finite-degree h, and Rα,β[tX−1] is the specialization of the element Rα,β∈ΛZ introduced in the statement, so comparing the coefficient of tn gives (Unsα)∗(Unsβ)=UnRα,β for every n≥0; for n<0 one has Un=0 by [F1], so no negative index is asserted.

5.1F4F5F6step 4.1∎

The Littlewood expression. Expand the four factors of the kernel of R with the Cauchy identity and the product-alphabet identity [F2] and [F4]: σ[ZAB]=∑ζ,δ,ϵsζ[Z]gδϵζsδ[A]sϵ[B], σ[ZA]=∑σsσ[Z]sσ[A], σ[ZB]=∑ρsρ[Z]sρ[B] and σ[AB]=∑τsτ[A]sτ[B]. Pairing with sα[A]sβ[B] and using the orthonormality of the Schur basis gives Rα,β=∑gδϵζsζ[Z]sσ[Z]sρ[Z]⟨sδsσsτ,sα⟩H⟨sϵsρsτ,sβ⟩H. By [F4] the two pairings are cδ,σ,τα and cϵ,ρ,τβ, and re-summing over σ with ρ fixed gives ∑σcδ,σ,ταsσ[Z]=(sδsτ)⊥sα by adjointness; similarly for β. Finally ∑ζgδϵζsζ[Z]=sδ∗sϵ[Z] by [F6]. This is exactly the displayed Littlewood expression, and the sum is finite because c- and g-coefficients vanish outside the size constraints.

Depends on

Used by

Dependency tree · two levels

56 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