Alphabeta Math
Pipeline-generated
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.

Spatial summaries and Palm laws

1 · Prerequisites

2 · Summary

For a stationary locally finite point process on Rd with finite positive intensity, this page fixes the recentering convention and constructs the full Palm law from the refined Campbell identity. Under local square integrability it defines occurrence-indexed second factorial and reduced measures, proves their local finiteness and the one-occurrence Palm deletion identity, and defines pair correlation only when the reduced measure has a Lebesgue density. Ripley's K uses closed balls and removes one distinguished occurrence at the origin. Finite positive intensity alone suffices for the L1 spatial count limit over dilates of compact convex windows; under ergodicity the limit is the intensity. The border estimator is stated as a finite-window procedure and carries no unbiasedness or asymptotic claim. Multiplicities are retained throughout.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Compact convex windows admit rectangle approximations and have negligible translated boundary

Statement

Assume Countable Choice. Let W⊆Rd be compact and convex with nonempty interior. Then 0<∣W∣<∞, ∣aW∣=ad∣W∣ for every a>0, and for each ϵ>0 there is a finite disjoint union R of half-open rectangles with R⊆W and ∣W∖R∣<ϵ. Also, for every fixed x∈Rd,

∣(aW+x)△aW∣∣aW∣⟶0(a→∞).

Here ∣⋅∣ denotes Borel Lebesgue measure and A△B=(A∖B)∪(B∖A).

Facts & Assumptions

Given: Countable Choice, a compact convex set W with nonempty interior, and Borel Lebesgue measure ∣⋅∣ on Rd.

[A1]

Countable Choice is assumed for the Borel Lebesgue measure and its box-value properties. (The Axiom of Countable Choice (ACω))

[F1]

Under Countable Choice, Lebesgue measure on the full Lebesgue sigma-algebra is a measure, its restriction to Borel sets is a measure, every half-open box has its usual product volume, and it is finite on bounded sets. (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included)

[F3]

Lebesgue measure is translation invariant, and measures are continuous from below. (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Continuity from below for measures)

Proof

Given: Countable Choice and a compact convex W⊆Rd with nonempty interior.

1.1givenA1construct

Choose x0∈int⁡W and r>0 with the open ball B(x0,r)⊆W. For 0<t<1 put Wt=x0+(1−t)(W−x0). If w∈W and ∥z∥<tr, then x0+z/t∈B(x0,r)⊆W and (1−t)w+t(x0+z/t)=(1−t)w+tx0+z∈W by convexity; thus every point of Wt has an open ball of radius tr contained in W, so Wt⊆int⁡W.

2.1step 1.1givenconstructalgebra

If 0<t′<t<1, put w′=1−t1−t′w+t−t′1−t′x0. The two coefficients are nonnegative and sum to one, so w′∈W by convexity, and x0+(1−t)(w−x0)=x0+(1−t′)(w′−x0). Thus Wt⊆Wt′. Moreover, every y∈int⁡W lies in some Wt: for y≠x0, choose s>0 small enough that w=x0+(1+s)(y−x0)∈W, and then y=x0+(1−t)(w−x0) for t=s/(1+s); x0 lies in every Wt. Hence for any sequence tn↓0, Wtn↑int⁡W.

3.1step 2.1F1F2F3

By [F2] and [F3], ∣Wtn∣=(1−tn)d∣W∣ and the sets increase to int⁡W, so [F3] gives ∣int⁡W∣=∣W∣. Thus the compact boundary ∂W=W∖int⁡W is a null set. Since W contains a nonempty open ball and is bounded, [F1] gives 0<∣W∣<∞.

4.1step 1.1step 3.1F1construct

Given ϵ>0, choose t>0 so that ∣W∣−∣Wt∣=(1−(1−t)d)∣W∣<ϵ. Choose a grid of half-open cubes of side δ<tr/d. Each cube that intersects Wt is contained in W, because its points lie within distance at most dδ<tr of a point whose radius-tr ball lies in W. Only finitely many grid cubes intersect bounded Wt; their union R is disjoint, finite, contains Wt, and is contained in W. Therefore ∣W∖R∣≤∣W∖Wt∣<ϵ.

5.1step 4.1F1F3algebra

Fix ϵ>0 and choose R⊆W as in step 4.1, a finite union of disjoint rectangles. Translation invariance and the symmetric-difference inclusion give ∣(W+h)△W∣≤2∣W∖R∣+∣(R+h)△R∣. For each half-open rectangle, its overlap with a translate by h has volume tending to the rectangle's volume as h→0, by the box-volume formula; the same limit holds for their finite union. Thus lim sup⁡h→0∣(W+h)△W∣≤2ϵ, and arbitrariness of ϵ gives convergence to zero.

6.1step 5.1F2algebra

For a>0, [F2] gives ∣aW∣=ad∣W∣ and ∣(aW+x)△aW∣=ad∣(W+x/a)△W∣. Dividing and applying step 5.1 with h=x/a→0 proves the asserted boundary ratio.

7.1A1F1F2step 3.1step 4.1step 5.1step 6.1∎

Steps 3.1, 4.1, 5.1, and 6.1 prove positive finite volume, the finite inner rectangle approximation, dilation scaling, and the translated-boundary limit. Countable Choice is used only through [F1]–[F2]; no AC or DC is used.

Sources

Last and Penrose, Chapter 8, proof of Theorem 8.14; local details above make the convex-boundary approximation explicit.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A locally finite translation-invariant Borel measure on Rd is a multiple of Lebesgue measure

Statement

Assume the Axiom of Countable Choice. Let m be a Borel measure on Rd that is finite on compact sets and translation invariant. Put Q=[0,1)d and c=m(Q). Then

m(B)=c λd(B)

for every Borel B⊆Rd, where λd is Borel Lebesgue measure. In particular, if c=0 then m is the zero measure.

Facts & Assumptions

Given: A natural number d≥1, Countable Choice, a locally finite Borel measure m on Rd, translation invariance m(B+x)=m(B), and Q=[0,1)d.

[A1]

Countable Choice: for every sequence of nonempty sets (Xn)n∈N there is a sequence xn∈Xn. (The Axiom of Countable Choice (ACω))

[F1]

A measure is countably additive on disjoint measurable sequences, and local finiteness means finite measure on every compact set. (Measures on sigma-algebras)

[F2]

Under Countable Choice, a translation-invariant Borel measure on Rd that assigns mass 1 to (0,1]d agrees with λd on all Borel sets. (A translation-invariant measure on the Borel sets of Rn giving the unit cube measure one is the restriction of Lebesgue measure)

Proof

Given: Countable Choice and a locally finite translation-invariant Borel measure m on Rd.

1.1givenF1constructalgebra

Fix a coordinate i and either face F of [0,1]d in that coordinate. For each integer n≥1, translate the lower face by j/(n+1)ei, or the upper face by −j/(n+1)ei, for j=1,…,n. These n translates are pairwise disjoint compact subsets of [0,1]d, each has measure m(F) by translation invariance, and m([0,1]d)<∞ by local finiteness. Hence nm(F)≤m([0,1]d) for every n, which forces m(F)=0. The boundary of [0,1]d is a finite union of such faces.

2.1step 1.1F1

The symmetric difference of Q and (0,1]d is contained in that boundary, so [F1] and step 1.1 give m(Q)=m((0,1]d)=c.

3.1step 2.1F1algebra

If c=0, the integer translates Q+k, k∈Zd, are a countable disjoint partition of Rd. Translation invariance gives m(Q+k)=0 for every k, and countable additivity gives m(Rd)=0. Monotonicity then gives m(B)=0 for every Borel B.

3.2A1step 2.1F2algebra

If c>0, m/c is a translation-invariant Borel measure and, by step 2.1, (m/c)((0,1]d)=1. Applying [F2] gives m/c=λd, hence m(B)=cλd(B) for every Borel B.

4.1A1F2step 3.1step 3.2∎

The cases c=0 and c>0 exhaust the nonnegative value m(Q), proving the statement. The proof uses Countable Choice only through [F2]; no stronger choice principle is used.

Sources

Last and Penrose, Chapter 8, Proposition 8.7 proof; Baddeley, Lecture 2, §2.4. The local face argument supplies the normalization change from [0,1)d to the source theorem's (0,1]d convention.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

An integrable stationary sequence has an L1 Cesaro limit

Statement

Let (Xn)n≥1 be a real-valued strictly stationary sequence with E∣X1∣<∞. Here strictly stationary means that every finite-dimensional law is unchanged by every nonnegative integer shift. Then there is an integrable random variable Y such that

1n∑j=1nXj⟶Yin L1,

that is, E∣n−1∑j=1nXj−Y∣→0. No independence or ergodicity is assumed, and the proof uses no choice axiom.

Facts & Assumptions

Given: A real strictly stationary sequence (Xn)n≥1 with E∣X1∣<∞.

[A1]

Strict stationarity means invariance of all finite-dimensional laws under every nonnegative integer shift; the canonical path shift preserves the stationary path law. (Stationary process and canonical path shift)

[F1]

Pointwise limsup and liminf of measurable real sequences are measurable. (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable)

[F2]

On a probability space, dominated pointwise convergence under one integrable majorant implies convergence of the integrals of absolute differences. (Dominated convergence)

[F3]

Increasing limits pass through the nonnegative integral. (Monotone convergence for the integral)

[F4]

Expectation of an integrable real random variable is its Lebesgue integral. (Expectation of a nonnegative or integrable random variable)

Proof

Given: A real strictly stationary sequence (Xn)n≥1 with E∣X1∣<∞.

1.1givenF1construct

First suppose EX1=0 and ∣Xn∣≤1 almost surely for each n. Put An=n−1∑j=1nXj and L=lim sup⁡nAn. Then −1≤L≤1, and for every fixed p≥1 the averages m−1∑j=pp+m−1Xj have the same limsup L: their difference from Am is at most 2(p−1)/m, which tends to zero.

2.1step 1.1A1F1construct

Fix 0<ϵ<1/4. For each p≥1 let Tp be the least positive integer m for which m−1∑j=pp+m−1Xj>L−ϵ. Such an m exists by the definition of limsup; [F1] and shift invariance show that the Tp all have the same distribution. Choose an integer k so that P(T1>k)<ϵ, and set Xp∗=Xp+21{Tp>k}.

3.1step 1.1step 2.1algebra

For every p, Xp∗≥−1 and EXp∗=2P(T1>k)<2ϵ. Define Tp∗ as the first m≥1 for which the average of Xp∗,…,Xp+m−1∗ exceeds L−ϵ. If Tp≤k, the same average of the larger sequence Xj∗ at length Tp exceeds L−ϵ; if Tp>k, then Xp∗=Xp+2≥1>L−ϵ. Thus 1≤Tp∗≤k in either case.

4.1step 3.1constructalgebra

Starting from M0=0, recursively set Mq+1=Mq+TMq+1∗. Each increment is between 1 and k, and the average of Xj∗ on each block (Mq,Mq+1] exceeds L−ϵ. Therefore SMq∗:=∑j=1MqXj∗>(L−ϵ)Mq.

5.1step 4.1step 3.1algebra

For n≥k, take the last Mq≤n; then 0≤n−Mq<k. The remaining terms are at least −1, so Sn∗>SMq∗−k>(L−ϵ)Mq−k≥(L−ϵ)n−2k, using L−ϵ≤1. Hence n−1Sn∗>L−ϵ−2k/n.

6.1step 2.1step 5.1F2F4algebra

Stationarity gives E[n−1Sn∗]=EX1∗<2ϵ. Taking expectations in step 5.1 and then letting n→∞ gives EL≤3ϵ. Since this holds for every such ϵ, EL≤0. Applying the same argument to (−Xn) shows E[lim inf⁡nAn]≥0. The bounded nonnegative difference lim sup⁡nAn−lim inf⁡nAn therefore has expectation at most zero, so it vanishes almost surely. Thus An converges almost surely; [F2] gives convergence in L1.

7.1step 6.1F4algebra

If instead ∣Xn∣≤C<∞ without centering, the case C=0 is immediate; for C>0 apply the preceding result to (Xn−EX1)/(2C), whose terms are centered and have absolute value at most 1. Rescaling and adding EX1 proves the bounded case.

8.1step 7.1F1F4construct

Suppose Xn≥0 and is integrable but not necessarily bounded. For r≥1 set Xn,r=Xn∧r and An,r=n−1∑j=1nXj,r. Define the limit canonically by Yr:=lim sup⁡n→∞An,r; it is measurable by [F1]. By step 7.1, the averages converge almost surely and in L1 to this integrable Yr. On the common probability-one event for these countably many convergences, Yr≤Yr+1; also Yr≥0 and EYr=EX1,r.

9.1step 8.1F3algebra

Let Y=lim⁡r→∞Yr. By [F3], Y is integrable and EY=EX1. Given ϵ>0, choose r with E(X1−X1,r)<ϵ; then also E(Y−Yr)<ϵ. For this fixed r, stationarity and nonnegativity give E∣An−An,r∣=E(X1−X1,r)<ϵ, while E∣An,r−Yr∣→0. The triangle inequality proves lim sup⁡nE∣An−Y∣≤2ϵ, and arbitrariness of ϵ gives L1 convergence.

10.1givenstep 8.1step 9.1algebra∎

For a signed integrable stationary sequence, apply the nonnegative case in steps 8.1–9.1 separately to Xn+=max⁡(Xn,0) and Xn−=max⁡(−Xn,0). Both are stationary nonnegative integrable sequences, and subtracting their L1 limits gives an integrable L1 limit for the averages of Xn. The entire argument used no choice principle.

Sources

Last and Penrose, Appendix B.2, Theorem B.11 and complete proof; Walkden's Birkhoff treatment is stronger and is not used as a choice-bearing shortcut.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Recentering a point configuration at a spatial location

Definition

Let d≥1 be an integer and let μ be a locally finite counting measure on Rd as in Random measures and locally finite point processes, with S=Rd. For x∈Rd, its recentering at x is the counting measure θxμ defined on Borel B⊆Rd by

(θxμ)(B):=μ(B+x).

Thus an occurrence at x is moved to 0, and in an occurrence representation μ=∑iδXi one has θxμ=∑iδXi−x. The action obeys θx+y=θx∘θy and θ0 is the identity. Joint measurability in (x,μ) 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.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Stationarity, finite intensity, and spatial ergodicity

Definition

Work with a point process η on Rd and its law Pη on the evaluation-measurable configuration space from Random measures and locally finite point processes. Recentering θx is as in Recentering a point configuration at a spatial location. The process is stationary if θxη has law Pη for every x∈Rd.

Put Q=[0,1)d. Its intensity is ρ:=E[η(Q)]. It has finite positive intensity when 0<ρ<∞. The item A stationary point process of finite intensity has mean measure rho times Lebesgue measure proves that its mean measure is ρλd under the stated measure-theoretic assumptions.

The translation-invariant sigma-algebra is Iη:={A in the configuration sigma-algebra:Pη(θx−1A△A)=0 for every x∈Rd}. It is a sigma-algebra because symmetric-difference nullity is preserved by complements and countable unions. The stationary point process is ergodic under translations if every A∈Iη has Pη(A)∈{0,1}. This is the full Rd action convention, not ergodicity of one selected unit shift.

Axiom convention. This item carries AC and Countable Choice through the transitive well-definedness dependencies of the point-process supplier; stationarity and the scalar intensity definition themselves use no choices.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The spatial recentering action is jointly measurable

Statement

The map (x,μ)↦θxμ from Rd times the evaluation-measurable space of locally finite counting measures to that space is measurable.

Facts & Assumptions

Given: The evaluation sigma-algebra on locally finite counting measures and the recentering convention in Recentering a point configuration at a spatial location.

[F1]

A point process is a measurable random element into locally finite counting measures, and their sigma-algebra is generated by evaluations μ↦μ(B) for Borel B. (Random measures and locally finite point processes)

[F2]

A measure kernel has measurable evaluations, and parameterized integration of a nonnegative product-measurable function is measurable when the kernel has a common finite-mass exhaustion. (Measure kernel and probability kernel, Measurability of integration against a kernel)

[A1]

AC and Countable Choice are carried by the transitive well-definedness dependencies of the point-process supplier; the evaluation calculation below uses neither. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof

Given: d≥1, AC, Countable Choice, and a locally finite counting measure μ with its evaluation sigma-algebra.

1.1givenF1F2construct

Fix a Borel set B⊆Rd. On parameter space Rd×Nlf(Rd) define the evaluation kernel K((x,μ),C)=μ(C). Its evaluations are measurable by [F1]; the fixed compact exhaustion [−n,n]d has finite K((x,μ),⋅)-mass for every (x,μ) by local finiteness. The function ((x,μ),y)↦1B(y−x) is product measurable because subtraction is continuous and B is Borel.

2.1step 1.1F1F2

Applying [F2] to this kernel gives measurability of (x,μ)⟼∫1B(y−x) μ(dy)=μ(B+x)=(θxμ)(B). Since this holds for every Borel B and evaluations generate the target sigma-algebra [F1], (x,μ)↦θxμ is measurable.

3.1A1step 2.1∎

The argument applies to every Borel evaluation and uses no selection; the AC and Countable Choice tags record only the carried supplier conventions [A1].

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

The full Palm distribution defined by the refined Campbell identity

Definition

Assume AC and Countable Choice as carried by the point-process supplier. Let η be a stationary process in the sense of Stationarity, finite intensity, and spatial ergodicity, with finite positive intensity ρ. Its full Palm distribution P0 is the unique probability measure on the configuration space such that

E∫h(x,θxη) η(dx)=ρ∫Rd∫h(x,μ) P0(dμ) dx

for every nonnegative function h measurable for the product of the Borel and configuration evaluation sigma-algebras. This definition uses the full point-centered configuration, not conditioning on the probability-zero event that an atom occurs at the origin. Existence, uniqueness, and retention of the distinguished origin occurrence are proved in Existence and uniqueness of the full Palm law and the refined Campbell identity ↗.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Second factorial and reduced second factorial moment measures

Definition

Assume η is a stationary point process as in Stationarity, finite intensity, and spatial ergodicity. It is locally square integrable if E[η(K)2]<∞ for every compact K⊆Rd. For a realized counting measure μ=∑i∈JδXi, with occurrences indexed separately even when locations coincide, as allowed by Random measures and locally finite point processes, define its second factorial measure on Borel C⊆Rd×Rd by

μ(2)(C):=∑i,j∈J, i≠j1C(Xi,Xj).

The second factorial moment measure is α(2)(C):=E[η(2)(C)]. With Q=[0,1)d, the reduced second factorial moment measure is

αred(2)(D):=E∑i,j∈J, i≠j1Q(Xi)1D(Xj−Xi),D⊆Rd Borel.

The local theorem Factorial and reduced factorial moment measures are well-defined and locally finite ↗ proves measurability and local finiteness under local square integrability. Occurrence indices, rather than distinct locations, are essential when multiplicities are present.

Axiom convention. AC and Countable Choice are carried by the transitive point-process supplier dependencies; the occurrence-indexed formulas themselves make no selections.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Mecke identity for locally finite Poisson point processes

Statement

Assume AC and Countable Choice as carried by the point-process supplier. Let η be a Poisson point process on Rd with locally finite, sigma-finite intensity measure ν. For every nonnegative function h measurable on the product of the Borel and configuration evaluation sigma-algebras,

E∫h(x,η−δx) η(dx)=∫RdE[h(x,η)] ν(dx).

At each counted occurrence x, η−δx removes exactly one occurrence; coincident remaining occurrences stay. Equivalently, for every such nonnegative f,

E∫f(x,η) η(dx)=∫RdE[f(x,η+δx)] ν(dx).

Both sides are extended nonnegative integrals.

Facts & Assumptions

Given: AC, Countable Choice, a Poisson point process η on Rd with locally finite sigma-finite intensity ν, and nonnegative product-measurable integrands.

[A1]

AC is carried by the transitive random-point-process supplier dependencies; the Mecke calculation below makes no choice. (The Axiom of Choice)

[A2]

Countable Choice is carried by the transitive random-point-process supplier dependencies; the Mecke calculation below makes no choice. (The Axiom of Countable Choice (ACω))

[F1]

A Poisson point process has independent counts on disjoint Borel sets, each with its specified scalar Poisson law; multiplicities are allowed. (Poisson and Cox point processes)

[F2]

A point process is a measurable locally finite counting measure, its evaluation maps generate its sigma-algebra, and occurrences may repeat. (Random measures and locally finite point processes)

[F3]

The scalar Poisson masses are pn=e−λλn/n! and sum to one; in particular npn=λpn−1. (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)

[F4]
[F5]

Adding one occurrence is measurable from its evaluation formula; deleting one counted occurrence is measurable on D={(x,μ):μ({x})≥1}. (Random measures and locally finite point processes, Deleting one occurrence from a locally finite counting measure is measurable)

[F6]

Nonnegative iterated integrals and increasing limits may be interchanged by Tonelli and monotone convergence. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Monotone convergence for the integral)

[F7]

A countable nonnegative weighted sum of measures is a measure. (Nonnegative scalar multiples and countable weighted sums of measures are measures)

Proof

Given: The stated Poisson point process η, intensity measure ν, AC, and Countable Choice.

1.1givenF1F2F3F7construct

First assume λ:=ν(Rd)<∞. If λ=0, then η(Rd)=0 almost surely by [F1], so both identities are zero. If λ>0, put Qν=ν/λ and pn=e−λλn/n!. For each n, let Pn be the law of ∑j=1nδXj when (X1,…,Xn) has product law Qν⊗n, with P0 the point mass at the zero measure. The countable weighted sum P∗=∑n≥0pnPn is a probability measure by the normalized Poisson masses [F3] and the countable weighted-sum result [F7]; evaluation maps of the finite Dirac sum are measurable by [F2].

1.2givenF1F2F4construct

Now let ν be sigma-finite and locally finite. Partition Rd into the explicit bounded Borel cells A1=[−1,1)d and An=[−n,n)d∖[−(n−1),n−1)d for n≥2. Let ηi be the restriction of η to Ai and η−i its restriction to Aic. Each ηi is a finite-intensity Poisson process. The two random configurations ηi and η−i are independent: finite evaluation cylinders refine to disjoint Borel pieces in Ai and Aic, whose counts are independent by [F1], and the generating rectangle pi-system extends this factorization to their evaluation sigma-algebras by [F4].

2.1step 1.1F1F2F3F4algebra

For disjoint Borel sets B1,…,Bm, add their complement as B0 and put qj=Qν(Bj). On the nth component the vector of counts has multinomial mass n!∏j=0mqjkj/kj! when ∑jkj=n. Mixing by pn and summing k0 gives P∗(N(Bj)=kj,1≤j≤m)=∏j=1me−ν(Bj)ν(Bj)kjkj!, using the exponential series; hence P∗ has the defining independent Poisson counts [F1]. Any other Poisson process with finite ν has the same finite-dimensional evaluation laws: refine any finite family of Borel sets into its finitely many disjoint Boolean atoms, apply [F1] to their counts, and recover the original counts by summation. Evaluation cylinders form a generating pi-system for the configuration sigma-algebra [F2], so probability-measure uniqueness [F4] shows that η has law P∗.

3.1step 1.1step 2.1F3F4F6algebra

For any nonnegative product-measurable f, represent η by the mixture law from steps 1.1–1.2. Pathwise the integral against its finite counting measure is a sum over occurrences, so Tonelli [F6] gives E∫f(x,η)η(dx)=∑n≥1pn∫(Rd)n∑i=1nf(xi,∑j=1nδxj) Qν⊗n(dx). Coordinate-permutation invariance of Qν⊗n makes the n summands equal. Reindexing with m=n−1 and npn=λpn−1 changes this to λ∑m≥0pm∫(Rd)m+1f(x1,δx1+∑j=2m+1δxj) Qν⊗(m+1)(dx). Integrating first in x1 and using ν=λQν, the inner mixture over m remaining points is E[f(x,η+δx)] by steps 1.1–1.2. This proves the add-one identity for finite total intensity.

4.1step 3.1step 1.2F4F5F6

Fix i. Independence makes the joint law of (ηi,η−i) the product of their laws, as it agrees with that product on measurable rectangles [F4]. For each fixed background configuration μ, the function fμ(x,ζ)=f(x,ζ+μ) is product-measurable by the addition evaluation formula in [F5]. Apply the finite-intensity add-one identity of step 3.1 to ηi and fμ, then integrate over μ=η−i; this gives E∫f(x,η)ηi(dx)=∫AiE[f(x,η+δx)]ν(dx). Summing over i and using [F6] proves the add-one identity for ν.

5.1step 4.1F5algebra

Let g be the nonnegative integrand in the deletion formula, and put D={(x,μ):μ({x})≥1}. Define H(x,μ)=g(x,μ−δx) on D and H=0 off D; [F5] makes H measurable. Apply the add-one identity of step 4.1 to H. At every occurrence counted by η(dx), (x,η)∈D and H(x,η)=g(x,η−δx); for every x, (x,η+δx)∈D and H(x,η+δx)=g(x,η). This gives the deletion identity. Since η−δx removes one unit mass, all other co-located occurrences remain.

6.1A1A2step 1.1step 2.1step 3.1step 1.2step 4.1step 5.1∎

Steps 1.1–4.1 establish both forms, including the zero-intensity boundary case and multiplicity convention. AC and Countable Choice [A1]–[A2] are inherited supplier assumptions; the local Mecke derivation itself uses no selection, and no DC is used.

Sources

Last and Penrose, Chapter 4, Theorem 4.4 proof and Theorem 4.1 formulation; Baddeley, Lecture 3, Campbell–Mecke formula. The local derivation keeps finite- and sigma-finite intensity cases and multiplicities explicit.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A stationary point process of finite intensity has mean measure rho times Lebesgue measure

Statement

Assume AC and Countable Choice, as carried by the random-point-process supplier. Let η be a stationary locally finite point process on Rd with 0<ρ:=E[η(Q)]<∞, where Q=[0,1)d. Its mean measure ν(B):=E[η(B)] is

ν(B)=ρλd(B)

for every Borel B⊆Rd.

Facts & Assumptions

Given: AC, Countable Choice, a stationary point process η, and 0<ρ=E[η(Q)]<∞.

[A1]

AC is carried by the transitive point-process supplier dependencies. (The Axiom of Choice)

[A2]

Countable Choice is carried by the transitive point-process supplier dependencies and is used for the Borel Lebesgue measure calculus. (The Axiom of Countable Choice (ACω))

[F1]

For a measurable random locally finite Borel measure, ν(B)=E[η(B)] is a measure; all evaluations are measurable. (Mean measures and measurable nonnegative integrals of random measures)

[F2]

Stationarity means the law is invariant under θx, and ρ=E[η(Q)] for Q=[0,1)d. (Stationarity, finite intensity, and spatial ergodicity)

[F3]

Every locally finite translation-invariant Borel measure m on Rd satisfies m(B)=m(Q)λd(B). (A locally finite translation-invariant Borel measure on Rd is a multiple of Lebesgue measure)

Proof

Given: AC, Countable Choice, a stationary point process η with ρ=Eη(Q)∈(0,∞), and its mean measure ν.

1.1givenF1F2

By [F1], ν(B)=E[η(B)] is a Borel measure, and ν(Q)=ρ.

2.1step 1.1F2algebra

Let B be bounded Borel. Choose an integer n with B⊆[−n,n)d. This cube is a finite disjoint union of translates Q+k, k∈{−n,…,n−1}d. Stationarity [F2] gives ν(Q+k)=E[η(Q+k)]=ρ for every such k. Monotonicity and finite additivity therefore give ν(B)≤(2n)dρ<∞. Hence ν is locally finite.

2.2step 1.1F2

For any Borel B and translation x, the definition of recentering gives ν(B+x)=E[η(B+x)]=E[(θxη)(B)]=E[η(B)]=ν(B), where the third equality is stationarity [F2]. Thus ν is translation invariant.

3.1A1A2step 1.1step 2.1step 2.2F3∎

Apply [F3] to the locally finite translation-invariant measure ν. Since ν(Q)=ρ by step 1.1, it follows that ν(B)=ρλd(B) for every Borel B. This is the claimed mean-measure formula.

Sources

Last and Penrose, Chapter 8, §8.1 and Proposition 8.2; Baddeley, Lecture 2, §2.4. The proof checks the mean-measure hypotheses locally.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Existence and uniqueness of the full Palm law and the refined Campbell identity

Statement

Assume AC and Countable Choice as carried by the point-process supplier. For every stationary locally finite point process η on Rd with finite positive intensity ρ, there is a unique probability law P0 on the configuration space satisfying

E∫h(x,θxη) η(dx)=ρ∫Rd∫h(x,μ) P0(dμ) dx

for every nonnegative product-measurable h. Moreover, P0-almost every configuration has at least one occurrence at the origin.

Facts & Assumptions

Given: AC, Countable Choice, a stationary locally finite point process η with finite positive intensity ρ, and its configuration space.

[A1]

AC is carried by the transitive random-point-process supplier dependencies; the local Palm construction uses no selection. (The Axiom of Choice)

[A2]

Countable Choice is carried by the transitive random-point-process and Lebesgue-measure supplier dependencies. (The Axiom of Countable Choice (ACω))

[F1]

A point process is a measurable random locally finite counting measure, and the evaluation maps generate its configuration sigma-algebra. (Random measures and locally finite point processes)

[F2]

Stationarity is invariance under the stated recentering action; its intensity mean measure is ρλd. (Stationarity, finite intensity, and spatial ergodicity, A stationary point process of finite intensity has mean measure rho times Lebesgue measure)

[F3]

The recentering action (x,μ)↦θxμ is jointly measurable. (Recentering a point configuration at a spatial location, The spatial recentering action is jointly measurable)

[F4]

Every locally finite translation-invariant Borel measure on Rd is its unit-cube mass times Lebesgue measure. (A locally finite translation-invariant Borel measure on Rd is a multiple of Lebesgue measure)

[F5]

Parameterized nonnegative integration against the evaluation kernel is measurable, and increasing limits pass through expectations. (Measure kernel and probability kernel, Measurability of integration against a kernel, Monotone convergence for the integral)

Proof

Given: AC, Countable Choice, a stationary point process η with 0<ρ=Eη(Q)<∞, Q=[0,1)d, and the recentering action.

1.1F1F2F3F5

For each configuration event A and Borel set B⊆Rd, define CA(B):=E∫1B(x)1A(θxη) η(dx). The integrand is measurable by [F3], so this is defined. For disjoint Bj, the indicators of their finite unions increase to the indicator of their union; monotone convergence [F5] and countable additivity of each η give CA(⋃jBj)=∑jCA(Bj). Also 0≤CA(B)≤Eη(B)=ρλd(B) by [F2], so CA is locally finite.

2.1givenF2F3step 1.1

For any y∈Rd, recentering has the flow property θx+y=θxθy. Changing the location variable in the integral gives CA(B+y)=E∫1B(u)1A(θu(θyη)) (θyη)(du)=CA(B), where the last equality uses stationarity of η. Thus CA is translation invariant.

3.1A2step 1.1step 2.1F4F5

By [F4] there is a constant cA=CA(Q) such that CA(B)=cAλd(B) for every Borel B. For disjoint configuration events Aj, monotone convergence in the indicator sum gives c∪jAj=∑jcAj. Also cN=Eη(Q)=ρ and c∅=0. Hence P0(A):=cA/ρ is a probability measure on the configuration sigma-algebra.

4.1step 3.1F3F5F6

For Borel B and configuration event A, the definition gives E∫1B(x)1A(θxη) η(dx)=CA(B)=ρλd(B)P0(A). Define the Campbell measure Π(E)=E∫1E(x,θxη)η(dx) on the product space. Joint measurability [F3] and monotone convergence [F5] make Π a measure. It is sigma-finite since Π(Qn×N)=Eη(Qn)=ρ∣Qn∣<∞ for the increasing bounded cubes Qn=[−n,n)d. The product measure ρ(λd⊗P0) is sigma-finite by [F6] and agrees with Π on rectangles by the displayed identity; uniqueness on the generating rectangle pi-system therefore gives equality of these measures. Integrating any nonnegative product-measurable h against them proves the refined Campbell identity.

5.1step 3.1step 4.1algebra

If P10 is another probability law satisfying the refined identity, use h(x,μ)=1Q(x)1A(μ) to obtain ρP10(A)=CA(Q)=ρP0(A) for every configuration event A; since ρ>0, P10=P0.

5.2step 4.1F3algebra

Let A0={μ:μ({0})=0}. For every counted occurrence x of η, the recentered configuration θxη has an occurrence at 0, so the left side of the refined identity with h(x,μ)=1Q(x)1A0(μ) is zero. Its right side is ρP0(A0) because ∣Q∣=1. Hence P0(A0)=0: the full Palm law retains at least the distinguished occurrence at the origin, even when other occurrences coincide there.

6.1A1A2step 4.1step 5.1step 5.2∎

The constructed law satisfies the defining identity by step 4.1, is unique by step 5.1, and has the origin-atom property by step 5.2. AC and Countable Choice [A1]–[A2] are inherited supplier assumptions; the construction itself uses no choice beyond the Lebesgue-measure supplier.

Sources

Last and Penrose, Chapter 9, Theorem 9.1 and Lemma 9.2; Baddeley, Lecture 3, §3.2. The construction is given locally rather than by conditioning on a null event.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Factorial and reduced factorial moment measures are well-defined and locally finite

Statement

Assume AC and Countable Choice as inherited through the random-point-process supplier. Let η be a locally square-integrable stationary point process. The pathwise second factorial measure η(2) is measurable as a random measure; its expectation α(2) and the reduced second factorial moment measure αred(2) of Second factorial and reduced second factorial moment measures are Borel measures, finite on bounded sets.

Facts & Assumptions

Given: AC, Countable Choice, a random locally finite counting measure η on Rd, stationarity, and E[η(K)2]<∞ for every compact K.

[A1]

AC is carried by the transitive point-process supplier dependencies; this proof makes no selection. (The Axiom of Choice)

[A2]

Countable Choice is carried by the transitive point-process supplier dependencies; this proof makes no selection. (The Axiom of Countable Choice (ACω))

[F1]

A point process is a measurable random element into locally finite counting measures; each realization is a finite or countable sum of Dirac masses, with repetitions allowed, and evaluations generate the configuration sigma-algebra. (Random measures and locally finite point processes)

[F2]

For sigma-finite measures the product measure exists and has the rectangle formula. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F3]

Parameterized nonnegative integration against an evaluation kernel is measurable. (Measure kernel and probability kernel, Measurability of integration against a kernel)

[F4]

A countable nonnegative sum of measures is a measure. (Nonnegative scalar multiples and countable weighted sums of measures are measures)

[F5]

Increasing limits pass through nonnegative expectations and integrals; pointwise limits of measurable extended-real functions are measurable. (Monotone convergence for the integral, Expectation of a nonnegative or integrable random variable, Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable)

[F6]

Local square integrability gives E[η(K)2]<∞ for every compact K. (Second factorial and reduced second factorial moment measures)

Proof

Given: The stated locally square-integrable stationary point process and its occurrence-indexed definitions.

1.1F1F2F4algebra

Fix a realization μ=∑i∈JδXi. Define μ(2):=∑i,j∈J, i≠jδ(Xi,Xj) directly as a countable sum of Dirac measures; [F4] makes it a measure, and it is finite on compact subsets of R2d because μ(K)2<∞ for a compact K containing both coordinate projections. On every bounded Borel C, this agrees with (μ⊗μ)(C)−(Δ#μ)(C), where Δ(x)=(x,x): both terms are finite there and the second removes exactly the equal-index pairs. Thus no subtraction of infinite values is used.

2.1step 1.1F1F3F5

Let Kn=[−n,n]d. For each Borel C⊆R2d, the evaluations (μ⊗μ)(C∩(Kn×Kn)) and Δ#μ(C∩(Kn×Kn)) are measurable functions of μ: the first is obtained by two successive integrations against the evaluation kernel [F3], and the second is evaluation on the Borel preimage under the continuous diagonal map [F1]. Both are finite; their difference is nonnegative and, by step 1.1, equals μ(2)(C∩(Kn×Kn)). These values increase to μ(2)(C) because Kn×Kn increases to all of R2d. Hence [F5] makes μ↦μ(2)(C) measurable.

3.1step 2.1F5F6

For pairwise disjoint Borel Cj, countable additivity of each η(2) gives η(2)(⋃jCj)=∑jη(2)(Cj) pointwise; [F5] passes the increasing partial sums through expectation. Thus α(2) is a measure. If C is bounded, choose compact K with C⊆K×K; then η(2)(C)≤η(K)2, so [F6] gives α(2)(C)<∞.

4.1step 2.1step 3.1F5F6

For Borel D⊆Rd, GD={(x,y):x∈Q, y−x∈D} is Borel because (x,y)↦y−x is continuous and Q is Borel. The map D↦η(2)(GD) is the pushforward under (x,y)↦y−x of the restriction of η(2) to Q×Rd, so it is a measure; it is measurable in η by step 2.1. Taking expectations and using [F5] shows αred(2) is a measure. If D is bounded, GD is contained in K×K for some compact K containing Q‾ and Q‾+D‾, so η(2)(GD)≤η(K)2 and [F6] makes its expectation finite.

5.1A1A2step 1.1step 2.1step 3.1step 4.1∎

Steps 1.1–4.1 establish the occurrence-indexed factorial measures, their measurability, and local finiteness. Multiplicity is retained because only equal occurrence indices are removed in step 1.1. The axioms [A1]–[A2] are inherited supplier assumptions and are not used by this construction.

Sources

Last and Penrose, Chapter 4, §4.2 and Chapter 8, Proposition 8.7 proof; Baddeley, Lecture 2, §§2.3–2.4. The local proof supplies measurability and handles multiplicities explicitly.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Spatial ergodic limit for counts in dilates of a convex window

Statement

Assume AC and Countable Choice as carried by the point-process supplier and Borel Lebesgue measure. Let η be a stationary locally finite point process on Rd with finite positive intensity ρ. Let W⊆Rd be compact and convex with nonempty interior, let an>0 with an→∞, and put Q=[0,1)d. For the full translation-invariant sigma-algebra Iη from Stationarity, finite intensity, and spatial ergodicity,

η(anW)∣anW∣⟶E[η(Q)∣Iη]in L1.

If the translation action is ergodic, the limit is the constant ρ. This statement gives no rate and no central limit theorem.

Facts & Assumptions

Given: AC, Countable Choice, a stationary point process η on Rd with 0<ρ<∞, a compact convex window W with nonempty interior, and scales an→∞.

[A1]

AC is inherited through the transitive point-process supplier dependencies; the spatial averaging proof below makes no selection. (The Axiom of Choice)

[A2]

Countable Choice is inherited through the point-process and Borel Lebesgue measure suppliers. (The Axiom of Countable Choice (ACω))

[F1]

Recentering is (θxμ)(B)=μ(B+x) with θx+y=θxθy; stationarity means the configuration law is invariant under every θx, and Iη consists of events invariant modulo null sets under every translation. (Recentering a point configuration at a spatial location, Stationarity, finite intensity, and spatial ergodicity)

[F2]

The recentering action is jointly measurable, so each stationary θx acts as a measurable measure-preserving map on the canonical configuration space. (The spatial recentering action is jointly measurable, Measure-preserving transformations and systems)

[F3]

The mean measure of η is ρλd, so Eη(B)=ρ∣B∣ for every Borel B. (A stationary point process of finite intensity has mean measure rho times Lebesgue measure)

[F4]

A real integrable stationary sequence has Cesaro averages converging in L1; this is proved choice-free. (An integrable stationary sequence has an L1 Cesaro limit)

[F5]

A compact convex window admits finite inner rectangle approximations, satisfies ∣aW∣=ad∣W∣, and has negligible translated symmetric-difference ratio. (Compact convex windows admit rectangle approximations and have negligible translated boundary)

[F6]

A locally finite translation-invariant Borel measure is its unit-cube mass times Lebesgue measure. (A locally finite translation-invariant Borel measure on Rd is a multiple of Lebesgue measure)

[F7]

A conditional-expectation version is an integrable Iη-measurable function whose integrals agree with those of η(Q) on every event in Iη. (Conditional expectation given a sigma algebra)

Proof

Given: The stated point process, Q=[0,1)d, translations Txη=θxη, W, and (an).

1.1givenF1F2F3

Work on the canonical configuration probability space with law Pη, and put f(μ)=μ(Q). By [F2], each Tx is measurable; by [F1], stationarity makes it measure preserving and Tx+y=TxTy. By [F3], f∈L1(Pη) and Ef=ρ.

1.2F1F2F4algebra

For j=1,…,d let Tj=Tej, where ej is the jth coordinate vector. For any g∈L1(Pη), the sequence (g∘Tjk)k≥0 is stationary: shifting a finite vector by m composes it with the measure-preserving map Tjm. By [F4] its averages An(j)g=n−1∑k=0n−1g∘Tjk converge in L1; denote their limit by Pjg. The averages are L1 contractions, so limits preserve linearity and satisfy ∥Pjg−Pjh∥1≤∥g−h∥1. Also Pjg is Tj-invariant because ∥An(j)g∘Tj−An(j)g∥1≤2∥g∥1/n. Since the translations commute, Pj preserves invariance under every Ti with i≠j.

2.1step 1.2F3F4algebra

Define g0=f and gj=Pjgj−1. For positive integers n1,…,nd, let An1,…,nd=And(d)⋯An1(1)f. Contractivity and the definition of Pj give inductively ∥An1,…,nj−gj∥1≤∥An1,…,nj−1−gj−1∥1+∥Anj(j)gj−1−gj∥1. Thus An1,…,nd→Z:=gd in L1 whenever every nj→∞. The variable Z is nonnegative, invariant under every integer-coordinate translation, and EZ=Ef=ρ.

3.1step 2.1F1F2algebra

The rectangular average with coordinate lengths nj and starting indices mj∈Z is An1,…,ndf∘Tm, where Tm=θ(m1,…,md). Since Z∘Tm=Z almost surely and Tm preserves Pη, its L1 distance from Z equals ∥An1,…,ndf−Z∥1, which tends to zero.

4.1step 3.1F3algebra

Let R=∏j=1d[bj,cj) be a bounded half-open rectangle with positive side lengths. In each coordinate, the complete unit cells contained in anR form an integer interval with length nj,n satisfying nj,n/an→cj−bj. Their product is a translated rectangular block of unit cells. By step 3.1, its count divided by ∏jnj,n converges in L1 to Z. The uncovered part of anR has volume and∣R∣−∏jnj,n=o(and); by [F3] its expected count has the same order. Therefore an−dη(anR)→∣R∣Z in L1.

5.1step 4.1F3F5algebra

Fix ϵ>0 and choose by [F5] a finite disjoint union R=⋃q=1NRq of half-open rectangles inside W with ∣W∖R∣<ϵ. Applying step 4.1 to each rectangle gives an−dη(anR)→∣R∣Z in L1. Also, by [F3], E[an−dη(an(W∖R))]=ρ∣W∖R∣<ρϵ. Since Z≥0 and EZ=ρ, the triangle inequality yields lim sup⁡nE∣an−dη(anW)−∣W∣Z∣≤2ρϵ. Arbitrariness of ϵ proves an−dη(anW)→∣W∣Z in L1.

6.1step 5.1F5algebra

By [F5], ∣anW∣=and∣W∣ and ∣W∣>0. Dividing the convergence in step 5.1 by ∣W∣ gives η(anW)/∣anW∣→Z in L1.

7.1step 6.1F1F2F3F5

For fixed x∈Rd, stationarity and [F3] give ∥η(anW+x)∣anW∣−η(anW)∣anW∣∥1≤ρ∣(anW+x)△anW∣∣anW∣⟶0 by [F5]. Together with step 6.1 and measure preservation, this implies Z∘Tx=Z almost surely for every fixed x. Hence every rational threshold set {Z>q} is in Iη, so Z is Iη-measurable.

7.2step 6.1F1F3F6F7

Let A∈Iη and define νA(B)=E[1Aη(B)]. Monotone convergence makes νA a measure; it is locally finite since νA≤ν=ρλd. For any x, stationarity and A's invariance modulo null sets give νA(B+x)=νA(B): writing ζ=θxη, stationarity gives L(ζ)=Pη, while 1A(η)=1A(θ−xζ)=1A(ζ) almost surely by A∈Iη. Thus E[1Aη(B+x)]=E[1A(η)(θxη)(B)]=E[1A(ζ)ζ(B)]=E[1Aη(B)]. By [F6], νA(B)=νA(Q)∣B∣=E[1Aη(Q)]∣B∣. Therefore, for each n, E[1Aη(anW)∣anW∣]=E[1Aη(Q)]. Passing to the L1 limit in step 6.1 shows E[1AZ]=E[1Aη(Q)] for every A∈Iη. By [F7], Z is a version of E[η(Q)∣Iη].

8.1A1A2step 2.1step 7.1step 7.2F1∎

If the translation action is ergodic, every event of Iη has probability zero or one. If the real Iη-measurable variable Z were not almost surely constant, there would be real a<b with Pη(Z≤a)>0 and Pη(Z≥b)>0; choosing a rational q∈(a,b) would make {Z>q} an invariant event of probability strictly between zero and one, a contradiction. Thus Z is constant almost surely. Its expectation is ρ by step 2.1, so Z=ρ almost surely. The result is only an L1 law of large numbers: it supplies neither a rate nor a CLT. AC and Countable Choice [A1]–[A2] are inherited supplier assumptions; the coordinate-sequence mean argument itself is choice-free.

Sources

Last and Penrose, Chapter 8, Theorem 8.14 and Appendix B.2, Theorem B.11; Baddeley, Lecture 2, §2.4. The limit and its full translation-invariant sigma-algebra are proved locally, with no rate or CLT imported.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The reduced second factorial moment measure is the Palm expectation after one-occurrence deletion

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 Rd with intensity 0<ρ<∞, let P0 be its full Palm distribution, and let αred(2) use Q=[0,1)d. For every Borel D⊆Rd,

αred(2)(D)=ρ∫(μ−δ0)(D) P0(dμ).

The subtraction removes one distinguished occurrence at the origin; any other co-located occurrences remain.

Facts & Assumptions

Given: AC, Countable Choice, the stationary locally square-integrable point process η, intensity ρ, and its full Palm law P0.

[A1]

AC is carried by the transitive point-process supplier dependencies; the occurrence-indexed identity uses no choice. (The Axiom of Choice)

[A2]

Countable Choice is carried by the point-process and Lebesgue-measure supplier dependencies. (The Axiom of Countable Choice (ACω))

[F1]

αred(2)(D)=E∑i≠j1Q(Xi)1D(Xj−Xi), where distinct indices count occurrences, including multiplicities. (Second factorial and reduced second factorial moment measures)

[F2]

θxμ(B)=μ(B+x), so the selected occurrence at x is moved to 0 and all other occurrences are translated by −x. (Recentering a point configuration at a spatial location)

[F3]

The full Palm law satisfies the refined Campbell identity for every nonnegative jointly measurable integrand and is supported on configurations with an origin occurrence. (Existence and uniqueness of the full Palm law and the refined Campbell identity)

[F4]

The factorial and reduced moment measures are measurable locally finite Borel measures under local square integrability. (Factorial and reduced factorial moment measures are well-defined and locally finite)

Proof

Given: The stated process, Q=[0,1)d, AC, Countable Choice, and its full Palm law.

1.1F1F2algebra

Write each realization with occurrence indices, η=∑iδXi. For each selected occurrence i, recentering and subtracting one unit atom gives (θXiη−δ0)(D)=∑j≠i1D(Xj−Xi). Indeed, Xi moves to 0, and only the selected index is removed; if Xj=Xi for another index j, that remaining occurrence is still counted at 0.

1.2F2F3F4construct

Define on the product of location and configuration spaces h(x,μ)={1Q(x)(μ(D)−1D(0)),μ({0})≥1,0,μ({0})=0. This is nonnegative and product measurable: the two cases are measurable by the configuration evaluation sigma-algebra, and on the first case μ−δ0 is a counting measure. For every counted occurrence x=Xi, [F2] puts θxη in the first case, and h(x,θxη)=1Q(x)(θxη−δ0)(D).

2.1step 1.1F1F4

Summing the identity in step 1.1 over the selected indices with Xi∈Q and taking expectations, [F1] gives αred(2)(D)=E∫1Q(x)(θxη−δ0)(D) η(dx). This remains valid for extended nonnegative values by monotone summation.

3.1A1A2step 1.2step 2.1F3F4algebra∎

Apply [F3] to the integrand h from step 1.2. The result is αred(2)(D)=ρ∫∫h(x,μ) P0(dμ) dx=ρ∣Q∣∫(μ−δ0)(D) P0(dμ). Since ∣Q∣=1, this is the asserted identity. AC and Countable Choice [A1]–[A2] are inherited supplier assumptions, not additional steps in the occurrence calculation.

Sources

Last and Penrose, Chapter 9, refined Campbell identity and Exercise 9.9; Chapter 8, Definition 8.6 and Proposition 8.7; Baddeley, Lecture 2, §2.4. The index-based argument fixes the multiplicity convention explicitly.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Pair-correlation density and Ripley K-function

Definition

Assume AC and Countable Choice as carried by the point-process and Palm suppliers. Let η be stationary and locally square integrable as in Stationarity, finite intensity, and spatial ergodicity and Second factorial and reduced second factorial moment measures, with finite positive intensity ρ and reduced second factorial moment measure αred(2).

A pair-correlation density exists exactly when αred(2) is absolutely continuous with respect to Borel Lebesgue measure Lebesgue measurable sets, the family L(Rn), and the restricted set function λn. Local finiteness makes αred(2) sigma-finite, so A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density gives a density; positivity of the measure makes that density nonnegative almost everywhere, and replacing its values on the null exceptional set by zero gives a nonnegative Borel version. The density is unique up to Lebesgue-null sets. Normalize it by ρ2 and call the resulting nonnegative Borel function g:

αred(2)(D)=ρ2∫Dg(u) du

for every Borel D⊆Rd. The definition does not assume pair densities for all stationary processes.

For r≥0, let B[0,r]={u∈Rd:∥u∥2≤r} be the closed Euclidean ball. Ripley's K-function is

K(r):=ρ−1∫(μ−δ0)(B[0,r]) P0(dμ),

where P0 is the full Palm distribution from The full Palm distribution defined by the refined Campbell identity and δ0 removes one distinguished occurrence at the origin. The Palm law has an origin occurrence almost surely by Existence and uniqueness of the full Palm law and the refined Campbell identity, and the reduced-measure identity The reduced second factorial moment measure is the Palm expectation after one-occurrence deletion gives the equivalent expression K(r)=ρ−2αred(2)(B[0,r]). For a simple process as defined in Random measures and locally finite point processes, deleting δ0 is the same as excluding the origin location; for a multiplicity-bearing process other co-located occurrences remain.

Axiom convention. AC and Countable Choice are inherited through the point-process and Palm dependency closure; no further choice is used by these definitions.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Border-corrected estimator for Ripley K

Definition

Assume the point-process supplier's AC and Countable Choice convention. Let η be the stationary locally square-integrable point process with finite positive intensity from Pair-correlation density and Ripley K-function. Given a compact convex observation window W⊆Rd with 0<∣W∣<∞, where ∣⋅∣ is Borel Lebesgue measure as in Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, let ξ(A):=η(A∩W) for Borel A be the complete observed counting measure in W as in Random measures and locally finite point processes, and fix a radius r≥0. Define the border window

W−r:={x∈W:B‾[x,r]⊆W},

where B‾[x,r] is the closed Euclidean ball under the Euclidean norm used in Pair-correlation density and Ripley K-function. Since W is closed, W−r=⋂∥z∥2≤r(W−z) is closed and hence Borel. Let Nξ(A)=ξ(A) count occurrences, including multiplicities, and put ρ^=Nξ(W)/∣W∣. The border anchor weight is wW,r(x)=1 for x∈W−r and 0 otherwise.

If Nξ(W−r)=0, return not defined. Otherwise Nξ(W)>0 because W−r⊆W, so ρ^Nξ(W−r)>0. For an occurrence representation ξ=∑iδXi, return

K^border(r):=1ρ^ Nξ(W−r)∑i:Xi∈W−r∑j≠i1{∥Xj−Xi∥2≤r}.

Every eligible anchor has its full closed radius-r neighborhood inside W, so all its radius-r partner occurrences are observed. This defines a finite-data procedure only; it asserts no unbiasedness, consistency, or asymptotic guarantee.

Axiom convention. The procedure itself makes no choices; AC and Countable Choice are inherited through its point-process and K dependencies.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Ripley K for a homogeneous Poisson process is Euclidean ball volume

Statement

Assume AC and Countable Choice as carried by the point-process supplier. Let η be a stationary homogeneous Poisson point process on Rd with intensity measure ρλd, where ρ>0. For every r≥0,

K(r)=∣B[0,r]∣.

The full Palm law is P0=L(η+δ0); adding and then deleting the distinguished atom means one occurrence, so no simplicity assumption is used.

Facts & Assumptions

Given: AC, Countable Choice, the stationary homogeneous Poisson process η, its full Palm law, and the closed ball convention.

[A1]

AC is carried by the transitive point-process supplier dependencies; this proof adds no choice. (The Axiom of Choice)

[A2]

Countable Choice is carried by the point-process and Lebesgue-measure supplier dependencies. (The Axiom of Countable Choice (ACω))

[F1]

The deletion-form Mecke identity holds for every nonnegative product-measurable integrand and removes one counted occurrence. (Mecke identity for locally finite Poisson point processes)

[F2]

The full Palm law satisfies the refined Campbell identity. (Existence and uniqueness of the full Palm law and the refined Campbell identity)

[F3]

Recentering is (θxμ)(B)=μ(B+x), is jointly measurable, and sends δx to δ0. (Recentering a point configuration at a spatial location, The spatial recentering action is jointly measurable)

[F4]
[F5]

K(r)=ρ−1E0[(μ−δ0)(B[0,r])] for the closed ball. (Pair-correlation density and Ripley K-function)

[F6]

For every compact C, the Poisson count η(C) has parameter ρ∣C∣<∞ and second moment (ρ∣C∣)2+ρ∣C∣. (Poisson and Cox point processes, Normalization, moments, and generating function of the Poisson count law)

Proof

Given: AC, Countable Choice, a stationary homogeneous Poisson process η of intensity ρλd, and its full Palm law P0.

1.1givenF5F6algebra

For each compact C⊆Rd, [F6] gives E[η(C)2]=(ρ∣C∣)2+ρ∣C∣<∞, so η is locally square integrable and satisfies the second-order premise of the K definition [F5].

1.2F1F3construct

Fix a configuration event A. In [F1] use hA(x,μ)=1Q(x)1A(θx(μ+δx)), which is product measurable by [F3] and the evaluation formula for adding one atom. At each occurrence x of η, deletion followed by addition restores η, so the left side is E∫1Q(x)1A(θxη)η(dx).

2.1step 1.2F1F2F3algebra

The right side of that Mecke identity is ρ∫QP(θx(η+δx)∈A) dx=ρ∣Q∣P(η+δ0∈A), because θxδx=δ0 and stationarity gives θxη=dη. The refined Palm identity [F2] applied to 1Q(x)1A(μ) says that the left side in step 1.2 is ρ∣Q∣P0(A). Since ∣Q∣=1 and ρ>0, P0(A)=P(η+δ0∈A) for every A, proving the full-Palm law identity.

3.1step 1.1step 2.1F4F5algebra

Under this Palm law, μ has the distribution of η+δ0. Removing the single distinguished occurrence gives (η+δ0)−δ0=η even if η has other occurrences at 0. Therefore E0[(μ−δ0)(B[0,r])]=E[η(B[0,r])]=ρ∣B[0,r]∣ by [F4]. Substituting in the K definition [F5] yields K(r)=∣B[0,r]∣.

4.1A1A2step 3.1F4F5∎

The endpoint r=0 is included: the closed ball is {0} and the same calculation gives K(0)=ρ−1Eη({0})=0=∣{0}∣. The proof uses the one-occurrence deletion convention and asserts neither diffuse-intensity simplicity nor any other simplicity property. AC and Countable Choice [A1]–[A2] are inherited supplier assumptions.

Sources

Last and Penrose, Chapters 4 and 9, Mecke equation and Theorem 9.4; Baddeley, Lecture 3, Example 3.3. The local proof derives the full Palm law directly from Mecke.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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 Rd with intensity ρ>0, and suppose its pair-correlation density g exists in the sense of Pair-correlation density and Ripley K-function. Then, for every r≥0,

K(r)=∫B[0,r]g(u) du.

For a simple process, the same K-function also satisfies K(r)=ρ−1E0[μ(B[0,r]∖{0})].

Facts & Assumptions

Given: AC, Countable Choice, the stationary locally square-integrable point process, its full Palm law, and the assumed density g.

[A1]

AC is inherited through the transitive point-process dependencies; no additional selection is made. (The Axiom of Choice)

[A2]

Countable Choice is inherited through the point-process and Palm dependencies. (The Axiom of Countable Choice (ACω))

[F1]

K(r)=ρ−1∫(μ−δ0)(B[0,r])P0(dμ), and a pair-correlation density satisfies αred(2)(D)=ρ2∫Dg(u)du. (Pair-correlation density and Ripley K-function)

[F2]

αred(2)(D)=ρ∫(μ−δ0)(D)P0(dμ), deleting one distinguished occurrence. (The reduced second factorial moment measure is the Palm expectation after one-occurrence deletion)

[F3]

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)

[F4]

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.

1.1F1F2algebra

Apply [F2] with D=B[0,r] and divide by ρ2>0. By the K definition [F1], K(r)=ρ−2αred(2)(B[0,r]).

1.2F1F3F4algebra

Suppose η is simple. The event A2={μ:μ({0})≥2} is measurable by the evaluation sigma-algebra. In the refined Campbell identity [F3], take h(x,μ)=1Q(x)1A2(μ) with Q=[0,1)d. On the probability-one event of simple realizations, every counted occurrence x has (θxη)({0})=η({x})=1, so the left side is zero. The right side is ρ∣Q∣P0(A2)=ρP0(A2), hence P0(A2)=0. Combining this with the at-least-one origin property in [F3] gives μ({0})=1 P0-almost surely. Therefore (μ−δ0)(B[0,r])=μ(B[0,r]∖{0}) P0-almost surely, and the definition [F1] gives the stated simple-process formula.

2.1step 1.1F1algebra

The density clause in [F1] applied to the same closed ball gives αred(2)(B[0,r])=ρ2∫B[0,r]g(u)du. Substitution in step 1.1 proves the asserted integral formula.

3.1A1A2step 1.1step 1.2F1∎

At the endpoint r=0, the closed-ball convention gives B[0,0]={0}, so K(0)=ρ−1E0[μ({0})−1]; this is 0 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.

5 · Examples, counterexamples and false statements

None yet.

Sources