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.
Countable canonical model
Definition
Let be a nonempty finite or countably infinite set equipped with a specified enumeration, let be finite energies, let be weights, and let be an open parameter interval. For a nonnegative family define , with finite sums as in Finite sums and finite products, by recursion and the supremum as in Complete ordered field (least-upper-bound property) when the finite subsums are bounded; set the value to when they are unbounded. This definition is independent of the specified enumeration. For , define the nonnegative partition sum by this rule. The admissible parameter set is . For , define . A countable probability law on means a nonnegative family with total sum under the finite-subsum convention above; these weights form such a law because . For any real family with , define . If , define the reference-relative entropy . When , this is the Shannon entropy with natural logarithms. A lower bound on the energies alone is not part of this definition and does not imply . For countably infinite , any specified enumeration is used only to write a list; the nonnegative sum itself is the supremum over finite subsums above.
Scope
The sum is interpreted using the series convention of Series, partial sums, convergence and the sum, divergence, and the tail series. The model is purely mathematical; any physical interpretation of , , or requires separate premises.
Depends on
Complete ordered field (least-upper-bound property)
Finite sums and finite products, by recursion
The natural logarithm as the inverse of the exponential function
The real exponential function and the number by a power series
Series, partial sums, convergence and the sum, divergence, and the tail series