Math 2.0

statement theorem

Poisson limit theorem

Statement

Let λ>0\lambda > 0, and let pn∈[0,1]p_n \in [0, 1] satisfy npn→λn p_n \to \lambda as n→∞n \to \infty. Let Sn∼Bin⁡(n,pn)S_n \sim \operatorname{Bin}(n, p_n). Then for each integer k≥0k \ge 0, lim⁡n→∞P(Sn=k)=lim⁡n→∞(nk)pnk(1−pn)n−k=e−λλkk!.\lim_{n \to \infty} P(S_n = k) = \lim_{n \to \infty} \binom{n}{k} p_n^k (1 - p_n)^{n - k} = e^{-\lambda} \frac{\lambda^k}{k!}. So SnS_n converges in distribution to the Poisson distribution with parameter λ\lambda.

Remarks

Proof: write (nk)pnk=n(n−1)⋯(n−k+1)nk⋅(npn)kk!\binom{n}{k} p_n^k = \frac{n(n-1)\cdots(n-k+1)}{n^k} \cdot \frac{(n p_n)^k}{k!}. The first factor tends to 11, and (1−pn)n−k→e−λ(1 - p_n)^{n-k} \to e^{-\lambda}. In practice, Bin⁡(n,p)\operatorname{Bin}(n, p) is close to Poisson⁡(np)\operatorname{Poisson}(np) when nn is large and pp is small. Le Cam's inequality gives an explicit bound on the error of this approximation.

Explanations

L1 human

The number of rare events among many independent chances is approximately Poisson. Examples are the number of misprints on a page, or the number of large insurance claims in a year.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

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

Sources

  1. Web https://en.wikipedia.org/wiki/Poisson_limit_theorem, Theorem