PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
absolute moments bounding (necessary and sufficient condition) (Theorem)

Let $X$ be a random variable; then$$ E[\left\vert X\right\vert ^{k}]\leq M^{k}\text{ \ \ \ \ \ \ }\forall k\geq 1,k\in \mathbf{N} $$


if and only if,$\forall i\geq 0,i\in \mathbf{N}$ $$ E\left[ \left\vert X\right\vert ^{k}\right] \leq E\left[ \left\vert X\right\vert ^{i}\right] M^{k-i}\text{ \ \ \ \ \ \ \ }\forall k\geq i,k\in \mathbf{N} $$


Proof. a) $(E\left[ \left\vert X\right\vert ^{k}\right] \leq E\left[ \left\vert X\right\vert ^{i}\right] M^{k-i}$ $\Longrightarrow $ $% E[\left\vert X\right\vert ^{k}]\leq M^{k})$ It's enough to take $i=0$ and the thesis follows easily.


b) $(E[\left\vert X\right\vert ^{k}]\leq M^{k}$ $\Longrightarrow E\left[ \left\vert X\right\vert ^{k}\right] \leq E\left[ \left\vert X\right\vert ^{i}% \right] M^{k-i})$ Let $1\leq i\leq k$ (the case $i=0$ is trivial). Then, using Cauchy-Schwarz inequality $N$ times, one has:\begin{eqnarray*} E[\left\vert X\right\vert ^{k}] &=&E\left[ \left\vert X\right\vert ^{\frac{i% }{2}}\left\vert X\right\vert ^{k-\frac{i}{2}}\right] \\ &\leq &E\left[ \left\vert X\right\vert ^{i}\right] ^{\frac{1}{2}}E\left[ \left\vert X\right\vert ^{2k-i}\right] ^{\frac{1}{2}} \\ &=&E\left[ \left\vert X\right\vert ^{i}\right] ^{\frac{1}{2}}E\left[ \left\vert X\right\vert ^{\frac{i}{2}}\left\vert X\right\vert ^{2k-\frac{3}{2% }i}\right] ^{\frac{1}{2}} \\ &\leq &E\left[ \left\vert X\right\vert ^{i}\right] ^{\left( \frac{1}{2}+% \frac{1}{4}\right) }E\left[ \left\vert X\right\vert ^{4k-3i}\right] ^{\frac{1% }{4}} \\ &\leq &E\left[ \left\vert X\right\vert ^{i}\right] ^{\left( \frac{1}{2}+% \frac{1}{4}+\frac{1}{8}\right) }E\left[ \left\vert X\right\vert ^{\left( 8k-7i\right) }\right] ^{\frac{1}{8}} \\ &&... \\ &\leq &E\left[ \left\vert X\right\vert ^{i}\right] ^{\left( \sum_{m=1}^{N}% \frac{1}{2^{m}}\right) }E\left[ \left\vert X\right\vert ^{2^{N}k-\left( 2^{N}-1\right) i}\right] ^{\frac{1}{2^{N}}} \\ &=&E\left[ \left\vert X\right\vert ^{i}\right] ^{\left( 1-\frac{1}{2^{N}}% \right) }E\left[ \left\vert X\right\vert ^{2^{N}\left( k-i\right) +i}\right] ^{\frac{1}{2^{N}}} \\ &\leq &E\left[ \left\vert X\right\vert ^{i}\right] ^{\left( 1-\frac{1}{2^{N}}% \right) }M^{\left( k-i\right) +\frac{i}{2^{N}}}, \end{eqnarray*} and since this must hold for any $N$ we obtain $$ E[\left\vert X\right\vert ^{k}]\leq E\left[ \left\vert X\right\vert ^{i}% \right] M^{k-i} $$ $ \qedsymbol$




"absolute moments bounding (necessary and sufficient condition)" is owned by Andrea Ambrosio.
(view preamble | get metadata)

View style:

Log in to rate this entry.
(view current ratings)

Cross-references: Cauchy-Schwarz inequality, random variable
There are 3 references to this entry.

This is version 2 of absolute moments bounding (necessary and sufficient condition), born on 2006-09-09, modified 2006-09-09.
Object id is 8333, canonical name is AbsoluteMomentsBoundingNecessaryAndSufficientCondition.
Accessed 908 times total.

Classification:
AMS MSC60E15 (Probability theory and stochastic processes :: Distribution theory :: Inequalities; stochastic orderings)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)