If $X_nto X$ in $L^p$, is $E(X_n^p)to E(X^p)$ true?
Let $p$ denote a positive integer. If $X_nto X$ in $L^p$, is $E(X_n^p)to E(X^p)$ true?
If each $X_n$ and $X$ are nonnegative, then it follows directly from Minkowski's inequality.
Then how about the general case? I separated each $X_n$ into its positive and negative parts as $X_n=X_n^+-X_n^-$, but it might not be the case that $X_n^+to X^+$ and $X_n^-to X^-$ in $L^p$.
probability-theory lp-spaces
add a comment |
Let $p$ denote a positive integer. If $X_nto X$ in $L^p$, is $E(X_n^p)to E(X^p)$ true?
If each $X_n$ and $X$ are nonnegative, then it follows directly from Minkowski's inequality.
Then how about the general case? I separated each $X_n$ into its positive and negative parts as $X_n=X_n^+-X_n^-$, but it might not be the case that $X_n^+to X^+$ and $X_n^-to X^-$ in $L^p$.
probability-theory lp-spaces
math.stackexchange.com/a/1250473
– Did
Dec 2 at 12:04
@Did It seems to me like the post you've linked deals with a kind of converse to what is asked here?
– Rhys Steele
Dec 2 at 12:22
True, I was too hasty, sorry about that. Leaving the link nonetheless, as an element of context.
– Did
Dec 2 at 12:24
add a comment |
Let $p$ denote a positive integer. If $X_nto X$ in $L^p$, is $E(X_n^p)to E(X^p)$ true?
If each $X_n$ and $X$ are nonnegative, then it follows directly from Minkowski's inequality.
Then how about the general case? I separated each $X_n$ into its positive and negative parts as $X_n=X_n^+-X_n^-$, but it might not be the case that $X_n^+to X^+$ and $X_n^-to X^-$ in $L^p$.
probability-theory lp-spaces
Let $p$ denote a positive integer. If $X_nto X$ in $L^p$, is $E(X_n^p)to E(X^p)$ true?
If each $X_n$ and $X$ are nonnegative, then it follows directly from Minkowski's inequality.
Then how about the general case? I separated each $X_n$ into its positive and negative parts as $X_n=X_n^+-X_n^-$, but it might not be the case that $X_n^+to X^+$ and $X_n^-to X^-$ in $L^p$.
probability-theory lp-spaces
probability-theory lp-spaces
edited Dec 2 at 12:42
Did
246k23220454
246k23220454
asked Dec 2 at 11:37
bellcircle
1,327411
1,327411
math.stackexchange.com/a/1250473
– Did
Dec 2 at 12:04
@Did It seems to me like the post you've linked deals with a kind of converse to what is asked here?
– Rhys Steele
Dec 2 at 12:22
True, I was too hasty, sorry about that. Leaving the link nonetheless, as an element of context.
– Did
Dec 2 at 12:24
add a comment |
math.stackexchange.com/a/1250473
– Did
Dec 2 at 12:04
@Did It seems to me like the post you've linked deals with a kind of converse to what is asked here?
– Rhys Steele
Dec 2 at 12:22
True, I was too hasty, sorry about that. Leaving the link nonetheless, as an element of context.
– Did
Dec 2 at 12:24
math.stackexchange.com/a/1250473
– Did
Dec 2 at 12:04
math.stackexchange.com/a/1250473
– Did
Dec 2 at 12:04
@Did It seems to me like the post you've linked deals with a kind of converse to what is asked here?
– Rhys Steele
Dec 2 at 12:22
@Did It seems to me like the post you've linked deals with a kind of converse to what is asked here?
– Rhys Steele
Dec 2 at 12:22
True, I was too hasty, sorry about that. Leaving the link nonetheless, as an element of context.
– Did
Dec 2 at 12:24
True, I was too hasty, sorry about that. Leaving the link nonetheless, as an element of context.
– Did
Dec 2 at 12:24
add a comment |
2 Answers
2
active
oldest
votes
For a simple, self-contained, proof, one can start from the binomial identity $$X_n^p-X^p=sum_{k=1}^p{pchoose k}(X_n-X)^kX^{p-k}$$ which yields $$|E(X_n^p)-E(X^p)|leqslantsum_{k=1}^p{pchoose k}E(|X_n-X|^k|X|^{p-k})$$ Now, for each $1leqslant kleqslant p$, by convexity, $$E(|X_n-X|^k|X|^{p-k})leqslant E(|X_n-X|^p)^{k/p}E(|X|^p)^{1-k/p}$$ hence each term in the sum on the RHS goes to $0$ as soon as $X_nto X$ in $L^p$.
The method yields an effective upper bound of $|E(X_n^p)-E(X^p)|$ in terms of $|X_n-X|_p$ and $|X|_p$, which we leave to the reader.
add a comment |
We have
$$|mathbb{E}[X_n^p - X^p]| leq p mathbb{E}[(|X_n| + |X|)^{p-1} |X_n - X|]$$
since for any $x,y in mathbb{R}$, $|x^p - y^p| leq p (|x| + |y|)^p |x-y|$ (for example, apply the mean value theorem to $t mapsto t^p$).
So by Holder's inequality,
begin{align*}
|mathbb{E}[X_n^p - X^p]| leq& p |X_n - X|_p mathbb{E}[(|X_n| + |X|)^p]^{frac{p-1}{p}} \
leq & 2^{p-1} p |X_n - X|_p (|X_n|_p^{p} + |X|_p^p)^{frac{p-1}{p}} to 0
end{align*}
since $|X_n|_p$ is a bounded sequence and $|X_n - X|_p to 0$.
$L^p$ norm is $mathbb{E}|X^p|^{1/p}$, not merely $(mathbb{E}X^p)^{1/p}$.
– bellcircle
Dec 2 at 11:56
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3022527%2fif-x-n-to-x-in-lp-is-ex-np-to-exp-true%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
For a simple, self-contained, proof, one can start from the binomial identity $$X_n^p-X^p=sum_{k=1}^p{pchoose k}(X_n-X)^kX^{p-k}$$ which yields $$|E(X_n^p)-E(X^p)|leqslantsum_{k=1}^p{pchoose k}E(|X_n-X|^k|X|^{p-k})$$ Now, for each $1leqslant kleqslant p$, by convexity, $$E(|X_n-X|^k|X|^{p-k})leqslant E(|X_n-X|^p)^{k/p}E(|X|^p)^{1-k/p}$$ hence each term in the sum on the RHS goes to $0$ as soon as $X_nto X$ in $L^p$.
The method yields an effective upper bound of $|E(X_n^p)-E(X^p)|$ in terms of $|X_n-X|_p$ and $|X|_p$, which we leave to the reader.
add a comment |
For a simple, self-contained, proof, one can start from the binomial identity $$X_n^p-X^p=sum_{k=1}^p{pchoose k}(X_n-X)^kX^{p-k}$$ which yields $$|E(X_n^p)-E(X^p)|leqslantsum_{k=1}^p{pchoose k}E(|X_n-X|^k|X|^{p-k})$$ Now, for each $1leqslant kleqslant p$, by convexity, $$E(|X_n-X|^k|X|^{p-k})leqslant E(|X_n-X|^p)^{k/p}E(|X|^p)^{1-k/p}$$ hence each term in the sum on the RHS goes to $0$ as soon as $X_nto X$ in $L^p$.
The method yields an effective upper bound of $|E(X_n^p)-E(X^p)|$ in terms of $|X_n-X|_p$ and $|X|_p$, which we leave to the reader.
add a comment |
For a simple, self-contained, proof, one can start from the binomial identity $$X_n^p-X^p=sum_{k=1}^p{pchoose k}(X_n-X)^kX^{p-k}$$ which yields $$|E(X_n^p)-E(X^p)|leqslantsum_{k=1}^p{pchoose k}E(|X_n-X|^k|X|^{p-k})$$ Now, for each $1leqslant kleqslant p$, by convexity, $$E(|X_n-X|^k|X|^{p-k})leqslant E(|X_n-X|^p)^{k/p}E(|X|^p)^{1-k/p}$$ hence each term in the sum on the RHS goes to $0$ as soon as $X_nto X$ in $L^p$.
The method yields an effective upper bound of $|E(X_n^p)-E(X^p)|$ in terms of $|X_n-X|_p$ and $|X|_p$, which we leave to the reader.
For a simple, self-contained, proof, one can start from the binomial identity $$X_n^p-X^p=sum_{k=1}^p{pchoose k}(X_n-X)^kX^{p-k}$$ which yields $$|E(X_n^p)-E(X^p)|leqslantsum_{k=1}^p{pchoose k}E(|X_n-X|^k|X|^{p-k})$$ Now, for each $1leqslant kleqslant p$, by convexity, $$E(|X_n-X|^k|X|^{p-k})leqslant E(|X_n-X|^p)^{k/p}E(|X|^p)^{1-k/p}$$ hence each term in the sum on the RHS goes to $0$ as soon as $X_nto X$ in $L^p$.
The method yields an effective upper bound of $|E(X_n^p)-E(X^p)|$ in terms of $|X_n-X|_p$ and $|X|_p$, which we leave to the reader.
answered Dec 2 at 12:36
Did
246k23220454
246k23220454
add a comment |
add a comment |
We have
$$|mathbb{E}[X_n^p - X^p]| leq p mathbb{E}[(|X_n| + |X|)^{p-1} |X_n - X|]$$
since for any $x,y in mathbb{R}$, $|x^p - y^p| leq p (|x| + |y|)^p |x-y|$ (for example, apply the mean value theorem to $t mapsto t^p$).
So by Holder's inequality,
begin{align*}
|mathbb{E}[X_n^p - X^p]| leq& p |X_n - X|_p mathbb{E}[(|X_n| + |X|)^p]^{frac{p-1}{p}} \
leq & 2^{p-1} p |X_n - X|_p (|X_n|_p^{p} + |X|_p^p)^{frac{p-1}{p}} to 0
end{align*}
since $|X_n|_p$ is a bounded sequence and $|X_n - X|_p to 0$.
$L^p$ norm is $mathbb{E}|X^p|^{1/p}$, not merely $(mathbb{E}X^p)^{1/p}$.
– bellcircle
Dec 2 at 11:56
add a comment |
We have
$$|mathbb{E}[X_n^p - X^p]| leq p mathbb{E}[(|X_n| + |X|)^{p-1} |X_n - X|]$$
since for any $x,y in mathbb{R}$, $|x^p - y^p| leq p (|x| + |y|)^p |x-y|$ (for example, apply the mean value theorem to $t mapsto t^p$).
So by Holder's inequality,
begin{align*}
|mathbb{E}[X_n^p - X^p]| leq& p |X_n - X|_p mathbb{E}[(|X_n| + |X|)^p]^{frac{p-1}{p}} \
leq & 2^{p-1} p |X_n - X|_p (|X_n|_p^{p} + |X|_p^p)^{frac{p-1}{p}} to 0
end{align*}
since $|X_n|_p$ is a bounded sequence and $|X_n - X|_p to 0$.
$L^p$ norm is $mathbb{E}|X^p|^{1/p}$, not merely $(mathbb{E}X^p)^{1/p}$.
– bellcircle
Dec 2 at 11:56
add a comment |
We have
$$|mathbb{E}[X_n^p - X^p]| leq p mathbb{E}[(|X_n| + |X|)^{p-1} |X_n - X|]$$
since for any $x,y in mathbb{R}$, $|x^p - y^p| leq p (|x| + |y|)^p |x-y|$ (for example, apply the mean value theorem to $t mapsto t^p$).
So by Holder's inequality,
begin{align*}
|mathbb{E}[X_n^p - X^p]| leq& p |X_n - X|_p mathbb{E}[(|X_n| + |X|)^p]^{frac{p-1}{p}} \
leq & 2^{p-1} p |X_n - X|_p (|X_n|_p^{p} + |X|_p^p)^{frac{p-1}{p}} to 0
end{align*}
since $|X_n|_p$ is a bounded sequence and $|X_n - X|_p to 0$.
We have
$$|mathbb{E}[X_n^p - X^p]| leq p mathbb{E}[(|X_n| + |X|)^{p-1} |X_n - X|]$$
since for any $x,y in mathbb{R}$, $|x^p - y^p| leq p (|x| + |y|)^p |x-y|$ (for example, apply the mean value theorem to $t mapsto t^p$).
So by Holder's inequality,
begin{align*}
|mathbb{E}[X_n^p - X^p]| leq& p |X_n - X|_p mathbb{E}[(|X_n| + |X|)^p]^{frac{p-1}{p}} \
leq & 2^{p-1} p |X_n - X|_p (|X_n|_p^{p} + |X|_p^p)^{frac{p-1}{p}} to 0
end{align*}
since $|X_n|_p$ is a bounded sequence and $|X_n - X|_p to 0$.
edited Dec 2 at 12:19
answered Dec 2 at 11:50
Rhys Steele
6,0431829
6,0431829
$L^p$ norm is $mathbb{E}|X^p|^{1/p}$, not merely $(mathbb{E}X^p)^{1/p}$.
– bellcircle
Dec 2 at 11:56
add a comment |
$L^p$ norm is $mathbb{E}|X^p|^{1/p}$, not merely $(mathbb{E}X^p)^{1/p}$.
– bellcircle
Dec 2 at 11:56
$L^p$ norm is $mathbb{E}|X^p|^{1/p}$, not merely $(mathbb{E}X^p)^{1/p}$.
– bellcircle
Dec 2 at 11:56
$L^p$ norm is $mathbb{E}|X^p|^{1/p}$, not merely $(mathbb{E}X^p)^{1/p}$.
– bellcircle
Dec 2 at 11:56
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3022527%2fif-x-n-to-x-in-lp-is-ex-np-to-exp-true%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
math.stackexchange.com/a/1250473
– Did
Dec 2 at 12:04
@Did It seems to me like the post you've linked deals with a kind of converse to what is asked here?
– Rhys Steele
Dec 2 at 12:22
True, I was too hasty, sorry about that. Leaving the link nonetheless, as an element of context.
– Did
Dec 2 at 12:24