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 omega involution conjugates Schur functions
Statement
Let be the graded -algebra endomorphism determined by for every . Then is an involution and
Facts & Assumptions
Given: The stable graded ring, the free stable elementary and complete generators, the finite reciprocal-series identity, the stable power sums, partition conjugation, and both Jacobi–Trudi formulas.
The degreewise inverse-limit ring has coordinatewise multiplication and finite degree support (The stable graded ring of symmetric functions).
The stable elements satisfy , and the are algebraically independent generators; the are also stable homogeneous elements (Elementary and complete families freely generate the stable ring).
In each finite rank, , where and (The generating-series identity ).
For , is the compatible sequence of finite power sums (Power sums form a rational but not integral stable basis).
Partition conjugation is an involution: (Partitions, English diagrams, and conjugation).
For every partition , for all allowed determinant sizes, with zero padding and negative-index terms zero (Jacobi–Trudi and dual Jacobi–Trudi identities).
Proof
By [F3], each finite-rank coefficient of is zero. By [F1] and [F2], these are projections of stable coefficients, so equality of every projection gives in . For finite rank , write and . The finite identity [F3] gives . Differentiating this finite product and expanding each geometric series gives . Each coefficient is stable by [F1], [F2], and [F4], so equality of all rank projections gives in , where and is invertible because its constant term is .
Since freely by [F2], replacing each polynomial generator by the stable element defines a unique unital graded -algebra endomorphism of .
The coefficient of in the stable identity of step 1.1 gives for each . Applying and using gives . Reversing the index in the original recurrence also gives . Starting with , induction on makes these last two sums identical after the leading term, so . Therefore for every free generator; hence is the identity on and is a ring automorphism. It sends to and to .
For a partition , apply to the Jacobi–Trudi determinant in [F6]; for nonnegative indices step 2.1 gives , and for negative indices both are zero by [F6] and . Multiplicativity and additivity therefore give . Apply the dual formula in [F6] to with determinant size , which is allowed because and [F5] identifies . Thus this determinant is , including at the minimal allowed size. The empty case gives . For the size-one determinant gives , where is the coefficient of in the stable identity of step 1.1.
Extend to and apply it coefficientwise to the logarithmic-derivative identity of step 1.1. By step 2.1, , and a coefficientwise ring map commutes with formal differentiation and inverses of series with constant term ; hence . At rank , replacing by in [F3] gives , so . Each coefficient is stable by [F1], [F2], and [F4]; therefore in . Comparing coefficients proves for every , including the endpoint .
Depends on
Used by
Nothing in the library uses this result yet.
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.6)–(2.7), (2.10), (2.10′), and (2.13), printed pp. 21–24; §3, equation (3.8), printed pp. 42–43 (standard reference, not scraped)
- Jeremy L. Martin, Lecture Notes on Algebraic Combinatorics, §9.5, printed pp. 180–181 (standard reference, not scraped)