Math 2.0

Probability theory and stochastic processes Proof

Proof of the Poisson limit theorem

Builds on Binomial distributionPoisson distributionConvergence in distributionCumulative distribution functionBinomial coefficient1 + x is at most exp xLogarithm is the inverse of the exponential

Proof

We split the binomial probability into three factors and find the limit of each one.

  1. Fix an integer k≥0k \ge 0. Since npn→λn p_n \to \lambda, we have pn=(npn)/n→λ⋅0=0p_n = (n p_n)/n \to \lambda \cdot 0 = 0. So there is n0≥kn_0 \ge k with pn≤1/2p_n \le 1/2 for n≥n0n \ge n_0; from now on n≥n0n \ge n_0.
  2. By the definition of the binomial distribution and of the binomial coefficient, P(Sn=k)=(nk)pnk(1−pn)n−k=an⋅(npn)kk!⋅(1−pn)n⋅(1−pn)−k,P(S_n = k) = \binom{n}{k} p_n^k (1 - p_n)^{n-k} = a_n \cdot \frac{(n p_n)^k}{k!} \cdot (1 - p_n)^{n} \cdot (1 - p_n)^{-k}, with an=n(n−1)⋯(n−k+1)nk=∏j=0k−1(1−jn)a_n = \frac{n(n-1)\cdots(n-k+1)}{n^k} = \prod_{j=0}^{k-1} \left(1 - \frac{j}{n}\right).
  3. Each of the kk factors 1−j/n1 - j/n tends to 11. So an→1a_n \to 1, and for k=0k = 0 the empty product is 11.
  4. Since npn→λn p_n \to \lambda, (npn)k/k!→λk/k!(n p_n)^k / k! \to \lambda^k / k!. Since pn→0p_n \to 0, (1−pn)−k→1(1 - p_n)^{-k} \to 1.
  5. Claim: −x−x2≤ln⁡(1−x)≤−x-x - x^2 \le \ln(1 - x) \le -x for 0≤x≤1/20 \le x \le 1/2. The upper bound is 1−x≤e−x1 - x \le e^{-x}, the inequality 1+y≤ey1 + y \le e^y with y=−xy = -x.
  6. For the lower bound, let g(x)=ln⁡(1−x)+x+x2g(x) = \ln(1 - x) + x + x^2. Then g(0)=0g(0) = 0 and g′(x)=−11−x+1+2x=x(1−2x)1−x≥0g'(x) = -\frac{1}{1-x} + 1 + 2x = \frac{x(1 - 2x)}{1 - x} \ge 0 on [0,1/2][0, 1/2]. So g≥0g \ge 0 there.
  7. By step 5 with x=pnx = p_n, −npn−npn⋅pn≤nln⁡(1−pn)≤−npn-n p_n - n p_n \cdot p_n \le n \ln(1 - p_n) \le -n p_n.
  8. Both bounds tend to −λ-\lambda, since npn→λn p_n \to \lambda and npn⋅pn→λ⋅0=0n p_n \cdot p_n \to \lambda \cdot 0 = 0. So nln⁡(1−pn)→−λn \ln(1 - p_n) \to -\lambda.
  9. The exponential is continuous and is the inverse of the logarithm. So (1−pn)n=exp⁡(nln⁡(1−pn))→e−λ(1 - p_n)^n = \exp(n \ln(1 - p_n)) \to e^{-\lambda}.
  10. By steps 2, 3, 4 and 9, P(Sn=k)→1⋅λkk!⋅e−λ⋅1=e−λλk/k!P(S_n = k) \to 1 \cdot \frac{\lambda^k}{k!} \cdot e^{-\lambda} \cdot 1 = e^{-\lambda} \lambda^k / k!. This is the first claim.
  11. Let T∼Poisson⁡(λ)T \sim \operatorname{Poisson}(\lambda), with the Poisson distribution. Let FnF_n and FF be the cumulative distribution functions of SnS_n and TT.
  12. Both SnS_n and TT take values in {0,1,2,… }\set{0, 1, 2, \dots}. So for x<0x < 0, Fn(x)=0=F(x)F_n(x) = 0 = F(x).
  13. For x≥0x \ge 0, let m=⌊x⌋m = \floor{x}. Then Fn(x)=∑k=0mP(Sn=k)F_n(x) = \sum_{k=0}^{m} P(S_n = k) and F(x)=∑k=0me−λλk/k!F(x) = \sum_{k=0}^{m} e^{-\lambda} \lambda^k / k!. These are finite sums, so step 10 gives Fn(x)→F(x)F_n(x) \to F(x).
  14. Thus Fn(x)→F(x)F_n(x) \to F(x) for every real xx, in particular at every continuity point of FF. So Sn→TS_n \to T in distribution.

Idea

For fixed kk, choosing kk successes among nn trials gives about nk/k!n^k/k! choices, each with probability about pnkp_n^k, so this part tends to λk/k!\lambda^k/k!. The chance of no other success, (1−pn)n(1 - p_n)^{n}, tends to e−λe^{-\lambda} because ln⁡(1−p)≈−p\ln(1 - p) \approx -p for small pp.

Reading path

To understand this page from the ground up, read these 292 pages in order. The foundations come first. The path takes the proofs Proof of the Cauchy–Hadamard theorem, Proof that a function with nonnegative second derivative is convex, Proof of the Weierstrass M-test, Proof of the limit of a sum of sequences, Proof of Rolle's theorem, Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof of the formula for the derivative of a polynomial, Proof of the commutativity of addition by induction, Proof of term-by-term differentiation, Proof of the epsilon-delta form of continuity, Proof of the power rule by induction, Proof that absolutely convergent series converge, Proof of the sum of a finite geometric series, Proof that convergent sequences are Cauchy, Proof that there is a natural number n with 1/n below any positive epsilon, Proof of the chain rule with an auxiliary difference quotient, Proof of the Cauchy criterion for series, Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem, Proof that the exponential series has infinite radius of convergence, Proof that a function with nonnegative derivative is increasing, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the root test, Proof of the double negation law by a truth table, Proof that the logarithm is the inverse of the exponential, Proof that power series converge uniformly on smaller intervals inside the radius of convergence, Proof of the extreme value theorem by the Bolzano–Weierstrass theorem, Proof that the exponential function is positive, Proof of the uniqueness of limits, Proof of strong induction from ordinary induction, Proof that power series are differentiable inside the radius of convergence, Proof of the limit of a product of sequences, Proof that uniform convergence of derivatives allows term-by-term differentiation, Proof that the absolute value is multiplicative, Proof of the squeeze theorem for sequences, Proof of Pascal's rule from the recursive definition, Proof that a differentiable function is convex iff its derivative is increasing, Proof of the linearity of differentiation, Proof of the sequential characterization of limits, Proof that the exponential function is strictly increasing, Proof that Cauchy sequences are bounded, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof of the comparison test, Proof of the existence of the infimum by negation, Proof of the continuity of the inverse of a strictly monotone continuous function, Proof of Fermat's theorem on stationary points, Proof that limits preserve non-strict inequalities, Proof that 1 + x is at most exp x, Proof of the factorial formula for binomial coefficients by induction, Proof that a function with positive derivative is strictly increasing, Proof of the intermediate value theorem by the supremum, Proof of the binomial theorem by induction, Proof that exponentials dominate powers in sequences, by the ratio of consecutive terms, Proof that differentiable functions are continuous, Proof that one-sided limits of a monotone function exist, Proof of the epsilon-delta form of the limit of a function, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof of the Archimedean property in an Archimedean ordered field, Proof that a composition of continuous functions is continuous, Proof of the exponential of a sum by the Cauchy product, Proof that a decreasing sequence bounded below converges, Proof of the term test, Proof that the exponential function is its own derivative, by term-by-term differentiation, Proof that the reals are Archimedean from the completeness axiom, Proof of the ratio test, Proof that convergent sequences are bounded, Proof of the product rule, Proof of the monotone convergence theorem for sequences, Proof that continuity is equivalent to sequential continuity, Proof of the boundedness theorem by Bolzano–Weierstrass, Proof of the ratio formula for the radius of convergence, Proof that a series of nonnegative terms converges iff its partial sums are bounded, Proof of the mean value theorem from Rolle's theorem, Proof that the Cauchy product of absolutely convergent series converges absolutely to the product, Proof that slopes of a convex function are increasing, Proof that the exponential function is strictly convex, Proof of the constant multiple rule.

  1. Binomial coefficient definition
  2. Construction of the reals from Cauchy sequences concept
  3. Convex function definition
  4. Definition by recursion concept
  5. Element definition
  6. Factorial definition
  7. Group concept
  8. Integers object
  9. Limit point of a set definition
  10. Local maximum definition
  11. Mathematical induction concept
  12. Natural numbers object
  13. Ordered field definition
  14. Peano axioms concept
  15. Proposition concept
  16. Random experiment concept
  17. Rational numbers object
  18. Real numbers object
  19. Sequence definition
  20. Set bounded above definition
  21. Strictly monotone function definition
  22. Proof of Pascal's rule from the recursive definition proof
  23. Proof that slopes of a convex function are increasing proof
  24. Strictly convex function definition
  25. Set definition
  26. Ring definition
  27. Ring of integers statement
  28. Limit of a function definition
  29. Local minimum definition
  30. Archimedean ordered field definition
  31. Successor function definition
  32. Conjunction definition
  33. Disjunction definition
  34. Implication definition
  35. Negation definition
  36. Predicate definition
  37. Bernoulli trial concept
  38. The reals form a field statement
  39. Real sequence definition
  40. Subsequence definition
  41. Infimum definition
  42. Supremum definition
  43. Pascal's rule statement
  44. Slopes of a convex function are increasing statement
  45. Ordered pair definition
  46. Commutative ring definition
  47. Continuity at a point definition
  48. Derivative definition
  49. One-sided limit definition
  50. Union definition
  51. Addition of natural numbers definition
  52. Sample space definition
  53. Proof of the Archimedean property in an Archimedean ordered field proof
  54. The rationals form a field statement
  55. Biconditional definition
  56. The successor function is injective statement
  57. Zero is not a successor statement
  58. Truth table concept
  59. Modus ponens concept
  60. Existential quantifier definition
  61. Universal quantifier definition
  62. Bounded sequence definition
  63. Cauchy sequence definition
  64. Geometric sequence definition
  65. Limit of a sequence definition
  66. Monotone sequence definition
  67. Sequence tending to infinity definition
  68. Series definition
  69. Completeness axiom statement
  70. Proof of the factorial formula for binomial coefficients by induction proof
  71. Cartesian product definition
  72. Continuous function definition
  73. Differentiable function definition
  74. One-sided derivative definition
  75. Archimedean property statement
  76. Proof of the commutativity of addition by induction proof
  77. Subset definition
  78. Order on the natural numbers definition
  79. The rationals form an ordered field statement
  80. Propositional logic concept
  81. Mathematical proof concept
  82. Uniqueness quantifier definition
  83. Limit superior definition
  84. Proof of the sum of a finite geometric series proof
  85. Convergent sequence definition
  86. Pointwise convergence definition
  87. Sequential continuity definition
  88. The sequence r^n tends to infinity for r > 1 example
  89. Cauchy product definition
  90. Partial sum definition
  91. Power series definition
  92. Factorial formula for binomial coefficients statement
  93. Proof that a composition of continuous functions is continuous proof
  94. Binary relation definition
  95. Derivative function definition
  96. Order on the reals definition
  97. Universal set definition
  98. Power set definition
  99. Commutativity of addition statement
  100. Proof of strong induction from ordinary induction proof
  101. Tautology definition
  102. Uniform convergence definition
  103. Sum of a finite geometric series statement
  104. Convergent series definition
  105. Radius of convergence definition
  106. Proof of the binomial theorem by induction proof
  107. Antisymmetric relation definition
  108. Reflexive relation definition
  109. Transitive relation definition
  110. Higher derivative definition
  111. Interval definition
  112. Complement definition
  113. Function definition
  114. Strong induction statement
  115. Uniform convergence on a set definition
  116. Logical equivalence definition
  117. Sum of a series definition
  118. Series of functions definition
  119. Absolute convergence definition
  120. Binomial theorem statement
  121. Preorder definition
  122. Second derivative definition
  123. Proof of the epsilon-delta form of continuity proof
  124. Proof of the epsilon-delta form of the limit of a function proof
  125. Sigma-algebra definition
  126. Injective function definition
  127. Preimage of a set definition
  128. Proof of the well-ordering principle from strong induction proof
  129. Proof of the double negation law by a truth table proof
  130. Partial order definition
  131. Epsilon-delta definition of continuity statement
  132. Monotone function definition
  133. Epsilon-delta definition of a limit statement
  134. Countable set definition
  135. Event definition
  136. Well-ordering principle statement
  137. Borel sigma-algebra definition
  138. Double negation law statement
  139. Total order definition
  140. Composition of continuous functions is continuous statement
  141. Probability axioms concept
  142. Proof by contradiction concept
  143. Proof that every sequence has a monotone subsequence, by peaks proof
  144. Probability measure definition
  145. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  146. Every sequence has a monotone subsequence statement
  147. Probability distribution definition
  148. Probability space definition
  149. The reals form an ordered field statement
  150. Absolute value definition
  151. Random variable definition
  152. Proof of the approximation property of the supremum proof
  153. Proof of the existence of the infimum by negation proof
  154. Cumulative distribution function definition
  155. Proof of the triangle inequality for real numbers proof
  156. Proof that the absolute value is multiplicative proof
  157. Discrete random variable definition
  158. Proof of the epsilon-N definition of the limit of a sequence proof
  159. Approximation property of the supremum statement
  160. Existence of the infimum statement
  161. Convergence in distribution definition
  162. Triangle inequality statement
  163. Absolute value is multiplicative statement
  164. Probability mass function definition
  165. Proof of the intermediate value theorem by the supremum proof
  166. Proof that one-sided limits of a monotone function exist proof
  167. Epsilon-N definition of the limit of a sequence statement
  168. Proof that the reals are Archimedean from the completeness axiom proof
  169. Proof that differentiable functions are continuous proof
  170. Intermediate value theorem statement
  171. Proof of the squeeze theorem for sequences proof
  172. Proof that limits preserve non-strict inequalities proof
  173. Proof of the uniqueness of limits proof
  174. Proof of the limit of a sum of sequences proof
  175. Poisson distribution definition
  176. Binomial distribution definition
  177. Proof that convergent sequences are bounded proof
  178. Proof that convergent sequences are Cauchy proof
  179. The reals are Archimedean statement
  180. Proof of the term test proof
  181. Proof that Cauchy sequences are bounded proof
  182. The sequence 1/n tends to zero example
  183. Proof of the monotone convergence theorem for sequences proof
  184. Differentiable functions are continuous statement
  185. Proof of the continuity of the inverse of a strictly monotone continuous function proof
  186. Proof that there is a natural number n with 1/n below any positive epsilon proof
  187. Limits preserve non-strict inequalities statement
  188. Uniqueness of limits statement
  189. Limit of a sum of sequences statement
  190. Proof of the ratio formula for the radius of convergence proof
  191. Convergent sequences are bounded statement
  192. Squeeze theorem statement
  193. Convergent sequences are Cauchy statement
  194. Cauchy sequences are bounded statement
  195. Monotone convergence theorem for sequences statement
  196. Proof of the limit of a product of sequences proof
  197. There is a natural number n with 1/n below any positive epsilon statement
  198. One-sided limits of a monotone function exist statement
  199. Term test statement
  200. Proof that a series of nonnegative terms converges iff its partial sums are bounded proof
  201. Proof that a decreasing sequence bounded below converges proof
  202. The sequence r^n tends to zero for |r| < 1 example
  203. Continuity of the inverse of a strictly monotone continuous function statement
  204. Proof of the sequential characterization of limits proof
  205. Decreasing sequence bounded below converges statement
  206. Proof that continuity is equivalent to sequential continuity proof
  207. Limit of a product of sequences statement
  208. A series of nonnegative terms converges iff its partial sums are bounded statement
  209. Geometric series example
  210. Continuity is equivalent to sequential continuity statement
  211. Proof that the Cauchy product of absolutely convergent series converges absolutely to the product proof
  212. Sequential characterization of limits statement
  213. Proof of the root test proof
  214. Proof of the ratio test proof
  215. Proof of the Cauchy–Hadamard theorem proof
  216. Proof that exponentials dominate powers in sequences, by the ratio of consecutive terms proof
  217. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  218. Proof of the comparison test proof
  219. Proof of the chain rule with an auxiliary difference quotient proof
  220. Proof of the product rule proof
  221. Proof of the linearity of differentiation proof
  222. Comparison test statement
  223. Cauchy product of absolutely convergent series statement
  224. Bolzano–Weierstrass theorem statement
  225. Exponentials dominate powers in sequences statement
  226. Chain rule statement
  227. Product rule statement
  228. Linearity of differentiation statement
  229. Ratio test statement
  230. Root test statement
  231. Proof of the boundedness theorem by Bolzano–Weierstrass proof
  232. Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem proof
  233. Proof of the constant multiple rule proof
  234. Proof of the power rule by induction proof
  235. Boundedness theorem statement
  236. Ratio formula for the radius of convergence statement
  237. Cauchy–Hadamard theorem statement
  238. Cauchy criterion for sequences statement
  239. Constant multiple rule statement
  240. Power rule statement
  241. Proof of the extreme value theorem by the Bolzano–Weierstrass theorem proof
  242. Uniformly Cauchy sequence of functions definition
  243. Proof of the Cauchy criterion for series proof
  244. Extreme value theorem statement
  245. Proof of the formula for the derivative of a polynomial proof
  246. Proof of Fermat's theorem on stationary points proof
  247. Cauchy criterion for series statement
  248. Derivative of a polynomial statement
  249. Proof that absolutely convergent series converge proof
  250. Fermat's theorem on stationary points statement
  251. Proof of Rolle's theorem proof
  252. Absolutely convergent series converge statement
  253. Rolle's theorem statement
  254. Proof of the Weierstrass M-test proof
  255. Proof of the mean value theorem from Rolle's theorem proof
  256. Weierstrass M-test statement
  257. Mean value theorem statement
  258. Proof that power series converge uniformly on smaller intervals inside the radius of convergence proof
  259. Proof that a differentiable function is convex iff its derivative is increasing proof
  260. Proof that a function with nonnegative derivative is increasing proof
  261. Proof that uniform convergence of derivatives allows term-by-term differentiation proof
  262. Proof that a function with positive derivative is strictly increasing proof
  263. Power series converge uniformly on smaller discs inside the radius of convergence statement
  264. A function with nonnegative derivative is increasing statement
  265. A differentiable function is convex iff its derivative is increasing statement
  266. Uniform convergence of derivatives allows term-by-term differentiation statement
  267. A function with positive derivative is strictly increasing statement
  268. Proof that the exponential series has infinite radius of convergence proof
  269. Proof that a function with nonnegative second derivative is convex proof
  270. Proof of term-by-term differentiation proof
  271. The exponential series has infinite radius of convergence statement
  272. A function with nonnegative second derivative is convex statement
  273. Term-by-term differentiation statement
  274. Exponential function definition
  275. Proof of the exponential of a sum by the Cauchy product proof
  276. Proof that power series are differentiable inside the radius of convergence proof
  277. Exponential of a sum statement
  278. Power series are differentiable inside the radius of convergence statement
  279. Proof that the exponential function is positive proof
  280. Proof that the exponential function is its own derivative, by term-by-term differentiation proof
  281. The exponential function is positive statement
  282. The exponential function is its own derivative statement
  283. Proof that the exponential function is strictly increasing proof
  284. The exponential function is strictly increasing statement
  285. Proof that the exponential function is strictly convex proof
  286. Natural logarithm definition
  287. Proof that 1 + x is at most exp x proof
  288. The exponential function is convex statement
  289. 1 + x is at most exp x statement
  290. Proof that the logarithm is the inverse of the exponential proof
  291. Logarithm is the inverse of the exponential statement
  292. Proof of the Poisson limit theorem proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Poisson_limit_theorem, First proof
About this page
TagPCFHW6Y6ZQ
URIm2://PCFHW6Y6ZQ
Kindproof
WritingW0 stub
MSC60F05
ProvesPoisson limit theorem
UsesBinomial distribution, Poisson distribution, Convergence in distribution, Cumulative distribution function, Binomial coefficient, 1 + x is at most exp x, Logarithm is the inverse of the exponential
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.