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 series σ: product formula, Cauchy identity, adjunction and reproducing kernel

Statement

Let σ[X]=∑n≥0hn[X] be the series of Specializations of symmetric functions and the series σ, and let ⟨ , ⟩H be the Hall form (The Hall inner product on symmetric functions).

  1. σ[X]=∏x∈X(1−x)−1 and σ[−X]=∏x∈X(1−x) for honest alphabets X; in particular σ[t]=(1−t)−1 and σ[−t]=1−t for the one-letter alphabet t, as formal series in t.
  2. σ[A+B]=σ[A] σ[B] for all specializations A,B, and for the one-letter alphabet t one has σ[tA]=∑n≥0tnhn[A].
  3. Cauchy identity: σ[XY]=∑λsλ[X]sλ[Y]=∑λzλ−1pλ[X]pλ[Y] for all specializations X,Y, summed by degree.
  4. For every specialization A, the operator σ[AX⊥] is the adjoint of multiplication by σ[AX]: σ[AX⊥]f[X]=f[X+A] for all f∈Λ.
  5. Reproducing kernel: ⟨σ[AX] ∣ f[X]⟩X=f[A] for all f∈Λ and all specializations A.

Facts & Assumptions

Given: Specializations A,B,U,X,Y into commutative Q-algebras, a partition λ, 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], pk[tA]=tkpk[A], and X⊥ the specialization f[X⊥]=f⊥, where f⊥ is the adjoint of multiplication by f; σ[X]=∑nhn[X] (Specializations of symmetric functions and the series σ).

[F2]

hn=∑λ⊢npλ/zλ, and at every honest alphabet ∑n(∑λ⊢n(−1)ℓ(λ)pλ/zλ)tn=∏x(1−xt); also hk[t]=tk and en[t]=0 for n≥2 on the one-letter alphabet t (Complete homogeneous functions expand in power sums with cycle-distribution coefficients, Power sums pk and complete homogeneous symmetric polynomials hk).

[F3]

Newton's identities and the fundamental theorem of symmetric polynomials: kek=∑i=1k(−1)i−1ek−ipi over Q, and substitution Tk↦ek is an isomorphism from a polynomial ring onto the symmetric polynomials in n variables (Newton's identities: kek=∑i=1k(−1)i−1ek−ipi, Fundamental theorem of symmetric polynomials: unique expression as a polynomial in e1,…,en).

[F4]

ΛQ=Q[p1,p2,… ] with {pλ:λ⊢d} a basis of ΛQd; the power sums are orthogonal, ⟨pρ,pσ⟩H=δρσzρ, and the Schur functions are orthonormal, ⟨sλ,sμ⟩H=δλμ (Power sums form a rational but not integral stable basis, Power sums are orthogonal for the Hall form, Schur functions form an orthonormal integral basis, Stable Schur functions from bialternants).

[F5]

In the bidegree completion the Cauchy kernel satisfies Ω(X,Y)=∑λsλ(X)sλ(Y) and Ω(X,Y)=∑λzλ−1pλ(X)pλ(Y), by diagonal bidegree; for N≥d the rank-N projection sends the basis mλ of Λd to the finite orbit sums, an isomorphism onto the degree-d symmetric polynomials (Bidegree completion of two symmetric-function rings, Power-sum, complete, and Schur expansions of the Cauchy kernel, The monomial symmetric functions form the integral stable basis, Monomial symmetric polynomials form an R-basis of the symmetric-polynomial ring, The stable graded ring of symmetric functions).

[F6]

sλ[U+V]=∑μ,νcμνλsμ[U]sν[V] and sλ[UV]=∑μ,νgμνλsμ[U]sν[V] for all specializations, and ⟨sλ,sρsμ⟩H=cρμλ (Schur functions on sums and products of alphabets, The Littlewood–Richardson rule for products of Schur functions, Littlewood--Richardson tableaux and coefficients).

[F7]

The adjoints of multiplication operators and of their degreewise sums satisfy (fg)⊥=f⊥g⊥=g⊥f⊥ (Specializations of symmetric functions and the series σ).

Proof

technique · direct
1.1F3

Transfer principle. Let d≥0. If an identity between polynomials in the values pk[X1],…,pk[Xr], k≤d, holds for all honest alphabets X1,…,Xr of at least d letters, then it holds for all specializations. Indeed, the substitution Ak(i)↦pk(x1(i),…,xd(i)) from Q[Ak(i)] to Q[x(1),…,x(r)] is injective: by [F3] over Q one has Q[e1,…,ed]=Q[p1,…,pd] inside the symmetric polynomials in d variables, and the elementary symmetric polynomials are algebraically independent by the fundamental theorem; tensor products of injective substitutions over the field Q are injective.

2.1F1F2F4step 1.1

Product formula and negation (1). For an honest alphabet X, ∑nhn[X]tn=∏x∈X(1−xt)−1 by [F2], so the series σ[X] equals ∏x∈X(1−x)−1 coefficientwise at t=1. Next, hn[−U]=(−1)nen[U] for every specialization U: both sides are polynomials in the values pk[U], k≤n, by [F4], and at honest alphabets the generating function of [F2] gives ∑nhn[−x]tn=exp⁡(−∑kpk(x)tk/k)=∏x(1−xt)=∑n(−1)nen(x)tn, so the identity follows from step 1.1 with d=n. Hence σ[−U]=∑n(−1)nen[U], which at an honest alphabet is ∏x∈X(1−x); at the one-letter alphabet t, hn[−t]=0 for n≥2 and h1[−t]=−t, so σ[−t]=1−t, while hn[t]=tn gives σ[t]=∑ntn=(1−t)−1 as a formal series.

2.2F1F4step 1.1

Reduction to honest alphabets. Every value f[U] of f∈ΛQn is the value at (p1[U],…,pn[U]) of a universal polynomial with rational coefficients, by the power-sum basis [F4]; the same holds for hn[U+V], hn[UV] and sλ[U+V]. Hence by step 1.1 such identities may be verified on honest alphabets with at least n letters, and that is how the remaining steps proceed.

3.1F1F2step 2.2

(2) Multiplicativity and the one-letter scaling. For honest alphabets X,Y, ∑nhn[X⊔Y]tn=∏ℓ∈X⊔Y(1−ℓt)−1=(∑ihi[X]ti)(∑jhj[Y]tj) by [F2], so hn[A+B]=∑i+j=nhi[A]hj[B] holds on honest alphabets and hence, by step 2.2 with d=n, for all specializations; summing over n gives σ[A+B]=σ[A]σ[B]. Since pk[tA]=tkpk[A] and hn is homogeneous of weight n in the power sums, hn[tA]=tnhn[A], so σ[tA]=∑ntnhn[A].

3.2F2F5step 2.2

(3) Cauchy identity. For honest alphabets X,Y and d≥0, apply the degree-d rank-N projection of [F5] (with N≥d) to the two Cauchy expansions of Ω: it produces hd[XY]=∑λ⊢dsλ[X]sλ[Y]=∑ρ⊢dzρ−1pρ[X]pρ[Y], the outer equality by [F2]. By step 2.2 with d, the identity hd[XY]=∑λ⊢dsλ[X]sλ[Y] holds for all specializations, and summing over d gives σ[XY]=∑λsλ[X]sλ[Y] by degree.

4.1F1F4F6F7step 3.2

(4) Adjointness. By step 3.2, σ[AX]=∑λsλ[A]sλ[X], so the adjoint of multiplication by σ[AX] is ∑λsλ[A]sλ⊥ degree by degree. On the other hand pρ[X⊥]=pρ⊥=∏i(pρi)⊥=(pρ)⊥ by [F1] and [F7], so hn[AX⊥]=∑ρ⊢nzρ−1pρ[A]pρ⊥=hn[AX]⊥ and σ[AX⊥]=σ[AX]⊥. To evaluate this adjoint, compute on the Schur basis: by [F6], sλ[X+A]=∑ρ,νcρνλsρ[X]sν[A], so ⟨sλ[X+A],sμ[X]⟩X=∑νcμνλsν[A]; and ⟨σ[AX]⊥sλ,sμ⟩X=⟨sλ,σ[AX]sμ⟩X=∑ρsρ[A]⟨sλ,sρsμ⟩X=∑ρcρμλsρ[A] by [F6] and [F4]. The two results agree for every μ, so by nondegeneracy of the Hall form σ[AX⊥]sλ=sλ[X+A] for every λ, and by linearity for all f.

5.1F4step 3.2∎

(5) Reproducing kernel. For every partition λ, ⟨σ[AX],sλ[X]⟩X=∑μsμ[A]⟨sμ[X],sλ[X]⟩X=sλ[A] by step 3.2 and orthonormality [F4]; by linearity in f this gives ⟨σ[AX] ∣ f[X]⟩X=f[A] for all f∈Λ.

Depends on

Used by

Dependency tree · two levels

37 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