Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
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.

Power-sum, complete, and Schur expansions of the Cauchy kernel

Statement

Let Ω(x,y) be the Cauchy kernel in the bidegree completion Bidegree completion of two symmetric-function rings. In Λ(x)⊗^Λ(y), Ω(x,y)=∑λhλ(x)mλ(y)=∑λsλ(x)sλ(y). In the componentwise rational completion ∏a,b≥0(ΛQa(x)⊗QΛQb(y)), it also has the expansion Ω(x,y)=∑λzλ−1pλ(x)pλ(y),zλ:=∏r≥1rmr(λ)mr(λ)!,mr(λ):=#{i:λi=r}. All three sums are by bidegree (d,d); the empty products indexed by ∅ equal 1.

Facts & Assumptions

Given: The bidegree completion and its Cauchy kernel, the degreewise stable ring, the stable and finite monomial bases, the stable complete basis, the finite power-sum and complete-homogeneous conventions, the rational power-sum basis, and the bialternant definition of stable Schur functions.

[F1]

The completed tensor product is the product of bidegree pieces, and Ω is the diagonal-bidegree stable limit of the finite products ∏i,j(1−xiyj)−1 (Bidegree completion of two symmetric-function rings).

[F2]

Each Λd is the inverse limit of finite rank-N symmetric-polynomial pieces, with coordinatewise multiplication (The stable graded ring of symmetric functions).

[F3]

For λ⊢d, mλ∈Λd is the compatible sequence of finite monomial orbit sums, and {mλ:λ⊢d} is a Z-basis of Λd (The monomial symmetric functions form the integral stable basis).

[F4]

The finite orbit sum mλ(x1,…,xN) is the sum of the distinct monomials whose exponent tuples are permutations of the padded tuple λ (Monomial symmetric polynomials indexed by partitions).

[F5]

In rank N, the finite orbit sums indexed by partitions of length at most N form a Z-basis of the symmetric polynomials (Monomial symmetric polynomials form an R-basis of the symmetric-polynomial ring).

[F6]

Each stable hr is the compatible sequence obtained from the finite hr by setting added variables to zero, and the products hλ for λ⊢d form a Z-basis of Λd (Elementary and complete families freely generate the stable ring).

[F7]

In rank N, hk is the sum of all monomials of total degree k, while pr=∑i=1Nxir for r≥1 (Power sums pk and complete homogeneous symmetric polynomials hk).

[F8]

The compatible pr generate ΛQ freely, and {pλ:λ⊢d} is a Q-basis of ΛQd (Power sums form a rational but not integral stable basis).

[F9]

For N≥ℓ(λ), sλ(x1,…,xN)=aλ+δN(x)/aδN(x); these finite quotients are compatible and define sλ∈Λ∣λ∣ (Stable Schur functions from bialternants).

Proof

technique · direct
1.1F1algebra

For N≥1, put KN=((1−xiyj)−1)i,j=1N, PN=∏i,j=1N(1−xiyj), and DN=PNdet⁡KN. Clearing denominators gives DN=∑σ∈SNsgn⁡(σ)∏i∏j≠σ(i)(1−xiyj). This polynomial is alternating separately in the x and y variables. Vandermonde divisibility gives ΔN(x)ΔN(y)∣DN in Z[x1,…,xN,y1,…,yN]. Since DN has degree at most N−1 in each individual variable and each Vandermonde has degree N−1 in each of its variables, the quotient has degree zero in every variable and is an integer constant. Here ΔN(x)=det⁡(xiN−j), and likewise for y. To determine the constant, truncate each geometric series at a common exponent bound M≥N−1 and apply finite Cauchy–Binet; the least possible total y-degree uses the distinct exponents 0,1,…,N−1 and contributes ΔN(x)ΔN(y). Reversing exponent order changes both determinants by the same sign. This lowest-degree term is unchanged as M increases, so it is the least-degree part of det⁡KN. Since PN has constant term 1 in the y variables, the least-degree part of DN is also ΔN(x)ΔN(y), and the constant is 1. Thus det⁡KN=ΔN(x)ΔN(y)ΩN, where ΩN=PN−1. For N=0 the identity holds with empty determinants and products equal to 1.

1.2F2F3F5

Fix d≥0 and N≥d. If d>0, every partition of d has length at most d≤N. By [F3], projection carries the stable basis mλ to the finite orbit sums; by [F5] those form a basis of the rank-N symmetric polynomials. Therefore Λd→ANd is an isomorphism. For d=0, it is the unit map Z→Z. Tensoring these projection isomorphisms in the two variables makes equality at rank N≥d sufficient to prove equality in bidegree (d,d).

1.3F4algebra

For N≥1, put KN=((1−xiyj)−1)i,j=1N, truncate each geometric series at exponent M, apply finite Cauchy–Binet, and let M increase; every fixed bidegree receives contributions from finitely many exponent sets, giving det⁡KN=∑0≤k1<⋯<kNdet⁡(xikj)i,jdet⁡(yikj)i,j. The assignment λi=kN+1−i−(N−i) is a bijection from these strictly increasing exponent sets to partitions of length at most N, since strict increase makes the parts weakly decreasing and nonnegative.

2.1F1F4F6F7step 1.2algebra

At finite rank N, write ΩN=∏i,j=1N(1−xiyj)−1. Expand each geometric product as ∏i=1N(1−xiyj)−1=∑aj≥0haj(x1,…,xN)yjaj, since multiplying the N one-variable geometric series gives the coefficient formula in [F7]. Hence ΩN=∑(a1,…,aN)∈NN(∏jhaj(x))y1a1⋯yNaN. Sort the positive entries of each exponent tuple into a partition λ. Its coefficient is hλ(x), and its distinct coordinate permutations sum to exactly mλ(y) by [F4]. Thus ΩN=∑ℓ(λ)≤Nhλ(x)mλ(y). Each bidegree has finitely many partitions; the kernel's stable coefficients are those finite-rank limits by [F1], so passing rank N≥d by step 1.2 proves the stable complete–monomial expansion.

2.2F1F2F7F8step 1.2algebra

At finite rank write ΩN=∏i,j=1N(1−xiyj)−1. Formal logarithms over Q give log⁡ΩN=∑i,j∑r≥1(xiyj)r/r=∑r≥1pr(N)(x)pr(N)(y)/r. In the componentwise rational completion, the positive-degree part of Ω is topologically nilpotent for the bidegree filtration: each fixed bidegree receives contributions from only finitely many powers and finitely many r. Thus formal logarithm and exponential are defined coefficientwise. By [F2], [F7], and [F8], the finite identity lifts to log⁡Ω=∑r≥1pr(x)pr(y)/r. Exponentiating and multiplying the commuting series exp⁡(pr(x)pr(y)/r)=∑mr≥0(pr(x)pr(y))mr/(rmrmr!) over r≥1 gives one term for each finitely supported multiplicity sequence (mr), equivalently each partition λ. Its coefficient is 1/zλ. By [F8] these are the rational power-sum basis elements in the two degree-d factors, proving the stated expansion.

2.3F9step 1.1step 1.3algebra

Reversing the exponent columns in both determinants of step 1.3 changes each by (−1)N(N−1)/2, so their product becomes aλ+δN(x)aλ+δN(y). By [F9], each alternant is ΔN times its finite Schur quotient. Combine the determinant expansion of step 1.3 with step 1.1 and cancel the nonzero polynomial ΔN(x)ΔN(y) in each homogeneous bidegree of the integral-domain polynomial ring; this gives ΩN=∑ℓ(λ)≤Nsλ(x1,…,xN)sλ(y1,…,yN).

3.1F1step 1.2step 2.3algebra∎

For each bidegree (d,d), take N≥d and use the projection isomorphisms of step 1.2 to pass the finite Schur identity of step 2.3 to the stable completion. The empty rank N=0 has empty determinants and products equal to 1, and the empty partition gives the constant term in all three expansions. Setting either alphabet to zero leaves only that term; all off-diagonal components are zero by [F1]. At degree one, rank-one projection sends h(1),m(1),p(1), and s(1) to x1, so every expansion has coefficient one. These arguments include the threshold rank N=d and the first allowed bialternant rank N=ℓ(λ).

Depends on

Used by

Dependency tree · two levels

15 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