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.
Finite-window pair counts are measurable
Statement
Let and be as in Finite-window spatial observations and configurations. For , put For a finite configuration , define Here is the product measure and the subtraction removes the ordered self-pairs from a representation with occurrences. Thus counts unordered pairs of distinct occurrences at distance at most , including co-located distinct occurrences when multiplicity is present. Then is measurable.
Facts & Assumptions
Given: , its finite-configuration space, and .
The evaluation maps generate the sigma-algebra on and each is a finite measure. (Finite-window spatial observations and configurations)
For a finite measure , the product measure exists and satisfies on measurable rectangles. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)
A lambda-system containing a pi-system contains its generated sigma-algebra. (Dynkin's pi-lambda theorem)
Sums, real scalar multiples, and hence differences of finite-valued measurable functions are measurable. (Closure properties of measurable functions used by the integral)
Countable suprema and pointwise limits of measurable functions are measurable. (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable)
Rational open boxes form a countable basis for ; their intersections with form a countable basis for its subspace topology. ( is a countable dense subset of , and rational open boxes form a countable basis)
For second-countable spaces, the Borel sigma-algebra of the product equals the product of the Borel sigma-algebras. (Borel sigma-algebra of a product of second-countable spaces)
Proof
Given: The finite configuration and the radius .
For a measurable rectangle , the map is measurable by [F1]. Let The whole space belongs to because its value is : for each integer , the level set is a countable union of evaluation level sets . The total product mass is finite. For , finite additivity gives ; this finite-valued measurable difference is measurable by [F4], so complements belong. Countable disjoint unions belong by countable additivity, since the partial sums are measurable by [F4] and their pointwise limit is measurable by [F5]. Thus is a lambda-system containing the rectangles.
Rectangles form a pi-system and generate the product Borel sigma-algebra by [F6] and [F7]. Dynkin's theorem [F3] applied to step 1.1 therefore gives that is measurable for every Borel . The set is closed, so its product-measure evaluation is measurable.
If , then . The terms with all occur since ; every remaining unordered pair of distinct occurrences contributes exactly two terms. Hence the displayed formula for is a finite nonnegative integer and is measurable by step 2.1 and [F1].
Depends on
- Finite-window spatial observations and configurations
- Borel sigma-algebra of a product of second-countable spaces
- $\mathbb{Q}^n$ is a countable dense subset of $\mathbb{R}^n$, and rational open boxes form a countable basis
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Dynkin's pi-lambda theorem
- Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable
- Closure properties of measurable functions used by the integral
Used by
Dependency tree · two levels
51 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Adrian Baddeley, Spatial Point Processes and their Applications, complete lecture notes (standard reference, not scraped)
- Günter Last and Mathew Penrose, Lectures on the Poisson Process, author-hosted 2017 version (standard reference, not scraped)