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 pair-correlation density integrates to Ripley K
Statement
Assume AC and Countable Choice as carried by the point-process and Palm suppliers. Let be a stationary locally square-integrable point process on with intensity , and suppose its pair-correlation density exists in the sense of Pair-correlation density and Ripley K-function. Then, for every ,
For a simple process, the same K-function also satisfies .
Facts & Assumptions
Given: AC, Countable Choice, the stationary locally square-integrable point process, its full Palm law, and the assumed density .
AC is inherited through the transitive point-process dependencies; no additional selection is made. (The Axiom of Choice)
Countable Choice is inherited through the point-process and Palm dependencies. (The Axiom of Countable Choice ())
, and a pair-correlation density satisfies . (Pair-correlation density and Ripley K-function)
, deleting one distinguished occurrence. (The reduced second factorial moment measure is the Palm expectation after one-occurrence deletion)
The full Palm law satisfies the refined Campbell identity for every nonnegative product-measurable integrand and is supported on configurations with at least one occurrence at zero. (Existence and uniqueness of the full Palm law and the refined Campbell identity)
A configuration is simple when every location has multiplicity at most one. Here a simple process means a process whose configurations are simple on a probability-one measurable event. (Random measures and locally finite point processes)
Proof
Given: AC, Countable Choice, the definitions in [F1], the reduced Palm identity, and the density hypothesis.
Apply [F2] with and divide by . By the K definition [F1],
Suppose is simple. The event is measurable by the evaluation sigma-algebra. In the refined Campbell identity [F3], take with . On the probability-one event of simple realizations, every counted occurrence has , so the left side is zero. The right side is , hence . Combining this with the at-least-one origin property in [F3] gives -almost surely. Therefore -almost surely, and the definition [F1] gives the stated simple-process formula.
The density clause in [F1] applied to the same closed ball gives . Substitution in step 1.1 proves the asserted integral formula.
At the endpoint , the closed-ball convention gives , so ; this is for a simple process, while any other co-located occurrences contribute in the multiplicity-bearing case. The proof uses no density-existence claim beyond the stated hypothesis. AC and Countable Choice [A1]–[A2] are inherited supplier assumptions, not additional derivation steps.
Sources
Last and Penrose, Proposition 8.8, Definition 8.9, and Theorem 9.1; Baddeley, Examples 2.14 and 2.17. The absolute-continuity hypothesis is retained explicitly.
Depends on
- Pair-correlation density and Ripley K-function
- Random measures and locally finite point processes
- The reduced second factorial moment measure is the Palm expectation after one-occurrence deletion
- Second factorial and reduced second factorial moment measures
- Existence and uniqueness of the full Palm law and the refined Campbell identity
- 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
43 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)