Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

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