Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Tagged scalable compounds

Definition

Let X be a set of state labels. A tagged scalable compound over X is a function c:X→R≥0 whose support supp⁡(c):={x∈X:c(x)≠0} is finite. The coefficient is a dimensionless formal amount; state labels retain their tags, so equal coefficients on different labels do not identify those labels. Compounds are equal exactly when their coefficient functions are equal.

For compounds c,d and t≥0, define composition and nonnegative scaling pointwise by (c+d)(x):=c(x)+d(x) and (tc)(x):=tc(x). The zero function is the empty compound; in particular 0c=0. Comparison axioms involving scaling still require a strictly positive scalar unless explicitly stated otherwise. The mass of c is the finite sum m(c):=∑x∈supp⁡(c)c(x). It is dimensionless bookkeeping mass, not thermodynamic mass or energy. The compound is positive when m(c)>0.

For every state label x∈X, the unit-state compound ex is the coefficient function with ex(y)=1 if y=x and ex(y)=0 otherwise. Its support is {x}, so it is a tagged compound. In compound comparisons, a state label x denotes ex. Every compound has the canonical finite decomposition c=∑x∈supp⁡(c)c(x)ex, with an empty sum when c=0; coefficients on this support are strictly positive. The mass-one property m(ex)=1 and the equivalence m(c)=0⟺c=0 are proved in Compound mass is well-defined and additive ↗.

The formula for mass is independent of the chosen finite set containing the support, and composition and scaling obey m(c+d)=m(c)+m(d) and m(tc)=tm(c); Compound mass is well-defined and additive ↗ proves these assertions.

Remarks

No topology, continuity, or physical interpretation is part of this definition. The finite-support restriction is essential: no infinite series or convergence convention is implicit.

Depends on

Dependency tree · 2 levels

Sources