Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 stable graded ring of symmetric functions

Definition

For integers N,d≥0, let ANd be the degree-d homogeneous part of Z[x1,…,xN]SN, using Symmetric polynomials as the invariants of variable permutations and the convention A00=Z and A0d=0 for d>0. For M≥N, the transition πM,N:AMd→ANd sets xN+1,…,xM equal to zero. These maps compose, so define Λd:=lim←⁡N≥0ANd,Λ:=⨁d≥0Λd.

An element of Λd is a compatible sequence of homogeneous degree-d symmetric polynomials, one in each rank. Multiplication of a degree-a sequence and a degree-b sequence is coordinatewise polynomial multiplication and lies in Λa+b; compatibility follows because each πM,N is a ring homomorphism. Extend this product distributively to Λ. The unit is the compatible constant sequence 1, and each element of Λ has only finitely many nonzero homogeneous components.

This direct sum is not the ungraded inverse limit of the rings Z[x1,…,xN]SN. For example, the compatible sequence ∏i=1N(1+xi) belongs to that ungraded inverse limit and has nonzero homogeneous components in every degree, so it is not an element of the direct sum Λ. The partition notation and empty partition follow Partitions, English diagrams, and conjugation.

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