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.
A translated lattice exposes recentering, atomic pair measures, and one-occurrence deletion
Example
Let be uniform on and define . This is a stationary simple point process on with intensity . Its full Palm law is the deterministic unit lattice. The reduced second factorial moment measure is atomic on , so no pair-correlation density exists. Replacing by shows why Palm deletion removes one occurrence at rather than all origin occurrences.
Verification
Given: , , and the definitions and theorems of Stationarity, finite intensity, and spatial ergodicity, The full Palm distribution defined by the refined Campbell identity, Second factorial and reduced second factorial moment measures, and Pair-correlation density and Ripley K-function.
[F1] Configuration measurability is tested by Borel evaluations; ; stationarity is invariance under every ; and intensity is . (Random measures and locally finite point processes, Stationarity, finite intensity, and spatial ergodicity, Recentering a point configuration at a spatial location)
[F2] Borel Lebesgue measure is translation invariant and assigns each interval its length. (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included)
[F3] The full Palm law is characterized by . (Existence and uniqueness of the full Palm law and the refined Campbell identity)
[F4] , with distinct occurrence indices. (Second factorial and reduced second factorial moment measures)
[F5] A pair-correlation density exists only if , and . (Pair-correlation density and Ripley K-function)
[F6] The reduced-measure Palm identity is . (The reduced second factorial moment measure is the Palm expectation after one-occurrence deletion)
[A1] AC and Countable Choice are inherited through the point-process and Palm supplier dependency closure; the explicit lattice calculations use no choices. (The Axiom of Choice, The Axiom of Countable Choice ())
For every Borel , is measurable as a countable sum of Borel functions; every compact set meets only finitely many points of each , so this is a locally finite random counting measure. For fixed , put . The map is a translation on each of and , with the two image intervals partitioning ; by [F2] it preserves uniform probability. Reindexing gives , so the process is stationary. Since exactly one lies in for every , and .
For every compact , choose an integer with . If and , then , so uniformly in . Consequently and . Both lattice processes satisfy the local square-integrability premise in the second-order and K definitions.
For every configuration event , the unit-cube Palm construction in [F3] gives There is exactly one occurrence in , and . Therefore . In particular, using the uncentered configuration in the indicator would give on the left Campbell sum almost surely, whereas the Palm-side value is ; this is why recentering cannot be dropped.
For each selected lattice occurrence , the displacements to all other occurrences are . Hence [F4] gives for bounded Borel . In particular while , so no measurable density can satisfy [F5].
Now put , so every lattice site has two occurrence indices and . A selected occurrence has one other occurrence at the same site, so . Equivalently, is concentrated on , and , so [F6] gives . Thus ; deleting both origin occurrences would incorrectly give zero.
The simple lattice has an atomic reduced measure and no pair-correlation density, while the doubled lattice verifies that factorial pairs distinguish occurrence indices and Palm deletion removes exactly one occurrence. The origin-centered convention and the closed-ball endpoint are both used explicitly. AC and Countable Choice [A1] are inherited assumptions only.
Sources
Last and Penrose, Exercises 8.3, 8.10–8.11 and Theorem 9.1; Baddeley, Example 2.15 and Lecture 3, §3.3. Every lattice and multiplicity calculation is verified above.
Depends on
- Random measures and locally finite point processes
- Stationarity, finite intensity, and spatial ergodicity
- A stationary point process of finite intensity has mean measure rho times Lebesgue measure
- Recentering a point configuration at a spatial location
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
- The full Palm distribution defined by the refined Campbell identity
- Existence and uniqueness of the full Palm law and the refined Campbell identity
- Second factorial and reduced second factorial moment measures
- Factorial and reduced factorial moment measures are well-defined and locally finite
- The reduced second factorial moment measure is the Palm expectation after one-occurrence deletion
- Pair-correlation density and Ripley K-function
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
66 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
- Günter Last and Mathew Penrose, Lectures on the Poisson Process (2017 author-hosted version) (standard reference, not scraped)
- Adrian Baddeley, Spatial Point Processes and their Applications (standard reference, not scraped)