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.

Schur functions on sums and products of alphabets

Statement

Let A,B be specializations (Specializations of symmetric functions and the series σ).

Both sums are finite. No multiplicativity or bilinearity of sλ in the alphabet variables, and no unproved Schur-functor decomposition, is assumed.

Facts & Assumptions

Given: Specializations A,B,U,V,W into commutative Q-algebras, partitions λ,μ,ν,ρ and integers d,n≥0.

[F1]

Specializations are the algebra homomorphisms determined by arbitrary power-sum values, with pk[A+B]=pk[A]+pk[B], pk[AB]=pk[A]pk[B]; for a product ρ one has pρ[A+B]=∏i(pρi[A]+pρi[B]) and pρ[AB]=pρ[A]pρ[B] (Specializations of symmetric functions and the series σ).

[F2]

ΛQ=Q[p1,p2,… ] and {pλ:λ⊢d} is a Q-basis of ΛQd (Power sums form a rational but not integral stable basis).

[F3]

hn=∑λ⊢npλ/zλ in ΛQ, where zλ=∏iimi(λ)mi(λ)!; in a finite alphabet, hk is the sum of all monomials of total degree k and ∑k≥0hktk=∏x(1−xt)−1 (Complete homogeneous functions expand in power sums with cycle-distribution coefficients, Power sums pk and complete homogeneous symmetric polynomials hk).

[F4]

Newton's identities: with e0=1, ek=0 for k>n, one has kek=∑i=1k(−1)i−1ek−ipi in R[x1,…,xn]Sym⁡n (Newton's identities: kek=∑i=1k(−1)i−1ek−ipi).

[F5]

The fundamental theorem of symmetric polynomials: substitution Tk↦ek is an isomorphism R[T1,…,Tn]→R[x1,…,xn]Sym⁡n (Fundamental theorem of symmetric polynomials: unique expression as a polynomial in e1,…,en).

[F6]

In the bidegree completion Bidegree completion of two symmetric-function rings, the Cauchy kernel satisfies Ω(X,Y)=∑λhλ(X)mλ(Y)=∑λsλ(X)sλ(Y), and in the rational completion Ω(X,Y)=∑λzλ−1pλ(X)pλ(Y); each sum is by diagonal bidegree (Power-sum, complete, and Schur expansions of the Cauchy kernel).

[F7]

sμsν=∑λcμνλsλ in Λ, and sλ/μ=∑νcμνλsν (The Littlewood–Richardson rule for products of Schur functions, Littlewood--Richardson tableaux and coefficients).

[F8]

The Schur functions form an orthonormal Z-basis: ⟨sλ,sμ⟩H=δλμ (Schur functions form an orthonormal integral basis, The Hall inner product on symmetric functions), and ⟨pρ,pσ⟩H=δρσzρ (Power sums are orthogonal for the Hall form).

[F9]

The internal product ∗ satisfies sμ∗sν=∑λgμνλsλ and pρ∗pσ=δρσzρpρ (Kronecker coefficients and the internal tensor product, The internal (Kronecker) product on symmetric functions, Power sums diagonalize the internal product).

[F10]

The rank-N projection Λd→ANd, f↦f(x1,…,xN), sends mλ to the orbit sum mλ(x1,…,xN) for ℓ(λ)≤N (and to 0 otherwise) and sλ to sλ(x1,…,xN); for N≥d it carries the basis {mλ:λ⊢d} bijectively onto the basis {mλ(x):λ⊢d} of the symmetric polynomials, hence is injective on Λd (The monomial symmetric functions form the integral stable basis, Monomial symmetric polynomials form an R-basis of the symmetric-polynomial ring, Stable Schur functions from bialternants, The stable graded ring of symmetric functions).

Proof

technique · universal polynomial identities checked on finite alphabets
1.1F4F5

Genericity. Fix d≥0 and N≥d. The substitution σd from Q[A1,…,Ad;B1,…,Bd] to Q[x1,…,xN,y1,…,yN] with Ak↦pk(x), Bk↦pk(y) is injective. Indeed, by [F4] over Q the identities kek=(−1)k−1pk+∑i=1k−1(−1)i−1ek−ipi express each ek recursively in p1,…,pk and each pk recursively in e1,…,ek for k≤N, so Q[e1,…,eN]=Q[p1,…,pN] as subrings of Q[x1,…,xN]; by [F5] that ring is a free polynomial ring on N generators, so p1,…,pN, and hence p1,…,pd, are algebraically independent. The same holds in the y-variables, and the tensor product over Q of two injective substitutions is injective.

2.1F1F3step 1.1

Multiplicativity. For all specializations U,V and all n≥0 one has hn[U+V]=∑i+j=nhi[U]hj[V]; consequently σ[U+V]=σ[U]σ[V] coefficientwise. By [F3], hn=∑λ⊢npλ/zλ involves only p1,…,pn, so both sides of the claimed identity are the value at (p1[U],…,pn[U],p1[V],…,pn[V]) of the universal polynomial Dn(A;B):=∑λ⊢n∏i(Aλi+Bλi)/zλ−∑i+j=n(∑μ⊢ipμ(A)/zμ)(∑ν⊢jpν(B)/zν), where pμ(A)=∏iAμi. At honest alphabets x1,…,xn and y1,…,yn, the generating function ∑khk(ℓ)tk=∏ℓ(1−ℓt)−1 of [F3] gives ∑khk(x⊔y)tk=∏ℓ(1−ℓt)−1=(∑ihi(x)ti)(∑jhj(y)tj), so Dn(p(x);p(y))=0. By step 1.1 with d=N=n the substitution is injective, so Dn=0, and the identity holds universally; since σ=∑nhn, this is multiplicativity of σ, coefficient by coefficient finite.

2.2F1F2F3F6F10step 1.1

Cauchy identities for arbitrary specializations. For all specializations X,Y and all d≥0, hd[XY]=∑λ⊢dsλ[X]sλ[Y]=∑ρ⊢dzρ−1pρ[X]pρ[Y], equivalently σ[XY]=∑λsλ[X]sλ[Y]=∑λzλ−1pλ[X]pλ[Y] coefficientwise. The second equality is [F3] applied to the alphabet XY: hd[XY]=∑ρ⊢dzρ−1pρ[XY]=∑ρzρ−1pρ[X]pρ[Y] by [F1]. For the first, fix d; both ∑λ⊢dsλ[X]sλ[Y] and ∑ρ⊢dzρ−1pρ[X]pρ[Y] are values of universal polynomials in (pk[X],pk[Y])k≤d, by [F2]. At honest alphabets x1,…,xN, y1,…,yN with N≥d, apply the projection Λd(X)⊗Λd(Y)→ANd(x)⊗ANd(y) of [F10] to the degree-(d,d) component of the Cauchy identity [F6]: it maps the two sides to ∑λ⊢dsλ(x)sλ(y) and ∑ρ⊢dzρ−1pρ(x)pρ(y), which are therefore equal. By step 1.1 with d=N the universal difference vanishes identically, proving the first equality for all X,Y.

3.1F1F7F8step 2.1step 2.2

Coproduct (a). Apply step 2.2 to the pair of specializations (U+V,Z), where Z denotes the tautological specialization into a fresh copy of Λ; the resulting chain of identities is ∑λsλ[U+V]sλ[Z]=σ[(U+V)Z]=σ[UZ+VZ]=σ[UZ]σ[VZ]=∑μ,νsμ[U]sν[V]sμ[Z]sν[Z], where the second equality uses pk[(U+V)Z]=pk[UZ]+pk[VZ] from [F1], the third is step 2.1, and the last is step 2.2 applied twice. By [F7], sμ[Z]sν[Z]=∑λcμνλsλ[Z], so the right side equals ∑λ(∑μ,νcμνλsμ[U]sν[V])sλ[Z], each coefficient being a finite sum. The sλ[Z] form a Z-basis of Λd(Z) by [F8] and [F10], so comparing coefficients of sλ[Z] gives sλ[U+V]=∑μ,νcμνλsμ[U]sν[V] for every λ.

3.2F8F9step 2.2

Kernel identity. For f,g∈ΛQd and independent formal alphabet variables U,V,W, with the Hall form of The Hall inner product on symmetric functions extended Q-bilinearly to Λ(U)⊗^Λ(V), one has ⟨f[U]g[V] ∣ σ[UVW]⟩U,V=(f∗g)[W]. By step 2.2 applied to the pair (UV,W), σ[UVW]=∑ρ⊢dzρ−1pρ[U]pρ[V]pρ[W] in the relevant degree, and the pairing is a finite sum because only ρ⊢d matches the bidegree (d,d) of f[U]g[V]. Writing f=∑ρaρpρ and g=∑ρbρpρ, so that ⟨f,pρ⟩H=aρzρ and ⟨g,pρ⟩H=bρzρ by [F8], the left side is ∑ρ⊢dzρ−1pρ[W]aρbρzρ2=∑ρaρbρzρpρ[W], which is (f∗g)[W] by the power-sum diagonalization [F9].

4.1F8F9step 2.2step 3.2

Plethysm (b). Keep U,V,W independent formal alphabet variables. Apply step 2.2 to the pair (UV,W): σ[UVW]=∑λsλ[UV]sλ[W]. Pairing with f[U]g[V] and using step 3.2 gives ∑λ⟨f[U]g[V],sλ[UV]⟩U,Vsλ[W]=(f∗g)[W]=∑λ⟨f∗g,sλ⟩Hsλ[W], the last equality being the orthonormal expansion [F8]. Comparing coefficients of sλ[W], legitimate exactly as in step 3.1, yields ⟨f[U]g[V],sλ[UV]⟩U,V=⟨f∗g,sλ⟩H. Taking f=sμ, g=sν of degree d gives ⟨sμ[U]sν[V],sλ[UV]⟩U,V=gμνλ by [F9] and [F8]. The products sμ[U]sν[V] with μ,ν⊢d are an orthonormal basis of the bidegree-(d,d) piece of Λ(U)⊗^Λ(V) for the tensor Hall form, because tensor products of orthonormal families are orthonormal and each bidegree piece is finite dimensional; expanding sλ[UV] in that basis gives sλ[UV]=∑μ,νgμνλsμ[U]sν[V]. This is a finite identity in the independent power sums of U,V, so applying the two specialization homomorphisms proves (b) for arbitrary A,B.

5.1F1F7F9step 3.1step 4.1∎

Finiteness, empty case and choice. In (a), cμνλ=0 unless μ⊆λ and ∣μ∣+∣ν∣=∣λ∣, so only finitely many pairs contribute, and the identity is verified coefficient of sλ[Z] by coefficient of sλ[Z]. In (b), gμνλ=0 unless ∣μ∣=∣ν∣=∣λ∣ by [F9], so again only finitely many pairs contribute. Both identities hold for arbitrary specializations into arbitrary commutative Q-algebras, and the proofs use only finite sums, finite bases and the substitution of step 1.1; no choice principle is used. The empty case is included: s∅=1 and c∅,∅∅=g∅,∅∅=1, so both displays hold for λ=∅.

Depends on

Used by

Dependency tree · two levels

55 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