Math 2.0

statement theorem

De Moivre–Laplace theorem

Statement

Let p∈(0,1)p \in (0, 1) and let Sn∼Bin⁡(n,p)S_n \sim \operatorname{Bin}(n, p) for each n≥1n \ge 1. Let q=1−pq = 1 - p. Then (Sn−np)/npq(S_n - np)/\sqrt{npq} converges in distribution to N(0,1)\mathcal{N}(0, 1). That is, for all reals a<ba < b, lim⁡n→∞P(a≤Sn−npnpq≤b)=∫ab12πe−x2/2 dx.\lim_{n \to \infty} P\left(a \le \frac{S_n - np}{\sqrt{npq}} \le b\right) = \int_a^b \frac{1}{\sqrt{2\pi}} e^{-x^2/2} \, dx.

Remarks

This is the special case of the central limit theorem for Bernoulli variables. Indeed, SnS_n has the law of a sum of nn independent Bernoulli(pp) variables. A local form also holds: (nk)pkqn−k∼12πnpqe−(k−np)2/(2npq)\binom{n}{k} p^k q^{n-k} \sim \frac{1}{\sqrt{2\pi npq}} e^{-(k - np)^2/(2npq)} as n→∞n \to \infty, uniformly for kk with ∣k−np∣≤Cn|k - np| \le C\sqrt{n}. The proof uses Stirling's formula. In practice, one often adds a continuity correction of 1/21/2 to the integer bounds.

History

Abraham de Moivre proved the case p=1/2p = 1/2. Pierre-Simon Laplace extended it to general pp.

Explanations

L1 human

For many trials, the binomial distribution looks like a bell curve with mean npnp and variance np(1−p)np(1 - p). This lets you approximate binomial probabilities, such as "at least 520520 heads in 10001000 tosses", with the normal distribution.

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/De_Moivre–Laplace_theorem, Theorem