TheoremBase

Proof of Thinning: Cell Counts of a Poisson Number of Independent Points

lemmalem:poisson-thinning-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Proof of the Poisson thinning lemma: conditioning-free decomposition over the truncated Poisson count, multinomial cell probabilities, and series resummation via the exponential series. Approved by Aaron.

Proof

Write G=Οƒ(K,(Vi)i∈N)\mathcal{G}=\sigma(K,(V_i)_{i\in\mathbb{N}}) for the generated Οƒ\sigma-algebra, A0=Rβˆ–(A1βˆͺβ‹―βˆͺAr)A_0=\mathbb{R}\setminus(A_1\cup\dots\cup A_r) (a Borel set), p0=Ξ½(A0)p_0=\nu(A_0), and for n∈N0n\in\mathbb{N}_0, Sj(n)=βˆ‘i=1n1{Vi∈Aj}S_j^{(n)}=\sum_{i=1}^{n}\mathbf{1}_{\{V_i\in A_j\}} (Sj(0)=0S_j^{(0)}=0). Since Ξ½\nu is a probability measure and A0,…,ArA_0,\dots,A_r are pairwise disjoint with union R\mathbb{R}, finite additivity gives p0+p1+β‹―+pr=1p_0+p_1+\dots+p_r=1.

Step 1 (the truncated count K~\widetilde K). The set N0\mathbb{N}_0 is Borel: each singleton {n}=β‹‚q∈N(nβˆ’1/q, n+1/q)\{n\}=\bigcap_{q\in\mathbb{N}}(n-1/q,\,n+1/q) is Borel, and N0\mathbb{N}_0 is a countable union of singletons. For n∈Nn\in\mathbb{N} we have {K~=n}=Kβˆ’1({n})\{\widetilde K=n\}=K^{-1}(\{n\}), and {K~=0}=Kβˆ’1({0}βˆͺ(Rβˆ–N0))\{\widetilde K=0\}=K^{-1}(\{0\}\cup(\mathbb{R}\setminus\mathbb{N}_0)); in every case the level set is a preimage under KK of a Borel set, hence an event lying in Οƒ(K)βŠ†G\sigma(K)\subseteq\mathcal{G}. Since K~\widetilde K takes all its values in N0\mathbb{N}_0, the preimage of any Borel set is the countable union of its level sets, so K~\widetilde K is a random variable, G\mathcal{G}-measurable. By Poisson Distribution, P(K∈Rβˆ–N0)=0P(K\in\mathbb{R}\setminus\mathbb{N}_0)=0 and P(K=n)=exp⁑(βˆ’ΞΌ)ΞΌn/n!P(K=n)=\exp(-\mu)\mu^{n}/n! for n∈N0n\in\mathbb{N}_0; hence

P(K~=n)=exp⁑(βˆ’ΞΌ)ΞΌnn!(n∈N0),P(\widetilde K=n)=\exp(-\mu)\frac{\mu^{n}}{n!}\qquad(n\in\mathbb{N}_0),

where for n=0n=0 the extra null set changes nothing by finite additivity.

Step 2 (Part 1). On the event {K~=n}\{\widetilde K=n\} we have Cj=Sj(n)C_j=S_j^{(n)}. Hence for c∈N0c\in\mathbb{N}_0,

{Cj=c}=⋃n∈N0({K~=n}∩{Sj(n)=c}),\{C_j=c\}=\bigcup_{n\in\mathbb{N}_0}\bigl(\{\widetilde K=n\}\cap\{S_j^{(n)}=c\}\bigr),

a countable union. As shown in the proof of Multinomial Distribution of Cell Counts for Independent Identically Distributed Points, each {Sj(n)=c}\{S_j^{(n)}=c\} is an event lying in Οƒ(Vi:1≀i≀n)βŠ†G\sigma(V_i:1\le i\le n)\subseteq\mathcal{G} (for n=0n=0 it is Ξ©\Omega if c=0c=0 and βˆ…\emptyset otherwise), so {Cj=c}∈G\{C_j=c\}\in\mathcal{G}. All values of CjC_j lie in N0\mathbb{N}_0 (each Cj(Ο‰)C_j(\omega) is a finite sum of zeros and ones), so as in Step 1, CjC_j is a random variable, G\mathcal{G}-measurable. This proves Part 1.

Step 3 (Part 2). Fix (n1,…,nr)∈N0r(n_1,\dots,n_r)\in\mathbb{N}_0^r and put s=n1+β‹―+nrs=n_1+\dots+n_r. Since the cells A0,…,ArA_0,\dots,A_r partition R\mathbb{R}, we have βˆ‘j=0rSj(n)=n\sum_{j=0}^{r}S_j^{(n)}=n identically; thus on {K~=n}\{\widetilde K=n\}, the event β‹‚j=1r{Cj=nj}\bigcap_{j=1}^{r}\{C_j=n_j\} forces S0(n)=nβˆ’sS_0^{(n)}=n-s, and it is empty for n<sn<s. Therefore

β‹‚j=1r{Cj=nj}=⋃nβ‰₯s({K~=n}∩Qn),Qn={S0(n)=nβˆ’s}βˆ©β‹‚j=1r{Sj(n)=nj},\bigcap_{j=1}^{r}\{C_j=n_j\}=\bigcup_{n\ge s}\Bigl(\{\widetilde K=n\}\cap Q_n\Bigr),\qquad Q_n=\{S_0^{(n)}=n-s\}\cap\bigcap_{j=1}^{r}\{S_j^{(n)}=n_j\},

a countable disjoint union (the {K~=n}\{\widetilde K=n\} are disjoint). For nβ‰₯max⁑(s,1)n\ge\max(s,1): the subfamily V1,…,VnV_1,\dots,V_n of the independent family is independent (Independence of Events and of Random Variables), each with distribution Ξ½\nu, and the r+1r+1 cells A0,…,ArA_0,\dots,A_r are pairwise disjoint with union R\mathbb{R}, so Multinomial Distribution of Cell Counts for Independent Identically Distributed Points gives

P(Qn)=n!(nβˆ’s)! n1!β‹―nr! p0 nβˆ’s∏j=1rpj nj.P(Q_n)=\frac{n!}{(n-s)!\,n_1!\cdots n_r!}\,p_0^{\,n-s}\prod_{j=1}^{r}p_j^{\,n_j}.

If n=0n=0 (possible only when s=0s=0), then Q0=Ξ©Q_0=\Omega and the displayed formula also holds, reading 0!/0!=10!/0!=1 and empty exponents as 11. Moreover QnβˆˆΟƒ(Vi:1≀i≀n)Q_n\in\sigma(V_i:1\le i\le n) and {K~=n}βˆˆΟƒ(K)\{\widetilde K=n\}\in\sigma(K); by Grouping Lemma for Independent Random Variables applied to the independent family (K,V1,V2,… )(K,V_1,V_2,\dots) with the two disjoint blocks (the index of KK) and (the indices of V1,…,VnV_1,\dots,V_n), these two Οƒ\sigma-algebras are independent, so P({K~=n}∩Qn)=P(K~=n)P(Qn)P(\{\widetilde K=n\}\cap Q_n)=P(\widetilde K=n)P(Q_n) (for n=0n=0, Q0=Ξ©Q_0=\Omega makes this trivial). By countable additivity and Step 1,

P(β‹‚j=1r{Cj=nj})=βˆ‘nβ‰₯sexp⁑(βˆ’ΞΌ)ΞΌnn!β‹…n!(nβˆ’s)! n1!β‹―nr! p0 nβˆ’s∏j=1rpj nj.P\Bigl(\bigcap_{j=1}^{r}\{C_j=n_j\}\Bigr)=\sum_{n\ge s}\exp(-\mu)\frac{\mu^{n}}{n!}\cdot\frac{n!}{(n-s)!\,n_1!\cdots n_r!}\,p_0^{\,n-s}\prod_{j=1}^{r}p_j^{\,n_j}.

Substituting n=s+tn=s+t, t∈N0t\in\mathbb{N}_0, and μn=μsμt\mu^{n}=\mu^{s}\mu^{t}, the series becomes

exp⁑(βˆ’ΞΌ) (∏j=1r(ΞΌpj)njnj!)βˆ‘t=0∞(ΞΌp0)tt!=exp⁑(βˆ’ΞΌ)exp⁑(ΞΌp0)∏j=1r(ΞΌpj)njnj!,\exp(-\mu)\,\Bigl(\prod_{j=1}^{r}\frac{(\mu p_j)^{n_j}}{n_j!}\Bigr)\sum_{t=0}^{\infty}\frac{(\mu p_0)^{t}}{t!}=\exp(-\mu)\exp(\mu p_0)\prod_{j=1}^{r}\frac{(\mu p_j)^{n_j}}{n_j!},

since ΞΌs∏jpjnj=∏j(ΞΌpj)nj\mu^{s}\prod_j p_j^{n_j}=\prod_j(\mu p_j)^{n_j} (as s=βˆ‘jnjs=\sum_j n_j) and βˆ‘tβ‰₯0(ΞΌp0)t/t!\sum_{t\ge0}(\mu p_0)^{t}/t! is the defining series of exp⁑(ΞΌp0)\exp(\mu p_0) from The Real Exponential Function. By Basic Properties of the Exponential Function and 1βˆ’p0=p1+β‹―+pr1-p_0=p_1+\dots+p_r,

exp⁑(βˆ’ΞΌ)exp⁑(ΞΌp0)=exp⁑(βˆ’ΞΌ(1βˆ’p0))=exp⁑(βˆ’βˆ‘j=1rΞΌpj)=∏j=1rexp⁑(βˆ’ΞΌpj).\exp(-\mu)\exp(\mu p_0)=\exp(-\mu(1-p_0))=\exp\Bigl(-\sum_{j=1}^{r}\mu p_j\Bigr)=\prod_{j=1}^{r}\exp(-\mu p_j).

Combining the last two displays yields Part 2.

Step 4 (Part 3). For each jj let gj(c)=exp⁑(βˆ’ΞΌpj)(ΞΌpj)c/c!g_j(c)=\exp(-\mu p_j)(\mu p_j)^{c}/c!, c∈N0c\in\mathbb{N}_0. Each gjg_j maps into [0,1][0,1] and βˆ‘c=0∞gj(c)=1\sum_{c=0}^{\infty}g_j(c)=1: this is the total-mass computation of Poisson Distribution for the parameter ΞΌpjβ‰₯0\mu p_j\ge0. By Part 1 the CjC_j take all values in N0\mathbb{N}_0, and by Part 2 their joint probability mass function factorizes as ∏jgj\prod_j g_j. Hence Factorized Joint Probability Mass Function Implies Independence applies: C1,…,CrC_1,\dots,C_r are independent, and for every Borel set BB,

P(Cj∈B)=βˆ‘c∈B∩N0exp⁑(βˆ’ΞΌpj)(ΞΌpj)cc!,P(C_j\in B)=\sum_{c\in B\cap\mathbb{N}_0}\exp(-\mu p_j)\frac{(\mu p_j)^{c}}{c!},

which is exactly the Poisson distribution with parameter ΞΌpj\mu p_j evaluated at BB, by Poisson Distribution. So CjC_j has the Poisson distribution with parameter ΞΌpj\mu p_j. β– \blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…