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.
Local-Tame Topology
Definition
Let be the probability laws on the configuration space of Poisson Configuration Reference that are invariant under every and satisfy . Stationarity then makes every bounded-region count integrable, because a bounded set meets finitely many unit cells.
A real measurable function on is local if there is a bounded Borel set such that is measurable with respect to the restriction . It is tame if there is a finite such that for every and one such bounded . Write for the family of all local tame functions. Each is integrable under every .
The local-tame topology on is the initial topology generated by all maps , . Equivalently, a net converges to in exactly when for every measurable local with at most linear growth in the count of a bounded support. Bounded local indicators are among these tests, so this topology separates distinct probability laws. The domain restriction to finite-intensity stationary laws ensures every displayed expectation is a finite real number.