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.

✓ 4 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Poisson and Cox point processes

1 · Prerequisites

2 · Summary

This page defines locally finite counting measures with multiplicities, Poisson and Cox processes, and the scalar count law. It proves the finite mixed-binomial construction, sigma-finite existence under countable choice and dependent choice, Campbell and Laplace formulas, both add-one and deletion forms of Mecke's identity with its converse, and Cox mean, Laplace, and second-moment identities. A supplied regular conditional kernel is part of the Cox model. Diffuse-intensity simplicity, directing-law uniqueness, and compensator theory are outside this page's claims.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Random measures and locally finite point processes

Definition

Fix a locally compact, second-countable Hausdorff topological space S (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Second countability: an at most countable basis for the topology, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not). Here locally compact means that every point has a compact neighbourhood; second countable means that the topology has an at most countable basis; and Hausdorff means that distinct points have disjoint open neighbourhoods. Let B(S) be the Borel sigma-algebra generated by the open sets (The Borel sigma-algebra of a topological space).

A counting measure on S is a Borel measure of the form μ=∑j∈Jδxj for a finite or countable index set J and points xj∈S, where repetitions are allowed and the empty sum is zero. Each δx is the unit point mass at x (The Dirac set function at a point, A Dirac set function is a probability measure), and the countable sum is a measure by Nonnegative scalar multiples and countable weighted sums of measures are measures. The multiplicity at x is μ({x}). The counting measure is locally finite if μ(K)<∞ for every compact subset K⊆S (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

Let Nlf(S) be the set of locally finite counting measures, equipped with the sigma-algebra generated by the evaluation maps μ↦μ(B) for B∈B(S). A point process on S is a measurable map η:(Ω,F,P)→(Nlf(S),E) from a probability space (Probability measures and probability spaces), with measurability in the sense of A measurable function between measurable spaces. Equivalently, every count η(B) is a measurable random variable, because the evaluation maps generate E. Its law is the probability measure Pη(A)=P(η−1(A)) on (Nlf(S),E) (Law or distribution of a random element, The law of a random element is a probability measure). The process is classified by its realized configurations: a configuration μ is simple if μ({x})≤1 for every x, and is multiplicity-bearing if some singleton has mass greater than one. This is a pointwise distinction; no almost-sure simplicity assertion is part of this definition.

Let Mlf(S) be the set of all locally finite Borel measures on S, with the sigma-algebra generated by their evaluation maps. A random locally finite measure ξ is a measurable map into this space.

For a nonnegative Borel function f, write η(f):=∫Sf dη. Define the expected measure, or intensity measure, by ν(B):=E[η(B)]. The expected-measure and random-integral measurability assertions are justified by Mean measures and measurable nonnegative integrals of random measures ↗. The measure ν need not be locally finite; it is locally finite exactly when E[η(K)]<∞ for each compact K.

The mean measure of a random locally finite measure is likewise ν(B)=E[ξ(B)], covered by the same expected-measure lemma. Local finiteness of each realization does not by itself assert local finiteness of ν.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Second-countable locally compact Hausdorff spaces admit compact exhaustions

Statement

Let S be locally compact, second countable, and Hausdorff. There is an increasing sequence of compact subsets Kn such that ⋃n≥1Kn=S and every compact subset of S is contained in some Kn.

Facts & Assumptions

Given: A topological space S that is locally compact, second countable, and Hausdorff.

[F1]

Local compactness means each point has a compact neighbourhood, and second countability supplies an at most countable basis. (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Second countability: an at most countable basis for the topology)

Proof

technique · direct
1.1givenF1F2F3choose

Fix an at most countable basis B for S and let U={U∈B:U‾ is compact}. For any x∈S, [F2] with O=S gives an open V containing x whose closure is compact. The basis property gives U∈B with x∈U⊆V; then U‾⊆V‾, and U‾ is closed in the compact space V‾, hence compact by [F3]. Thus U is an at most countable open cover of S.

2.1step 1.1F3construct

If S=∅, take Kn=∅. Otherwise enumerate the subfamily U by filtering the fixed countable basis in its given enumeration; if the subfamily is finite, repeat its last member. Put Kn=⋃j=1nU‾j. An open cover of Kn restricts to an open cover of each of the finitely many compact sets U‾j; taking the union of their finite subcovers gives a finite subcover of Kn. Thus Kn is compact. The sequence is increasing, and its union is S because U covers S.

3.1step 1.1step 2.1F4

Let C⊆S be compact. The open cover U of C has a finite subcover by the ambient-cover criterion in [F4]. Let n be at least every index in that finite subcover. Then C⊆⋃j=1nUj⊆Kn. Thus every compact C is contained in some Kn.

4.1step 2.1step 3.1∎

Steps 2.1 and 3.1 give the required increasing compact exhaustion and its cofinal containment property. The construction uses only a fixed countable basis and finite subcovers, so it invokes no choice principle.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

The scalar Poisson count law

Definition

For a finite parameter λ≥0, the Poisson count law Pois⁡(λ) is the probability measure on N0={0,1,2,…} whose masses are Pois⁡(λ){k}=e−λλkk!,k∈N0, when λ>0, and is the point mass at 0 when λ=0. The normalization and the moment and generating-function identities used below are proved in Normalization, moments, and generating function of the Poisson count law ↗. The separate extended convention for a Poisson point-process count on a Borel set of infinite intensity is that the count equals +∞ almost surely; it is not a finite Poisson probability law.

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

Mean measures and measurable nonnegative integrals of random measures

Statement

Let ζ be a random locally finite Borel measure on S; in particular, ζ may be a point process. Then ν(B):=E[ζ(B)] is a measure, and for every nonnegative Borel f the map ω↦ζω(f) is a measurable extended nonnegative random variable satisfying E[ζ(f)]=∫f dν. The mean measure ν is locally finite if and only if E[ζ(K)]<∞ for every compact K.

Facts & Assumptions

Given: A measurable random element ζ whose values are locally finite Borel measures on S.

[F1]

Each realization ζω is a measure, and every evaluation ω↦ζω(B) is measurable. (Random measures and locally finite point processes)

[F2]

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

[F3]

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

[F4]

Every nonnegative measurable function is the increasing pointwise limit of nonnegative simple measurable functions. (Every nonnegative measurable function is the increasing limit of simple measurable functions)

[F5]

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

[F6]

A measure is zero at the empty set and countably additive on pairwise disjoint measurable sets. (Measures on sigma-algebras)

Proof

technique · direct
1.1givenF1F2F6

The function ν(B)=E[ζ(B)] is defined for every Borel set B by [F1] and [F2], and ν(∅)=0 because each measure ζω vanishes at ∅.

1.2givenF1F4F5

Let f≥0 be Borel and choose sn↑f as in [F4]. If sn is simple, its integral against ζ is a finite nonnegative linear combination of the measurable evaluations in [F1], hence is measurable. For each ω, monotone convergence for the measure ζω gives ζω(sn)↑ζω(f). The pointwise-limit result [F5] therefore makes ω↦ζω(f) measurable.

2.1givenstep 1.1F1F2F3F6

Let (Bj)j≥1 be pairwise disjoint Borel sets. For every ω, ζω(⋃jBj)=∑jζω(Bj) by [F1] and [F6]. The finite partial sums increase, so [F3] gives ν(⋃jBj)=lim⁡n∑j=1nE[ζ(Bj)]=∑jν(Bj). Together with step 1.1 this proves that ν is a measure.

2.2givenstep 1.2F1F2F3F4

For a nonnegative simple s=∑j=1maj1Bj, the definition ν(B)=E[ζ(B)] and finite linearity give E[ζ(s)]=∫s dν. For the increasing sequence from step 1.2, both ζ(sn)↑ζ(f) pathwise and ∫sn dν↑∫f dν; applying [F3] to both nonnegative integrals proves the expectation identity.

3.1givenstep 2.1F1∎

For compact K, local finiteness of ν at K means exactly ν(K)=E[ζ(K)]<∞ by its definition. Requiring this for all compact K proves the final equivalence.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A point-process law is determined by its finite-dimensional count laws

Statement

Let η and η′ be point processes on S with the evaluation sigma algebra on Nlf(S). If every finite vector of Borel-set counts has the same distribution under η and η′, then their laws on Nlf(S) are equal.

Facts & Assumptions

Given: Point processes η,η′ with equal finite-dimensional laws of their count evaluations.

[F1]

The evaluation maps generate the configuration sigma-algebra, and the law of a point process is its push-forward probability measure. (Random measures and locally finite point processes, Law or distribution of a random element, The law of a random element is a probability measure)

[F2]

A probability measure is determined by its values on a generating pi-system. (Dynkin's pi-lambda theorem)

Proof

technique · direct
1.1givenF1construct

Let N‾0:=N0∪{+∞}, the range of every count evaluation, and let C consist of the cylinder sets {μ:μ(Bj)∈Ej, 1≤j≤m} for finite Borel families B1,…,Bm and subsets Ej⊆N‾0. Each such constraint is measurable because this countable range consists of Borel singletons in [0,+∞]. The family is a pi-system: intersecting two cylinders concatenates their finite coordinate lists, and if a Borel set occurs twice its two constraints are replaced by their intersection. Every evaluation preimage is a one-coordinate cylinder of this form, so by definition of the evaluation sigma-algebra σ(C) is the full configuration sigma-algebra.

2.1givenstep 1.1F1F2∎

The hypothesis says the laws Pη and Pη′ assign the same probability to every member of C, since membership in a cylinder is a finite-vector count event. Both are probability measures by [F1]. Applying [F2] to this generating pi-system gives Pη=Pη′.

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

Normalization, moments, and generating function of the Poisson count law

Statement

For finite λ≥0, the masses in The scalar Poisson count law sum to one. If N∼Pois⁡(λ), then E[N]=λ,E[N(N−1)]=λ2,E[N2]=λ2+λ,Var⁡(N)=λ, and E[sN]=exp⁡(λ(s−1)) for 0≤s≤1.

Facts & Assumptions

Given: A finite parameter λ≥0 and the mass formula in The scalar Poisson count law.

[F1]

For λ>0, the mass at k is e−λλk/k!; at λ=0 the law is concentrated at 0. (The scalar Poisson count law)

[F2]

The real exponential is defined by the convergent power series ex=∑k≥0xk/k! and satisfies eaeb=ea+b. (The real exponential function and the number e by a power series, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y))

[F3]

Expectation is integration against the probability law, and variance is E[(N−EN)2] when the second moment is finite. (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space)

Proof

technique · direct
1.1givenF1

If λ=0, [F1] puts all mass at 0, so the masses sum to one and the stated moments and generating function have their asserted values.

1.2givenF1F2algebra

Suppose λ>0. By [F1] and the defining exponential series [F2], ∑k=0∞e−λλkk!=e−λeλ=1. Thus the displayed masses normalize to a probability law.

2.1step 1.2F1F2F3algebra

Using [F1] and reindexing the nonnegative series, E[N]=e−λ∑k=1∞kλkk!=λe−λ∑j=0∞λjj!=λ.

3.1step 2.1F1F2F3algebra

Reindexing with j=k−2 gives E[N(N−1)]=e−λ∑k=2∞k(k−1)λk/k!=λ2e−λ∑j=0∞λj/j!=λ2 by [F2]. Since N2=N(N−1)+N, this and step 2.1 yield E[N2]=λ2+λ and hence Var⁡(N)=E[N2]−(EN)2=λ.

4.1step 1.1F1F2algebra∎

For 0≤s≤1, [F1] and [F2] give E[sN]=e−λ∑k=0∞(λs)kk!=e−λeλs=eλ(s−1). Together with step 1.1 this proves the generating-function formula also at λ=0.

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

Deleting one occurrence from a locally finite counting measure is measurable

Statement

Let D:={(x,μ)∈S×Nlf(S):μ({x})≥1}. Then D is measurable in the product evaluation sigma-algebra, and the map R:D→Nlf(S) defined by R(x,μ)=μ−δx is measurable. The subtraction removes one occurrence, so any other occurrences at x remain.

Facts & Assumptions

Given: The topological and measurable structures of S and Nlf(S) from Random measures and locally finite point processes.

[F1]

There is an increasing compact exhaustion (Kn) such that every compact subset of S is contained in some Kn. (Second-countable locally compact Hausdorff spaces admit compact exhaustions)

[F2]

Evaluation maps μ↦μ(B) generate the sigma-algebra on Nlf(S), and each μ is a locally finite measure. (Random measures and locally finite point processes)

[F3]

A measure kernel has measurable evaluations, and integration of a product-measurable nonnegative function against a uniformly sigma-finite kernel is measurable. (Measure kernel and probability kernel, Measurability of integration against a kernel)

[F4]

The product sigma-algebra is generated by measurable rectangles, and B(S) is generated by the open sets. (The product sigma-algebra and its finite iterates, The Borel sigma-algebra of a topological space)

Proof

technique · direct
1.1givenF1F2construct

On the parameter space S×Nlf(S) define Q((x,μ),B):=μ(B). For each parameter this is a measure, its evaluations are measurable by [F2], and (Kn) is a common finite-mass exhaustion because μ(Kn)<∞ for every locally finite μ. Thus Q is a uniformly sigma-finite kernel.

1.2givenF4algebra

The diagonal Δ={(x,y):x=y} is closed in S×S because S is Hausdorff. The product topology has the countable basis consisting of rectangles from countable bases of the two copies of S; every open set is a countable union of these rectangles. Hence the product Borel sigma-algebra equals B(S)⊗B(S), so 1Δ is product measurable by [F4].

2.1step 1.1step 1.2F3

For (x,μ), μ({x})=∫1Δ(x,y) Q((x,μ),dy). The measurability theorem in [F3] makes (x,μ)↦μ({x}) measurable; therefore its inverse image D of [1,∞] is measurable.

3.1givenF2step 2.1construct

On D, μ−δx is again a locally finite counting measure: in a representation of μ as a countable sum of point masses, remove one occurrence at x; no compact-set count increases. For every Borel B, R(x,μ)(B)=μ(B)−1B(x), where ∞−1 is interpreted as ∞. This evaluation is measurable on D, since both terms are measurable and on D the subtraction is nonnegative. The evaluations generate the target sigma-algebra [F2], so R is measurable.

4.1step 2.1step 3.1∎

Steps 2.1-3.1 prove measurability of the domain and deletion map, including the multiplicity convention.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Poisson and Cox point processes

Definition

Let S be as in Random measures and locally finite point processes. A Poisson point process with locally finite, sigma-finite intensity measure ν is a point process η such that for every finite pairwise-disjoint family of Borel sets B1,…,Bm, the counts η(Bi) are independent random elements (Independent random elements) and η(Bi) has the scalar Poisson law of mean ν(Bi) (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law). If ν(B)=∞, the extended count convention is η(B)=+∞ almost surely. Here sigma-finite means that S is a countable union of Borel sets of finite ν-measure (Finite, sigma-finite, and semifinite measures); for the stated S, local finiteness also implies sigma-finiteness by the compact exhaustion in Second-countable locally compact Hausdorff spaces admit compact exhaustions.

Let Mlf(S) be the evaluation-measurable space of locally finite Borel measures. A Cox point process directed by a random measure ξ consists of a point process η, a random locally finite measure ξ, and a supplied probability kernel K from Mlf(S) to Nlf(S) such that K(ξ,⋅) is a regular conditional law of η given ξ (Conditional law given a random element) and, for Pξ-almost every μ, K(μ,⋅) is the law of a Poisson point process of intensity μ. The kernel is part of the model data; this definition does not assert that such a kernel exists for every (η,ξ). The mean measure of ξ is ν(B)=E[ξ(B)], a measure by Mean measures and measurable nonnegative integrals of random measures.

Both definitions permit multiplicities. They do not assert that diffuse directing measures yield simple processes or that a Cox law determines the law of its directing measure.

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

Finite-intensity Poisson-process existence and mixed-binomial law

Statement

Let ν be a finite Borel measure on S (Finite, sigma-finite, and semifinite measures) and put λ=ν(S). A Poisson point process of intensity ν exists. If λ=0 it is the zero process. If λ>0, its law is the push-forward of ∑n=0∞e−λλnn!(νλ)⊗n on the disjoint union ∐n≥0Sn under (x1,…,xn)↦∑i=1nδxi. Every Poisson point process of finite total intensity has this same law. This is the mixed-binomial representation: the total count is Poisson and, in the construction, the n locations in component Sn have product law (ν/λ)⊗n.

Facts & Assumptions

Given: A finite Borel measure ν on S, with total mass λ=ν(S).

[F1]

A Poisson point process has independent counts on disjoint Borel sets, with scalar laws specified by their intensity measures. (Poisson and Cox point processes)

[F2]

For finite λ>0, the mass of total count n is e−λλn/n!; these masses sum to one. (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)

[F3]

Finite products of probability measures exist and have the rectangle product formula. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F4]

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

[F5]

Equal finite-dimensional laws of count evaluations determine the point process law. (A point-process law is determined by its finite-dimensional count laws)

[F6]

Each δx is a probability measure and thus a counting measure. (The Dirac set function at a point, A Dirac set function is a probability measure)

Proof

technique · direct
1.1givenF1construct

If λ=0, take a one-point probability space and let η be the zero measure. For every Borel B, ν(B)=0, so η(B)=0 has the required Poisson law and every finite vector of counts is independent.

1.2givenF2F3F4construct

Now suppose λ>0 and put Q=ν/λ. Let Ω=∐n≥0({n}×Sn) with the sigma-algebra whose sections in every Sn are product-measurable. For each n, the section map defines a probability measure Qn(A)=Q⊗n(An) on Ω, by [F3]. The countable sum P=∑n≥0e−λλnQn/n! is a probability measure by [F2] and [F4].

1.3F3F6construct

On the component (n,x1,…,xn) define η=∑i=1nδxi. For each Borel B, η(B)=∑i=1n1B(xi) is measurable on each component, so η is a random locally finite counting measure.

1.4givenF3algebra

Let B1,…,Bm be pairwise-disjoint Borel sets and let B0=S∖⋃j=1mBj. Put qj=Q(Bj). Conditional on the component Sn, independence of the n coordinates gives, for k0+⋯+km=n, P{η(Bj)=kj, 0≤j≤m∣n}=n!∏j=0mkj!∏j=0mqjkj, where 00=1. This is the multinomial count of coordinate assignments to the partition B0,…,Bm.

2.1step 1.4F1F2algebra

Put K=∑j=1mkj. Summing the conditional multinomial masses in step 1.4 over k0≥0 gives P{η(Bj)=kj,1≤j≤m}=e−λ∏j=1m(λqj)kjkj!∑k0=0∞(λq0)k0k0!=∏j=1me−λqj(λqj)kjkj!=∏j=1me−ν(Bj)ν(Bj)kjkj!, since the exponential series gives the sum as eλq0 and 1−q0=∑j=1mqj. Thus these counts are independent Poisson variables with respective means ν(Bj), proving existence with the required count laws.

3.1F1F5step 2.1

For uniqueness in distribution, take any finite family of Borel sets and partition S into the finitely many atoms generated by that family. Each original count is a sum of counts on these disjoint atoms. For either process, [F1] gives independent Poisson counts on those atoms with the same means ν(C), so the atom-count vectors have the same product law and every original finite evaluation vector has the same law. The point-process law characterization [F5] then gives equality of the laws.

4.1step 1.1step 1.2step 1.3step 2.1step 3.1∎

Steps 1.1-3.1 prove the zero-mass case, construct the mixed-binomial law for positive finite mass, and show that every finite-intensity Poisson process has that law. No choice principle is used; only finite products and a specified countable sum occur.

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

First and second moments of a Poisson random integral

Statement

Let η be a Poisson point process with locally finite intensity measure ν. For every nonnegative Borel function f, E[η(f)]=ν(f),E[η(f)2]=ν(f2)+ν(f)2, as identities in [0,∞]. Here η(f)=∫f dη and ν(f)=∫f dν.

Facts & Assumptions

Given: A Poisson point process η with locally finite intensity measure ν and a nonnegative Borel function f.

[F1]

Counts on disjoint Borel sets are independent and have Poisson laws with their intensity means; an infinite-mean count equals +∞ almost surely. (Poisson and Cox point processes)

[F2]

For N∼Pois⁡(a) with finite a, EN=a and EN2=a+a2. (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)

[F3]

Nonnegative Borel functions admit increasing simple approximations, and increasing limits pass through nonnegative integrals. (Every nonnegative measurable function is the increasing limit of simple measurable functions, Monotone convergence for the integral)

Proof

technique · direct
1.1givenF1F2algebra

First let s=∑j=1mcj1Bj be a nonnegative simple function with disjoint Borel sets Bj and coefficients cj>0, after discarding zero coefficients. Write aj=ν(Bj). If some aj=∞, [F1] gives η(s)=∞ almost surely and both displayed right-hand quantities are infinite. If all aj<∞, [F1]-[F2] give Eη(s)=∑jcjaj=ν(s) and Eη(s)2=∑jcj2(aj+aj2)+2∑i<jcicjaiaj=ν(s2)+ν(s)2. The zero simple function also satisfies both identities.

2.1givenstep 1.1F3∎

For arbitrary f≥0, choose simple sn↑f by [F3]. Then η(sn)↑η(f), η(sn)2↑η(f)2, ν(sn)↑ν(f), and ν(sn2)↑ν(f2). Applying monotone convergence [F3] to the two expectation integrals and to the two measure integrals, and using step 1.1 for each sn, yields both asserted identities, including the extended-infinite cases.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Mecke identity for a finite-intensity Poisson point process

Statement

Let η be a Poisson point process on S with finite intensity measure ν (so ν(S)<∞ under Finite, sigma-finite, and semifinite measures), and let h:S×Nlf(S)→[0,∞] be measurable. Addition (x,μ)↦μ+δx is interpreted as addition of counting measures. Then E[∫Sh(x,η) η(dx)]=∫SE[h(x,η+δx)] ν(dx). Both sides are well-defined extended nonnegative integrals.

Facts & Assumptions

Given: A Poisson point process η on S with finite intensity measure ν and a nonnegative measurable function h.

[F1]

The law of a finite-intensity Poisson point process is the mixed-binomial law: for λ=ν(S)>0, first take N∼Pois⁡(λ), then conditionally take N independent locations with law ν/λ; the zero-intensity process is zero. (Finite-intensity Poisson-process existence and mixed-binomial law)

[F2]

Finite products of probability measures have their rectangle product formula and are unique; coordinate permutations preserve the corresponding identically distributed product measure. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F3]

Nonnegative sums and iterated integrals can be interchanged by Tonelli, and the scalar Poisson masses are e−λλn/n!. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)

[F4]

Evaluation maps generate the configuration sigma-algebra, and integration of a nonnegative measurable function against the evaluation kernel of a random measure is measurable. (Random measures and locally finite point processes, Measure kernel and probability kernel, Measurability of integration against a kernel)

Proof

technique · direct
1.1givenF4construct

The addition map is measurable because for every Borel B its output evaluation is (μ+δx)(B)=μ(B)+1B(x), a measurable function of (x,μ); therefore (x,μ)↦h(x,μ+δx) is measurable. The left integral is measurable by the evaluation-kernel integration assertion [F4].

1.2givenF1F3

If λ=0, then ν=0 and [F1] makes η the zero measure almost surely, so both sides vanish. Suppose λ>0 and write Q=ν/λ, pn=e−λλn/n!. By [F1], the left side equals ∑n≥0pn∫Sn∑i=1nh(xi,∑j=1nδxj) Q⊗n(d(x1,…,xn)).

2.1step 1.2F2F3algebra

For each n≥1, every summand indexed by i has the same integral: coordinate permutation sends the ith coordinate to the first, preserves Q⊗n by [F2], and leaves the sum of Dirac masses unchanged. Tonelli [F3] and npn=λpn−1 therefore turn step 1.2 into λ∑m≥0pm∫Sm+1h(x1,δx1+∑j=2m+1δxj) Q⊗(m+1)(d(x1,…,xm+1)).

3.1step 2.1F1F2F3∎

Integrating first in x1 in step 2.1 and using ν=λQ, the result is ∫S∑m≥0pm∫Smh(x,δx+∑j=1mδxj) Q⊗m(d(x1,…,xm)) ν(dx). By the mixed-binomial representation [F1], the sum and inner integral are E[h(x,η+δx)] for each fixed x, so this is the right side of the claimed identity.

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

Existence of a locally finite Poisson point process

Statement

Assume countable choice and dependent choice. Let S be locally compact, second countable, and Hausdorff, and let ν be a locally finite, sigma-finite Borel measure on S. Then a locally finite Poisson point process with intensity ν exists. This existence assertion uses countable choice and dependent choice only through the countable product of probability spaces; it does not assume full choice.

Facts & Assumptions

Given: A locally compact, second-countable Hausdorff space S and a locally finite, sigma-finite Borel measure ν on S; sigma-finite means that S is a countable union of Borel sets of finite ν-measure (Finite, sigma-finite, and semifinite measures).

[F1]

There is an increasing compact exhaustion (Kn) covering S, with every compact subset contained in some Kn. (Second-countable locally compact Hausdorff spaces admit compact exhaustions)

[F2]

For each finite Borel measure ρ, the explicit mixed-binomial construction on ∐n≥0Sn gives a Poisson point process of intensity ρ, and finite disjoint counts have the independent Poisson laws. (Finite-intensity Poisson-process existence and mixed-binomial law)

[F3]

The countable product of the coordinate probability spaces exists under countable choice and dependent choice. (Assuming countable and dependent choice, countable products of arbitrary probability spaces)

[F4]

A countable sum of measures is a measure; increasing limits pass through nonnegative integrals. (Nonnegative scalar multiples and countable weighted sums of measures are measures, Monotone convergence for the integral, Measures on sigma-algebras)

[F5]

The scalar Poisson law has mass e−aak/k!, probability generating function ea(s−1), and is normalized for a≥0. (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)

[A1]

Countable choice is assumed only to invoke [F3]. (The Axiom of Countable Choice (ACω))

Proof

technique · direct
1.1givenF1F4F6construct

Put K0=∅, A1=K1, and Ai=Ki∖Ki−1 for i≥2. By [F6], each Ki is closed, so the disjoint sets Ai are Borel and cover S. Since Ai⊆Ki, countable additivity of the measure gives ν(Ai)≤ν(Ki)<∞, hence νi(B):=ν(B∩Ai) is finite. If i>m, then Ai∩Km=∅.

2.1givenstep 1.1F2F3A1A2construct

For each i, let Ωi be the explicit finite-intensity mixed-binomial space from [F2] for νi (a one-point space when νi=0), with law Pi and coordinate counting measure ηi. The countable product theorem [F3], under [A1]-[A2], supplies a probability space on which all these coordinates are independent. Each ηi is supported on Ai almost surely: its count on S∖Ai is Poisson with mean zero by [F2], hence zero almost surely.

3.1givenF1F2F4step 1.1step 2.1construct

Let E=⋂i≥1{ηi(S∖Ai)=0}. Each event in this intersection is measurable by the coordinate evaluation maps and has probability one by step 2.1; countable subadditivity applied to their null complements gives P(E)=1. For Borel B, define η(B)=∑i≥1ηi(B) on E and η(B)=0 off E. On E the countable sum is a measure by [F4], while off E it is the zero measure; its evaluations are measurable as the restriction to the measurable event E of increasing limits of finite sums. On E it is a counting measure because the coordinate construction lists finitely many point locations per cell and the countable union of those lists is countable; off E the empty configuration is a counting measure. On E, if C is compact, [F1] gives C⊆Km for some m; then η(C)=∑i=1mηi(C)<∞, because later cells avoid Km and each of the first m coordinates contains finitely many points. Off E all compact counts are zero. Thus η is a measurable point process with locally finite realizations everywhere, and agrees almost surely with the unmodified superposition, preserving all its count laws.

3.2givenF2F3F5A1A2step 2.1algebra

Fix pairwise-disjoint Borel sets B1,…,Br and write Nij=ηi(Bj) and aij=νi(Bj). By [F2], within each row i the Nij are independent Poisson variables of means aij; rows are independent by [F3] and [A1]-[A2], so all finitely many variables in the first n rows are independent. For independent X∼Pois⁡(a) and Y∼Pois⁡(b), direct convolution gives P(X+Y=k)=e−(a+b)∑l=0kalbk−l/(l!(k−l)!)=e−(a+b)(a+b)k/k! by the binomial theorem. Iterating this identity shows that Nj(n)=∑i=1nNij are independent across j with laws Pois⁡(aj(n)), where aj(n)=∑i=1naij.

4.1step 3.1step 3.2F4F5algebra

On the probability-one event E from step 3.1, the counts Nj(n) increase to Nj=η(Bj) and aj(n)↑aj:=ν(Bj). For finite aj, the events {Nj(n)≤kj for every j} decrease to {Nj≤kj for every j}; continuity from above follows by applying [F4] to their complementary increasing indicators. Their probabilities, computed from step 3.2, converge to ∏j∑k=0kje−ajajk/k!. Inclusion-exclusion over the finitely many lower rectangles then gives the product of Poisson point masses for every count vector, proving independence and the desired laws when all aj<∞.

5.1step 3.2step 4.1F5algebra

If aj=∞, then for each integer M≥0, continuity from above gives P(Nj≤M)=lim⁡ne−aj(n)∑k=0M(aj(n))k/k!=0. The limit is zero because e−ttk→0 for each fixed k, as follows from et≥tk+1/(k+1)!. Hence Nj=∞ almost surely. Applying the finite-coordinate argument of step 4.1 to the coordinates with finite aj, while the infinite-mean coordinates are almost surely constant at +∞, gives the required extended independent-count convention for the whole family.

6.1step 2.1step 3.1step 3.2step 4.1step 5.1A1A2∎

Steps 3.1, 3.2, 4.1, and 5.1 prove local finiteness and the independent Poisson count laws. The only choice principles used are [A1]-[A2] for the countable product in step 2.1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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)).

5 · Examples, counterexamples and false statements

None yet.

Sources