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.
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 .
Depends on
- The scalar Poisson count law
- The real exponential function and the number $e$ by a power series
- The exponential addition formula $\exp(x+y)=\exp(x)\exp(y)$
- The factorial $n!$ and the falling factorial $n^{\underline{k}}$, defined by recursion in $\mathbb{N}$
- Expectation of a nonnegative or integrable random variable
- Moments, variance, and covariance on a probability space
Used by
- Explicit Poisson tau-leaping with an invalid-state status Algorithm
- Exposure-parameterized Poisson law Definition
- Poisson and Cox point processes Definition
- A binomial guard prevents overdraw but changes Poisson noise Example
- A CLE can assign negative density near an empty population Example
- A finite-window Poisson process that terminates at time one Example
- A minimum-intensity coupling reduces a Poisson count correction Example
- A Poisson leap can make a pure-death population negative Example
- Homogeneous Poisson likelihood and a Hawkes intensity specification Example
- Poisson and Cox counts with the same mean on a finite window Example
- Three-state birth-death chain with a certified Poisson tail Example
- Two-state gating through uniformization Example
- A geometric upper bound for a Poisson right tail Lemma
- Conditional moments of one Poisson tau-leap increment Lemma
- Finite-window homogeneous Poisson construction and ordered event-time density Lemma
- First and second moments of a Poisson random integral Lemma
- Mecke identity for a finite-intensity Poisson point process Lemma
- One-step weak defect of finite-state Poisson tau-leaping Lemma
- Shared-minimum coupling of two Poisson counts Lemma
- Campbell, Laplace, Mecke, and Cox moment formulas Theorem
- Compensators, brackets, and jump-integral isometry for reaction counts Theorem
- Dominating thinning has the prescribed reaction law Theorem
- Existence of a Dirichlet process by normalized gamma Poisson random measure Theorem
- Existence of a locally finite Poisson point process Theorem
- Finite master equation and uniformization formula Theorem
- Finite-intensity Poisson-process existence and mixed-binomial law Theorem
- Mecke identity for locally finite Poisson point processes Theorem
- Order-one correction variance for coupled Poisson tau-leap levels Theorem
- Ripley K for a homogeneous Poisson process is Euclidean ball volume Theorem
- Uniformization truncation, mass loss, and arithmetic-error ledger Theorem
- Weak order one for finite-state Poisson tau-leaping with an exit bound Theorem
Cited to discharge well-definedness by The scalar Poisson count law.
Dependency tree · two levels
36 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)