Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 r≥0, let er,hr∈Λr be the stable sequences obtained from the finite elementary and complete homogeneous symmetric polynomials (The elementary symmetric polynomials e0,e1,…,en, Power sums pk and complete homogeneous symmetric polynomials hk) by setting each added variable to zero. Set e0=h0=1, and for a partition λ=(λ1,λ2,…) write eλ=∏ieλi and hλ=∏ihλi. Then Λ=Z[e1,e2,…]=Z[h1,h2,…], each family of generators is algebraically independent over Z, and for every d≥0 the families {eλ:λ⊢d} and {hλ:λ⊢d} are Z-bases of Λd.

Facts & Assumptions

Given: The degreewise stable ring, its monomial basis, and the finite-rank elementary, complete, dominance, and generating-series conventions.

[F1]

Multiplication of degree-a and degree-b sequences is coordinatewise and lies in Λa+b; elements of Λ have finite degree support (The stable graded ring of symmetric functions).

[F2]

For d≥0 and each partition λ⊢d, the stable orbit sum mλ∈Λd projects to the finite orbit sum mλ(x1,…,xN) when ℓ(λ)≤N, and the family indexed by λ⊢d is a Z-basis of Λd (The monomial symmetric functions form the integral stable basis).

[F10]

For N≥d, each stable orbit sum mμ projects to the corresponding rank-N orbit sum (The monomial symmetric functions form the integral stable basis).

[F3]

Conjugation sends a partition λ to a partition λ′ of the same integer, and λ↦λ′ is an involution (Partitions, English diagrams, and conjugation).

[F4]

In finite rank, ek(x1,…,xN) is the sum of the squarefree monomials indexed by the k-element subsets of {1,…,N}, with e0=1 (The elementary symmetric polynomials e0,e1,…,en).

[F5]

In finite rank, hk is the sum of all monomials x1a1⋯xNaN with a1+⋯+aN=k, and h0=1 (Power sums pk and complete homogeneous symmetric polynomials hk).

[F6]

The dominance relation λ⊵μ means ∑i=1rλi≥∑i=1rμi for every r≥1 (Dominance order on partitions).

[F7]

In each finite rank, the generating series satisfy E(−t)H(t)=1 (The generating-series identity E(−t)H(t)=1).

[F8]

At rank N, mλ is the sum of the distinct monomials whose exponent tuples lie in the variable-permutation orbit of λ (Monomial symmetric polynomials indexed by partitions).

[F9]

At rank N, the polynomials mλ indexed by partitions of length at most N form a Z-basis of the symmetric polynomials (Monomial symmetric polynomials form an R-basis of the symmetric-polynomial ring).

Proof

technique · triangularity
1.1F1F4F5

For each fixed r, specializing an added variable to zero sends the finite er and hr 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 Λr by [F1], [F4], and [F5].

1.2F3F4F6

Fix λ⊢d and a rank N≥d. In expanding eλ′=∏jeλj′, regard each factor as a column of height λj′ 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 r variable labels each column contributes at most min⁡(r,λj′) occurrences. Hence ∑i=1rμi≤∑jmin⁡(r,λj′)=∑i=1rλi, so λ⊵μ by [F3] and [F6]. Since the factors are symmetric, relabeling does not change the coefficient of the orbit sum.

2.1F1F4F5F7step 1.1

Fix n≥1. At every finite rank N≥0, the coefficient of tn in [F7] gives the recurrence among the rank-N components of ei and hn−i. By [F1], [F4], [F5], and step 1.1, these are the rank-N projections of the corresponding stable products. Since the recurrence holds at every rank, it is the zero sequence in Λn; the constant coefficient is e0h0=1. Thus E(−t)H(t)=1 coefficientwise in the stable ring.

2.2F3F4F6step 1.2

Consider the monomial x1λ1x2λ2⋯ in rank N≥d. Its first-r exponent sum is ∑i=1rλi=∑jmin⁡(r,λj′) for each r. In a selection contributing this monomial, each column contributes at most min⁡(r,λj′) to that prefix, so equality of the total forces equality in every column for every r. A column of height h must therefore select precisely labels 1,…,h; this is one selection. Hence the coefficient of the monomial, and therefore of the orbit sum mλ, in eλ′ is one.

3.1F2F3F6F8F9F10step 1.2step 2.2

Fix d>0 and project to rank N=d. By [F10], each stable basis element mμ projects to the rank-d orbit sum; [F8] identifies its distinct monomial terms, and [F9] says these projections form a Z-basis. Thus the projection identifies stable and finite monomial coefficients. The rank-d expansion of each eλ′ 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 Z. The degree d=0 case is the single basis element e∅=m∅=1. By [F2], the mμ are an integral basis; by the conjugation bijection [F3], the products eκ are also an integral basis.

4.1F1step 3.1

Give a variable Er weight r. The degree-d monomials in the polynomial ring Z[E1,E2,…] are exactly Eλ for λ⊢d. Sending Er to er sends these degree-d monomials to the basis eλ 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 er freely generate Λ.

5.1step 2.1step 3.1step 4.1∎

Because the er freely generate Λ by step 4.1, the assignment ω(er)=hr extends to a graded ring homomorphism. The coefficient recurrence in step 2.1 and the same identity with t replaced by −t give, for each n≥1, hn−e1hn−1+e2hn−2−⋯+(−1)nen=0 and en−h1en−1+h2en−2−⋯+(−1)nhn=0. Apply ω to the first recurrence and induct on n, starting from ω(h0)=1=e0. If ω(hj)=ej for j<n, the resulting equation and the second recurrence have identical terms except for ω(hn) and en, so ω(hn)=en. Hence ω2 fixes each generator en, and so ω is an automorphism. It carries the basis eλ from step 3.1 to hλ, proving that the hλ form an integral basis and that the hr are algebraically independent.

Depends on

Used by

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