Expected values are integral to probability theory.
This note crystallizes the notion of expected values for random variables that will be used throughout the remainder of the text.
Simple Random Variables
Before jumping into the notion in full generality, we’ll start with a special case.
For those familiar with measure theory, this should be reminiscent of simple functions.
They’ll serve as a basis for extending the notion of expected values (integration) to general random variables (functions).
In other words, the random variable can only take on finitely many values.
We can always write these variables in a particular form.
Denote the values X takes on by x1,…,xn, and their associated pre-images by Ai,
so X(Ai)={xi}.
We can then write X=∑i=1nxi1Ai.
Note that the sets {Ai} form a finite partition of Ω.
For such a random variable, we define the expected value as follows.
We also see from the definition that E[1A1]=P(A).
It also follows from the definition that E is both linear, and order-preserving.
Moreover, when X and Y are independent, we have that
E[XY]=E[X]E[Y].(4)
Clearly, Var[X]≥0 and from the linearity of expectation, we see that
E[(X−μX)2]=E[X2]−μX2.(5)
And it immediately follows that
Var[αX+β]=α2Var[X].(6)
Let’s conclude with a fact, because this is all there really is to say about simple random variables.
General Non-negative Random Variables
At first glance, it’s not obvious how to extend our definition of expected values to random variables that are not simple.
However, the definition itself should conjure an image of Riemann, or better yet, Lebesgue, integration.
In fact, the previous proposition applies to X being simple, but could serve as a definition for the expected value of X when it is not simple.
In this case, it is indeed possible that E[X]=∞.
That’s something that we’re willing to accept, and mirrors the fact that integrals may be infinite in measure theory.
Recall that for k∈N, the k-th moment of a non-negative random variable is defined to be E[Xk]