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.
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.
Depends on
- Random measures and locally finite point processes
- Mean measures and measurable nonnegative integrals of random measures
- The scalar Poisson count law
- Normalization, moments, and generating function of the Poisson count law
- Poisson and Cox point processes
- 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
- Nonnegative scalar multiples and countable weighted sums of measures are measures
- A point-process law is determined by its finite-dimensional count laws
- The Dirac set function at a point
- A Dirac set function is a probability measure
- Finite, sigma-finite, and semifinite measures
Used by
- A CLE can assign negative density near an empty population Example
- Poisson and Cox counts with the same mean on a finite window Example
- A finite Poisson process with atomless intensity is simple Lemma
- A positive finite-window Gibbs density has its density-ratio Papangelou intensity Lemma
- Mecke identity for a finite-intensity Poisson point process Lemma
- Campbell, Laplace, Mecke, and Cox moment formulas Theorem
- Dominating thinning has the prescribed reaction law Theorem
- Existence of a locally finite Poisson point process Theorem
- Finite-window spatial Poisson likelihood relative to unit rate Theorem
Dependency tree · two levels
55 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
- Gunter Last and Mathew Penrose, Lectures on the Poisson Process, author-hosted 2017 version (standard reference, not scraped)
- Adrian Baddeley, Spatial Point Processes and their Applications, complete lecture notes (standard reference, not scraped)