# Expected value

In probability theory, the expected value of a random variable, intuitively, is the long-run average value of repetitions of the experiment it represents. For example, the expected value in rolling a six-sided die is 3.5, because the average of all the numbers that come up in an extremely large number of rolls is close to 3.5. Less roughly, the law of large numbers states that the arithmetic mean of the values almost surely converges to the expected value as the number of repetitions approaches infinity. The expected value is also known as the expectation, mathematical expectation, EV, average, mean value, mean, or first moment.

More practically, the expected value of a discrete random variable is the probability-weighted average of all possible values. In other words, each possible value the random variable can assume is multiplied by its probability of occurring, and the resulting products are summed to produce the expected value. The same principle applies to a continuous random variable, except that an integral of the variable with respect to its probability density replaces the sum. The formal definition subsumes both of these and also works for distributions which are neither discrete nor continuous; the expected value of a random variable is the integral of the random variable with respect to its probability measure.[1][2]

The expected value does not exist for random variables having some distributions with large "tails", such as the Cauchy distribution.[3] For random variables such as these, the long-tails of the distribution prevent the sum/integral from converging.

The expected value is a key aspect of how one characterizes a probability distribution; it is one type of location parameter. By contrast, the variance is a measure of dispersion of the possible values of the random variable around the expected value. The variance itself is defined in terms of two expectations: it is the expected value of the squared deviation of the variable's value from the variable's expected value.

The expected value plays important roles in a variety of contexts. In regression analysis, one desires a formula in terms of observed data that will give a "good" estimate of the parameter giving the effect of some explanatory variable upon a dependent variable. The formula will give different estimates using different samples of data, so the estimate it gives is itself a random variable. A formula is typically considered good in this context if it is an unbiased estimator—that is, if the expected value of the estimate (the average value it would give over an arbitrarily large number of separate samples) can be shown to equal the true value of the desired parameter.

In decision theory, and in particular in choice under uncertainty, an agent is described as making an optimal choice in the context of incomplete information. For risk neutral agents, the choice involves using the expected values of uncertain quantities, while for risk averse agents it involves maximizing the expected value of some objective function such as a von Neumann–Morgenstern utility function. One example of using expected value in reaching optimal decisions is the Gordon–Loeb model of information security investment. According to the model, one can conclude that the amount a firm spends to protect information should generally be only a small fraction of the expected loss (i.e., the expected value of the loss resulting from a cyber/information security breach).[4]

## Definition

### Univariate discrete random variable, finite case

Suppose random variable X can take value x1 with probability p1, value x2 with probability p2, and so on, up to value xk with probability pk. Then the expectation of this random variable X is defined as

${\displaystyle \operatorname {E} [X]=x_{1}p_{1}+x_{2}p_{2}+\cdots +x_{k}p_{k}\;.}$

Since all probabilities pi add up to one (p1 + p2 + ... + pk = 1), the expected value can be viewed as the weighted average, with pi’s being the weights:

${\displaystyle \operatorname {E} [X]={\frac {x_{1}p_{1}+x_{2}p_{2}+\dotsb +x_{k}p_{k}}{1}}={\frac {x_{1}p_{1}+x_{2}p_{2}+\dotsb +x_{k}p_{k}}{p_{1}+p_{2}+\dotsb +p_{k}}}\;.}$

If all outcomes xi are equally likely (that is, p1 = p2 = ... = pk), then the weighted average turns into the simple average. This is intuitive: the expected value of a random variable is the average of all values it can take; thus the expected value is what one expects to happen on average. If the outcomes xi are not equally probable, then the simple average must be replaced with the weighted average, which takes into account the fact that some outcomes are more likely than the others. The intuition however remains the same: the expected value of X is what one expects to happen on average.

An illustration of the convergence of sequence averages of rolls of a die to the expected value of 3.5 as the number of rolls (trials) grows.

Example 1. Let X represent the outcome of a roll of a fair six-sided die. More specifically, X will be the number of pips showing on the top face of the die after the toss. The possible values for X are 1, 2, 3, 4, 5, and 6, all equally likely (each having the probability of 1/6). The expectation of X is

${\displaystyle \operatorname {E} [X]=1\cdot {\frac {1}{6}}+2\cdot {\frac {1}{6}}+3\cdot {\frac {1}{6}}+4\cdot {\frac {1}{6}}+5\cdot {\frac {1}{6}}+6\cdot {\frac {1}{6}}=3.5.}$

If one rolls the die n times and computes the average (arithmetic mean) of the results, then as n grows, the average will almost surely converge to the expected value, a fact known as the strong law of large numbers. One example sequence of ten rolls of the die is 2, 3, 1, 2, 5, 6, 2, 2, 2, 6, which has the average of 3.1, with the distance of 0.4 from the expected value of 3.5. The convergence is relatively slow: the probability that the average falls within the range 3.5 ± 0.1 is 21.6% for ten rolls, 46.1% for a hundred rolls and 93.7% for a thousand rolls. See the figure for an illustration of the averages of longer sequences of rolls of the die and how they converge to the expected value of 3.5. More generally, the rate of convergence can be roughly quantified by e.g. Chebyshev's inequality and the Berry–Esseen theorem.

Example 2. The roulette game consists of a small ball and a wheel with 38 numbered pockets around the edge. As the wheel is spun, the ball bounces around randomly until it settles down in one of the pockets. Suppose random variable X represents the (monetary) outcome of a $1 bet on a single number ("straight up" bet). If the bet wins (which happens with probability 1/38 in American roulette), the payoff is$35; otherwise the player loses the bet. The expected profit from such a bet will be

${\displaystyle \operatorname {E} [\,{\text{gain from }}\1{\text{ bet}}\,]=-\1\cdot {\frac {37}{38}}+\35\cdot {\frac {1}{38}}=-\0.0526.}$

i.e. the bet of $1 stands to lose$0.0526, so its expected value is -\$0.0526.

### Univariate discrete random variable, countable case

Let X be a discrete random variable taking values x
1
, x
2
, ... with probabilities p
1
, p
2
, ... respectively. Then the expected value of this random variable is the infinite sum

${\displaystyle \operatorname {E} [X]=\sum _{i=1}^{\infty }x_{i}\,p_{i},}$

provided that this series converges absolutely (that is, the sum must remain finite if we were to replace all x
i
'
s with their absolute values). If this series does not converge absolutely, we say that the expected value of X does not exist.

For example, suppose random variable X takes values 1, −2, 3, −4, ..., with respective probabilities c/12, c/22, c/32, c/42, ..., where c = 6/π2 is a normalizing constant that ensures the probabilities sum up to one. Then the infinite sum

${\displaystyle \sum _{i=1}^{\infty }x_{i}\,p_{i}=c\,{\bigg (}1-{\frac {1}{2}}+{\frac {1}{3}}-{\frac {1}{4}}+\dotsb {\bigg )}}$

converges and its sum is equal to ln(2)6/π2 ≃ 0.421383. However it would be incorrect to claim that the expected value of X is equal to this number—in fact E[X] does not exist, as this series does not converge absolutely (see harmonic series).

### Univariate continuous random variable

If the probability distribution of ${\displaystyle X}$ admits a probability density function ${\displaystyle f(x)}$, then the expected value can be computed as

${\displaystyle \operatorname {E} [X]=\int _{-\infty }^{\infty }xf(x)\,\mathrm {d} x.}$

### General definition

In general, if X is a random variable defined on a probability space (Ω, Σ, P), then the expected value of X, denoted by E[X], 〈X〉, X or E[X], is defined as the Lebesgue integral

${\displaystyle \operatorname {E} [X]=\int _{\Omega }X\,\mathrm {d} P=\int _{\Omega }X(\omega )P(\mathrm {d} \omega )}$

When this integral exists, it is defined as the expectation of X. Not all random variables have a finite expected value, since the integral may not converge absolutely; furthermore, for some it is not defined at all (e.g., Cauchy distribution). Two variables with the same probability distribution will have the same expected value, if it is defined.

It follows directly from the discrete case definition that if X is a constant random variable, i.e. X = b for some fixed real number b, then the expected value of X is also b.

The expected value of a measurable function of X, g(X), given that X has a probability density function f(x), is given by the inner product of f and g:

${\displaystyle \operatorname {E} [g(X)]=\int _{-\infty }^{\infty }g(x)f(x)\,\mathrm {d} x.}$

This is sometimes called the law of the unconscious statistician. Using representations as Riemann–Stieltjes integral and integration by parts the formula can be restated as

${\displaystyle \operatorname {E} [g(X)]=\int _{-\infty }^{\infty }g(x)\,\mathrm {d} \mathrm {P} (X\leq x)=}$${\displaystyle {\begin{cases}g(a)+\int _{a}^{\infty }g'(x)\mathrm {P} (X>x)\,\mathrm {d} x&\mathrm {if} \ \mathrm {P} (X\geq a)=1\\g(b)-\int _{-\infty }^{b}g'(x)\mathrm {P} (X\leq x)\,\mathrm {d} x&\mathrm {if} \ \mathrm {P} (X\leq b)=1.\end{cases}}}$

As a special case let α denote a positive real number. Then

${\displaystyle \operatorname {E} \left[|X|^{\alpha }\right]=\alpha \int _{0}^{\infty }t^{\alpha -1}\mathrm {P} (\left|X\right|>t)\,\mathrm {d} t.}$

In particular, if α = 1 and Pr[X ≥ 0] = 1, then this reduces to

${\displaystyle \operatorname {E} [|X|]=\operatorname {E} [X]=\int _{0}^{\infty }\lbrace 1-F(t)\rbrace \,\mathrm {d} t,}$

where F is the cumulative distribution function of X. This last identity is an instance of what, in a non-probabilistic setting, has been called the layer cake representation.

The law of the unconscious statistician applies also to a measurable function g of several random variables X1, ... Xn having a joint density f:[5] [6]

${\displaystyle \operatorname {E} [g(X_{1},\dots ,X_{n})]=\int _{-\infty }^{\infty }\cdots \int _{-\infty }^{\infty }g(x_{1},\ldots ,x_{n})~f(x_{1},\ldots ,x_{n})~\mathrm {d} x_{1}\cdots \mathrm {d} x_{n}.}$

## Properties

### Constants

The expected value of a constant is equal to the constant itself; i.e., if ${\displaystyle c}$ is a constant, then ${\textstyle \operatorname {E} [c]=c}$.

### Monotonicity

If ${\displaystyle X}$ and ${\displaystyle Y}$ are random variables such that ${\textstyle X\leq Y}$ almost surely, then ${\displaystyle \operatorname {E} [X]\leq \operatorname {E} [Y]}$.

### Linearity

The expected value operator (or expectation operator) ${\displaystyle \operatorname {E} [\cdot ]}$ is linear in the sense that

{\displaystyle {\begin{aligned}\operatorname {E} [X+c]&=\operatorname {E} [X]+c\\\operatorname {E} [X+Y]&=\operatorname {E} [X]+\operatorname {E} [Y]\\\operatorname {E} [aX]&=a\operatorname {E} [X]\end{aligned}}}

The second result is valid even if ${\displaystyle X}$ is not statistically independent of ${\displaystyle Y}$. Combining the results from the previous three equations, we can see that

${\displaystyle \operatorname {E} [aX+bY+c]=a\operatorname {E} [X]+b\operatorname {E} [Y]+c\,}$

for any two random variables ${\displaystyle X}$ and ${\displaystyle Y}$ (which need to be defined on the same probability space) and any real numbers a, b and c.

### Iterated expectation

#### Iterated expectation for discrete random variables

For any two discrete random variables ${\displaystyle X}$, ${\displaystyle Y}$ one may define the conditional expectation:[7]

${\displaystyle \operatorname {E} [X\mid Y=y]=\sum \limits _{x}x\cdot \operatorname {P} (X=x\mid Y=y),}$

which means that E[X | Y = y] is a function of y. Let g(y) be that function of y; then the notation E[X | Y] is a random variable in its own right, equal to g(Y).

Lemma. Then the expectation of X satisfies:[8]

${\displaystyle \operatorname {E} [X]=\operatorname {E} \left[\operatorname {E} [X\mid Y]\right].}$

Proof.

{\displaystyle {\begin{aligned}\operatorname {E} \left[\operatorname {E} [X\mid Y]\right]&=\sum \limits _{y}\operatorname {E} [X\mid Y=y]\cdot \operatorname {P} (Y=y)\\&=\sum \limits _{y}\left(\sum \limits _{x}x\cdot \operatorname {P} (X=x|Y=y)\right)\cdot \operatorname {P} (Y=y)\\&=\sum \limits _{y}\sum \limits _{x}x\cdot \operatorname {P} (X=x\mid Y=y)\cdot \operatorname {P} (Y=y)\\&=\sum \limits _{y}\sum \limits _{x}x\cdot \operatorname {P} (Y=y\mid X=x)\cdot \operatorname {P} (X=x)\\&=\sum \limits _{x}x\cdot \operatorname {P} (X=x)\cdot \left(\sum \limits _{y}\operatorname {P} (Y=y\mid X=x)\right)\\&=\sum \limits _{x}x\cdot \operatorname {P} (X=x)\\&=\operatorname {E} [X]\end{aligned}}}

The left-hand side of this equation is referred to as the iterated expectation. The equation is sometimes called the tower rule or the tower property; it is treated under law of total expectation.

#### Iterated expectation for continuous random variables

In the continuous case, the results are completely analogous. The definition of conditional expectation would use inequalities, density functions, and integrals to replace equalities, mass functions, and summations, respectively. However, the main result still holds:

${\displaystyle \operatorname {E} [X]=\operatorname {E} [\operatorname {E} [X\mid Y]]}$

### Inequality

If a random variable X is always less than or equal to another random variable Y, the expectation of X is less than or equal to that of Y:

If XY, then E[X] ≤ E[Y].

In particular, if we set Y to |X| we know XY and −XY. Therefore, we know E[X] ≤ E[Y] and E[−X] ≤ E[Y]. From the linearity of expectation we know −E[X] ≤ E[Y]. Therefore, the absolute value of expectation of a random variable is less than or equal to the expectation of its absolute value:

${\displaystyle |\operatorname {E} [X]|\leq \operatorname {E} [|X|]}$

This is a special case of Jensen's inequality.

### Non-multiplicativity

If one considers the joint probability density function of X and Y, say j(x,y), then the expectation of XY is

${\displaystyle \operatorname {E} [XY]=\iint xy\,j(x,y)\,\mathrm {d} x\,\mathrm {d} y.}$

In general, the expected value operator is not multiplicative, i.e. E[XY] is not necessarily equal to E[X]·E[Y]. In fact, the amount by which multiplicativity fails is called the covariance:

${\displaystyle \operatorname {Cov} (X,Y)=\operatorname {E} [XY]-\operatorname {E} [X]\operatorname {E} [Y].}$

Thus multiplicativity holds precisely when Cov(X, Y) = 0, in which case X and Y are said to be uncorrelated (independent variables are a notable case of uncorrelated variables).

Now if X and Y are independent, then by definition j(x,y) = f(x)g(y) where f and g are the marginal PDFs for X and Y. Then

{\displaystyle {\begin{aligned}\operatorname {E} [XY]&=\iint xy\,j(x,y)\,\mathrm {d} x\,\mathrm {d} y=\iint xyf(x)g(y)\,\mathrm {d} y\,\mathrm {d} x\\&=\left[\int xf(x)\,\mathrm {d} x\right]\left[\int yg(y)\,\mathrm {d} y\right]=\operatorname {E} [X]\operatorname {E} [Y]\end{aligned}}}

and Cov(X, Y) = 0.

Observe that independence of X and Y is required only to write j(x, y) = f(x)g(y), and this is required to establish the second equality above. The third equality follows from a basic application of the Fubini–Tonelli theorem.

### Functional non-invariance

In general, with the exception of linear functions, the expectation operator and functions of random variables do not commute; that is

${\displaystyle \operatorname {E} [g(X)]=\int _{\Omega }g(X)\,\mathrm {d} \mathrm {P} \neq g(\operatorname {E} [X]).}$

A notable inequality concerning this topic is Jensen's inequality, involving expected values of convex (or concave) functions.

### Relation to characteristic function

The probability density function of a scalar random variable X is related to its characteristic function φX by the inversion formula:

${\displaystyle f_{X}(x)={\frac {1}{2\pi }}\int _{\mathbf {R} }e^{-itx}\varphi _{X}(t)\,dt.}$

We can use this inversion formula in expected value of a function g(X) to obtain

${\displaystyle \operatorname {E} [g(X)]={\frac {1}{2\pi }}\int \int g(x)e^{-itx}\varphi _{X}(t)\,dt\,dx}$

Changing the order of integration, we get

${\displaystyle \operatorname {E} [g(X)]={\frac {1}{2\pi }}\int G(t)\varphi _{X}(t)\,dt,}$

where

${\displaystyle G(t)=\int g(x)e^{-itx}\,dx}$

is the Fourier transform of ${\displaystyle g(x).}$ This can also be seen as a direct consequence of Plancherel theorem.

## Uses and applications

It is possible to construct an expected value equal to the probability of an event by taking the expectation of an indicator function that is one if the event has occurred and zero otherwise. This relationship can be used to translate properties of expected values into properties of probabilities, e.g. using the law of large numbers to justify estimating probabilities by frequencies.

The expected values of the powers of X are called the moments of X; the moments about the mean of X are expected values of powers of X − E[X]. The moments of some random variables can be used to specify their distributions, via their moment generating functions.

To empirically estimate the expected value of a random variable, one repeatedly measures observations of the variable and computes the arithmetic mean of the results. If the expected value exists, this procedure estimates the true expected value in an unbiased manner and has the property of minimizing the sum of the squares of the residuals (the sum of the squared differences between the observations and the estimate). The law of large numbers demonstrates (under fairly mild conditions) that, as the size of the sample gets larger, the variance of this estimate gets smaller.

This property is often exploited in a wide variety of applications, including general problems of statistical estimation and machine learning, to estimate (probabilistic) quantities of interest via Monte Carlo methods, since most quantities of interest can be written in terms of expectation, e.g. ${\displaystyle \operatorname {P} ({X\in {\mathcal {A}}})=\operatorname {E} [I_{\mathcal {A}}(X)]}$ where ${\displaystyle I_{\mathcal {A}}(X)}$ is the indicator function for set ${\displaystyle {\mathcal {A}}}$, i.e. ${\displaystyle X\in {\mathcal {A}}\rightarrow I_{\mathcal {A}}(X)=1,X\not \in {\mathcal {A}}\rightarrow I_{\mathcal {A}}(X)=0}$.

The mass of probability distribution is balanced at the expected value, here a Beta(α,β) distribution with expected value α/(α+β).

In classical mechanics, the center of mass is an analogous concept to expectation. For example, suppose X is a discrete random variable with values xi and corresponding probabilities pi. Now consider a weightless rod on which are placed weights, at locations xi along the rod and having masses pi (whose sum is one). The point at which the rod balances is E[X].

Expected values can also be used to compute the variance, by means of the computational formula for the variance

${\displaystyle \operatorname {Var} (X)=\operatorname {E} [X^{2}]-(\operatorname {E} [X])^{2}.}$

A very important application of the expectation value is in the field of quantum mechanics. The expectation value of a quantum mechanical operator ${\displaystyle {\hat {A}}}$ operating on a quantum state vector ${\displaystyle |\psi \rangle }$ is written as ${\displaystyle \langle {\hat {A}}\rangle =\langle \psi |A|\psi \rangle }$. The uncertainty in ${\displaystyle {\hat {A}}}$ can be calculated using the formula ${\displaystyle (\Delta A)^{2}=\langle {\hat {A}}^{2}\rangle -\langle {\hat {A}}\rangle ^{2}}$.

## Expectation of matrices

If X is an m × n matrix, then the expected value of the matrix is defined as the matrix of expected values:

${\displaystyle \operatorname {E} [X]=\operatorname {E} \left[{\begin{pmatrix}x_{1,1}&x_{1,2}&\cdots &x_{1,n}\\x_{2,1}&x_{2,2}&\cdots &x_{2,n}\\\vdots &\vdots &\ddots &\vdots \\x_{m,1}&x_{m,2}&\cdots &x_{m,n}\end{pmatrix}}\right]={\begin{pmatrix}\operatorname {E} [x_{1,1}]&\operatorname {E} [x_{1,2}]&\cdots &\operatorname {E} [x_{1,n}]\\\operatorname {E} [x_{2,1}]&\operatorname {E} [x_{2,2}]&\cdots &\operatorname {E} [x_{2,n}]\\\vdots &\vdots &\ddots &\vdots \\\operatorname {E} [x_{m,1}]&\operatorname {E} [x_{m,2}]&\cdots &\operatorname {E} [x_{m,n}]\end{pmatrix}}.}$

This is utilized in covariance matrices.

## Formulas for special cases

### Discrete distribution taking only non-negative integer values

When a random variable takes only values in {0, 1, 2, 3, ...} we can use the following formula for computing its expectation (even when the expectation is infinite):

${\displaystyle \operatorname {E} [X]=\sum _{i=1}^{\infty }\Pr(X\geq i).}$

Proof.

${\displaystyle \sum _{i=1}^{\infty }\Pr(X\geq i)=\sum _{i=1}^{\infty }\sum _{j=i}^{\infty }\Pr(X=j).}$

Interchanging the order of summation, we have

{\displaystyle {\begin{aligned}\sum _{i=1}^{\infty }\sum _{j=i}^{\infty }\Pr(X=j)&=\sum _{j=1}^{\infty }\sum _{i=1}^{j}\Pr(X=j)\\&=\sum _{j=1}^{\infty }j\Pr(X=j)\\&=\operatorname {E} [X].\end{aligned}}}

This result can be a useful computational shortcut. For example, suppose we toss a coin where the probability of heads is p. How many tosses can we expect until the first heads (not including the heads itself)? Let X be this number. We are counting only the tails and not the heads which ends the experiment; in particular, we can have X = 0. The expectation of X may be computed by

${\displaystyle \sum _{i=1}^{\infty }(1-p)^{i}={\frac {1}{p}}-1.}$

This is because, when the first i tosses yield tails, the number of tosses is at least i. The last equality used the formula for a geometric progression,

${\displaystyle \sum _{i=1}^{\infty }r^{i}=\sum _{i=0}^{\infty }r^{i}-1={\frac {1}{1-r}}-1,}$

where ${\displaystyle r=1-p<1}$.

### Continuous distribution taking non-negative values

Analogously with the discrete case above, when a continuous random variable X takes only non-negative values, we can use the following formula for computing its expectation (even when the expectation is infinite):

${\displaystyle \operatorname {E} [X]=\int _{0}^{\infty }\Pr(X\geq x)\;\mathrm {d} x}$

Proof: It is first assumed that X has a density fX(x). We present two techniques:

${\displaystyle \operatorname {E} [X]=\int _{0}^{\infty }(-x)(-f_{X}(x))\;\mathrm {d} x={\Big [}-x(1-F(x)){\Big ]}_{0}^{\infty }+\int _{0}^{\infty }(1-F(x))\;\mathrm {d} x}$
and the bracket vanishes because (see Cumulative distribution function#Derived functions)
${\displaystyle 1-F(x)=o\left({\frac {1}{x}}\right)\quad {\text{as}}\quad x\to \infty .}$
{\displaystyle {\begin{aligned}\int _{0}^{\infty }\Pr(X\geq x)\;\mathrm {d} x&=\int _{0}^{\infty }\int _{x}^{\infty }f_{X}(t)\;\mathrm {d} t\;\mathrm {d} x=\int _{0}^{\infty }\int _{0}^{t}f_{X}(t)\;\mathrm {d} x\;\mathrm {d} t=\int _{0}^{\infty }tf_{X}(t)\;\mathrm {d} t=\operatorname {E} [X]\end{aligned}}}
In case no density exists, it is seen that
${\displaystyle \operatorname {E} [X]=\int _{0}^{\infty }\int _{0}^{x}\!\mathrm {d} t\,\mathrm {d} F(x)=\int _{0}^{\infty }\int _{t}^{\infty }\mathrm {d} F(x)\mathrm {d} t=\int _{0}^{\infty }\!(1-F(t))\,\mathrm {d} t.}$
If both negative and non-negative values are taken for X, then its expectation is
${\displaystyle \operatorname {E} [X]=\int _{0}^{\infty }\Pr(X\geq x)\;\mathrm {d} x-\int _{-\infty }^{0}\Pr(X\leq x)\;\mathrm {d} x}$

## History

The idea of the expected value originated in the middle of the 17th century from the study of the so-called problem of points, which seeks to divide the stakes in a fair way between two players who have to end their game before it's properly finished. This problem had been debated for centuries, and many conflicting proposals and solutions had been suggested over the years, when it was posed in 1654 to Blaise Pascal by French writer and amateur mathematician Chevalier de Méré. de Méré claimed that this problem couldn't be solved and that it showed just how flawed mathematics was when it came to its application to the real world. Pascal, being a mathematician, was provoked and determined to solve the problem once and for all. He began to discuss the problem in a now famous series of letters to Pierre de Fermat. Soon enough they both independently came up with a solution. They solved the problem in different computational ways but their results were identical because their computations were based on the same fundamental principle. The principle is that the value of a future gain should be directly proportional to the chance of getting it. This principle seemed to have come naturally to both of them. They were very pleased by the fact that they had found essentially the same solution and this in turn made them absolutely convinced they had solved the problem conclusively. However, they did not publish their findings. They only informed a small circle of mutual scientific friends in Paris about it.[9]

Three years later, in 1657, a Dutch mathematician Christiaan Huygens, who had just visited Paris, published a treatise (see Huygens (1657)) "De ratiociniis in ludo aleæ" on probability theory. In this book he considered the problem of points and presented a solution based on the same principle as the solutions of Pascal and Fermat. Huygens also extended the concept of expectation by adding rules for how to calculate expectations in more complicated situations than the original problem (e.g., for three or more players). In this sense this book can be seen as the first successful attempt of laying down the foundations of the theory of probability.

In the foreword to his book, Huygens wrote: "It should be said, also, that for some time some of the best mathematicians of France have occupied themselves with this kind of calculus so that no one should attribute to me the honour of the first invention. This does not belong to me. But these savants, although they put each other to the test by proposing to each other many questions difficult to solve, have hidden their methods. I have had therefore to examine and go deeply for myself into this matter by beginning with the elements, and it is impossible for me for this reason to affirm that I have even started from the same principle. But finally I have found that my answers in many cases do not differ from theirs." (cited by Edwards (2002)). Thus, Huygens learned about de Méré's Problem in 1655 during his visit to France; later on in 1656 from his correspondence with Carcavi he learned that his method was essentially the same as Pascal's; so that before his book went to press in 1657 he knew about Pascal's priority in this subject.

Neither Pascal nor Huygens used the term "expectation" in its modern sense. In particular, Huygens writes: "That my Chance or Expectation to win any thing is worth just such a Sum, as wou'd procure me in the same Chance and Expectation at a fair Lay. ... If I expect a or b, and have an equal Chance of gaining them, my Expectation is worth a+b/2." More than a hundred years later, in 1814, Pierre-Simon Laplace published his tract "Théorie analytique des probabilités", where the concept of expected value was defined explicitly:

… this advantage in the theory of chance is the product of the sum hoped for by the probability of obtaining it; it is the partial sum which ought to result when we do not wish to run the risks of the event in supposing that the division is made proportional to the probabilities. This division is the only equitable one when all strange circumstances are eliminated; because an equal degree of probability gives an equal right for the sum hoped for. We will call this advantage mathematical hope.

The use of the letter E to denote expected value goes back to W.A. Whitworth in 1901,[10] who used a script E. The symbol has become popular since for English writers it meant "Expectation", for Germans "Erwartungswert", for Spanish "Esperanza matemática" and for French "Espérance mathématique".[11]

## Notes

1. ^ Sheldon M Ross (2007). "§2.4 Expectation of a random variable". Introduction to probability models (9th ed.). Academic Press. p. 38 ff. ISBN 0-12-598062-0.
2. ^ Richard W Hamming (1991). "§2.5 Random variables, mean and the expected value". The art of probability for scientists and engineers. Addison–Wesley. p. 64 ff. ISBN 0-201-40686-1.
3. ^ Richard W Hamming (1991). "Example 8.7–1 The Cauchy distribution". The art of probability for scientists and engineers. Addison-Wesley. p. 290 ff. ISBN 0-201-40686-1. Sampling from the Cauchy distribution and averaging gets you nowhere — one sample has the same distribution as the average of 1000 samples!
4. ^ Gordon, Lawrence; Loeb, Martin (November 2002). "The Economics of Information Security Investment". ACM Transactions on Information and System Security. 5 (4): 438–457. doi:10.1145/581271.581274.
5. ^ Expectation Value, retrieved October 2013 Check date values in: |access-date= (help)
6. ^ Papoulis, A. (1984), Probability, Random Variables, and Stochastic Processes, New York: McGraw–Hill, pp. 139–152
7. ^ Sheldon M Ross. "Chapter 3: Conditional probability and conditional expectation". cited work. p. 97 ff. ISBN 0-12-598062-0.
8. ^ Sheldon M Ross. "§3.4: Computing expectations by conditioning". cited work. p. 105 ff. ISBN 0-12-598062-0.
9. ^ "Ore, Pascal and the Invention of Probability Theory". The American Mathematical Monthly. 67 (5): 409–419. 1960. doi:10.2307/2309286.
10. ^ Whitworth, W.A. (1901) Choice and Chance with One Thousand Exercises. Fifth edition. Deighton Bell, Cambridge. [Reprinted by Hafner Publishing Co., New York, 1959.]
11. ^

## Literature

• Edwards, A.W.F (2002). Pascal's arithmetical triangle: the story of a mathematical idea (2nd ed.). JHU Press. ISBN 0-8018-6946-3.
• Huygens, Christiaan (1657). De ratiociniis in ludo aleæ (English translation, published in 1714:).