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.

The monomial symmetric functions form the integral stable basis

Statement

For d≥0 and each partition λ⊢d, let mλ∈Λd be the compatible sequence whose rank-N projection is the monomial orbit sum mλ(x1,…,xN) when ℓ(λ)≤N, and is zero otherwise. Then {mλ:λ⊢d} is a Z-basis of Λd.

Facts & Assumptions

Given: The stable graded ring and the finite-rank monomial orbit-sum convention.

[F1]

An element of Λd is a compatible sequence of homogeneous degree-d symmetric polynomials, one in each rank (The stable graded ring of symmetric functions).

[F2]

Orb⁡(λ) 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).

[F3]

As λ ranges over partitions of length at most n, the polynomials mλ form an R-basis of R[x1,…,xn]Sym⁡n (Monomial symmetric polynomials form an R-basis of the symmetric-polynomial ring).

Proof

technique · direct
1.1F1F2

In degree d=0, the only partition is ∅, its orbit sum is the constant 1, and Λ0=Z; hence it is a basis.

1.2F3

Suppose d>0 and fix N≥d. Every partition of d has at most d parts, so every λ⊢d has ℓ(λ)≤N. By [F3], the rank-N orbit sums indexed by these partitions form a Z-basis of ANd.

1.3F1F2

If M>N≥d, specializing xN+1,…,xM to zero leaves exactly those orbit monomials whose positive exponents all lie among the first N variables; these are precisely the distinct rank-N orbit monomials, each once. Thus every transition AMd→ANd is an isomorphism carrying the displayed basis to itself.

2.1F1step 1.2step 1.3∎

A compatible sequence in Λd is uniquely determined by its rank-N 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 M≥N; 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 Λd.

Depends on

Used by

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