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 be the Cauchy kernel in the bidegree completion Bidegree completion of two symmetric-function rings. In , In the componentwise rational completion it also has the expansion All three sums are by bidegree ; the empty products indexed by equal .
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.
The completed tensor product is the product of bidegree pieces, and is the diagonal-bidegree stable limit of the finite products (Bidegree completion of two symmetric-function rings).
Each is the inverse limit of finite rank- symmetric-polynomial pieces, with coordinatewise multiplication (The stable graded ring of symmetric functions).
For , is the compatible sequence of finite monomial orbit sums, and is a -basis of (The monomial symmetric functions form the integral stable basis).
The finite orbit sum is the sum of the distinct monomials whose exponent tuples are permutations of the padded tuple (Monomial symmetric polynomials indexed by partitions).
In rank , the finite orbit sums indexed by partitions of length at most form a -basis of the symmetric polynomials (Monomial symmetric polynomials form an -basis of the symmetric-polynomial ring).
Each stable is the compatible sequence obtained from the finite by setting added variables to zero, and the products for form a -basis of (Elementary and complete families freely generate the stable ring).
In rank , is the sum of all monomials of total degree , while for (Power sums and complete homogeneous symmetric polynomials ).
The compatible generate freely, and is a -basis of (Power sums form a rational but not integral stable basis).
For , ; these finite quotients are compatible and define (Stable Schur functions from bialternants).
Proof
For , put , , and . Clearing denominators gives . This polynomial is alternating separately in the and variables. Vandermonde divisibility gives in . Since has degree at most in each individual variable and each Vandermonde has degree in each of its variables, the quotient has degree zero in every variable and is an integer constant. Here , and likewise for . To determine the constant, truncate each geometric series at a common exponent bound and apply finite Cauchy–Binet; the least possible total -degree uses the distinct exponents and contributes . Reversing exponent order changes both determinants by the same sign. This lowest-degree term is unchanged as increases, so it is the least-degree part of . Since has constant term in the variables, the least-degree part of is also , and the constant is . Thus , where . For the identity holds with empty determinants and products equal to .
Fix and . If , every partition of has length at most . By [F3], projection carries the stable basis to the finite orbit sums; by [F5] those form a basis of the rank- symmetric polynomials. Therefore is an isomorphism. For , it is the unit map . Tensoring these projection isomorphisms in the two variables makes equality at rank sufficient to prove equality in bidegree .
For , put , truncate each geometric series at exponent , apply finite Cauchy–Binet, and let increase; every fixed bidegree receives contributions from finitely many exponent sets, giving . The assignment is a bijection from these strictly increasing exponent sets to partitions of length at most , since strict increase makes the parts weakly decreasing and nonnegative.
At finite rank , write . Expand each geometric product as , since multiplying the one-variable geometric series gives the coefficient formula in [F7]. Hence . Sort the positive entries of each exponent tuple into a partition . Its coefficient is , and its distinct coordinate permutations sum to exactly by [F4]. Thus . Each bidegree has finitely many partitions; the kernel's stable coefficients are those finite-rank limits by [F1], so passing rank by step 1.2 proves the stable complete–monomial expansion.
At finite rank write . Formal logarithms over give . 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 . Thus formal logarithm and exponential are defined coefficientwise. By [F2], [F7], and [F8], the finite identity lifts to . Exponentiating and multiplying the commuting series over gives one term for each finitely supported multiplicity sequence , equivalently each partition . Its coefficient is . By [F8] these are the rational power-sum basis elements in the two degree- factors, proving the stated expansion.
Reversing the exponent columns in both determinants of step 1.3 changes each by , so their product becomes . By [F9], each alternant is times its finite Schur quotient. Combine the determinant expansion of step 1.3 with step 1.1 and cancel the nonzero polynomial in each homogeneous bidegree of the integral-domain polynomial ring; this gives .
For each bidegree , take 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 has empty determinants and products equal to , 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 , and to , so every expansion has coefficient one. These arguments include the threshold rank and the first allowed bialternant rank .
Depends on
- Bidegree completion of two symmetric-function rings
- The stable graded ring of symmetric functions
- The monomial symmetric functions form the integral stable basis
- Monomial symmetric polynomials indexed by partitions
- Monomial symmetric polynomials form an $R$-basis of the symmetric-polynomial ring
- Elementary and complete families freely generate the stable ring
- Power sums form a rational but not integral stable basis
- Stable Schur functions from bialternants
- Power sums $p_k$ and complete homogeneous symmetric polynomials $h_k$
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
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Chapter I §2, equations (2.14)–(2.15), printed pp. 24–25; §4, equations (4.1)–(4.3), printed pp. 62–63 (standard reference, not scraped)
- Jeremy L. Martin, Lecture Notes on Algebraic Combinatorics, §9.9, printed pp. 191–195 (standard reference, not scraped)