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.
Jacobi–Trudi and dual Jacobi–Trudi identities
Statement
For every partition , let be the stable Schur function defined by bialternants (Stable Schur functions from bialternants). For any integers and , pad and with zero parts to lengths and , respectively. Then where are the stable complete and elementary functions (Elementary and complete families freely generate the stable ring, The elementary symmetric polynomials , Power sums and complete homogeneous symmetric polynomials ). In these determinants use , set for , and take the empty determinant to be .
Facts & Assumptions
Given: The stable graded ring, partition conjugation, the bialternant definition of , stable , and their finite-rank conventions.
Each is the inverse limit of the degree- finite symmetric-polynomial parts, and has coordinatewise multiplication (The stable graded ring of symmetric functions).
The conjugate partition has parts , its length is , and (Partitions, English diagrams, and conjugation).
For , the finite Schur polynomial is the bialternant quotient , and its compatible rank sequence defines (Stable Schur functions from bialternants).
The finite sequences specialize compatibly to stable elements, have , and the are algebraically independent generators of (Elementary and complete families freely generate the stable ring).
In rank , is the sum of squarefree monomials indexed by the -element subsets, with and for (The elementary symmetric polynomials ).
In rank , is the sum of all monomials of total degree , with (Power sums and complete homogeneous symmetric polynomials ).
In every finite rank, , with and (The generating-series identity ).
Proof
For each , take the coefficient of in the finite identity [F7] at every rank . By [F4] and [F5], these coefficients are the rank projections of the stable products . Since all projections vanish, the inverse-limit element is zero by [F1]; the constant coefficient is . Hence coefficientwise in .
Fix a finite rank and let be the elementary polynomial in the variables other than . By [F5] and [F7], . For , define , , and . Taking the coefficient of gives .
If , then by [F3], and either determinant is upper unitriangular or empty, hence equals . Otherwise fix any finite rank . Put and . For , is upper triangular with diagonal , so . For , is the bialternant numerator and . Taking determinants in and using gives ; by [F3] this is the rank- Schur polynomial. Appending a zero part to changes the determinant to , so its value is independent of determinant size; hence for every rank the size- determinant equals the rank- Schur polynomial. Compatibility gives equality in .
For the chosen sizes , index matrices by and set and when , with both entries zero when . Step 1.1 gives coefficientwise; both matrices are upper unitriangular, so and .
If , each determinant is upper unitriangular, or empty, and equals . Otherwise pad and with zero parts to the chosen sizes and set and . In increasing order, the minor is the transpose of with both orders reversed, so . Its complements are and . The listed indices are strictly increasing and lie in . None equals , since equality would give : if the left side is at least , and if it is at most . The two sets have distinct indices in total and are therefore complementary. At rank , the bialternant numerator and denominator are nonzero: the strictly decreasing exponents give distinct monomials in the numerator determinant, and the Vandermonde denominator is nonzero. Thus ; by [F4], is a domain. Over , is invertible by step 2.1. Reorder rows as and columns as , giving . Block elimination gives , while the lower-right block of is . Thus . Moving an increasing index set of size to the front has sign ; the row and column reorderings therefore give . Since and , this sign is . The complementary minor has entries ; a negative subscript gives zero by the stated convention. Factoring row and column signs contributes , which cancels the permutation sign. Therefore . For and , these are and , each the sum of the variables by [F5] and [F6].
Depends on
- The stable graded ring of symmetric functions
- Partitions, English diagrams, and conjugation
- Stable Schur functions from bialternants
- Elementary and complete families freely generate the stable ring
- The generating-series identity $E(-t)H(t)=1$
- The elementary symmetric polynomials $e_0,e_1,\ldots,e_n$
- Power sums $p_k$ and complete homogeneous symmetric polynomials $h_k$
Used by
- A nonzero stable Schur function can vanish in too few variables Counterexample
- Skew Schur functions by Hall adjointness Definition
- Cauchy kernel through bidegree three Example
- The five standard symmetric-function bases in degree three Example
- The omega involution conjugates Schur functions Proposition
- Schur functions form an orthonormal integral basis Theorem
- Skew Jacobi–Trudi and tableau expansion Theorem
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–3, equations (2.9′), (3.4)–(3.7), printed pp. 22–23 and 41–42 (standard reference, not scraped)
- Jeremy L. Martin, Lecture Notes on Algebraic Combinatorics, §9.8, printed pp. 187–190 (standard reference, not scraped)