If 
is a random variable on the probability space 
, then the expected value (aka expectation) of 
is, in essence, a weighted average of of the values 
may take on. In the case of simple random variables this weighted average is precisely the expectation. For a general random variable we’re actually taking a limit of the expectations of simple random variables that converge to the random variable of interest.
Assuming 
is a non-negative simple random variable of the form
where 
, and for the sake of simplicity that 
. The expected value of , denoted ![\mathbb{E}[X]](http://s1.wordpress.com/latex.php?latex=%5Cmathbb%7BE%7D%5BX%5D&bg=ffffff&fg=000000&s=0 "\mathbb{E}[X]")
, is
![\displaystyle \mathbb{E}[X] = \sum_{i=1}^n \alpha_i P(A_i)](http://s2.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Cmathbb%7BE%7D%5BX%5D+%3D+%5Csum_%7Bi%3D1%7D%5En+%5Calpha_i+P%28A_i%29&bg=ffffff&fg=000000&s=0 "\displaystyle \mathbb{E}[X] = \sum_{i=1}^n \alpha_i P(A_i)")
.
When is not a simple random variable, we take to be the supremum of the expectations of simple random variables less than . That is,
![\displaystyle \mathbb{E}[X] = \sup \left\{ \mathbb{E}[Z] : 0 \leq Z \leq X \right\}](http://s3.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Cmathbb%7BE%7D%5BX%5D+%3D+%5Csup+%5Cleft%5C%7B+%5Cmathbb%7BE%7D%5BZ%5D+%3A+0+%5Cleq+Z+%5Cleq+X+%5Cright%5C%7D&bg=ffffff&fg=000000&s=0 "\displaystyle \mathbb{E}[X] = \sup \left\{ \mathbb{E}[Z] : 0 \leq Z \leq X \right\}")
where each 
is a simple random variable. When is not non-negative, we break into its positive and negative parts, 
and 
, and provided ![\mathbb{E}[X^{+}]](http://s3.wordpress.com/latex.php?latex=%5Cmathbb%7BE%7D%5BX%5E%7B%2B%7D%5D&bg=ffffff&fg=000000&s=0 "\mathbb{E}[X^{+}]")
and ![\mathbb{E}[X^{-}]](http://s1.wordpress.com/latex.php?latex=%5Cmathbb%7BE%7D%5BX%5E%7B-%7D%5D&bg=ffffff&fg=000000&s=0 "\mathbb{E}[X^{-}]")
are not both infinite, we take the expectation to be
![\displaystyle \mathbb{E}[X] = \mathbb{E}[X^{+}] - \mathbb{E}[X^{-}]](http://s2.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Cmathbb%7BE%7D%5BX%5D+%3D+%5Cmathbb%7BE%7D%5BX%5E%7B%2B%7D%5D+-+%5Cmathbb%7BE%7D%5BX%5E%7B-%7D%5D&bg=ffffff&fg=000000&s=0 "\displaystyle \mathbb{E}[X] = \mathbb{E}[X^{+}] - \mathbb{E}[X^{-}]")
.
Notice that our definition of ![\mathbb{E}[X]](http://s3.wordpress.com/latex.php?latex=%5Cmathbb%7BE%7D%5BX%5D&bg=ffffff&fg=000000&s=0 "\mathbb{E}[X]")
is simply the Lebesgue integral of with respect to the probability measure 
over all of 
.
![\displaystyle \mathbb{E}[X] = \int_{\Omega} X dP](http://s1.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Cmathbb%7BE%7D%5BX%5D+%3D+%5Cint_%7B%5COmega%7D+X+dP&bg=ffffff&fg=000000&s=0 "\displaystyle \mathbb{E}[X] = \int_{\Omega} X dP")
As such, useful properties of Lebesgue integrals, such as linearity, and powerful theorems like monotone and dominated convergence, hold for expectations. One slightly less obvious nice property is that if 
is the distribution function of , then we have
![\displaystyle \mathbb{E}[X] = \int_{\Omega} X dP = \int_{-\infty}^\infty x \, dF(x)](http://s1.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Cmathbb%7BE%7D%5BX%5D+%3D+%5Cint_%7B%5COmega%7D+X+dP+%3D+%5Cint_%7B-%5Cinfty%7D%5E%5Cinfty+x+%5C%2C+dF%28x%29&bg=ffffff&fg=000000&s=0 "\displaystyle \mathbb{E}[X] = \int_{\Omega} X dP = \int_{-\infty}^\infty x \, dF(x)")
where the integral on the right refers to the Lebesgue-Stieltjes integral using the probability measure obtained from , or simply the usual Riemann-Stieltjes integral in those cases that it exists. To see this, simply show that the result holds for (non-negative) simple random variables, note that for a general non-negative random variable there exists an increasing sequence of non-negative simple random variables that converges to it, and apply the monotone convergence theorem. For general random variables, break the function into its positive and negative parts and apply the previous result.
