Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I normally have problem with proving inequalities since there are many different inequalities and I'm usually confused on how to choose a proper one and focus on that to get my problem solved. Here is one of them that I thought Jensen's inequality should solve it but I've not been able to solve it yet.

Suppose $E|X|^k$ < $\infty$ show that for any j and k where $0 < j < k$ we have:

$$ (E|X|^j)^k \le (E|X|^k)^j $$

I think since $E|X|^k$ < $\infty$ and $ j < k $, then we can assume $E|X|^j$ < $\infty$.

I appreciate your hints.

share|cite|improve this question
up vote 2 down vote accepted

Hint: Apply Jensen inequality $c(\mathbb E(Y))\leqslant\mathbb E(c(Y))$ to the nonnegative random variable $Y=|X|^j$ and the convex function $c:\mathbb R_+\to\mathbb R$ defined by $c(t)=|t|^{k/j}$ for every $t$ in $\mathbb R_+$.

share|cite|improve this answer
Thank you very much...I think I need to solve more examples to become comfortable with inequalities. I'm always confused how to choose and how to use them. Thanks again. – Sam Oct 26 '12 at 18:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.