Compare $E[|X| cdot 1{|X| < M}]$ and $P(|X| < M)$ with $E|X|=1$
$begingroup$
$X$ is a random variable and $E|X|=1$. Do we know any relation between $P(|X|leq M)$ and $E[|X| cdot 1{|X| leq M }]$? Do we only have one direction, i.e., either $P(|X|leq M) geq E[|X| cdot 1{|X| leq M }]$ or $P(|X|leq M) leq E[|X| cdot 1{|X| leq M }$? Or in fact, both cases can happen? EDIT: Especially when $M to infty$, what would be the asymptotic comparison?
probability-theory inequality random-variables expected-value
$endgroup$
add a comment |
$begingroup$
$X$ is a random variable and $E|X|=1$. Do we know any relation between $P(|X|leq M)$ and $E[|X| cdot 1{|X| leq M }]$? Do we only have one direction, i.e., either $P(|X|leq M) geq E[|X| cdot 1{|X| leq M }]$ or $P(|X|leq M) leq E[|X| cdot 1{|X| leq M }$? Or in fact, both cases can happen? EDIT: Especially when $M to infty$, what would be the asymptotic comparison?
probability-theory inequality random-variables expected-value
$endgroup$
$begingroup$
For every nonnegative $M$, the function $u:tmapsto t$ is nondecreasing on $tgeqslant0$ and the function $v:tmapstomathbf 1_{tleqslant M}$ is nonincreasing on $tgeqslant0$, hence, by a rearrangement inequality, $$E(u(|X|)v(|X|))leqslant E(u(|X|))E(v(|X|))$$ If, in addition, $E|X|=1$, this yields $$E(|X|mathbf 1_{|X|leqslant M})leqslant P(|X|leqslant M)$$
$endgroup$
– Did
Feb 1 at 7:01
$begingroup$
@Did Thank you. I found that one can also use Chebyshev's association inequality to prove this.
$endgroup$
– jwyao
Feb 1 at 17:53
$begingroup$
You could show how, for example by posting an answer below.
$endgroup$
– Did
Feb 1 at 17:54
$begingroup$
@Did Just post. Thanks for reminding me of the inequality.
$endgroup$
– jwyao
Feb 1 at 18:02
add a comment |
$begingroup$
$X$ is a random variable and $E|X|=1$. Do we know any relation between $P(|X|leq M)$ and $E[|X| cdot 1{|X| leq M }]$? Do we only have one direction, i.e., either $P(|X|leq M) geq E[|X| cdot 1{|X| leq M }]$ or $P(|X|leq M) leq E[|X| cdot 1{|X| leq M }$? Or in fact, both cases can happen? EDIT: Especially when $M to infty$, what would be the asymptotic comparison?
probability-theory inequality random-variables expected-value
$endgroup$
$X$ is a random variable and $E|X|=1$. Do we know any relation between $P(|X|leq M)$ and $E[|X| cdot 1{|X| leq M }]$? Do we only have one direction, i.e., either $P(|X|leq M) geq E[|X| cdot 1{|X| leq M }]$ or $P(|X|leq M) leq E[|X| cdot 1{|X| leq M }$? Or in fact, both cases can happen? EDIT: Especially when $M to infty$, what would be the asymptotic comparison?
probability-theory inequality random-variables expected-value
probability-theory inequality random-variables expected-value
edited Feb 1 at 7:01
Did
249k23228466
249k23228466
asked Feb 1 at 6:25
jwyaojwyao
16311
16311
$begingroup$
For every nonnegative $M$, the function $u:tmapsto t$ is nondecreasing on $tgeqslant0$ and the function $v:tmapstomathbf 1_{tleqslant M}$ is nonincreasing on $tgeqslant0$, hence, by a rearrangement inequality, $$E(u(|X|)v(|X|))leqslant E(u(|X|))E(v(|X|))$$ If, in addition, $E|X|=1$, this yields $$E(|X|mathbf 1_{|X|leqslant M})leqslant P(|X|leqslant M)$$
$endgroup$
– Did
Feb 1 at 7:01
$begingroup$
@Did Thank you. I found that one can also use Chebyshev's association inequality to prove this.
$endgroup$
– jwyao
Feb 1 at 17:53
$begingroup$
You could show how, for example by posting an answer below.
$endgroup$
– Did
Feb 1 at 17:54
$begingroup$
@Did Just post. Thanks for reminding me of the inequality.
$endgroup$
– jwyao
Feb 1 at 18:02
add a comment |
$begingroup$
For every nonnegative $M$, the function $u:tmapsto t$ is nondecreasing on $tgeqslant0$ and the function $v:tmapstomathbf 1_{tleqslant M}$ is nonincreasing on $tgeqslant0$, hence, by a rearrangement inequality, $$E(u(|X|)v(|X|))leqslant E(u(|X|))E(v(|X|))$$ If, in addition, $E|X|=1$, this yields $$E(|X|mathbf 1_{|X|leqslant M})leqslant P(|X|leqslant M)$$
$endgroup$
– Did
Feb 1 at 7:01
$begingroup$
@Did Thank you. I found that one can also use Chebyshev's association inequality to prove this.
$endgroup$
– jwyao
Feb 1 at 17:53
$begingroup$
You could show how, for example by posting an answer below.
$endgroup$
– Did
Feb 1 at 17:54
$begingroup$
@Did Just post. Thanks for reminding me of the inequality.
$endgroup$
– jwyao
Feb 1 at 18:02
$begingroup$
For every nonnegative $M$, the function $u:tmapsto t$ is nondecreasing on $tgeqslant0$ and the function $v:tmapstomathbf 1_{tleqslant M}$ is nonincreasing on $tgeqslant0$, hence, by a rearrangement inequality, $$E(u(|X|)v(|X|))leqslant E(u(|X|))E(v(|X|))$$ If, in addition, $E|X|=1$, this yields $$E(|X|mathbf 1_{|X|leqslant M})leqslant P(|X|leqslant M)$$
$endgroup$
– Did
Feb 1 at 7:01
$begingroup$
For every nonnegative $M$, the function $u:tmapsto t$ is nondecreasing on $tgeqslant0$ and the function $v:tmapstomathbf 1_{tleqslant M}$ is nonincreasing on $tgeqslant0$, hence, by a rearrangement inequality, $$E(u(|X|)v(|X|))leqslant E(u(|X|))E(v(|X|))$$ If, in addition, $E|X|=1$, this yields $$E(|X|mathbf 1_{|X|leqslant M})leqslant P(|X|leqslant M)$$
$endgroup$
– Did
Feb 1 at 7:01
$begingroup$
@Did Thank you. I found that one can also use Chebyshev's association inequality to prove this.
$endgroup$
– jwyao
Feb 1 at 17:53
$begingroup$
@Did Thank you. I found that one can also use Chebyshev's association inequality to prove this.
$endgroup$
– jwyao
Feb 1 at 17:53
$begingroup$
You could show how, for example by posting an answer below.
$endgroup$
– Did
Feb 1 at 17:54
$begingroup$
You could show how, for example by posting an answer below.
$endgroup$
– Did
Feb 1 at 17:54
$begingroup$
@Did Just post. Thanks for reminding me of the inequality.
$endgroup$
– jwyao
Feb 1 at 18:02
$begingroup$
@Did Just post. Thanks for reminding me of the inequality.
$endgroup$
– jwyao
Feb 1 at 18:02
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
(Chebyshev's Association Inequality) $f$ is nonincreasing and $g$ is nondecreasing. $X$ is a real-valued random variable and $Y$ is a nonnegative random variable. Then
$$ E[Y] E[Yf(X)g(X)] leq E[Yf(X)] E[Yg(X)] .$$
Take $Y equiv 1$, $f(cdot) = 1{|X|leq cdot}$ and $g(cdot) = |cdot|$. The result would be similar to Did's comment.
$endgroup$
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%2f3095889%2fcompare-ex-cdot-1-x-m-and-px-m-with-ex-1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
(Chebyshev's Association Inequality) $f$ is nonincreasing and $g$ is nondecreasing. $X$ is a real-valued random variable and $Y$ is a nonnegative random variable. Then
$$ E[Y] E[Yf(X)g(X)] leq E[Yf(X)] E[Yg(X)] .$$
Take $Y equiv 1$, $f(cdot) = 1{|X|leq cdot}$ and $g(cdot) = |cdot|$. The result would be similar to Did's comment.
$endgroup$
add a comment |
$begingroup$
(Chebyshev's Association Inequality) $f$ is nonincreasing and $g$ is nondecreasing. $X$ is a real-valued random variable and $Y$ is a nonnegative random variable. Then
$$ E[Y] E[Yf(X)g(X)] leq E[Yf(X)] E[Yg(X)] .$$
Take $Y equiv 1$, $f(cdot) = 1{|X|leq cdot}$ and $g(cdot) = |cdot|$. The result would be similar to Did's comment.
$endgroup$
add a comment |
$begingroup$
(Chebyshev's Association Inequality) $f$ is nonincreasing and $g$ is nondecreasing. $X$ is a real-valued random variable and $Y$ is a nonnegative random variable. Then
$$ E[Y] E[Yf(X)g(X)] leq E[Yf(X)] E[Yg(X)] .$$
Take $Y equiv 1$, $f(cdot) = 1{|X|leq cdot}$ and $g(cdot) = |cdot|$. The result would be similar to Did's comment.
$endgroup$
(Chebyshev's Association Inequality) $f$ is nonincreasing and $g$ is nondecreasing. $X$ is a real-valued random variable and $Y$ is a nonnegative random variable. Then
$$ E[Y] E[Yf(X)g(X)] leq E[Yf(X)] E[Yg(X)] .$$
Take $Y equiv 1$, $f(cdot) = 1{|X|leq cdot}$ and $g(cdot) = |cdot|$. The result would be similar to Did's comment.
answered Feb 1 at 18:01
jwyaojwyao
16311
16311
add a comment |
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.
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%2f3095889%2fcompare-ex-cdot-1-x-m-and-px-m-with-ex-1%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
$begingroup$
For every nonnegative $M$, the function $u:tmapsto t$ is nondecreasing on $tgeqslant0$ and the function $v:tmapstomathbf 1_{tleqslant M}$ is nonincreasing on $tgeqslant0$, hence, by a rearrangement inequality, $$E(u(|X|)v(|X|))leqslant E(u(|X|))E(v(|X|))$$ If, in addition, $E|X|=1$, this yields $$E(|X|mathbf 1_{|X|leqslant M})leqslant P(|X|leqslant M)$$
$endgroup$
– Did
Feb 1 at 7:01
$begingroup$
@Did Thank you. I found that one can also use Chebyshev's association inequality to prove this.
$endgroup$
– jwyao
Feb 1 at 17:53
$begingroup$
You could show how, for example by posting an answer below.
$endgroup$
– Did
Feb 1 at 17:54
$begingroup$
@Did Just post. Thanks for reminding me of the inequality.
$endgroup$
– jwyao
Feb 1 at 18:02