Probability, Random Variables, and Random Processes: Theory and Signal Processing Applications
by John J. Shynk
5.10 EXPECTATION OF A FUNCTION
The expectation of function Y = g(X) of random variable X can be computed in two ways: (i) deriving the pdf fY(y) and then calculating
or (ii) directly calculating
based on FX(x). We demonstrate the equivalence of both approaches in the following theorem.
Theorem 5.4 The expectation of function Y = g(X) of random variable X is
(5.76)
Proof. (Discrete random variable). The proof is a straightforward application of the mapping process from X to Y:
(5.77)
The inner sum accounts for all values of x (and the corresponding probability mass) that map to value y. The double sum is the same as a single sum over all possible values of g(x), weighted by pX[x]:
(5.78)
(Continuous random variable). Assume that g(X) is monotonically increasing where each x maps to a unique y. Thus
(5.79)
Substituting y = g(x) and x = g−1(y) gives
where dx/dy>0 for a monotonically ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access