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.
Stable Schur functions from bialternants
Definition
For a partition and an integer , pad with zero parts to length and set . Define the alternating polynomial and define by the same formula with . The finite-rank Schur polynomial is For , define . Thus a component is specified at every rank, including rank zero; empty determinants have value .
Well-definedness and stability. The exponents are strictly decreasing, so the numerator is alternating. Setting makes it zero; the factor theorem therefore gives divisibility by each in . These pairwise nonassociate prime factors therefore have product dividing the numerator, so the quotient is an integral polynomial. Since numerator and denominator both change by the sign of a variable permutation, their quotient is symmetric. Its degree is .
If , setting in the rank- numerator and denominator expands each determinant along its last row; both resulting minors have the common factor , and after cancelling it the quotient is exactly the rank- quotient. At the remaining boundary , every exponent in the rank- numerator is positive, so its last row becomes zero when . The denominator specializes to , a nonzero polynomial (equal to when ). Specializing the polynomial identity and cancelling this nonzero polynomial shows that the specialized Schur polynomial is zero, as required by the rank- definition. Below this boundary both components are zero. Hence these polynomials form a compatible sequence in the inverse limit The stable graded ring of symmetric functions, defining . With the empty determinant equal to , . The partition length and padding convention is that of Partitions, English diagrams, and conjugation.
At the minimal rank , the one-box partition gives directly from the quotient; its stable sequence is nonzero.
Depends on
Used by
- A nonzero stable Schur function can vanish in too few variables Counterexample
- The Kostka change of basis is dominance-unitriangular Lemma
- Jacobi–Trudi and dual Jacobi–Trudi identities Theorem
- Power-sum, complete, and Schur expansions of the Cauchy kernel Theorem
- Skew Jacobi–Trudi and tableau expansion Theorem
Dependency tree · two levels
4 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 §3 (standard reference, not scraped)
- Jeremy L. Martin, Lecture Notes on Algebraic Combinatorics, §9.13 (standard reference, not scraped)