Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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 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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

36 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