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.
Poisson and Cox point processes
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
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
Random measures and locally finite point processes
Definition
Fix a locally compact, second-countable Hausdorff topological space (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 be the Borel sigma-algebra generated by the open sets (The Borel sigma-algebra of a topological space).
A counting measure on is a Borel measure of the form for a finite or countable index set and points , where repetitions are allowed and the empty sum is zero. Each is the unit point mass at (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 is . The counting measure is locally finite if for every compact subset (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
Let be the set of locally finite counting measures, equipped with the sigma-algebra generated by the evaluation maps for . A point process on is a measurable map from a probability space (Probability measures and probability spaces), with measurability in the sense of A measurable function between measurable spaces. Equivalently, every count is a measurable random variable, because the evaluation maps generate . Its law is the probability measure on (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 for every , 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 be the set of all locally finite Borel measures on , 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 , write . Define the expected measure, or intensity measure, by . 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 for each compact .
The mean measure of a random locally finite measure is likewise , covered by the same expected-measure lemma. Local finiteness of each realization does not by itself assert local finiteness of .
Second-countable locally compact Hausdorff spaces admit compact exhaustions
Statement
Let be locally compact, second countable, and Hausdorff. There is an increasing sequence of compact subsets such that and every compact subset of is contained in some .
Facts & Assumptions
Given: A topological space that is locally compact, second countable, and Hausdorff.
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)
In a locally compact Hausdorff space, for every open and there is open with and compact. (In a locally compact Hausdorff space every point has a neighbourhood base of compact sets, every open subspace and every closed subspace is locally compact, every open set around a point contains an open set with compact closure inside it, and every compact set sits inside an open set with compact closure)
A compact subset is compact in its subspace topology; in a Hausdorff space, a closed subset of a compact space is compact. (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact)
An ambient open cover of a compact subset has a finite subcover. (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it)
Proof
Fix an at most countable basis for and let . For any , [F2] with gives an open containing whose closure is compact. The basis property gives with ; then , and is closed in the compact space , hence compact by [F3]. Thus is an at most countable open cover of .
If , take . Otherwise enumerate the subfamily by filtering the fixed countable basis in its given enumeration; if the subfamily is finite, repeat its last member. Put . An open cover of restricts to an open cover of each of the finitely many compact sets ; taking the union of their finite subcovers gives a finite subcover of . Thus is compact. The sequence is increasing, and its union is because covers .
Let be compact. The open cover of has a finite subcover by the ambient-cover criterion in [F4]. Let be at least every index in that finite subcover. Then . Thus every compact is contained in some .
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.
The scalar Poisson count law
Definition
For a finite parameter , the Poisson count law is the probability measure on whose masses are when , and is the point mass at when . 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.
Mean measures and measurable nonnegative integrals of random measures
Statement
Let be a random locally finite Borel measure on ; in particular, may be a point process. Then is a measure, and for every nonnegative Borel the map is a measurable extended nonnegative random variable satisfying . The mean measure is locally finite if and only if for every compact .
Facts & Assumptions
Given: A measurable random element whose values are locally finite Borel measures on .
Each realization is a measure, and every evaluation is measurable. (Random measures and locally finite point processes)
Expectation of a nonnegative random variable is its nonnegative integral. (Expectation of a nonnegative or integrable random variable)
Increasing limits pass through the nonnegative integral. (Monotone convergence for the integral)
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)
Pointwise limits of measurable extended-real functions are measurable. (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable)
A measure is zero at the empty set and countably additive on pairwise disjoint measurable sets. (Measures on sigma-algebras)
Proof
The function is defined for every Borel set by [F1] and [F2], and because each measure vanishes at .
Let be Borel and choose as in [F4]. If 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 . The pointwise-limit result [F5] therefore makes measurable.
Let be pairwise disjoint Borel sets. For every , by [F1] and [F6]. The finite partial sums increase, so [F3] gives . Together with step 1.1 this proves that is a measure.
For a nonnegative simple , the definition and finite linearity give . For the increasing sequence from step 1.2, both pathwise and ; applying [F3] to both nonnegative integrals proves the expectation identity.
For compact , local finiteness of at means exactly by its definition. Requiring this for all compact proves the final equivalence.
A point-process law is determined by its finite-dimensional count laws
Statement
Let and be point processes on with the evaluation sigma algebra on . If every finite vector of Borel-set counts has the same distribution under and , then their laws on are equal.
Facts & Assumptions
Given: Point processes with equal finite-dimensional laws of their count evaluations.
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)
A probability measure is determined by its values on a generating pi-system. (Dynkin's pi-lambda theorem)
Proof
Let , the range of every count evaluation, and let consist of the cylinder sets for finite Borel families and subsets . Each such constraint is measurable because this countable range consists of Borel singletons in . 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 is the full configuration sigma-algebra.
The hypothesis says the laws and assign the same probability to every member of , 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 .
Normalization, moments, and generating function of the Poisson count law
Statement
For finite , the masses in The scalar Poisson count law sum to one. If , then and for .
Facts & Assumptions
Given: A finite parameter and the mass formula in The scalar Poisson count law.
For , the mass at is ; at the law is concentrated at . (The scalar Poisson count law)
The real exponential is defined by the convergent power series and satisfies . (The real exponential function and the number by a power series, The exponential addition formula )
Expectation is integration against the probability law, and variance is when the second moment is finite. (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space)
Proof
If , [F1] puts all mass at , so the masses sum to one and the stated moments and generating function have their asserted values.
Suppose . By [F1] and the defining exponential series [F2], Thus the displayed masses normalize to a probability law.
Using [F1] and reindexing the nonnegative series,
Reindexing with gives by [F2]. Since , this and step 2.1 yield and hence .
For , [F1] and [F2] give Together with step 1.1 this proves the generating-function formula also at .
Deleting one occurrence from a locally finite counting measure is measurable
Statement
Let Then is measurable in the product evaluation sigma-algebra, and the map defined by is measurable. The subtraction removes one occurrence, so any other occurrences at remain.
Facts & Assumptions
Given: The topological and measurable structures of and from Random measures and locally finite point processes.
There is an increasing compact exhaustion such that every compact subset of is contained in some . (Second-countable locally compact Hausdorff spaces admit compact exhaustions)
Evaluation maps generate the sigma-algebra on , and each is a locally finite measure. (Random measures and locally finite point processes)
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)
The product sigma-algebra is generated by measurable rectangles, and is generated by the open sets. (The product sigma-algebra and its finite iterates, The Borel sigma-algebra of a topological space)
Proof
On the parameter space define . For each parameter this is a measure, its evaluations are measurable by [F2], and is a common finite-mass exhaustion because for every locally finite . Thus is a uniformly sigma-finite kernel.
The diagonal is closed in because is Hausdorff. The product topology has the countable basis consisting of rectangles from countable bases of the two copies of ; every open set is a countable union of these rectangles. Hence the product Borel sigma-algebra equals , so is product measurable by [F4].
For , . The measurability theorem in [F3] makes measurable; therefore its inverse image of is measurable.
On , is again a locally finite counting measure: in a representation of as a countable sum of point masses, remove one occurrence at ; no compact-set count increases. For every Borel , where is interpreted as . This evaluation is measurable on , since both terms are measurable and on the subtraction is nonnegative. The evaluations generate the target sigma-algebra [F2], so is measurable.
Steps 2.1-3.1 prove measurability of the domain and deletion map, including the multiplicity convention.
Poisson and Cox point processes
Definition
Let 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 , the counts are independent random elements (Independent random elements) and has the scalar Poisson law of mean (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law). If , the extended count convention is almost surely. Here sigma-finite means that is a countable union of Borel sets of finite -measure (Finite, sigma-finite, and semifinite measures); for the stated , local finiteness also implies sigma-finiteness by the compact exhaustion in Second-countable locally compact Hausdorff spaces admit compact exhaustions.
Let 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 from to such that is a regular conditional law of given (Conditional law given a random element) and, for -almost every , 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 , 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.
Finite-intensity Poisson-process existence and mixed-binomial law
Statement
Let be a finite Borel measure on (Finite, sigma-finite, and semifinite measures) and put . A Poisson point process of intensity exists. If it is the zero process. If , its law is the push-forward of on the disjoint union under . 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 locations in component have product law .
Facts & Assumptions
Given: A finite Borel measure on , with total mass .
A Poisson point process has independent counts on disjoint Borel sets, with scalar laws specified by their intensity measures. (Poisson and Cox point processes)
For finite , the mass of total count is ; these masses sum to one. (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)
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)
A countable nonnegative weighted sum of measures is a measure. (Nonnegative scalar multiples and countable weighted sums of measures are measures)
Equal finite-dimensional laws of count evaluations determine the point process law. (A point-process law is determined by its finite-dimensional count laws)
Each 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
If , take a one-point probability space and let be the zero measure. For every Borel , , so has the required Poisson law and every finite vector of counts is independent.
Now suppose and put . Let with the sigma-algebra whose sections in every are product-measurable. For each , the section map defines a probability measure on , by [F3]. The countable sum is a probability measure by [F2] and [F4].
On the component define . For each Borel , is measurable on each component, so is a random locally finite counting measure.
Let be pairwise-disjoint Borel sets and let . Put . Conditional on the component , independence of the coordinates gives, for , , where . This is the multinomial count of coordinate assignments to the partition .
Put . Summing the conditional multinomial masses in step 1.4 over gives , since the exponential series gives the sum as and . Thus these counts are independent Poisson variables with respective means , proving existence with the required count laws.
For uniqueness in distribution, take any finite family of Borel sets and partition 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 , 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.
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.
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 , as identities in . Here and .
Facts & Assumptions
Given: A Poisson point process with locally finite intensity measure and a nonnegative Borel function .
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)
For with finite , and . (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)
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
First let be a nonnegative simple function with disjoint Borel sets and coefficients , after discarding zero coefficients. Write . If some , [F1] gives almost surely and both displayed right-hand quantities are infinite. If all , [F1]-[F2] give and . The zero simple function also satisfies both identities.
For arbitrary , choose simple by [F3]. Then , , , and . Applying monotone convergence [F3] to the two expectation integrals and to the two measure integrals, and using step 1.1 for each , yields both asserted identities, including the extended-infinite cases.
Mecke identity for a finite-intensity Poisson point process
Statement
Let be a Poisson point process on with finite intensity measure (so under Finite, sigma-finite, and semifinite measures), and let be measurable. Addition is interpreted as addition of counting measures. Then Both sides are well-defined extended nonnegative integrals.
Facts & Assumptions
Given: A Poisson point process on with finite intensity measure and a nonnegative measurable function .
The law of a finite-intensity Poisson point process is the mixed-binomial law: for , first take , then conditionally take independent locations with law ; the zero-intensity process is zero. (Finite-intensity Poisson-process existence and mixed-binomial law)
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)
Nonnegative sums and iterated integrals can be interchanged by Tonelli, and the scalar Poisson masses are . (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)
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
The addition map is measurable because for every Borel its output evaluation is , a measurable function of ; therefore is measurable. The left integral is measurable by the evaluation-kernel integration assertion [F4].
If , then and [F1] makes the zero measure almost surely, so both sides vanish. Suppose and write , . By [F1], the left side equals .
For each , every summand indexed by has the same integral: coordinate permutation sends the th coordinate to the first, preserves by [F2], and leaves the sum of Dirac masses unchanged. Tonelli [F3] and therefore turn step 1.2 into .
Integrating first in in step 2.1 and using , the result is . By the mixed-binomial representation [F1], the sum and inner integral are for each fixed , so this is the right side of the claimed identity.
Existence of a locally finite Poisson point process
Statement
Assume countable choice and dependent choice. Let be locally compact, second countable, and Hausdorff, and let be a locally finite, sigma-finite Borel measure on . 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 and a locally finite, sigma-finite Borel measure on ; sigma-finite means that is a countable union of Borel sets of finite -measure (Finite, sigma-finite, and semifinite measures).
There is an increasing compact exhaustion covering , with every compact subset contained in some . (Second-countable locally compact Hausdorff spaces admit compact exhaustions)
For each finite Borel measure , the explicit mixed-binomial construction on 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)
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)
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)
The scalar Poisson law has mass , probability generating function , and is normalized for . (The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law)
Compact subsets of a Hausdorff space are closed. (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones)
Countable choice is assumed only to invoke [F3]. (The Axiom of Countable Choice ())
Dependent choice is assumed only to invoke [F3]. (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain)
Proof
Put , , and for . By [F6], each is closed, so the disjoint sets are Borel and cover . Since , countable additivity of the measure gives , hence is finite. If , then .
For each , let be the explicit finite-intensity mixed-binomial space from [F2] for (a one-point space when ), with law and coordinate counting measure . The countable product theorem [F3], under [A1]-[A2], supplies a probability space on which all these coordinates are independent. Each is supported on almost surely: its count on is Poisson with mean zero by [F2], hence zero almost surely.
Let . 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 . For Borel , define on and off . On the countable sum is a measure by [F4], while off it is the zero measure; its evaluations are measurable as the restriction to the measurable event of increasing limits of finite sums. On 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 the empty configuration is a counting measure. On , if is compact, [F1] gives for some ; then , because later cells avoid and each of the first coordinates contains finitely many points. Off 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.
Fix pairwise-disjoint Borel sets and write and . By [F2], within each row the are independent Poisson variables of means ; rows are independent by [F3] and [A1]-[A2], so all finitely many variables in the first rows are independent. For independent and , direct convolution gives by the binomial theorem. Iterating this identity shows that are independent across with laws , where .
On the probability-one event from step 3.1, the counts increase to and . For finite , the events decrease to ; continuity from above follows by applying [F4] to their complementary increasing indicators. Their probabilities, computed from step 3.2, converge to . 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 .
If , then for each integer , continuity from above gives . The limit is zero because for each fixed , as follows from . Hence almost surely. Applying the finite-coordinate argument of step 4.1 to the coordinates with finite , while the infinite-mean coordinates are almost surely constant at , gives the required extended independent-count convention for the whole family.
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.
Campbell, Laplace, Mecke, and Cox moment formulas
Statement
Let be a Poisson point process on the locally compact, second-countable Hausdorff space , with locally finite, sigma-finite intensity measure . For every nonnegative Borel , its Campbell and Laplace formulas are and , with . For every nonnegative measurable for the product of the Borel and evaluation sigma-algebras on , the add-one Mecke formula and its deletion form are and ; 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 .
If is Cox directed by a random locally finite measure with supplied probability kernel , write for the law of and for its mean measure. Then for -almost every , and . Consequently , , and , all as extended nonnegative identities. Thus exactly when and ; then . 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.
The mean measure is a measure, nonnegative random integrals are measurable, and for every nonnegative Borel . (Mean measures and measurable nonnegative integrals of random measures)
The finite-intensity Mecke identity holds for every nonnegative measurable integrand. (Mecke identity for a finite-intensity Poisson point process)
A compact exhaustion exists; compact sets in a Hausdorff space are closed; sigma-finiteness means a countable finite-measure Borel cover; and independent counts mean independence of the generated sigma-algebras. (Second-countable locally compact Hausdorff spaces admit compact exhaustions, Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones, Finite, sigma-finite, and semifinite measures, Poisson and Cox point processes, Independent random elements, Random measures and locally finite point processes)
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)
The addition map and the deletion map on 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)
A Poisson random integral satisfies and , including extended values. (First and second moments of a Poisson random integral)
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)
A Cox model supplies a regular conditional probability kernel ; 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)
The variance of a square-integrable random variable is , and the scalar Poisson mass formula has masses. (Moments, variance, and covariance on a probability space, The scalar Poisson count law, Normalization, moments, and generating function of the Poisson count law, The real exponential function and the number by a power series, The exponential addition formula )
Proof
For every Borel with , the defining Poisson law and the scalar mean identity [F9] give ; if , the extended-count convention gives the same equality. Apply [F1] with to obtain Campbell's formula for every nonnegative Borel .
First take a nonnegative simple on disjoint Borel sets, discarding zero coefficients. Independence of the counts and the scalar generating function [F9] give ; when and , both sides are zero by the infinite-count convention.
The point-addition map is measurable because each output evaluation is , and configuration addition is measurable because ; both follow from the evaluation sigma-algebra. Thus is measurable for fixed . For a random locally finite counting measure , the map is measurable by applying the kernel-integration theorem to the evaluation kernel with parameter . This makes the random integrals below well-defined.
Choose simple using [F7]. Then and . Monotone convergence [F7] on the probability space and on passes the simple identity of step 1.2 to the asserted Laplace formula.
Let be the compact exhaustion [F3], set and for , and define and . The sets are Borel by [F3]. Each is a finite-intensity Poisson process with intensity , since and . The sigma-algebras generated by evaluations of and are independent: their generating cylinder events concern disjoint regions, so [F3]-[F4] extend the independent-count property to those sigma-algebras. Also .
For fixed , integrate first over the independent laws of and . Applying the finite-intensity identity [F2] to for each fixed background gives . Summing over and using Tonelli [F4] yields the add-one identity, since and .
Now let be Cox directed by and use its supplied kernel . For -almost every , is a Poisson law of intensity ; [F6] and step 2.1 therefore give , , and . The conditional-law identity [F8] and nonnegative kernel integration average these formulas over .
For nonnegative measurable , define on and off . This is measurable by [F5]. For -almost every counted point , , while for every ; applying step 3.1 to gives . A mass at contributes times the configuration with mass , so the formula retains multiplicity.
By [F1], and . Integrating step 3.2 gives , , and , all with extended nonnegative values.
Conversely, suppose the deletion identity holds for every nonnegative measurable . For any such , set , which is measurable by [F5]. Then at every counted point and on the right, so the add-one identity follows.
Fix disjoint Borel sets with finite and write . Applying the add-one identity of step 5.1 to gives , so each is finite almost surely. For a count vector , put . Use in the same identity. Disjointness makes insertion of increase only the th count, so for , and the right side is zero when .
Iterating the recurrences of step 6.1 gives , with the convention . Since the probabilities sum to one and each scalar Poisson mass sequence is normalized [F9], finite product summation gives and . Hence the counts on every finite family of disjoint finite-intensity sets are independent Poisson variables.
If has , let . Then and . For each integer , , because as (use ). Thus 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.
A sum of two nonnegative extended numbers is finite exactly when both summands are finite, so step 4.2 gives exactly when and . In that case and are square-integrable; [F9] and step 4.2 yield .
5 · Examples, counterexamples and false statements
None yet.