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 sums fail to span integrally in degree two
Statement
In degree two, the integral stable symmetric function cannot be expressed as a -linear combination of and . Thus the power-sum family does not span over .
Facts & Assumptions
Given: The stable graded ring, the finite power-sum and complete-homogeneous conventions, the finite monomial orbit sums, the stable monomial and complete bases, and the rational power-sum basis.
Each is the inverse limit of its finite-rank homogeneous symmetric-polynomial pieces, and the rank- projections are compatible (The stable graded ring of symmetric functions).
In rank , for , and is the sum of all monomials of total degree (Power sums and complete homogeneous symmetric polynomials ).
At rank , is the sum of the distinct monomials in the variable-permutation orbit of the padded partition (Monomial symmetric polynomials indexed by partitions).
The stable are the compatible sequences obtained from the finite by setting added variables to zero (Elementary and complete families freely generate the stable ring).
The stable functions and form a -basis of , and projection to rank identifies this basis with the finite orbit sums (The monomial symmetric functions form the integral stable basis).
The stable power-sum products for form a -basis of (Power sums form a rational but not integral stable basis).
In rank , the monomial 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).
Proof
At rank two, [F2] and [F3] give , , , , and . By [F7], and are a basis in rank two; by [F5] and the stable-ring projection in [F1], the rank-two projection carries the stable basis to that finite basis and is an isomorphism. The stable projects to its finite polynomial by [F2] and [F4], and the finite power sums form compatible stable sequences by [F1] and [F2]. Thus the same three equations hold in . At rank one the three finite functions all equal , while rank zero has no degree-two monomials; rank two is the first rank that distinguishes the two monomial orbits.
Since , step 1.1 yields . By [F6], and are a -basis, so this is the unique rational coordinate vector of . If for integers , including zero values, uniqueness forces , impossible. Equivalently, comparison in the integral basis of [F5] forces the coefficient to satisfy . Thus is a witness to failure of integral spanning.
Depends on
- The stable graded ring of symmetric functions
- Power sums $p_k$ and complete homogeneous symmetric polynomials $h_k$
- Monomial symmetric polynomials indexed by partitions
- Monomial symmetric polynomials form an $R$-basis of the symmetric-polynomial ring
- The monomial symmetric functions form the integral stable basis
- Elementary and complete families freely generate the stable ring
- Power sums form a rational but not integral stable basis
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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.10)–(2.14′), printed pp. 23–25 (standard reference, not scraped)
- Jeremy L. Martin, Lecture Notes on Algebraic Combinatorics, §9.6, printed pp. 181–183 (standard reference, not scraped)