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.
Poisson Configuration Reference
Definition
Assume the Axiom of Choice and fix an integer dimension . For , let . These are left-closed, right-open cells. For every , Integer part: for every real there is exactly one integer with supplies the unique integers with , so belongs to exactly one . The cells are Borel products of closed/open ray intersections and have volume one by A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, whose statement covers this face convention. A finite configuration in is a finite subset of distinct points. Encode it by its cardinality and its uniquely lexicographically increasing list of local coordinates . Pad the code after its first coordinates with the zero vector. For fixed , the strictly increasing lists form a Borel subset of , since lexicographic strict order is a finite union of coordinate-equality and coordinate-inequality conditions. Thus all codes form a Borel subset of . Each factor is Polish as a closed subspace of complete with a countable dense rational grid; with its discrete metric is Polish. The ambient space is Polish by Under the Axiom of Countable Choice, countable products and subspaces of Polish spaces are Polish (and is completely metrized by The standard weighted metric on a countable product of bounded complete metric spaces is complete), so Borel subspaces admit polish presentations makes the cell space standard Borel. By Counts Generate the Sigma-Algebra of Finite Configurations, its sigma-algebra is generated by the counts for Borel .
Use for real , with defined by The real exponential function and the number by a power series; for a real measurable function , means the pointwise composition . For , give a cell configuration with points probability for its count. The probabilities sum to by the exponential power series and The exponential addition formula . Conditional on count , take the -fold product of normalized Lebesgue measure on , restrict it to the complement of the collision diagonals, and push it forward by lexicographic sorting. The product exists by the finite product-measure theorem; each collision diagonal is null by Tonelli and the fact that Lebesgue measure gives every singleton measure zero, so the restricted measure still has mass one. Sorting is Borel on the finitely many permutation regions of the no-collision set. This defines a law on ; for , use the empty product and the empty configuration. Let with its product cylinder sigma-algebra. The product sigma-algebra is generated by the cell-coordinate sigma-algebras, each generated by counts on Borel subsets of its bounded cell by Counts Generate the Sigma-Algebra of Finite Configurations. Conversely every bounded-region count is a finite sum of these cell counts, since a bounded set meets finitely many cells. Thus the product cylinder sigma-algebra is exactly the sigma-algebra generated by all bounded-Borel count maps. For each , denotes the unique probability on whose finite cell marginals are the products of the corresponding . Existence and uniqueness follow from Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces. In particular every translation is measurable since . The unit-intensity reference is .
Identify each with the simple locally finite counting measure obtained by uniting its finite cell configurations. For a bounded Borel set , write and for its Lebesgue measure. Define translation by for . The next item proves that under , counts in disjoint bounded Borel sets are independent Poisson random variables with means and that is translation invariant. This item is a mathematical reference construction and makes no physical claim.
Depends on
The Axiom of Choice
The factorial and the falling factorial , defined by recursion in
The real exponential function and the number by a power series
The exponential addition formula
Integer part: for every real there is exactly one integer with
Lebesgue measurable sets, the family , and the restricted set function
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included
Standard Borel spaces
Separability: the existence of an at most countable dense subset
Polish spaces are separable completely metrizable spaces
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in
Closed subspaces of complete metric spaces are complete; the converse under countable choice
The rationals embed densely in the reals
Under the Axiom of Countable Choice, countable products and subspaces of Polish spaces are Polish
The standard weighted metric on a countable product of bounded complete metric spaces is complete
Borel subspaces admit polish presentations
Finite products of standard Borel spaces are standard Borel
The product measure of two sigma-finite measure spaces
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Counts Generate the Sigma-Algebra of Finite Configurations
Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces
The natural numbers (von Neumann)
The integers as equivalence classes of pairs of naturals
Integer powers
The Borel sigma-algebra of a topological space
The product sigma-algebra and its finite iterates