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.
Elementary and complete families freely generate the stable ring
Statement
For each , let be the stable sequences obtained from the finite elementary and complete homogeneous symmetric polynomials (The elementary symmetric polynomials , Power sums and complete homogeneous symmetric polynomials ) by setting each added variable to zero. Set , and for a partition write and . Then each family of generators is algebraically independent over , and for every the families and are -bases of .
Facts & Assumptions
Given: The degreewise stable ring, its monomial basis, and the finite-rank elementary, complete, dominance, and generating-series conventions.
Multiplication of degree- and degree- sequences is coordinatewise and lies in ; elements of have finite degree support (The stable graded ring of symmetric functions).
For and each partition , the stable orbit sum projects to the finite orbit sum when , and the family indexed by is a -basis of (The monomial symmetric functions form the integral stable basis).
For , each stable orbit sum projects to the corresponding rank- orbit sum (The monomial symmetric functions form the integral stable basis).
Conjugation sends a partition to a partition of the same integer, and is an involution (Partitions, English diagrams, and conjugation).
In finite rank, is the sum of the squarefree monomials indexed by the -element subsets of , with (The elementary symmetric polynomials ).
In finite rank, is the sum of all monomials with , and (Power sums and complete homogeneous symmetric polynomials ).
The dominance relation means for every (Dominance order on partitions).
In each finite rank, the generating series satisfy (The generating-series identity ).
At rank , is the sum of the distinct monomials whose exponent tuples lie in the variable-permutation orbit of (Monomial symmetric polynomials indexed by partitions).
At rank , the polynomials 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
For each fixed , specializing an added variable to zero sends the finite and to their lower-rank polynomials: terms involving that variable vanish, and the remaining subset or exponent tuples are unchanged. They therefore define homogeneous compatible sequences in by [F1], [F4], and [F5].
Fix and a rank . In expanding , regard each factor as a column of height and record the distinct variable labels selected by [F4]. For any resulting monomial, relabel variables so its exponents are weakly decreasing and call that exponent partition . Among the first variable labels each column contributes at most occurrences. Hence so by [F3] and [F6]. Since the factors are symmetric, relabeling does not change the coefficient of the orbit sum.
Fix . At every finite rank , the coefficient of in [F7] gives the recurrence among the rank- components of and . By [F1], [F4], [F5], and step 1.1, these are the rank- projections of the corresponding stable products. Since the recurrence holds at every rank, it is the zero sequence in ; the constant coefficient is . Thus coefficientwise in the stable ring.
Consider the monomial in rank . Its first- exponent sum is for each . In a selection contributing this monomial, each column contributes at most to that prefix, so equality of the total forces equality in every column for every . A column of height must therefore select precisely labels ; this is one selection. Hence the coefficient of the monomial, and therefore of the orbit sum , in is one.
Fix and project to rank . By [F10], each stable basis element projects to the rank- orbit sum; [F8] identifies its distinct monomial terms, and [F9] says these projections form a -basis. Thus the projection identifies stable and finite monomial coefficients. The rank- expansion of each therefore gives the stable transition matrix. Its entries are integers, vanish unless by step 1.2, and have diagonal entries one by step 2.2. Ordering the finite dominance poset by a linear extension makes this matrix unitriangular, hence invertible over . The degree case is the single basis element . By [F2], the are an integral basis; by the conjugation bijection [F3], the products are also an integral basis.
Give a variable weight . The degree- monomials in the polynomial ring are exactly for . Sending to sends these degree- monomials to the basis from step 3.1, so the map is bijective in every degree. Since every polynomial and every element of has finite degree support by [F1], it is an isomorphism of graded rings. Thus the freely generate .
Because the freely generate by step 4.1, the assignment extends to a graded ring homomorphism. The coefficient recurrence in step 2.1 and the same identity with replaced by give, for each , and . Apply to the first recurrence and induct on , starting from . If for , the resulting equation and the second recurrence have identical terms except for and , so . Hence fixes each generator , and so is an automorphism. It carries the basis from step 3.1 to , proving that the form an integral basis and that the are algebraically independent.
Depends on
- The stable graded ring of symmetric functions
- Partitions, English diagrams, and conjugation
- The monomial symmetric functions form the integral stable basis
- Monomial symmetric polynomials indexed by partitions
- Monomial symmetric polynomials form an $R$-basis of the symmetric-polynomial ring
- The elementary symmetric polynomials $e_0,e_1,\ldots,e_n$
- Power sums $p_k$ and complete homogeneous symmetric polynomials $h_k$
- Dominance order on partitions
- The generating-series identity $E(-t)H(t)=1$
Used by
- A nonzero stable Schur function can vanish in too few variables Counterexample
- Power sums fail to span integrally in degree two Counterexample
- The Hall inner product on symmetric functions Definition
- A disconnected skew Schur function factors Example
- 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
- Power sums form a rational but not integral stable basis Proposition
- The omega involution conjugates Schur functions Proposition
- Jacobi–Trudi and dual Jacobi–Trudi identities Theorem
- Power-sum, complete, and Schur expansions of the Cauchy kernel Theorem
- Schur functions form an orthonormal integral basis 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–3 (standard reference, not scraped)
- Jeremy L. Martin, Lecture Notes on Algebraic Combinatorics, §§9.4–9.5 (standard reference, not scraped)