# 6.1: Expected Value of Discrete Random Variables

- Page ID
- 3144

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\id}{\mathrm{id}}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\kernel}{\mathrm{null}\,}\)

\( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\)

\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\)

\( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)

\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)

\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vectorC}[1]{\textbf{#1}} \)

\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)When a large collection of numbers is assembled, as in a census, we are usually interested not in the individual numbers, but rather in certain descriptive quantities such as the average or the median. In general, the same is true for the probability distribution of a numerically-valued random variable. In this and in the next section, we shall discuss two such descriptive quantities: the *expected value *and the *variance. *Both of these quantities apply only to numerically-valued random variables, and so we assume, in these sections, that all random variables have numerical values. To give some intuitive justification for our definition, we consider the following game.

## Average Value

A die is rolled. If an odd number turns up, we win an amount equal to this number; if an even number turns up, we lose an amount equal to this number. For example, if a two turns up we lose 2, and if a three comes up we win 3. We want to decide if this is a reasonable game to play. We first try simulation. The program **Die** carries out this simulation.

The program prints the frequency and the relative frequency with which each outcome occurs. It also calculates the average winnings. We have run the program twice. The results are shown in Table \(\PageIndex{1}\).

Winning |
Frequency | Relative | Frequency | Relative |
---|---|---|---|---|

Frequency | Frequency | |||

1 | 17 | .17 | 1681 | .1681 |

-2 | 17 | .17 | 1678 | .1678 |

3 | 16 | .16 | 1626 | .1626 |

-4 | 18 | .18 | 1696 | .1696 |

5 | 16 | .16 | 1686 | .1686 |

-6 | 16 | .16 | 1633 | .1633 |

In the first run we have played the game 100 times. In this run our average gain is \(-.57\). It looks as if the game is unfavorable, and we wonder how unfavorable it really is. To get a better idea, we have played the game 10,000 times. In this case our average gain is \(-.4949\).

We note that the relative frequency of each of the six possible outcomes is quite close to the probability 1/6 for this outcome. This corresponds to our frequency interpretation of probability. It also suggests that for very large numbers of plays, our average gain should be

\[ \nonumber \begin{aligned} \mu & = & 1 \Bigl(\frac 16\Bigr) - 2\Bigl(\frac 16\Bigr) + 3 \Bigl(\frac 16\Bigr) - 4 \Bigl(\frac 16\Bigr) + 5 \Bigl(\frac 16\Bigr) - 6 \Bigl(\frac 16\Bigr) \\ & = & \frac 96 - \frac {12}6 = -\frac 36 = -.5\ .\end{aligned}\] This agrees quite well with our average gain for 10,000 plays.

We note that the value we have chosen for the average gain is obtained by taking the possible outcomes, multiplying by the probability, and adding the results. This suggests the following definition for the expected outcome of an experiment.

## Expected Value

Let \(X\) be a numerically-valued discrete random variable with sample space \(\Omega\) and distribution function \(m(x)\). The *expected value* \(E(X)\) is defined by

\[\nonumber E(X) = \sum_{x \in \Omega} x m(x)\ ,\]

provided this sum converges absolutely.

We often refer to the expected value as the *mean *and denote \(E(X)\) by \(\mu\) for short. If the above sum does not converge absolutely, then we say that \(X\) does not have an expected value.

Let an experiment consist of tossing a fair coin three times. Let \(X\) denote the number of heads which appear. Then the possible values of \(X\) are \(0, 1, 2\) and \(3\). The corresponding probabilities are \(1/8, 3/8, 3/8,\) and \(1/8\). Thus, the expected value of \(X\) equals

\[\nonumber [0\biggl(\frac 18\biggr) + 1\biggl(\frac 38\biggr) + 2\biggl(\frac 38\biggr) + 3\biggl(\frac 18\biggr) = \frac 32\ .\] Later in this section we shall see a quicker way to compute this expected value, based on the fact that \(X\) can be written as a sum of simpler random variables.

Suppose that we toss a fair coin until a head first comes up, and let \(X\) represent the number of tosses which were made. Then the possible values of \(X\) are \(1, 2, \ldots\), and the distribution function of \(X\) is defined by \[m(i) = {1\over {2^i}}\ .\] (This is just the geometric distribution with parameter \(1/2\).) Thus, we have \[\begin{aligned} E(X) & = &\sum_{i = 1}^\infty i {1\over{2^i}} \\ & = & \sum_{i = 1}^\infty {1\over{2^i}} + \sum_{i = 2}^\infty {1\over{2^i}} + \cdots \\ & = & 1 + {1\over 2} + {1\over{2^2}} + \cdots \\ & = & 2\ .\end{aligned}\]

Suppose that we flip a coin until a head first appears, and if the number of tosses equals \(n\), then we are paid \(2^n\) dollars. What is the expected value of the payment?

**Answer**-
We let \(Y\) represent the payment. Then,

\[P(Y = 2^n) = {1\over{2^n}}\ ,\] for \(n \ge 1\). Thus, \[E(Y) = \sum_{n = 1}^\infty 2^n {1\over{2^n}}\ ,\] which is a divergent sum. Thus, \(Y\) has no expectation. This example is called the . The fact that the above sum is infinite suggests that a player should be willing to pay any fixed amount per game for the privilege of playing this game. The reader is asked to consider how much he or she would be willing to pay for this privilege. It is unlikely that the reader’s answer is more than 10 dollars; therein lies the paradox.

In the early history of probability, various mathematicians gave ways to resolve this paradox. One idea (due to G. Cramer) consists of assuming that the amount of money in the world is finite. He thus assumes that there is some fixed value of \(n\) such that if the number of tosses equals or exceeds \(n\), the payment is \(2^n\) dollars. The reader is asked to show in Exercise \(\PageIndex{20}\) that the expected value of the payment is now finite.

Daniel Bernoulli and Cramer also considered another way to assign value to the payment. Their idea was that the value of a payment is some function of the payment; such a function is now called a utility function. Examples of reasonable utility functions might include the square-root function or the logarithm function. In both cases, the value of \(2n\) dollars is less than twice the value of \(n\) dollars. It can easily be shown that in both cases, the expected utility of the payment is finite (see Exercise \(\PageIndex{20}\).

Let \(T\) be the time for the first success in a Bernoulli trials process. Then we take as sample space \(\Omega\) the integers \(1,~2,~\ldots\\) and assign the geometric distribution

\[m(j) = P(T = j) = q^{j - 1}p .\]

Thus, \[\begin{align} E(T) & = & 1 \cdot p + 2qp + 3q^2p +\cdots \\ & = & p(1 + 2q + 3q^2 +\cdots ) .\end{align}\]

Now if \(|x| < 1\), then \[1 + x + x^2 + x^3 + \cdots = \frac{1}{1 - x} .\] Differentiating this formula, we get \[1 + 2x + 3x^2 +\cdots = \frac{1}{(1 - x)^2} ,\] so \[E(T) = \frac{p}{(1 - q)^2} = \frac{p}{p^2} = \frac{1}{p} .\] In particular, we see that if we toss a fair coin a sequence of times, the expected time until the first heads is 1/(1/2) = 2. If we roll a die a sequence of times, the expected number of rolls until the first six is 1/(1/6) = 6.

## Interpretation of Expected Value

In statistics, one is frequently concerned with the average value of a set of data. The following example shows that the ideas of average value and expected value are very closely related.

The heights, in inches, of the women on the Swarthmore basketball team are 5’ 9", 5’ 9", 5’ 6", 5’ 8", 5’ 11", 5’ 5", 5’ 7", 5’ 6", 5’ 6", 5’ 7", 5’ 10", and 6’ 0".

A statistician would compute the average height (in inches) as follows: \[\frac{69 + 69 + 66 + 68 + 71 + 65 + 67 + 66 + 66 + 67 + 70 + 72}{12} = 67.9\ .\] One can also interpret this number as the expected value of a random variable. To see this, let an experiment consist of choosing one of the women at random, and let \(X\) denote her height. Then the expected value of \(X\) equals 67.9.

Of course, just as with the frequency interpretation of probability, to interpret expected value as an average outcome requires further justification. We know that for any finite experiment the average of the outcomes is not predictable. However, we shall eventually prove that the average will usually be close to \(E(X)\) if we repeat the experiment a large number of times. We first need to develop some properties of the expected value. Using these properties, and those of the concept of the variance to be introduced in the next section, we shall be able to prove the This theorem will justify mathematically both our frequency concept of probability and the interpretation of expected value as the average value to be expected in a large number of experiments.

## Expectation of a Function of a Random Variable

Suppose that \(X\) is a discrete random variable with sample space \(\Omega\), and \(\phi(x)\) is a real-valued function with domain \(\Omega\). Then \(\phi(X)\) is a real-valued random variable. One way to determine the expected value of \(\phi(X)\) is to first determine the distribution function of this random variable, and then use the definition of expectation. However, there is a better way to compute the expected value of \(\phi(X)\), as demonstrated in the next example.

Suppose a coin is tossed 9 times, with the result \[HHHTTTTHT\ .\] The first set of three heads is called a . There are three more runs in this sequence, namely the next four tails, the next head, and the next tail. We do not consider the first two tosses to constitute a run, since the third toss has the same value as the first two.

Now suppose an experiment consists of tossing a fair coin three times. Find the expected number of runs.

**Answer**-
It will be helpful to think of two random variables, \(X\) and \(Y\), associated with this experiment. We let \(X\) denote the sequence of heads and tails that results when the experiment is performed, and \(Y\) denote the number of runs in the outcome \(X\). The possible outcomes of \(X\) and the corresponding values of \(Y\) are shown in Table \(\PageIndex{2}\)

\[\begin{tabular}{cc} X & Y \\ \hline HHH & 1\\ HHT & 2\\ HTH & 3\\ HTT & 2\\ THH & 2\\ THT & 3\\ TTH & 2\\ TTT & 1\\ \end{tabular}\]

To calculate \(E(Y)\) using the definition of expectation, we first must find the distribution function \(m(y)\) of \(Y\) i.e., we group together those values of \(X\) with a common value of \(Y\) and add their probabilities. In this case, we calculate that the distribution function of \(Y\) is: \(m(1) = 1/4,\ m(2) = 1/2,\) and \(m(3) = 1/4\). One easily finds that \(E(Y) = 2\).

Now suppose we didn’t group the values of \(X\) with a common \(Y\)-value, but instead, for each \(X\)-value \(x\), we multiply the probability of \(x\) and the corresponding value of \(Y\), and add the results. We obtain \[1\biggl(\frac 18\biggr) +2\biggl(\frac 18\biggr) +3\biggl(\frac 18\biggr) +2\biggl(\frac 18\biggr) +2\biggl(\frac 18\biggr) +3\biggl(\frac 18\biggr) +2\biggl(\frac 18\biggr) +1\biggl(\frac 18\biggr)\ ,\] which equals 2.

This illustrates the following general principle. If \(X\) and \(Y\) are two random variables, and \(Y\) can be written as a function of \(X\), then one can compute the expected value of \(Y\) using the distribution function of \(X\).

If \(X\) is a discrete random variable with sample space \(\Omega\) and distribution function \(m(x)\), and if \(\phi : \Omega \to\) is a function, then \[E(\phi(X)) = \sum_{x \in \Omega} \phi(x) m(x)\ ,\] provided the series converges absolutely.

**Proof**-
The proof of this theorem is straightforward, involving nothing more than grouping values of \(X\) with a common \(Y\)-value, as in Example \(\PageIndex{6}\)

## The Sum of Two Random Variables

Many important results in probability theory concern sums of random variables. We first consider what it means to add two random variables.

We flip a coin and let \(X\) have the value 1 if the coin comes up heads and 0 if the coin comes up tails. Then, we roll a die and let \(Y\) denote the face that comes up. What does \(X+Y\) mean, and what is its distribution?

###### Solution

This question is easily answered in this case, by considering, as we did in Chapter 4, the joint random variable \(Z = (X,Y)\), whose outcomes are ordered pairs of the form \((x, y)\), where \(0 \le x \le 1\) and \(1 \le y \le 6\). The description of the experiment makes it reasonable to assume that \(X\) and \(Y\) are independent, so the distribution function of \(Z\) is uniform, with \(1/12\) assigned to each outcome. Now it is an easy matter to find the set of outcomes of \(X+Y\), and its distribution function.

In Example \(\PageIndex{6}\), the random variable \(X\) denoted the number of heads which occur when a fair coin is tossed three times. It is natural to think of \(X\) as the sum of the random variables \(X_1, X_2, X_3\), where \(X_i\) is defined to be 1 if the \(i\)th toss comes up heads, and 0 if the \(i\)th toss comes up tails. The expected values of the \(X_i\)’s are extremely easy to compute. It turns out that the expected value of \(X\) can be obtained by simply adding the expected values of the \(X_i\)’s. This fact is stated in the following theorem.

Let \(X\) and \(Y\) be random variables with finite expected values. Then \[E(X + Y) = E(X) + E(Y)\ ,\] and if \(c\) is any constant, then \[E(cX) = cE(X)\ .\]

**Proof**-
Let the sample spaces of \(X\) and \(Y\) be denoted by \(\Omega_X\) and \(\Omega_Y\), and suppose that \[\Omega_X = \{x_1, x_2, \ldots\}\] and \[\Omega_Y = \{y_1, y_2, \ldots\}\ .\] Then we can consider the random variable \(X + Y\) to be the result of applying the function \(\phi(x, y) = x + y\) to the joint random variable \((X,Y)\). Then, by Theorem \(\PageIndex{1}\) the expected value of the sum of any finite number of random variables is the sum of the expected values of the individual random variables., we have

\[\begin{aligned} E(X+Y) & = &\sum_j \sum_k (x_j + y_k) P(X = x_j,\ Y = y_k) \\ & = &\sum_j \sum_k x_j P(X = x_j,\ Y = y_k) + \sum_j \sum_k y_k P(X = x_j,\ Y = y_k) \\ & = &\sum_j x_j P(X = x_j) + \sum_k y_k P(Y = y_k)\ .\end{aligned}\]

The last equality follows from the fact that \[\sum_k P(X = x_j,\ Y = y_k)\ \ =\ \ P(X = x_j)\] and \[\sum_j P(X = x_j,\ Y = y_k)\ \ =\ \ P(Y = y_k)\ .\]

Thus, \[E(X+Y) = E(X) + E(Y)\ .\]

If \(c\) is any constant, \[\begin{aligned} E(cX) & = & \sum_j cx_j P(X = x_j) \\ & = & c\sum_j x_j P(X = x_j)\\ & = & cE(X)\ .\end{aligned}\]

It is easy to prove by mathematical induction that* the expected value of the sum of any finite number of random variables is the sum of the expected values of the individual random variables.*

It is important to note that mutual independence of the summands was not needed as a hypothesis in the Theorem \(\PageIndex{2}\) and its generalization. The fact that expectations add, whether or not the summands are mutually independent, is sometimes referred to as the First Fundamental Mystery of Probability.

Let \(Y\) be the number of fixed points in a random permutation of the set \(\{a,b,c\}\). To find the expected value of \(Y\), it is helpful to consider the basic random variable associated with this experiment, namely the random variable \(X\) which represents the random permutation. There are six possible outcomes of \(X\), and we assign to each of them the probability \(1/6\) see Table \(\PageIndex{3}\). Then we can calculate \(E(Y)\) using Theorem \(\PageIndex{1}\), as \[3\Bigl({1\over 6}\Bigr) + 1\Bigl({1\over 6}\Bigr) + 1\Bigl({1\over 6}\Bigr) + 0\Bigl({1\over 6}\Bigr) + 0\Bigl({1\over 6}\Bigr) + 1\Bigl({1\over 6}\Bigr) = 1\ .\]

\(X\) | \(Y\) |
---|---|

\(a\;\;\;b\;\;\; c\) | 3 |

\(a\;\;\; c\;\;\; b\) | 1 |

\(b\;\;\; a\;\;\; c\) | 1 |

\(b\;\;\; c\;\;\; a\) | 0 |

\(c\;\;\; a\;\;\; b\) | 0 |

\(c\;\;\; b\;\;\; a\) | 1 |

We now give a very quick way to calculate the average number of fixed points in a random permutation of the set \(\{1, 2, 3, \ldots, n\}\). Let \(Z\) denote the random permutation. For each \(i\), \(1 \le i \le n\), let \(X_i\) equal 1 if \(Z\) fixes \(i\), and 0 otherwise. So if we let \(F\) denote the number of fixed points in \(Z\), then \[F = X_1 + X_2 + \cdots + X_n\ .\] Therefore, Theorem \(\PageIndex{2}\) implies that \[E(F) = E(X_1) + E(X_2) + \cdots + E(X_n)\ .\] But it is easy to see that for each \(i\), \[E(X_i) = {1\over n}\ ,\] so \[E(F) = 1\ .\] This method of calculation of the expected value is frequently very useful. It applies whenever the random variable in question can be written as a sum of simpler random variables. We emphasize again that it is not necessary that the summands be mutually independent.

## Bernoulli Trials

Let \(S_n\) be the number of successes in \(n\) Bernoulli trials with probability \(p\) for success on each trial. Then the expected number of successes is \(np\). That is, \[E(S_n) = np\ .\]

**Proof**-
Let \(X_j\) be a random variable which has the value 1 if the \(j\)th outcome is a success and 0 if it is a failure. Then, for each \(X_j\), \[E(X_j) = 0\cdot(1 - p) + 1\cdot p = p\ .\] Since \[S_n = X_1 + X_2 +\cdots+ X_n\ ,\] and the expected value of the sum is the sum of the expected values, we have \[\begin{aligned} E(S_n) & = & E(X_1) + E(X_2) +\cdots+ E(X_n) \\ & = & np\ .\end{aligned}\]

## Poisson Distribution

Recall that the Poisson distribution with parameter \(\lambda\) was obtained as a limit of binomial distributions with parameters \(n\) and \(p\), where it was assumed that \(np = \lambda\), and \(n \rightarrow \infty\). Since for each \(n\), the corresponding binomial distribution has expected value \(\lambda\), it is reasonable to guess that the expected value of a Poisson distribution with parameter \(\lambda\) also has expectation equal to \(\lambda\). This is in fact the case, and the reader is invited to show this (see Exercise \(\PageIndex{21}\)).

## Independence

If \(X\) and \(Y\) are two random variables, it is not true in general that \(E(X \cdot Y) = E(X)E(Y)\). However, this is true if \(X\) and \(Y\) are *independent.*

If \(X\) and \(Y\) are independent random variables, then \[E(X \cdot Y) = E(X)E(Y)\ .\]

**Proof**-
Suppose that \[\Omega_X = \{x_1, x_2, \ldots\}\] and \[\Omega_Y = \{y_1, y_2, \ldots\}\] are the sample spaces of \(X\) and \(Y\), respectively. Using Theorem \(\PageIndex{1}\), we have \[E(X \cdot Y) = \sum_j \sum_k x_jy_k P(X = x_j,\ Y = y_k)\ .\]

But if \(X\) and \(Y\) are independent, \[P(X = x_j, Y = y_k) = P(X = x_j)P(Y = y_k)\ .\] Thus, \[\begin{aligned} E(X \cdot Y) & = & \sum_j\sum_k x_j y_k P(X = x_j) P(Y = y_k) \\ & = & \left(\sum_j x_j P(X = x_j)\right) \left(\sum_k y_k P(Y = y_k)\right) \\ & = &E(X) E(Y)\ .\end{aligned}\]

A coin is tossed twice. \(X_i = 1\) if the \(i\)th toss is heads and 0 otherwise. We know that \(X_1\) and \(X_2\) are independent. They each have expected value 1/2. Thus \(E(X_1 \cdot X_2) = E(X_1) E(X_2) = (1/2)(1/2) = 1/4\).

We next give a simple example to show that the expected values need not multiply if the random variables are not independent.

Consider a single toss of a coin. We define the random variable \(X\) to be 1 if heads turns up and 0 if tails turns up, and we set \(Y = 1 - X\). Then \(E(X) = E(Y) = 1/2\). But \(X \cdot Y = 0\) for either outcome. Hence, \(E(X \cdot Y) = 0 \ne E(X) E(Y)\).

We return to our records example of Section 3.1 for another application of the result that the expected value of the sum of random variables is the sum of the expected values of the individual random variables.

## Records

We start keeping snowfall records this year and want to find the expected number of records that will occur in the next \(n\) years. The first year is necessarily a record. The second year will be a record if the snowfall in the second year is greater than that in the first year. By symmetry, this probability is 1/2. More generally, let \(X_j\) be 1 if the \(j\)th year is a record and 0 otherwise. To find \(E(X_j)\), we need only find the probability that the \(j\)th year is a record. But the record snowfall for the first \(j\) years is equally likely to fall in any one of these years, so \(E(X_j) = 1/j\). Therefore, if \(S_n\) is the total number of records observed in the first \(n\) years,

\[E(S_n) = 1 + \frac 12 + \frac 13 +\cdots+ \frac 1n\ .\]

This is the famous *divergent harmonic series. *It is easy to show that

\[E(S_n) \sim \log n\]

as \(n \rightarrow \infty\). A more accurate approximation to \(E(S_n)\) is given by the expression

\[\log n + \gamma + {1\over {2n}}\ ,\]

where \(\gamma\) denotes Euler’s constant, and is approximately equal to .5772.

Therefore, in ten years the expected number of records is approximately \(2.9298\); the exact value is the sum of the first ten terms of the harmonic series which is 2.9290.

## Craps

In the game of craps, the player makes a bet and rolls a pair of dice. If the sum of the numbers is 7 or 11 the player wins, if it is 2, 3, or 12 the player loses. If any other number results, say \(r\), then \(r\) becomes the player’s point and he continues to roll until either \(r\) or 7 occurs. If \(r\) comes up first he wins, and if 7 comes up first he loses. The program **Craps** simulates playing this game a number of times.

We have run the program for 1000 plays in which the player bets 1 dollar each time. The player’s average winnings were \(-.006\). The game of craps would seem to be only slightly unfavorable. Let us calculate the expected winnings on a single play and see if this is the case. We construct a two-stage tree measure as shown in Figure \(\PageIndex{1}\).

The first stage represents the possible sums for his first roll. The second stage represents the possible outcomes for the game if it has not ended on the first roll. In this stage we are representing the possible outcomes of a sequence of rolls required to determine the final outcome. The branch probabilities for the first stage are computed in the usual way assuming all 36 possibilites for outcomes for the pair of dice are equally likely. For the second stage we assume that the game will eventually end, and we compute the conditional probabilities for obtaining either the point or a 7. For example, assume that the player’s point is 6. Then the game will end when one of the eleven pairs, \((1,5)\), \((2,4)\), \((3,3)\), \((4,2)\), \((5,1)\), \((1,6)\), \((2,5)\), \((3,4)\), \((4,3)\), \((5,2)\), \((6,1)\), occurs. We assume that each of these possible pairs has the same probability. Then the player wins in the first five cases and loses in the last six. Thus the probability of winning is 5/11 and the probability of losing is 6/11. From the path probabilities, we can find the probability that the player wins 1 dollar; it is 244/495. The probability of losing is then 251/495. Thus if \(X\) is his winning for a dollar bet,

\[\begin{aligned} E(X) & = & 1\Bigl(\frac {244}{495}\Bigr) + (-1)\Bigl(\frac {251}{495}\Bigr) \\ & = & -\frac {7}{495} \approx -.0141\ .\end{aligned}\]

The game is unfavorable, but only slightly. The player’s expected gain in \(n\) plays is \(-n(.0141)\). If \(n\) is not large, this is a small expected loss for the player. The casino makes a large number of plays and so can afford a small average gain per play and still expect a large profit.

## Roulette

In Las Vegas, a roulette wheel has 38 slots numbered 0, 00, 1, 2, …, 36. The 0 and 00 slots are green, and half of the remaining 36 slots are red and half are black. A croupier spins the wheel and throws an ivory ball. If you bet 1 dollar on red, you win 1 dollar if the ball stops in a red slot, and otherwise you lose a dollar. We wish to calculate the expected value of your winnings, if you bet 1 dollar on red.

Let \(X\) be the random variable which denotes your winnings in a 1 dollar bet on red in Las Vegas roulette. Then the distribution of \(X\) is given by \[m_{X} = \pmatrix{ -1 & 1 \cr 20/38 & 18/38 \cr},\] and one can easily calculate (see Exercise \(\PageIndex{5}\)) that \[E(X) \approx -.0526\ .\]

We now consider the roulette game in Monte Carlo, and follow the treatment of Sagan.^{1} In the roulette game in Monte Carlo there is only one 0. If you bet 1 franc on red and a 0 turns up, then, depending upon the casino, one or more of the following options may be offered:

(a) You get 1/2 of your bet back, and the casino gets the other half of your bet.

(b) Your bet is put “in prison," which we will denote by \(P_1\). If red comes up on the next turn, you get your bet back (but you don’t win any money). If black or 0 comes up, you lose your bet.

(c) Your bet is put in prison \(P_1\), as before. If red comes up on the next turn, you get your bet back, and if black comes up on the next turn, then you lose your bet. If a 0 comes up on the next turn, then your bet is put into double prison, which we will denote by \(P_2\). If your bet is in double prison, and if red comes up on the next turn, then your bet is moved back to prison \(P_1\) and the game proceeds as before. If your bet is in double prison, and if black or 0 come up on the next turn, then you lose your bet. We refer the reader to Figure \(\PageIndex{2}\), where a tree for this option is shown. In this figure, \(S\) is the starting position, \(W\) means that you win your bet, \(L\) means that you lose your bet, and \(E\) means that you break even.

It is interesting to compare the expected winnings of a 1 franc bet on red, under each of these three options. We leave the first two calculations as an exercise (see Exercise \(\PageIndex{37}\)). Suppose that you choose to play alternative (c). The calculation for this case illustrates the way that the early French probabilists worked problems like this.

Suppose you bet on red, you choose alternative (c), and a 0 comes up. Your possible future outcomes are shown in the tree diagram in Figure \(\PageIndex{3}\). Assume that your money is in the first prison and let \(x\) be the probability that you lose your franc. From the tree diagram we see that

\[x = \frac {18}{37} + \frac 1{37}P({\rm you\ lose\ your\ franc\ }|\ {\rm your\ franc\ is \ in\ }P_2)\].

Also,

\[P({\rm you\ lose\ your\ franc\ }|\ {\rm your\ franc\ is \ in\ }P_2) = \frac {19}{37} + \frac{18}{37}x\].

So, we have

\[x = \frac{18}{37} + \frac 1{37}\Bigl(\frac {19}{37} + \frac{18}{37}x\Bigr)\].

Solving for \(x\), we obtain \(x = 685/1351\). Thus, starting at \(S\), the probability that you lose your bet equals \[\frac {18}{37} + \frac 1{37}x = \frac{25003}{49987}\ .\]

To find the probability that you win when you bet on red, note that you can only win if red comes up on the first turn, and this happens with probability 18/37. Thus your expected winnings are \[1 \cdot {\frac{18}{37}} -1 \cdot {\frac {25003}{49987}} = -\frac{687}{49987} \approx -.0137\ .\]

It is interesting to note that the more romantic option (c) is less favorable than option (a) (see Exercise \(\PageIndex{37}\)).

If you bet 1 dollar on the number 17, then the distribution function for your winnings \(X\) is \[P_X = \pmatrix{ -1 & 35 \cr 36/37 & 1/37 \cr}\ ,\] and the expected winnings are \[-1 \cdot {\frac{36}{37}} + 35 \cdot {\frac 1{37}} = -\frac 1{37} \approx -.027\ .\] Thus, at Monte Carlo different bets have different expected values. In Las Vegas almost all bets have the same expected value of \(-2/38 = -.0526\) (see Exercises \(\PageIndex{4}\) and \(\PageIndex{5}\)).

## Conditional Expectation

If \(F\) is any event and \(X\) is a random variable with sample space \(\Omega = \{x_1, x_2, \ldots\}\), then the *conditional expectation *is defined by \[E(X|F) = \sum_j x_j P(X = x_j|F)\ .\] Conditional expectation is used most often in the form provided by the following theorem.

Let \(X\) be a random variable with sample space \(\Omega\). If \(F_1\), \(F_2\), …, \(F_r\) are events such that \(F_i \cap F_j = \emptyset\) for \(i \ne j\) and \(\Omega = \cup_j F_j\), then \[E(X) = \sum_j E(X|F_j) P(F_j)\ .\]

**Proof**-
We have \[\begin{aligned} \sum_j E(X|F_j) P(F_j) & = & \sum_j \sum_k x_k P(X = x_k|F_j) P(F_j) \\ & = & \sum_j \sum_k x_k P(X = x_k\,\, {\rm and}\,\, F_j\,\,{\rm occurs}) \\ & = & \sum_k \sum_j x_k P(X = x_k\,\,{\rm and}\,\,F_j\,\,{\rm occurs}) \\ & = & \sum_k x_k P(X = x_k) \\ & = & E(X)\ .\end{aligned}\]

Let \(T\) be the number of rolls in a single play of craps. We can think of a single play as a two-stage process. The first stage consists of a single roll of a pair of dice. The play is over if this roll is a 2, 3, 7, 11, or 12. Otherwise, the player’s point is established, and the second stage begins. This second stage consists of a sequence of rolls which ends when either the player’s point or a 7 is rolled. We record the outcomes of this two-stage experiment using the random variables \(X\) and \(S\), where \(X\) denotes the first roll, and \(S\) denotes the number of rolls in the second stage of the experiment (of course, \(S\) is sometimes equal to 0). Note that \(T = S+1\). Then by Theorem \(\PageIndex{5}\)

\[E(T) = \sum_{j = 2}^{12} E(T|X = j) P(X = j)\ .\]

If \(j = 7\), 11 or 2, 3, 12, then \(E(T|X = j) = 1\). If \(j = 4, 5, 6, 8, 9,\) or \(10\), we can use Example \(\PageIndex{4}\) to calculate the expected value of \(S\). In each of these cases, we continue rolling until we get either a \(j\) or a 7. Thus, \(S\) is geometrically distributed with parameter \(p\), which depends upon \(j\). If \(j = 4\), for example, the value of \(p\) is \(3/36 + 6/36 = 1/4\). Thus, in this case, the expected number of additional rolls is \(1/p = 4\), so \(E(T|X = 4) = 1 + 4 = 5\). Carrying out the corresponding calculations for the other possible values of \(j\) and using Theorem \(\PageIndex{5}\) gives

\[\begin{aligned} E(T) & = & 1\Bigl(\frac {12}{36}\Bigr) + \Bigl(1 + \frac {36}{3 + 6}\Bigr)\Bigl(\frac 3{36}\Bigr) + \Bigl(1 + \frac {36}{4 + 6}\Bigr)\Bigl(\frac 4{36}\Bigr) \\ & & + \Bigl(1 + \frac {36}{5 + 6}\Bigr)\Bigl(\frac 5{36}\Bigr) + \Bigl(1 + \frac {36}{5 + 6}\Bigr)\Bigl(\frac 5{36}\Bigr) \\ & & + \Bigl(1 + \frac {36}{4 + 6}\Bigr)\Bigl(\frac 4{36}\Bigr) + \Bigl(1 + \frac {36}{3 + 6}\Bigr)\Bigl(\frac 3{36}\Bigr) \\ & = & \frac {557}{165} \\ & \approx & 3.375\dots\ .\end{aligned}\]

## Martingales

We can extend the notion of fairness to a player playing a sequence of games by using the concept of conditional expectation.

Let \(S_1\), \(S_2\), …, \(S_n\) be Peter’s accumulated fortune in playing heads or tails (see Example 1.1.4). Then \[E(S_n | S_{n - 1} = a,\dots,S_1 = r) = \frac 12 (a + 1) + \frac 12 (a - 1) = a\ .\]

We note that Peter’s expected fortune after the next play is equal to his present fortune. When this occurs, we say the game is A fair game is also called a *martingales. *If the coin is biased and comes up heads with probability \(p\) and tails with probability \(q = 1 - p\), then \[E(S_n | S_{n - 1} = a,\dots,S_1 = r) = p (a + 1) + q (a - 1) = a + p - q\ .\] Thus, if \(p < q\), this game is unfavorable, and if \(p > q\), it is favorable.

If you are in a casino, you will see players adopting elaborate of play to try to make unfavorable games favorable. Two such systems, the martingale doubling system and the more conservative Labouchere system, were described in Exercises 1.1.9 and 1.1.10. Unfortunately, such systems cannot change even a fair game into a favorable game.

Even so, it is a favorite pastime of many people to develop systems of play for gambling games and for other games such as the stock market. We close this section with a simple illustration of such a system.

## Stock Prices

Let us assume that a stock increases or decreases in value each day by 1 dollar, each with probability 1/2. Then we can identify this simplified model with our familiar game of heads or tails. We assume that a buyer, Mr. Ace, adopts the following strategy. He buys the stock on the first day at its price \(V\). He then waits until the price of the stock increases by one to \(V + 1\) and sells. He then continues to watch the stock until its price falls back to \(V\). He buys again and waits until it goes up to \(V + 1\) and sells. Thus he holds the stock in intervals during which it increases by 1 dollar. In each such interval, he makes a profit of 1 dollar. However, we assume that he can do this only for a finite number of trading days. Thus he can lose if, in the last interval that he holds the stock, it does not get back up to \(V + 1\); and this is the only way he can lose. In Figure \(\PageIndex{4}\) we illustrate a typical history if Mr. Ace must stop in twenty days. Mr. Ace holds the stock under his system during the days indicated by broken lines. We note that for the history shown in Figure \(\PageIndex{4}\), his system nets him a gain of 4 dollars.

We have written a program **StockSystem** to simulate the fortune of Mr. Ace if he uses his sytem over an \(n\)-day period. If one runs this program a large number of times, for \(n = 20\), say, one finds that his expected winnings are very close to 0, but the probability that he is ahead after 20 days is significantly greater than 1/2. For small values of \(n\), the exact distribution of winnings can be calculated. The distribution for the case \(n = 20\) is shown in Figure \(\PageIndex{4}\). Using this distribution, it is easy to calculate that the expected value of his winnings is exactly 0. This is another instance of the fact that a fair game (a martingale) remains fair under quite general systems of play.

Although the expected value of his winnings is 0, the probability that Mr. Ace is ahead after 20 days is about .610. Thus, he would be able to tell his friends that his system gives him a better chance of being ahead than that of someone who simply buys the stock and holds it, if our simple random model is correct. There have been a number of studies to determine how random the stock market is.

## Historical Remarks

With the Law of Large Numbers to bolster the frequency interpretation of probability, we find it natural to justify the definition of expected value in terms of the average outcome over a large number of repetitions of the experiment. The concept of expected value was used before it was formally defined; and when it was used, it was considered not as an average value but rather as the appropriate value for a gamble. For example recall, from the Historical Remarks section of Chapter 1, Section 1.2, Pascal’s way of finding the value of a three-game series that had to be called off before it is finished.

Pascal first observed that if each player has only one game to win, then the stake of 64 pistoles should be divided evenly. Then he considered the case where one player has won two games and the other one.

Then consider, Sir, if the first man wins, he gets 64 pistoles, if he loses he gets 32. Thus if they do not wish to risk this last game, but wish to separate without playing it, the first man must say: “I am certain to get 32 pistoles, even if I lose I still get them; but as for the other 32 pistoles, perhaps I will get them, perhaps you will get them, the chances are equal. Let us then divide these 32 pistoles in half and give one half to me as well as my 32 which are mine for sure." He will then have 48 pistoles and the other 16.

^{2}

Note that Pascal reduced the problem to a symmetric bet in which each player gets the same amount and takes it as obvious that in this case the stakes should be divided equally.

The first systematic study of expected value appears in Huygens’ book. Like Pascal, Huygens find the value of a gamble by assuming that the answer is obvious for certain symmetric situations and uses this to deduce the expected for the general situation. He does this in steps. His first proposition is

Prop. I. If I expect \(a\) or \(b\), either of which, with equal probability, may fall to me, then my Expectation is worth \((a + b)/2\), that is, the half Sum of \(a\) and \(b\).

^{3}

Huygens proved this as follows: Assume that two player A and B play a game in which each player puts up a stake of \((a + b)/2\) with an equal chance of winning the total stake. Then the value of the game to each player is \((a + b)/2\). For example, if the game had to be called off clearly each player should just get back his original stake. Now, by symmetry, this value is not changed if we add the condition that the winner of the game has to pay the loser an amount \(b\) as a consolation prize. Then for player A the value is still \((a + b)/2\). But what are his possible outcomes for the modified game? If he wins he gets the total stake \(a + b\) and must pay B an amount \(b\) so ends up with \(a\). If he loses he gets an amount \(b\) from player B. Thus player A wins \(a\) or \(b\) with equal chances and the value to him is \((a + b)/2\).

Huygens illustrated this proof in terms of an example. If you are offered a game in which you have an equal chance of winning 2 or 8, the expected value is 5, since this game is equivalent to the game in which each player stakes 5 and agrees to pay the loser 3 — a game in which the value is obviously 5.

Huygens’ second proposition is

Prop. II. If I expect \(a\), \(b\), or \(c\), either of which, with equal facility, may happen, then the Value of my Expectation is \((a + b + c)/3\), or the third of the Sum of \(a\), \(b\), and \(c\).

^{4}

His argument here is similar. Three players, A, B, and C, each stake \[(a+b+c)/3\] in a game they have an equal chance of winning. The value of this game to player A is clearly the amount he has staked. Further, this value is not changed if A enters into an agreement with B that if one of them wins he pays the other a consolation prize of \(b\) and with C that if one of them wins he pays the other a consolation prize of \(c\). By symmetry these agreements do not change the value of the game. In this modified game, if A wins he wins the total stake \(a + b + c\) minus the consolation prizes \(b + c\) giving him a final winning of \(a\). If B wins, A wins \(b\) and if C wins, A wins \(c\). Thus A finds himself in a game with value \((a + b + c)/3\) and with outcomes \(a\), \(b\), and \(c\) occurring with equal chance. This proves Proposition II.

More generally, this reasoning shows that if there are \(n\) outcomes \[a_1,\ a_2,\ \ldots,\ a_n\ ,\] all occurring with the same probability, the expected value is \[\frac {a_1 + a_2 +\cdots+ a_n}n\ .\]

In his third proposition Huygens considered the case where you win \(a\) or \(b\) but with unequal probabilities. He assumed there are \(p\) chances of winning \(a\), and \(q\) chances of winning \(b\), all having the same probability. He then showed that the expected value is \[E = \frac p{p + q} \cdot a + \frac q{p + q} \cdot b\ .\] This follows by considering an equivalent gamble with \(p + q\) outcomes all occurring with the same probability and with a payoff of \(a\) in \(p\) of the outcomes and \(b\) in \(q\) of the outcomes. This allowed Huygens to compute the expected value for experiments with unequal probabilities, at least when these probablities are rational numbers.

Thus, instead of defining the expected value as a weighted average, Huygens assumed that the expected value of certain symmetric gambles are known and deduced the other values from these. Although this requires a good deal of clever manipulation, Huygens ended up with values that agree with those given by our modern definition of expected value. One advantage of this method is that it gives a justification for the expected value in cases where it is not reasonable to assume that you can repeat the experiment a large number of times, as for example, in betting that at least two presidents died on the same day of the year. (In fact, three did; all were signers of the Declaration of Independence, and all three died on July 4.)

In his book, Huygens calculated the expected value of games using techniques similar to those which we used in computing the expected value for roulette at Monte Carlo. For example, his proposition XIV is:

Prop. XIV. If I were playing with another by turns, with two Dice, on this Condition, that if I throw 7 I gain, and if he throws 6 he gains allowing him the first Throw: To find the proportion of my Hazard to his.

^{5}

A modern description of this game is as follows. Huygens and his opponent take turns rolling a die. The game is over if Huygens rolls a 7 or his opponent rolls a 6. His opponent rolls first. What is the probability that Huygens wins the game?

To solve this problem Huygens let \(x\) be his chance of winning when his opponent threw first and \(y\) his chance of winning when he threw first. Then on the first roll his opponent wins on 5 out of the 36 possibilities. Thus, \[x = \frac {31}{36} \cdot y\ .\] But when Huygens rolls he wins on 6 out of the 36 possible outcomes, and in the other 30, he is led back to where his chances are \(x\). Thus \[y = \frac 6{36} + \frac {30}{36} \cdot x\ .\] From these two equations Huygens found that \(x = 31/61\).

Another early use of expected value appeared in Pascal’s argument to show that a rational person should believe in the existence of God.^{6} Pascal said that we have to make a wager whether to believe or not to believe. Let \(p\) denote the probability that God does not exist. His discussion suggests that we are playing a game with two strategies, believe and not believe, with payoffs as shown in Table [table 6.4].

\[\nonumber \begin{array}{ccc} & \text{God does not exist} & God exists \\ & \\ & \p & 1 - p \end{array}\]

\[\nonumber \begin{array}{l|c|c|}believe & -u & v \\ not believe & 0 & -x \end{array}\]

Here \(-u\) represents the cost to you of passing up some worldly pleasures as a consequence of believing that God exists. If you do not believe, and God is a vengeful God, you will lose \(x\). If God exists and you do believe you will gain v. Now to determine which strategy is best you should compare the two expected values \[p(-u) + (1 - p)v \qquad {\rm and} \qquad p0 + (1 - p)(-x),\] and choose the larger of the two. In general, the choice will depend upon the value of \(p\). But Pascal assumed that the value of \(v\) is infinite and so the strategy of believing is best no matter what probability you assign for the existence of God. This example is considered by some to be the beginning of decision theory. Decision analyses of this kind appear today in many fields, and, in particular, are an important part of medical diagnostics and corporate business decisions.

Another early use of expected value was to decide the price of annuities. The study of statistics has its origins in the use of the bills of mortality kept in the parishes in London from 1603. These records kept a weekly tally of christenings and burials. From these John Graunt made estimates for the population of London and also provided the first mortality data,^{7} shown in Table [table 6.5].

\[\nonumber \begin{array}{cc} & \\ \hline Age & Survivors \\ \hline 0 & 100 \\ 6 & 64 \\ 16 & 40 \\ 26 & 25 \\ 36 & 16 \\ 46 & 10 \\ 56 & 6 \\ 66 & 3 \\ 76 & 1 \\ \hline \end{array}\]

As Hacking observes, Graunt apparently constructed this table by assuming that after the age of 6 there is a constant probability of about 5/8 of surviving for another decade.^{8} For example, of the 64 people who survive to age 6, 5/8 of 64 or 40 survive to 16, 5/8 of these 40 or 25 survive to 26, and so forth. Of course, he rounded off his figures to the nearest whole person.

Clearly, a constant mortality rate cannot be correct throughout the whole range, and later tables provided by Halley were more realistic in this respect.^{9}

A *terminal annuity *provides a fixed amount of money during a period of \(n\) years. To determine the price of a terminal annuity one needs only to know the appropriate interest rate. A *life annuity *provides a fixed amount during each year of the buyer’s life. The appropriate price for a life annuity is the expected value of the terminal annuity evaluated for the random lifetime of the buyer. Thus, the work of Huygens in introducing expected value and the work of Graunt and Halley in determining mortality tables led to a more rational method for pricing annuities. This was one of the first serious uses of probability theory outside the gambling houses.

Although expected value plays a role now in every branch of science, it retains its importance in the casino. In 1962, Edward Thorp’s book *Beat the **Dealer*^{10} provided the reader with a strategy for playing the popular casino game of blackjack that would assure the player a positive expected winning. This book forevermore changed the belief of the casinos that they could not be beat.

## Exercises

### Exercise \(\PageIndex{1}\)

A card is drawn at random from a deck consisting of cards numbered 2 through 10. A player wins 1 dollar if the number on the card is odd and loses 1 dollar if the number if even. What is the expected value of his winnings?

### Exercise \(\PageIndex{2}\)

A card is drawn at random from a deck of playing cards. If it is red, the player wins 1 dollar; if it is black, the player loses 2 dollars. Find the expected value of the game.

### Exercise \(\PageIndex{3}\)

In a class there are 20 students: 3 are 5’ 6", 5 are 5’8", 4 are 5’10", 4 are 6’, and 4 are 6’ 2". A student is chosen at random. What is the student’s expected height?

### Exercise \(\PageIndex{4}\)

In Las Vegas the roulette wheel has a 0 and a 00 and then the numbers 1 to 36 marked on equal slots; the wheel is spun and a ball stops randomly in one slot. When a player bets 1 dollar on a number, he receives 36 dollars if the ball stops on this number, for a net gain of 35 dollars; otherwise, he loses his dollar bet. Find the expected value for his winnings.

### Exercise \(\PageIndex{5}\)

In a second version of roulette in Las Vegas, a player bets on red or black. Half of the numbers from 1 to 36 are red, and half are black. If a player bets a dollar on black, and if the ball stops on a black number, he gets his dollar back and another dollar. If the ball stops on a red number or on 0 or 00 he loses his dollar. Find the expected winnings for this bet.

### Exercise \(\PageIndex{6}\)

A die is rolled twice. Let \(X\) denote the sum of the two numbers that turn up, and \(Y\) the difference of the numbers (specifically, the number on the first roll minus the number on the second). Show that \(E(XY) = E(X)E(Y)\). Are \(X\) and \(Y\) independent?

### Exercise \(\PageIndex{7}\)

Show that, if \(X\) and \(Y\) are random variables taking on only two values each, and if \(E(XY) = E(X)E(Y)\), then \(X\) and \(Y\) are independent.

### Exercise \(\PageIndex{8}\)

A royal family has children until it has a boy or until it has three children, whichever comes first. Assume that each child is a boy with probability 1/2. Find the expected number of boys in this royal family and the expected number of girls.

### Exercise \(\PageIndex{9}\)

If the first roll in a game of craps is neither a natural nor craps, the player can make an additional bet, equal to his original one, that he will make his point before a seven turns up. If his point is four or ten he is paid off at \(2 : 1\) odds; if it is a five or nine he is paid off at odds \(3 : 2\); and if it is a six or eight he is paid off at odds \(6 : 5\). Find the player’s expected winnings if he makes this additional bet when he has the opportunity.

### Exercise \(\PageIndex{10}\)

In Example \(\PageIndex{16}\) assume that Mr. Ace decides to buy the stock and hold it until it goes up 1 dollar and then sell and not buy again. Modify the program **StockSystem** to find the distribution of his profit under this system after a twenty-day period. Find the expected profit and the probability that he comes out ahead.

### Exercise \(\PageIndex{11}\)

On September 26, 1980, the *New York Times *reported that a mysterious stranger strode into a Las Vegas casino, placed a single bet of 777,000 dollars on the “don’t pass" line at the crap table, and walked away with more than 1.5 million dollars. In the “don’t pass" bet, the bettor is essentially betting with the house. An exception occurs if the roller rolls a 12 on the first roll. In this case, the roller loses and the “don’t pass" better just gets back the money bet instead of winning. Show that the “don’t pass" bettor has a more favorable bet than the roller.

### Exercise \(\PageIndex{12}\)

Recall that in the *martingales doubling system *(see Exercise 1.1.10 ), the player doubles his bet each time he loses. Suppose that you are playing roulette in a where there are no 0’s, and you bet on red each time. You then win with probability 1/2 each time. Assume that you enter the casino with 100 dollars, start with a 1-dollar bet and employ the martingale system. You stop as soon as you have won one bet, or in the unlikely event that black turns up six times in a row so that you are down 63 dollars and cannot make the required 64-dollar bet. Find your expected winnings under this system of play.

### Exercise \(\PageIndex{13}\)

You have 80 dollars and play the following game. An urn contains two white balls and two black balls. You draw the balls out one at a time without replacement until all the balls are gone. On each draw, you bet half of your present fortune that you will draw a white ball. What is your expected final fortune?

### Exercise \(\PageIndex{14}\)

In the hat check problem (see Example 3.2.8. ), it was assumed that \(N\) people check their hats and the hats are handed back at random. Let \(X_j = 1\) if the \(j\)th person gets his or her hat and 0 otherwise. Find \(E(X_j)\) and \(E(X_j \cdot X_k)\) for \(j\) not equal to \(k\). Are \(X_j\) and \(X_k\) independent?

### Exercise \(\PageIndex{15}\)

A box contains two gold balls and three silver balls. You are allowed to choose successively balls from the box at random. You win 1 dollar each time you draw a gold ball and lose 1 dollar each time you draw a silver ball. After a draw, the ball is not replaced. Show that, if you draw until you are ahead by 1 dollar or until there are no more gold balls, this is a favorable game.

### Exercise \(\PageIndex{16}\)

Gerolamo Cardano in his book, *The Gambling Scholar *written in the early 1500s, considers the following carnival game. There are six dice. Each of the dice has five blank sides. The sixth side has a number between 1 and 6—a different number on each die. The six dice are rolled and the player wins a prize depending on the total of the numbers which turn up.

- Find, as Cardano did, the expected total without finding its distribution.
- Large prizes were given for large totals with a modest fee to play the game. Explain why this could be done.

### Exercise \(\PageIndex{17}\)

Let \(X\) be the first time that a occurs in an infinite sequence of Bernoulli trials with probability \(p\) for success. Let \(p_k = P(X = k)\) for \(k = 1\), 2, …. Show that \(p_k = p^{k - 1}q\) where \(q = 1 - p\). Show that \(\sum_k p_k = 1\). Show that \(E(X) = 1/q\). What is the expected number of tosses of a coin required to obtain the first tail?

### Exercise \(\PageIndex{18}\)

Exactly one of six similar keys opens a certain door. If you try the keys, one after another, what is the expected number of keys that you will have to try before success?

### Exercise \(\PageIndex{19}\)

A multiple choice exam is given. A problem has four possible answers, and exactly one answer is correct. The student is allowed to choose a subset of the four possible answers as his answer. If his chosen subset contains the correct answer, the student receives three points, but he loses one point for each wrong answer in his chosen subset. Show that if he just guesses a subset uniformly and randomly his expected score is zero.

### Exercise \(\PageIndex{20}\)

You are offered the following game to play: a fair coin is tossed until heads turns up for the first time (see Example 6.1.3). If this occurs on the first toss you receive 2 dollars, if it occurs on the second toss you receive \(2^2 = 4\) dollars and, in general, if heads turns up for the first time on the \(n\)th toss you receive \(2^n\) dollars.

- Show that the expected value of your winnings does not exist (i.e., is given by a divergent sum) for this game. Does this mean that this game is favorable no matter how much you pay to play it?
- Assume that you only receive \(2^{10}\) dollars if any number greater than or equal to ten tosses are required to obtain the first head. Show that your expected value for this modified game is finite and find its value.
- Assume that you pay 10 dollars for each play of the original game. Write a program to simulate 100 plays of the game and see how you do.
- Now assume that the utility of \(n\) dollars is \(\sqrt n\). Write an expression for the expected utility of the payment, and show that this expression has a finite value. Estimate this value. Repeat this exercise for the case that the utility function is \(\log(n)\).

### Exercise \(\PageIndex{21}\)

Let \(X\) be a random variable which is Poisson distributed with parameter \(\lambda\). Show that \(E(X) = \lambda\).* Hint* : Recall that \[e^x = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \cdots\,.\]

### Exercise \(\PageIndex{22}\)

Recall that in Exercise =1.1.4, we considered a town with two hospitals. In the large hospital about 45 babies are born each day, and in the smaller hospital about 15 babies are born each day. We were interested in guessing which hospital would have on the average the largest number of days with the property that more than 60 percent of the children born on that day are boys. For each hospital find the expected number of days in a year that have the property that more than 60 percent of the children born on that day were boys.

### Exercise \(\PageIndex{23}\)

An insurance company has 1,000 policies on men of age 50. The company estimates that the probability that a man of age 50 dies within a year is .01. Estimate the number of claims that the company can expect from beneficiaries of these men within a year.

### Exercise \(\PageIndex{24}\)

Using the life table for 1981 in Appendix C, write a program to compute the expected lifetime for males and females of each possible age from 1 to 85. Compare the results for males and females. Comment on whether life insurance should be priced differently for males and females.

### Exercise *\(\PageIndex{25}\)

A deck of ESP cards consists of 20 cards each of two types: say ten stars, ten circles (normally there are five types). The deck is shuffled and the cards turned up one at a time. You, the alleged percipient, are to name the symbol on each card *before* it is turned up.

Suppose that you are really just guessing at the cards. If you do not get to see each card after you have made your guess, then it is easy to calculate the expected number of correct guesses, namely ten.

If, on the other hand, you are guessing with information, that is, if you see each card after your guess, then, of course, you might expect to get a higher score. This is indeed the case, but calculating the correct expectation is no longer easy.

But it is easy to do a computer simulation of this guessing with information, so we can get a good idea of the expectation by simulation. (This is similar to the way that skilled blackjack players make blackjack into a favorable game by observing the cards that have already been played. See Exercise \(\PageIndex{29}\).)

- First, do a simulation of guessing without information, repeating the experiment at least 1000 times. Estimate the expected number of correct answers and compare your result with the theoretical expectation.
- What is the best strategy for guessing with information?
- Do a simulation of guessing with information, using the strategy in (b). Repeat the experiment at least 1000 times, and estimate the expectation in this case.

### Exercise \(\PageIndex{26}\)

Consider the ESP problem as described in Exercise \(\PageIndex{25}\). You are again guessing with information, and you are using the optimal guessing strategy of guessing *star *if the remaining deck has more stars, *circle* if more circles, and tossing a coin if the number of stars and circles are equal. Assume that \(S \geq C\), where \(S\) is the number of stars and \(C\) the number of circles.

We can plot the results of a typical game on a graph, where the horizontal axis represents the number of steps and the vertical axis represents the *difference *between the number of stars and the number of circles that have been turned up. A typical game is shown in Figure \(\PageIndex{6}\. In this particular game, the order in which the cards were turned up is \((C,S,S,S,S,C,C,S,S,C)\). Thus, in this particular game, there were six stars and four circles in the deck. This means, in particular, that every game played with this deck would have a graph which ends at the point \((10, 2)\). We define the line \(L\) to be the horizontal line which goes through the ending point on the graph (so its vertical coordinate is just the difference between the number of stars and circles in the deck).

- Show that, when the random walk is below the line \(L\), the player guesses right when the graph goes up (star is turned up) and, when the walk is above the line, the player guesses right when the walk goes down (circle turned up). Show from this property that the subject is sure to have at least \(S\) correct guesses.
- When the walk is at a point \((x,x)\) the line \(L\) the number of stars and circles remaining is the same, and so the subject tosses a coin. Show that the probability that the walk reaches \((x,x)\) is \[ \frac{\binom{S}{x} \binom{C}{x} }{ \binom{S + C}{2x} } \]
*Hint*: The outcomes of \(2x\) cards is a hypergeometric distribution (see Section [sec 5.1]). - Using the results of (a) and (b) show that the expected number of correct guesses under intelligent guessing is \[S + \sum_{x = 1}^C \frac{1}{2} \frac{ \binom{S}{x} \binom{C}{x} }{ \binom{S + C}{2x} } \]

### Exercise \(\PageIndex{27}\)

It has been said^{12} that a Dr. B. Muriel Bristol declined a cup of tea stating that she preferred a cup into which milk had been poured first. The famous statistician R. A. Fisher carried out a test to see if she could tell whether milk was put in before or after the tea. Assume that for the test Dr. Bristol was given eight cups of tea—four in which the milk was put in before the tea and four in which the milk was put in after the tea.

- What is the expected number of correct guesses the lady would make if she had no information after each test and was just guessing?
- Using the result of Exercise [exer 6.1.26] find the expected number of correct guesses if she was told the result of each guess and used an optimal guessing strategy.

### Exercise \(\PageIndex{28}\)

In a popular computer game the computer picks an integer from 1 to \(n\) at random. The player is given \(k\) chances to guess the number. After each guess the computer responds “correct," “too small," or “too big."

- Show that if \(n \leq 2^k - 1\), then there is a strategy that guarantees you will correctly guess the number in \(k\) tries.
- Show that if \(n \geq 2^k - 1\), there is a strategy that assures you of identifying one of \(2^k - 1\) numbers and hence gives a probability of \((2^k - 1)/n\) of winning. Why is this an optimal strategy? Illustrate your result in terms of the case \(n = 9\) and \(k = 3\).

### Exercise \(\PageIndex{29}\)

In the casino game of blackjack the dealer is dealt two cards, one face up and one face down, and each player is dealt two cards, both face down. If the dealer is showing an ace the player can look at his down cards and then make a bet called an bet. (Expert players will recognize why it is called insurance.) If you make this bet you will win the bet if the dealer’s second card is a : namely, a ten, jack, queen, or king. If you win, you are paid twice your insurance bet; otherwise you lose this bet. Show that, if the only cards you can see are the dealer’s ace and your two cards and if your cards are not ten cards, then the insurance bet is an unfavorable bet. Show, however, that if you are playing two hands simultaneously, and you have no ten cards, then it is a favorable bet. (Thorp^{13} has shown that the game of blackjack is favorable to the player if he or she can keep good enough track of the cards that have been played.)

### Exercise \(\PageIndex{30}\)

Assume that, every time you buy a box of Wheaties, you receive a picture of one of the \(n\) players for the New York Yankees (see Exercise [sec 3.2].[exer 3.2.34]). Let \(X_k\) be the number of additional boxes you have to buy, after you have obtained \(k - 1\) different pictures, in order to obtain the next new picture. Thus \(X_1 = 1\), \(X_2\) is the number of boxes bought after this to obtain a picture different from the first pictured obtained, and so forth.

- Show that \(X_k\) has a geometric distribution with \(p = (n - k + 1)/n\).
- Simulate the experiment for a team with 26 players (25 would be more accurate but we want an even number). Carry out a number of simulations and estimate the expected time required to get the first 13 players and the expected time to get the second 13. How do these expectations compare?
- Show that, if there are \(2n\) players, the expected time to get the first half of the players is \[2n \left( \frac 1{2n} + \frac 1{2n - 1} +\cdots+ \frac 1{n + 1} \right)\ ,\] and the expected time to get the second half is \[2n \left( \frac 1n + \frac 1{n - 1} +\cdots+ 1 \right)\ .\]
- In Example [exam 6.5] we stated that \[1 + \frac 12 + \frac 13 +\cdots+ \frac 1n \sim \log n + .5772 + \frac 1{2n}\ .\] Use this to estimate the expression in (c). Compare these estimates with the exact values and also with your estimates obtained by simulation for the case \(n = 26\).

### Exercise \(\PageIndex{31}\)

(Feller^{14}) A large number, \(N\), of people are subjected to a blood test. This can be administered in two ways: (1) Each person can be tested separately, in this case \(N\) test are required, (2) the blood samples of \(k\) persons can be pooled and analyzed together. If this test is this one test suffices for the \(k\) people. If the test is each of the \(k\) persons must be tested separately, and in all, \(k + 1\) tests are required for the \(k\) people. Assume that the probability \(p\) that a test is positive is the same for all people and that these events are independent.

- Find the probability that the test for a pooled sample of \(k\) people will be positive.
- What is the expected value of the number \(X\) of tests necessary under plan (2)? (Assume that \(N\) is divisible by \(k\).)
- For small \(p\), show that the value of \(k\) which will minimize the expected number of tests under the second plan is approximately \(1/\sqrt p\).

### Exercise \(\PageIndex{32}\)

Write a program to add random numbers chosen from \([0,1]\) until the first time the sum is greater than one. Have your program repeat this experiment a number of times to estimate the expected number of selections necessary in order that the sum of the chosen numbers first exceeds 1. On the basis of your experiments, what is your estimate for this number?

### Exercise \(\PageIndex{33}\)

The following related discrete problem also gives a good clue for the answer to Exercise [exer 6.1.32]. Randomly select with replacement \(t_1\), \(t_2\), …, \(t_r\) from the set \((1/n, 2/n, \dots, n/n)\). Let \(X\) be the smallest value of \(r\) satisfying \[t_1 + t_2 +\cdots+ t_r > 1\ .\] Then \(E(X) = (1 + 1/n)^n\). To prove this, we can just as well choose \(t_1\), \(t_2\), …, \(t_r\) randomly with replacement from the set \((1, 2, \dots, n)\) and let \(X\) be the smallest value of \(r\) for which \[t_1 + t_2 +\cdots+ t_r > n\ .\]

- Use Exercise [sec 3.2].[exer 3.2.35.5] to show that \[P(X \geq j + 1) = {n \choose j}{\Bigl(\frac {1}{n}\Bigr)^j}\ .\]
- Show that \[E(X) = \sum_{j = 0}^n P(X \geq j + 1)\ .\]

### Exercise \(\PageIndex{34}\)

(Banach’s Matchbox^{16}) A man carries in each of his two front pockets a box of matches originally containing \(N\) matches. Whenever he needs a match, he chooses a pocket at random and removes one from that box. One day he reaches into a pocket and finds the box empty.

- Let \(p_r\) denote the probability that the other pocket contains \(r\) matches. Define a sequence of random variables as follows: Let \(X_i = 1\) if the \(i\)th draw is from the left pocket, and 0 if it is from the right pocket. Interpret \(p_r\) in terms of \(S_n = X_1 + X_2 +\cdots+ X_n\). Find a binomial expression for \(p_r\).
- Write a computer program to compute the \(p_r\), as well as the probability that the other pocket contains at least \(r\) matches, for \(N = 100\) and \(r\) from 0 to 50.
- Show that \((N - r)p_r = (1/2)(2N + 1)p_{r + 1} - (1/2)(r + 1)p_{r + 1}\).
- Evaluate \(\sum_r p_r\).
- Use (c) and (d) to determine the expectation \(E\) of the distribution \(\{p_r\}\).
- Use Stirling’s formula to obtain an approximation for \(E\). How many matches must each box contain to ensure a value of about 13 for the expectation \(E\)? (Take \(\pi = 22/7\).)

### Exercise \(\PageIndex{35}\)

A coin is tossed until the first time a head turns up. If this occurs on the \(n\)th toss and \(n\) is odd you win \(2^n/n\), but if \(n\) is even then you lose \(2^n/n\). Then if your expected winnings exist they are given by the convergent series \[1 - \frac 12 + \frac 13 - \frac 14 +\cdots\] called the alternating It is tempting to say that this should be the expected value of the experiment. Show that if we were to do this, the expected value of an experiment would depend upon the order in which the outcomes are listed.

### Exercise \(\PageIndex{36}\)

Suppose we have an urn containing \(c\) yellow balls and \(d\) green balls. We draw \(k\) balls, without replacement, from the urn. Find the expected number of yellow balls drawn. : Write the number of yellow balls drawn as the sum of \(c\) random variables.

### Exercise \(\PageIndex{37}\)

The reader is referred to Example [exam 6.7] for an explanation of the various options available in Monte Carlo roulette.

- Compute the expected winnings of a 1 franc bet on red under option (a).
- Repeat part (a) for option (b).
- Compare the expected winnings for all three options.

### Exercise \(\PageIndex{38}\)

(from Pittel^{17}) Telephone books, \(n\) in number, are kept in a stack. The probability that the book numbered \(i\) (where \(1 \le i \le n\)) is consulted for a given phone call is \(p_i > 0\), where the \(p_i\)’s sum to 1. After a book is used, it is placed at the top of the stack. Assume that the calls are independent and evenly spaced, and that the system has been employed indefinitely far into the past. Let \(d_i\) be the average depth of book \(i\) in the stack. Show that \(d_i \le d_j\) whenever \(p_i \ge p_j\). Thus, on the average, the more popular books have a tendency to be closer to the top of the stack. : Let \(p_{ij}\) denote the probability that book \(i\) is above book \(j\). Show that \(p_{ij} = p_{ij}(1 - p_j) + p_{ji}p_i\).

### Exercise \(\PageIndex{39}\)

(from Propp^{18}) In the previous problem, let \(P\) be the probability that at the present time, each book is in its proper place, i.e., book \(i\) is \(i\)th from the top. Find a formula for \(P\) in terms of the \(p_i\)’s. In addition, find the least upper bound on \(P\), if the \(p_i\)’s are allowed to vary.* Hint* : First find the probability that book 1 is in the right place. Then find the probability that book 2 is in the right place, given that book 1 is in the right place. Continue.

### Exercise \(\PageIndex{40}\)

(from H. Shultz and B. Leonard^{19}) A sequence of random numbers in \([0, 1)\) is generated until the sequence is no longer monotone increasing. The numbers are chosen according to the uniform distribution. What is the expected length of the sequence? (In calculating the length, the term that destroys monotonicity is included.) : Let \(a_1,\ a_2,\ \ldots\) be the sequence and let \(X\) denote the length of the sequence. Then \[P(X > k) = P(a_1 < a_2 < \cdots < a_k)\ ,\] and the probability on the right-hand side is easy to calculate. Furthermore, one can show that \[E(X) = 1 + P(X > 1) + P(X > 2) + \cdots\ .\]

### Exercise \(\PageIndex{41}\)

Let \(T\) be the random variable that counts the number of 2-unshuffles performed on an \(n\)-card deck until all of the labels on the cards are distinct. This random variable was discussed in Section 3.3. Using Equation [eq 3.3.1] in that section, together with the formula \[E(T) = \sum_{s = 0}^\infty P(T > s)\] that was proved in Exercise \(\PageIndex{33}\), show that

\[E(T) = \sum_{s = 0}^\infty \left(1 - {\binom{2^s}{n}}\frac{n!}{2^{sn}}\right) .\]

Show that for \(n = 52\), this expression is approximately equal to 11.7. (As was stated in Chapter 3, this means that on the average, almost 12 riffle shuffles of a 52-card deck are required in order for the process to be considered random.)