Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Compound mass is well-defined and additive

Statement

For every tagged scalable compound c, the mass in Tagged scalable compounds is independent of the finite summation set used. For any compounds c,d and t≥0, m(c+d)=m(c)+m(d) and m(tc)=tm(c); m(0)=0. For every x∈X, the unit-state compound ex has m(ex)=1. A compound has zero mass if and only if it is the empty compound.

Facts & Assumptions

[F1]

Tagged scalable compounds: compounds are nonnegative finite-support functions, and mass is defined by a finite sum over support.

[F2]

Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule supplies bijective reindexing and splitting over disjoint finite sets. Enumerating a finite set expresses its real sum using Finite sums and finite products, by recursion; additivity and scalar linearity then follow from clauses 1 and 2 of Laws of finite sums and finite products. In particular, its sum of zero terms is zero, so disjoint splitting shows that adjoining zero terms leaves a sum unchanged. Clause 4 of Laws of finite sums and finite products gives nonnegativity of a sum of nonnegative terms and says that a zero sum forces each term to be zero.

Proof

Given: [F1] and [F2].

1.1F1F2

Let E be any finite subset of X containing supp⁡(c). On E∖supp⁡(c) the function is zero, so the finite sum over E equals the finite sum over supp⁡(c) by [F2]. If E and E′ both contain the support, compare each sum to the sum over the finite union E∪E′; hence the value is independent of the chosen finite summation set.

2.1F1F2step 1.1

The support of c+d is contained in the finite union of the supports of c and d. Sum over that union; distributivity in [F2] gives m(c+d)=m(c)+m(d), since zero terms outside each individual support contribute nothing by step 1.1. The support of tc equals that of c for t>0, and scalar linearity of the finite sum gives m(tc)=tm(c). For t=0, tc=0 and both m(tc) and tm(c) are zero. The empty sum is zero, so m(0)=0.

3.1F1F2step 2.1∎

The support of ex is the singleton {x}, whose one summand is 1, so the recursion in [F2] gives m(ex)=0+1=1. If m(c)=0, sum its nonnegative coefficients over its finite support. Clause 4 in [F2] forces every summand to be zero; coefficients off the support are also zero, hence c=0. Conversely c=0 has zero mass by step 2.1. Thus all the claimed mass identities hold, including the empty and unit-state cases.

Depends on

Dependency tree · 2 levels

Sources