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 monomial symmetric functions form the integral stable basis
Statement
For and each partition , let be the compatible sequence whose rank- projection is the monomial orbit sum when , and is zero otherwise. Then is a -basis of .
Facts & Assumptions
Given: The stable graded ring and the finite-rank monomial orbit-sum convention.
An element of is a compatible sequence of homogeneous degree- symmetric polynomials, one in each rank (The stable graded ring of symmetric functions).
is the set of distinct tuples obtained by permuting the coordinates of . Repeated monomials are counted once, not with their stabilizer multiplicity (Monomial symmetric polynomials indexed by partitions).
As ranges over partitions of length at most , the polynomials form an -basis of (Monomial symmetric polynomials form an -basis of the symmetric-polynomial ring).
Proof
In degree , the only partition is , its orbit sum is the constant , and ; hence it is a basis.
Suppose and fix . Every partition of has at most parts, so every has . By [F3], the rank- orbit sums indexed by these partitions form a -basis of .
If , specializing to zero leaves exactly those orbit monomials whose positive exponents all lie among the first variables; these are precisely the distinct rank- orbit monomials, each once. Thus every transition is an isomorphism carrying the displayed basis to itself.
A compatible sequence in is uniquely determined by its rank- component. Expanding that component in the finite basis of [F3], compatibility and the basis-preserving isomorphisms of step 1.3 force the same integer coefficients at every rank ; lower-rank components are their specializations. Conversely, every finite integer combination of the compatible orbit sums gives such a sequence. Hence the stable orbit sums span and are linearly independent in .
Depends on
Used by
- Power sums fail to span integrally in degree two Counterexample
- The Hall inner product on symmetric functions Definition
- Cauchy kernel through bidegree three Example
- The five standard symmetric-function bases in degree three Example
- The Kostka change of basis is dominance-unitriangular Lemma
- Elementary and complete families freely generate the stable ring Theorem
- Power-sum, complete, and Schur expansions of the Cauchy kernel Theorem
Dependency tree · two levels
5 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 (standard reference, not scraped)
- Jeremy L. Martin, Lecture Notes on Algebraic Combinatorics, §9.3 (standard reference, not scraped)