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 , the mass in Tagged scalable compounds is independent of the finite summation set used. For any compounds and , and ; . For every , the unit-state compound has . A compound has zero mass if and only if it is the empty compound.
Facts & Assumptions
Tagged scalable compounds: compounds are nonnegative finite-support functions, and mass is defined by a finite sum over support.
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].
Let be any finite subset of containing . On the function is zero, so the finite sum over equals the finite sum over by [F2]. If and both contain the support, compare each sum to the sum over the finite union ; hence the value is independent of the chosen finite summation set.
The support of is contained in the finite union of the supports of and . Sum over that union; distributivity in [F2] gives , since zero terms outside each individual support contribute nothing by step 1.1. The support of equals that of for , and scalar linearity of the finite sum gives . For , and both and are zero. The empty sum is zero, so .
The support of is the singleton , whose one summand is , so the recursion in [F2] gives . If , 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 . Conversely has zero mass by step 2.1. Thus all the claimed mass identities hold, including the empty and unit-state cases.