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 Reference Counts and Translation Invariance
Statement
Assume AC, fix and , and let be the configuration law of Poisson Configuration Reference. Define the intensity measure on Borel sets by , where and the nonnegative expectation may be infinite. For pairwise disjoint bounded Borel sets , the restrictions are independent, each count has Poisson law with mean , and the joint law of counts on any finite disjoint family is the product of those Poisson laws. In particular, is invariant under every translation , and for every Borel . For every bounded Borel and real , its count also has the exact exponential moment
Facts & Assumptions
Given: AC, dimension , , the cell-product law , and pairwise disjoint bounded Borel sets .
AC is part of the Poisson reference construction and of its countable product existence (The Axiom of Choice, Poisson Configuration Reference).
On each unit cell, the count has law and, conditional on , the points are independent uniform points subsequently sorted. Finite cell families are independent (Poisson Configuration Reference).
The number of length- label sequences with category counts is the multinomial coefficient, and its finite expansion is the multinomial theorem (The multinomial coefficient as the number of ordered partitions of an -set into blocks of prescribed sizes, The multinomial coefficient equals , and in ).
Exponentials turn sums into products (The exponential addition formula ).
The configuration sigma-algebra is generated by bounded-Borel count maps, finite count cylinders form a generating pi-system, and agreement there determines probability laws (Counts Generate the Sigma-Algebra of Finite Configurations, Dynkin's pi-lambda theorem).
The real exponential function and the number by a power series: the real exponential is its everywhere convergent factorial power series. Monotone convergence for the integral permits expectations of increasing nonnegative partial sums and countable sums.
Proof
Given: The hypotheses and suppliers in Facts & Assumptions.
Fix one unit cell and a finite Borel partition of it. Put , so . Conditional on the cell count , the independent uniform points give category-count probability for . Multiplying by the Poisson count probability gives , by [F3]. This factors into the Poisson probabilities of the disjoint cell pieces, including the complement ; hence their counts are independent Poisson variables with respective means . Zero-volume pieces have count zero almost surely by the same formula.
Each bounded intersects only finitely many unit cells. Apply step 1.1 to the partition formed by the sets and their complement in each such cell. Independence within each cell and independence between cell configurations show that all component counts, indexed by both and , are independent Poisson variables.
For fixed , sum the component counts over its finitely many cells. The sum of independent Poisson variables of means has mass at equal to : expand by [F2], then use the product of the component masses. Thus is Poisson with mean . The groups of components for different are disjoint independent families, so their sums remain independent.
Put . The count mass in step 3.1 gives, by nonnegative partial sums and [F5], For , the count is zero almost surely and both sides are one, so no ambiguous zero power is needed. This establishes the exponential-moment interface before entropy estimates use it.
Let be pairwise disjoint and, for each , consider a finite count-cylinder event in the restriction to . Refine the finitely many counting sets in each event into their disjoint atoms inside . Step 3.1 gives independent Poisson counts on all these atoms across every ; the event for each restricted configuration is a measurable function only of its own atom counts. Thus finite cylinder events factor across . The restriction sigma-fields are generated by these cylinders, so repeated pi-lambda extension proves independence of the restrictions themselves.
For a finite family of bounded Borel sets , partition their union into the finitely many disjoint Boolean atoms formed by the sets and their complements. Every is a sum of the counts on these atoms. Translation preserves each atom's volume, so step 3.1 gives the same joint distribution of this whole count vector under and its translate. Thus the laws agree on every finite count cylinder. These cylinders generate the configuration sigma-algebra by [F4], and pi-lambda uniqueness identifies the laws. The one-set count law gives for bounded . For arbitrary Borel , increase bounded cubes to all space and apply [F5] to the counting measures and Lebesgue measure to obtain the same extended identity. For disjoint Borel , the pointwise counting identity and [F5] show countable additivity of , while the empty set has expectation zero. Thus the defined intensity functional is a measure and equals times Lebesgue measure.
Depends on
The real exponential function and the number by a power series
Monotone convergence for the integral
The Axiom of Choice
Poisson Configuration Reference
Counts Generate the Sigma-Algebra of Finite Configurations
The multinomial coefficient as the number of ordered partitions of an -set into blocks of prescribed sizes
The multinomial coefficient equals , and in
The exponential addition formula
Dynkin's pi-lambda theorem