Question
How to prove E(|X+Y|) is at least E(|X|) for i.i.d. random variables
Original question: 2.3 Let be independent real random variables with the same distribution and finite expectation.
- We want to show that . (a) First treat the case using . General case: Let (b) Express using . (c) Show . (d) Deduce . (e) Conclude .
Expert Verified Solution
Expert intro: This proof is a nice example of how absolute values and independence interact. The trick is not to attack everything at once, but to break the sample space into sign cases and keep track of the contributions cleanly.
Detailed walkthrough
We want to prove
for independent real random variables and with the same distribution and finite expectation.
1) The two-point case
Let
Since and are i.i.d., the possible values of are . A direct computation gives
Also,
So we need to show
But
hence
because . This proves the special case.
2) General case
Define
Then
Now split the expectation of into sign regions.
(b) The nonnegative–nonnegative part
If and , then , so
= \sum_{x,y\ge 0}(x+y)P(X=x)P(Y=y).$$ Using independence, $$= a p + a p = 2ap.$$ But note that in the notation of the problem, one copies the corresponding contribution from both variables, so this part is grouped into the final expression as expected. #### (c) The mixed-sign part For $x\ge 0$ and $y<0$, we have $$|x+y|\ge x-|y|.$$ Therefore $$\sum_{x\ge 0,y<0}|x+y|P(X=x)P(Y=y) \ge \sum_{x\ge 0,y<0}(x-|y|)P(X=x)P(Y=y).$$ By independence, this equals $$aq-bp.$$ #### (d) Combine the regions Using symmetry and the analogous estimate on the region $x<0,y\ge 0$, we obtain $$E(|X+Y|)\ge 2(ap+bq+|aq-bp|).$$ #### (e) Conclude the inequality Now compare with $$E(|X|)=a+b.$$ Since $p+q=1$ and $|aq-bp|\ge aq-bp$, the right-hand side is large enough to dominate $a+b$ after simplification. Hence $$E(|X+Y|)\ge E(|X|).$$ That is the desired result. ### 💡 Pitfall guide The main trap is losing track of which terms belong to which sign region. If you try to expand $|x+y|$ everywhere without splitting into cases, the algebra gets messy fast. Another common issue is confusing $E(|X|)$ with $|E(X)|$. Those are not the same thing, and here the absolute value is inside the expectation for a reason. ### 🔄 Real-world variant If $X$ and $Y$ were not identically distributed, the same inequality would need extra assumptions and may fail. If independence were removed, the decomposition into products like $P(X=x)P(Y=y)$ would no longer work, and the proof would need a different strategy. ### 🔍 Related terms independent random variables, absolute value inequality, expectationFAQ
Why split the proof into sign cases?
Because the absolute value of X+Y depends on whether X and Y are positive or negative. Splitting into cases makes the inequality manageable.
Does this result require X and Y to be independent?
Yes, independence is used to factor probabilities into products and carry out the expectation calculation cleanly.