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.
Recentering a point configuration at a spatial location
Definition
Let be an integer and let be a locally finite counting measure on as in Random measures and locally finite point processes, with . For , its recentering at is the counting measure defined on Borel by
Thus an occurrence at is moved to , and in an occurrence representation one has . The action obeys and is the identity. Joint measurability in is proved in The spatial recentering action is jointly measurable ↗.
Axiom convention. The point-process supplier used for this definition has transitive dependencies on AC and Countable Choice; the recentering formula itself makes no selections.
Depends on
Used by
- Stationarity, finite intensity, and spatial ergodicity Definition
- The full Palm distribution defined by the refined Campbell identity Definition
- A translated lattice exposes recentering, atomic pair measures, and one-occurrence deletion Example
- The spatial recentering action is jointly measurable Lemma
- Existence and uniqueness of the full Palm law and the refined Campbell identity Theorem
- Ripley K for a homogeneous Poisson process is Euclidean ball volume Theorem
- Spatial ergodic limit for counts in dilates of a convex window Theorem
- The reduced second factorial moment measure is the Palm expectation after one-occurrence deletion Theorem
Dependency tree · two levels
23 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)