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

Campbell, Laplace, Mecke, and Cox moment formulas

Statement

Let η be a Poisson point process on the locally compact, second-countable Hausdorff space S, with locally finite, sigma-finite intensity measure ν. For every nonnegative Borel f, its Campbell and Laplace formulas are E[η(f)]=ν(f) and E[e−η(f)]=e−ν(1−e−f), with e−∞=0. For every nonnegative g measurable for the product of the Borel and evaluation sigma-algebras on S×Nlf(S), the add-one Mecke formula and its deletion form are E[∫g(x,η) η(dx)]=∫E[g(x,η+δx)] ν(dx) and E[∫g(x,η−δx) η(dx)]=∫E[g(x,η)] ν(dx); in the second integral one occurrence is deleted at each counted point, with multiplicity retained. Conversely, a locally finite point process with locally finite, sigma-finite mean measure ν is Poisson if it satisfies the deletion identity for every such g.

If η is Cox directed by a random locally finite measure ξ with supplied probability kernel K, write Pξ for the law of ξ and ν(B)=Eξ(B) for its mean measure. Then for Pξ-almost every μ, ∫e−ζ(f)K(μ,dζ)=e−μ(1−e−f) and ∫ζ(f)2K(μ,dζ)=μ(f2)+μ(f)2. Consequently Eη(f)=ν(f), E[e−η(f)]=E[e−ξ(1−e−f)], and E[η(f)2]=ν(f2)+E[ξ(f)2], all as extended nonnegative identities. Thus E[η(f)2]<∞ exactly when ∫f2 dν<∞ and E[ξ(f)2]<∞; then Var⁡(η(f))=ν(f2)+Var⁡(ξ(f)). All formulas allow multiplicities and assert neither simplicity under diffuse intensity nor uniqueness of a Cox directing law.

Facts & Assumptions

Given: The stated point-process and Cox models and nonnegative measurable test functions.

[F1]

The mean measure ν(B)=Eζ(B) is a measure, nonnegative random integrals are measurable, and Eζ(f)=∫f dν for every nonnegative Borel f. (Mean measures and measurable nonnegative integrals of random measures)

[F2]

The finite-intensity Mecke identity holds for every nonnegative measurable integrand. (Mecke identity for a finite-intensity Poisson point process)

[F4]

Independence of count-generated sigma-algebras follows by extending cylinder-event factorization from a generating pi-system; finite product laws are unique and nonnegative iterated integrals obey Tonelli. (Dynkin's pi-lambda theorem, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)

[F5]

The addition map (x,μ)↦μ+δx and the deletion map on D={(x,μ):μ({x})≥1} are measurable in the evaluation sigma-algebras; the evaluation kernel permits measurable nonnegative random integrals. (Random measures and locally finite point processes, Deleting one occurrence from a locally finite counting measure is measurable, Measure kernel and probability kernel, Measurability of integration against a kernel)

[F6]

A Poisson random integral satisfies Eη(f)=ν(f) and Eη(f)2=ν(f2)+ν(f)2, including extended values. (First and second moments of a Poisson random integral)

[F7]

Increasing simple approximations and monotone convergence apply to nonnegative measurable functions and integrals. (Every nonnegative measurable function is the increasing limit of simple measurable functions, Monotone convergence for the integral)

[F8]

A Cox model supplies a regular conditional probability kernel K; integration of a nonnegative measurable function against that kernel gives the joint expectation by iterated integration. (Conditional law given a random element, Measure kernel and probability kernel, Measurability of integration against a kernel)

Proof

technique · direct
1.1givenF1F9

For every Borel B with ν(B)<∞, the defining Poisson law and the scalar mean identity [F9] give Eη(B)=ν(B); if ν(B)=∞, the extended-count convention gives the same equality. Apply [F1] with ζ=η to obtain Campbell's formula for every nonnegative Borel f.

1.2givenF9algebra

First take a nonnegative simple s=∑j=1mcj1Bj on disjoint Borel sets, discarding zero coefficients. Independence of the counts and the scalar generating function [F9] give Ee−η(s)=∏jexp⁡(ν(Bj)(e−cj−1))=exp⁡(−ν(1−e−s)); when cj>0 and ν(Bj)=∞, both sides are zero by the infinite-count convention.

1.3givenF5construct

The point-addition map is measurable because each output evaluation is (μ+δx)(B)=μ(B)+1B(x), and configuration addition is measurable because (μ+ζ)(B)=μ(B)+ζ(B); both follow from the evaluation sigma-algebra. Thus hμ(x,ζ):=h(x,μ+ζ) is measurable for fixed μ. For a random locally finite counting measure ζ, the map ω↦∫h(x,ζ(ω))ζ(dx,ω) is measurable by applying the kernel-integration theorem to the evaluation kernel with parameter ζ. This makes the random integrals below well-defined.

2.1givenstep 1.2F7

Choose simple sn↑f using [F7]. Then 1−e−η(sn)↑1−e−η(f) and 1−e−sn↑1−e−f. Monotone convergence [F7] on the probability space and on (S,ν) passes the simple identity of step 1.2 to the asserted Laplace formula.

2.2givenF2F3F4step 1.3construct

Let (Kn) be the compact exhaustion [F3], set A1=K1 and Ai=Ki∖Ki−1 for i≥2, and define ηi(B)=η(B∩Ai) and η−i(B)=η(B∖Ai). The sets Ai are Borel by [F3]. Each ηi is a finite-intensity Poisson process with intensity νi(B)=ν(B∩Ai), since Ai⊆Ki and ν(Ki)<∞. The sigma-algebras generated by evaluations of ηi and η−i are independent: their generating cylinder events concern disjoint regions, so [F3]-[F4] extend the independent-count property to those sigma-algebras. Also η=ηi+η−i.

3.1step 1.3step 2.2F2F4

For fixed i, integrate first over the independent laws of η−i and ηi. Applying the finite-intensity identity [F2] to hμ(x,ζ)=h(x,μ+ζ) for each fixed background μ gives E∫h(x,η)ηi(dx)=∫E[h(x,η+δx)] νi(dx). Summing over i and using Tonelli [F4] yields the add-one identity, since ∑iηi=η and ∑iνi=ν.

3.2givenstep 2.1F6F8

Now let η be Cox directed by ξ and use its supplied kernel K. For Pξ-almost every μ, K(μ,⋅) is a Poisson law of intensity μ; [F6] and step 2.1 therefore give ∫ζ(f)K(μ,dζ)=μ(f), ∫e−ζ(f)K(μ,dζ)=e−μ(1−e−f), and ∫ζ(f)2K(μ,dζ)=μ(f2)+μ(f)2. The conditional-law identity [F8] and nonnegative kernel integration average these formulas over Pξ.

4.1step 3.1F5algebra

For nonnegative measurable g, define H(x,μ)=1D(x,μ)g(x,μ−δx) on D and H=0 off D. This is measurable by [F5]. For η-almost every counted point x, (x,η)∈D, while (x,η+δx)∈D for every x; applying step 3.1 to H gives E∫g(x,η−δx)η(dx)=∫E[g(x,η)]ν(dx). A mass m at x contributes m times the configuration with mass m−1, so the formula retains multiplicity.

4.2step 3.2F1F8

By [F1], Eξ(f)=ν(f) and Eξ(f2)=ν(f2). Integrating step 3.2 gives Eη(f)=ν(f), Ee−η(f)=Ee−ξ(1−e−f), and Eη(f)2=ν(f2)+Eξ(f)2, all with extended nonnegative values.

5.1givenstep 4.1F5

Conversely, suppose the deletion identity holds for every nonnegative measurable g. For any such h, set g(x,μ)=h(x,μ+δx), which is measurable by [F5]. Then g(x,η−δx)=h(x,η) at every counted point and g(x,η)=h(x,η+δx) on the right, so the add-one identity follows.

6.1givenstep 5.1F5algebra

Fix disjoint Borel sets B1,…,Br with finite aj=ν(Bj) and write Nj=η(Bj). Applying the add-one identity of step 5.1 to h(x,μ)=1Bi(x) gives ENi=ai, so each Ni is finite almost surely. For a count vector k∈N0r, put pk=P(N1=k1,…,Nr=kr). Use hi(x,μ)=1Bi(x)1{μ(Bj)=kj  ∀j} in the same identity. Disjointness makes insertion of x∈Bi increase only the ith count, so kipk=aipk−ei for ki≥1, and the right side is zero when ki=0.

7.1step 6.1F9algebra

Iterating the recurrences of step 6.1 gives pk=p0∏j=1rajkj/kj!, with the convention 00=1. Since the probabilities sum to one and each scalar Poisson mass sequence is normalized [F9], finite product summation gives p0=e−∑jaj and pk=∏je−ajajkj/kj!. Hence the counts on every finite family of disjoint finite-intensity sets are independent Poisson variables.

8.1step 7.1F3F7F9algebra

If B has ν(B)=∞, let Cn=B∩Kn. Then ν(Cn)<∞ and ν(Cn)↑∞. For each integer M≥0, P(η(B)≤M)≤e−ν(Cn)∑k=0Mν(Cn)k/k!→0, because e−ttk→0 as t→∞ (use et≥tk+1/(k+1)!). Thus η(B)=∞ almost surely. For any finite disjoint family, infinite-mean counts are therefore constants +∞ and the finite-mean coordinates have the independent laws from step 7.1; this is the defining extended Poisson count convention.

9.1step 4.2F9algebra∎

A sum of two nonnegative extended numbers is finite exactly when both summands are finite, so step 4.2 gives Eη(f)2<∞ exactly when ν(f2)<∞ and Eξ(f)2<∞. In that case η(f) and ξ(f) are square-integrable; [F9] and step 4.2 yield Var⁡(η(f))=ν(f2)+Var⁡(ξ(f)).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

105 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