Weak Law of Large Numbers Explained with Worked Examples

The weak law of large numbers says the sample mean converges in probability to the true mean: for every , as .

Write 2x or 2*x to multiply, ^ for powers, and ; between simultaneous equations. You can also type factor, expand, derivative of, integrate … from a to b, limit … as x->0 or 15% of 80.

Try an example

Before you start

This page is easier if you are comfortable with:

What Weak law of large numbers means

Chebyshev's inequality applied to (variance ) gives (Chebyshev's inequality). For a fair coin, , , : the bound is , while the exact binomial probability of or heads is 0.0569 (the binomial distribution). To make the bound at most 0.05 we need .

For a fair die (), , : the bound is . The bound is crude (compare the central limit theorem, which gives the actual normal-shaped fluctuation), but it proves the principle: relative frequencies settle down, which justifies the interpretation of probability as long-run frequency (relative frequency).

The law is the basis of Monte Carlo methods, whose accuracy is described by the Monte Carlo error, and of estimation by sample averages (mean squared error). The strong law is a stronger statement: the averages converge for almost every infinite sequence.

What is it used for?

Averages settle near the true mean as the sample grows, which justifies estimating by sampling.

How to use weak law of large numbers

  1. Find of a single observation.
  2. Bound .
  3. Solve for to reach a target probability.
  4. Compare with the exact or normal-approximation value.

Graph

Chebyshev bound 0.25/(0.01n) on a fair coin average being off by 0.1n = 100: 0.25n = 500: 0.055010015020025030035040045050055060000.20.40.60.81Chebyshev bound 0.25/(0.01n) on a fair coin average being off by 0.1nboundboundGraph with x from 20 to 600 and y from 0 to 1.05. Shows the curve bound; point n = 100: 0.25 at (100, 0.25); point n = 500: 0.05 at (500, 0.05).

More tosses make a large deviation less and less likely.

Worked examples

These examples are worked by hand, step by step, so you can compare your own working.

Example 1: coin, n = 100

Bound for 100 fair coin tosses.

Worked example
Answer
0.250.25
  1. Formula

Example 2: sample size for 0.05

How large must be so that the bound is at most 0.05?

Worked example
Answer
500500
  1. Formula

Example 3: a die

Bound for 100 rolls of a fair die.

Worked example
Answer
0.11670.1167
  1. Formula

Special cases

A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.

σ² = 4, n = 100, ε = 0.5

bound σ²/(nε²)

0.16.

n = 400

bound

0.04.

Need bound ≤ 0.01

n ≥ σ²/(ε²·0.01)

1600.

ε = 1

n = 100

bound 0.04.

Word problems

The sample mean converges in probability to μ. Chebyshev gives a quantitative bound: P(|X̄ₙ − μ| ≥ ε) ≤ σ²/(nε²).

Bound

σ² = 4, n = 100, ε = 0.5. Find σ²/(nε²).

  1. 4/25
  2. Check: ✓0.16

Larger n

Find the bound for n = 400.

  1. 4/100
  2. Check: ✓0.04

Required n Higher

Find n making the bound 0.01.

  1. 4/(0.25 × 0.01)
  2. Check: ✓1600

Larger ε Higher

Find the bound for ε = 1, n = 100.

  1. 4/100
  2. Check: ✓0.04

Common mistakes

Using σ

σ/(nε²) ✗

σ²/(nε²) ✓

Variance.

Forgetting ε²

σ²/(nε) ✗

σ²/(nε²) ✓

Squared.

Certainty

X̄ = μ ✗

close with high probability ✓

Not equality.

Strong vs weak

same ✗

probability vs almost sure ✓

Different modes.

Exam tips

  1. σ²/(nε²).
  2. Increase n to tighten.
  3. Chebyshev proves it.
  4. Probability, not certainty.
  5. ε squared.

Practice questions

Try each one on paper, then open the answer. Use the solver above to see the full working.

1. Bound σ² = 9, n = 100, ε = 1 Foundation

0.09

2. Bound σ² = 1, n = 25, ε = 0.2 Foundation

1

3. n for bound 0.05, σ² = 4, ε = 1 Foundation

80

4. Bound σ² = 16, n = 400, ε = 2 Higher

0.01

5. n for bound 0.1, σ² = 2, ε = 0.5 Higher

80

6. Bound σ² = 4, n = 1000, ε = 0.1 Higher

0.4

Practice generator

Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.

Solve: …

Key terms

Weak law of large numbers
X̄ₙ → μ in probability.
Convergence in probability
P(
Chebyshev bound
σ²/(nε²).
Sample mean
X̄ₙ.
Tolerance (ε)
Allowed error.
Strong law
Almost-sure version.

Frequently asked questions

What is the weak law of large numbers?

Sample means converge in probability to the mean.

How is it proved?

By Chebyshev’s inequality.

What is the bound?

σ²/(nε²).

How does it differ from the strong law?

It gives probability, not almost sure convergence.

Which page covers Chebyshev?

Chebyshev’s inequality.

Which page covers Markov?

Markov’s inequality.

More in Advanced statistics and stochastic processes and the formula sheets.