guide:69043688f2

[math] \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}[/math]

\label{sec 8.1} We are now in a position to prove our first fundamental theorem of probability. We have seen that an intuitive way to view the probability of a certain outcome is as the frequency with which that outcome occurs in the long run, when the experiment is repeated a large number of times. We have also defined probability mathematically as a value of a distribution function for the random variable representing the experiment. The Law of Large Numbers, which is a theorem proved about the mathematical model of probability, shows that this model is consistent with the frequency interpretation of probability. This theorem is sometimes called the law of averages. To find out what would happen if this law were not true, see the article by Robert M. Coates.

Chebyshev Inequality

To discuss the Law of Large Numbers, we first need an important inequality called the Chebyshev Inequality.

Theorem

(Chebyshev Inequality) Let [math]X[/math] be a discrete random variable with expected value [math]\mu = E(X)[/math], and let [math]\epsilon \gt 0[/math] be any positive real number. Then

[[math]] P(|X - \mu| \geq \epsilon) \leq \frac {V(X)}{\epsilon^2}\ . [[/math]]

\n

Show Proof

Let [math]m(x)[/math] denote the distribution function of [math]X[/math]. Then the probability that [math]X[/math] differs from [math]\mu[/math] by at least [math]\epsilon[/math] is given by

[[math]] P(|X - \mu| \geq \epsilon) = \sum_{|x - \mu| \geq \epsilon} m(x)\ . [[/math]]

We know that

[[math]] V(X) = \sum_x (x - \mu)^2 m(x)\ , [[/math]]

and this is clearly at least as large as

[[math]] \sum_{|x - \mu| \geq \epsilon} (x - \mu)^2 m(x)\ , [[/math]]

since all the summands are positive and we have restricted the range of summation in the second sum. But this last sum is at least

[[math]] \begin{eqnarray*} \sum_{|x - \mu| \geq \epsilon} \epsilon^2 m(x) &=& \epsilon^2 \sum_{|x - \mu| \geq \epsilon} m(x) \\ &=& \epsilon^2 P(|X - \mu| \geq \epsilon)\ .\\ \end{eqnarray*} [[/math]]

So,

[[math]] P(|X - \mu| \geq \epsilon) \leq \frac {V(X)}{\epsilon^2}\ . [[/math]]

■

Note that [math]X[/math] in the above theorem can be any discrete random variable, and [math]\epsilon[/math] any positive number. Example Let [math]X[/math] by any random variable with [math]E(X) = \mu[/math] and [math]V(X) = \sigma^2[/math]. Then, if [math]\epsilon = k\sigma[/math], Chebyshev's Inequality states that

[[math]] P(|X - \mu| \geq k\sigma) \leq \frac {\sigma^2}{k^2\sigma^2} = \frac 1{k^2}\ . [[/math]]

Thus, for any random variable, the probability of a deviation from the mean of more than [math]k[/math] standard deviations is [math]{} \leq 1/k^2[/math]. If, for example, [math]k = 5[/math], [math]1/k^2 = .04[/math].

Chebyshev's Inequality is the best possible inequality in the sense that, for any [math]\epsilon \gt 0[/math], it is possible to give an example of a random variable for which Chebyshev's Inequality is in fact an equality. To see this, given [math]\epsilon \gt 0[/math], choose [math]X[/math] with distribution

[[math]] p_X = \pmatrix{ -\epsilon & +\epsilon \cr 1/2 & 1/2 \cr}\ . [[/math]]

Then [math]E(X) = 0[/math], [math]V(X) = \epsilon^2[/math], and

[[math]] P(|X - \mu| \geq \epsilon) = \frac {V(X)}{\epsilon^2} = 1\ . [[/math]]

We are now prepared to state and prove the Law of Large Numbers.

Law of Large Numbers

Theorem

(Law of Large Numbers) Let [math]X_1[/math], [math]X_2[/math], \dots, [math]X_n[/math] be an independent trials process, with finite expected value [math]\mu = E(X_j)[/math] and finite variance [math]\sigma^2 = V(X_j)[/math]. Let [math]S_n = X_1 + X_2 +\cdots+ X_n[/math]. Then for any [math]\epsilon \gt 0[/math],

[[math]] P\left( \left| \frac {S_n}n - \mu \right| \geq \epsilon \right) \to 0 [[/math]]

as [math]n \rightarrow \infty[/math]. Equivalently,

[[math]] P\left( \left| \frac {S_n}n - \mu \right| \lt \epsilon \right) \to 1 [[/math]]

as [math]n \rightarrow \infty[/math].\n

Show Proof

Since [math]X_1[/math], [math]X_2[/math], \dots, [math]X_n[/math] are independent and have the same distributions, we can apply Theorem. We obtain

[[math]] V(S_n) = n\sigma^2\ , [[/math]]

and

[[math]] V (\frac {S_n}n) = \frac {\sigma^2}n\ . [[/math]]

Also we know that

[[math]] E (\frac {S_n}n) = \mu\ . [[/math]]

By Chebyshev's Inequality, for any [math]\epsilon \gt 0[/math],

[[math]] P\left( \left| \frac {S_n}n - \mu \right| \geq \epsilon \right) \leq \frac {\sigma^2}{n\epsilon^2}\ . [[/math]]

Thus, for fixed [math]\epsilon[/math],

[[math]] P\left( \left| \frac {S_n}n - \mu \right| \geq \epsilon \right) \to 0 [[/math]]

as [math]n \rightarrow \infty[/math], or equivalently,

[[math]] P\left( \left| \frac {S_n}n - \mu \right| \lt \epsilon \right) \to 1 [[/math]]

as [math]n \rightarrow \infty[/math].

■

Law of Averages

Note that [math]S_n/n[/math] is an average of the individual outcomes, and one often calls the Law of Large Numbers the “law of averages.” It is a striking fact that we can start with a random experiment about which little can be predicted and, by taking averages, obtain an experiment in which the outcome can be predicted with a high degree of certainty. The Law of Large Numbers, as we have stated it, is often called the “Weak Law of Large Numbers” to distinguish it from the “Strong Law of Large Numbers” described in Exercise Exercise. Consider the important special case of Bernoulli trials with probability [math]p[/math] for success. Let [math]X_j = 1[/math] if the [math]j[/math]th outcome is a success and 0 if it is a failure. Then [math]S_n = X_1 + X_2 +\cdots+ X_n[/math] is the number of successes in [math]n[/math] trials and [math]\mu = E(X_1) = p[/math]. The Law of Large Numbers states that for any [math]\epsilon \gt 0[/math]

[[math]] P\left( \left| \frac {S_n}n - p \right| \lt \epsilon \right) \to 1 [[/math]]

as [math]n \rightarrow \infty[/math]. The above statement says that, in a large number of repetitions of a Bernoulli experiment, we can expect the proportion of times the event will occur to be near [math]p[/math]. This shows that our mathematical model of probability agrees with our frequency interpretation of probability.

Coin Tossing

Let us consider the special case of tossing a coin [math]n[/math] times with [math]S_n[/math] the number of heads that turn up. Then the random variable [math]S_n/n[/math] represents the fraction of times heads turns up and will have values between 0 and 1. The Law of Large Numbers predicts that the outcomes for this random variable will, for large [math]n[/math], be near 1/2. In Figure \ref{fig 8.1}, we have plotted the distribution for this example for increasing values of [math]n[/math]. We have marked the outcomes between .45 and .55 by dots at the top of the spikes. We see that as [math]n[/math] increases the distribution gets more and more concentrated around .5 and a larger and larger percentage of the total area is contained within the interval [math](.45,.55)[/math], as predicted by the Law of Large Numbers.

File:Guide e6d15 PSfig8-1.ps

Die Rolling

Example Consider [math]n[/math] rolls of a die. Let [math]X_j[/math] be the outcome of the [math]j[/math]th roll. Then [math]S_n = X_1 + X_2 +\cdots+ X_n[/math] is the sum of the first [math]n[/math] rolls. This is an independent trials process with [math]E(X_j) = 7/2[/math]. Thus, by the Law of Large Numbers, for any [math]\epsilon \gt 0[/math]

[[math]] P\left( \left| \frac {S_n}n - \frac 72 \right| \geq \epsilon \right) \to 0 [[/math]]

as [math]n \rightarrow \infty[/math]. An equivalent way to state this is that, for any [math]\epsilon \gt 0[/math],

[[math]] P\left( \left| \frac {S_n}n - \frac 72 \right| \lt \epsilon \right) \to 1 [[/math]]

as [math]n \rightarrow \infty[/math].

Numerical Comparisons

It should be emphasized that, although Chebyshev's Inequality proves the Law of Large Numbers, it is actually a very crude inequality for the probabilities involved. However, its strength lies in the fact that it is true for any random variable at all, and it allows us to prove a very powerful theorem.

In the following example, we compare the estimates given by Chebyshev's Inequality with the actual values. Example Let [math]X_1[/math], [math]X_2[/math], \dots, [math]X_n[/math] be a Bernoulli trials process with probability .3 for success and .7 for failure. Let [math]X_j = 1[/math] if the [math]j[/math]th outcome is a success and 0 otherwise. Then, [math]E(X_j) = .3[/math] and [math]V(X_j) = (.3)(.7) = .21[/math]. If

[[math]] A_n = \frac {S_n}n = \frac {X_1 + X_2 +\cdots+ X_n}n [[/math]]

is the average of the [math]X_i[/math], then [math]E(A_n) = .3[/math] and [math]V(A_n) = V(S_n)/n^2 = .21/n[/math]. Chebyshev's Inequality states that if, for example, [math]\epsilon = .1[/math],

[[math]] P(|A_n - .3| \geq .1) \leq \frac {.21}{n(.1)^2} = \frac {21}n\ . [[/math]]

Thus, if [math]n = 100[/math],

[[math]] P(|A_{100} - .3| \geq .1) \leq .21\ , [[/math]]

or if [math]n = 1000[/math],

[[math]] P(|A_{1000} - .3| \geq .1) \leq .021\ . [[/math]]

These can be rewritten as

[[math]] \begin{eqnarray*} P(.2 \lt A_{100} \lt .4) &\geq& .79\ , \\ P(.2 \lt A_{1000} \lt .4) &\geq& .979\ . \end{eqnarray*} [[/math]]

These values should be compared with the actual values, which are (to six decimal places)

[[math]] \begin{eqnarray*} P(.2 \lt A_{100} \lt .4) &\approx& .962549 \\ P(.2 \lt A_{1000} \lt .4) &\approx& 1\ .\\ \end{eqnarray*} [[/math]]

The program Law can be used to carry out the above calculations in a systematic way.

Historical Remarks

The Law of Large Numbers was first proved by the Swiss mathematician James Bernoulli in the fourth part of his work Ars Conjectandi published posthumously in 1713. As often happens with a first proof, Bernoulli's proof was much more difficult than the proof we have presented using Chebyshev's inequality. Chebyshev developed his inequality to prove a general form of the Law of Large Numbers (see Exercise Exercise). The inequality itself appeared much earlier in a work by Bienaymé, and in discussing its history Maistrov remarks that it was referred to as the Bienaymé-Chebyshev Inequality for a long time. In Ars Conjectandi Bernoulli provides his reader with a long discussion of the meaning of his theorem with lots of examples. In modern notation he has an event that occurs with probability [math]p[/math] but he does not know [math]p[/math]. He wants to estimate [math]p[/math] by the fraction [math]\bar{p}[/math] of the times the event occurs when the experiment is repeated a number of times. He discusses in detail the problem of estimating, by this method, the proportion of white balls in an urn that contains an unknown number of white and black balls. He would do this by drawing a sequence of balls from the urn, replacing the ball drawn after each draw, and estimating the unknown proportion of white balls in the urn by the proportion of the balls drawn that are white. He shows that, by choosing [math]n[/math] large enough he can obtain any desired accuracy and reliability for the estimate. He also provides a lively discussion of the applicability of his theorem to estimating the probability of dying of a particular disease, of different kinds of weather occurring, and so forth. In speaking of the number of trials necessary for making a judgement, Bernoulli observes that the “man on the street” believes the “law of averages.”

Further, it cannot escape anyone that for judging in this way about any event at all, it is not enough to use one or two trials, but rather a great number of trials is required. And sometimes the stupidest man---by some instinct of nature per se and by no previous instruction (this is truly amazing)--- knows for sure that the more observations of this sort that are taken, the less the danger will be of straying from the mark.

But he goes on to say that he must contemplate another possibility.

Something futher must be contemplated here which perhaps no one has thought about till now. It certainly remains to be inquired whether after the number of observations has been increased, the probability is increased of attaining the true ratio between the number of cases in which some event can happen and in which it cannot happen, so that this probability finally exceeds any given degree of certainty; or whether the problem has, so to speak, its own asymptote---that is, whether some degree of certainty is given which one can never exceed.

Bernoulli recognized the importance of this theorem, writing:

Therefore, this is the problem which I now set forth and make known after I have already pondered over it for twenty years. Both its novelty and its very great usefullness, coupled with its just as great difficulty, can exceed in weight and value all the remaining chapters of this thesis.

Bernoulli concludes his long proof with the remark:

Whence, finally, this one thing seems to follow: that if observations of all events were to be continued throughout all eternity, (and hence the ultimate probability would tend toward perfect certainty), everything in the world would be perceived to happen in fixed ratios and according to a constant law of alternation, so that even in the most accidental and fortuitous occurrences we would be bound to recognize, as it were, a certain necessity and, so to speak, a certain fate. I do now know whether Plato wished to aim at this in his doctrine of the universal return of things, according to which he predicted that all things will return to their original state after countless ages have past.

\exercises

\choice{}{==General references== Doyle, Peter G. (2006). "Grinstead and Snell's Introduction to Probability" (PDF). Retrieved June 6, 2024.