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.

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.

Depends on

Used by

Dependency tree · two levels

28 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