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 form a rational but not integral stable basis
Statement
For , let be the compatible sequence of finite power-sum polynomials (The stable graded ring of symmetric functions, Power sums and complete homogeneous symmetric polynomials ). For a partition , set (Partitions, English diagrams, and conjugation). Write and . Then and for every , the family is a -basis of . These families are not in general -bases of : in degree two, has nonintegral coordinates in the power-sum basis.
Facts & Assumptions
Given: The degreewise stable ring, the finite power-sum and complete-homogeneous conventions, the stable complete basis, and the partition indexing convention.
is the inverse limit of the degree- finite symmetric-polynomial parts, and is a graded ring with coordinatewise multiplication and finite degree support (The stable graded ring of symmetric functions).
In rank , for , and is the sum of all monomials of total degree , with (Power sums and complete homogeneous symmetric polynomials ).
The stable freely generate over , are algebraically independent, and is an integral basis of (Elementary and complete families freely generate the stable ring).
A partition of is a finite weakly decreasing sequence of positive integers summing to , and for the only partition is (Partitions, English diagrams, and conjugation).
Proof
For each , setting a newly added variable to zero sends the finite rank- power sum to the rank- power sum. Hence these are compatible sequences by [F1] and [F2]; the are already the stable homogeneous elements supplied by [F3].
In rank , multiplying the geometric series for shows from [F2] that . Differentiating this finite product gives .
Write in . The finite identity of step 1.2 holds at every rank, and each coefficient of , , and is a stable homogeneous sequence by [F1] and step 1.1. Equality of every rank projection therefore gives . Comparing coefficients of yields the Newton recurrence for every .
Since , step 2.1 can be solved in either direction as and . Induction shows that each is a polynomial in with leading term , and each is a polynomial over in with leading term . Because these equations solve the same recurrence for its last unknown and each is invertible in , induction verifies that the two substitutions are inverse through every finite index.
For each finite , the mutually inverse triangular substitutions of step 3.1 identify with . By [F3], the are algebraically independent over and remain so over by clearing denominators; hence the are algebraically independent and generate after scalar extension, using the graded direct sum [F1]. A degree- monomial in variables of weights is exactly for a partition by [F4]; these monomials therefore form a -basis of , including at .
At , step 2.1 gives ; at it gives , hence . The element belongs to the integral stable ring by [F2] and [F3], while step 4.1 makes and a -basis of degree two. Uniqueness of those rational coordinates and their nonintegral values show that is not in their -span, so the power sums do not form an integral basis in degree two.
Depends on
Used by
- Power sums are orthogonal for the Hall form Corollary
- Power sums fail to span integrally in degree two Counterexample
- The five standard symmetric-function bases in degree three Example
- The omega involution conjugates Schur functions Proposition
- Power-sum, complete, and Schur expansions of the Cauchy kernel Theorem
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.12) and (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)