$operatorname{supp}(f_{X,Y})={(x,y)inmathbb{R}^2||x|+|y|leq1}$ then $X,Y$ are not independent
$begingroup$
Let $Z=(X,Y)$ be a absolutely coninuous random variable such that
$$
\operatorname{supp}(f_Z)={(x,y)inmathbb{R}^2||x|+|y|leq1}
$$
Show that $X,Y$ are not independent.
I don't have a good idea how to continue the proof. I need to find $(t,s)inmathbb{R}^2$ that setasfies
$$
\ int_{-1}^{s}int_{-1}^{t}f_Z(x,y)dx dy=int_{-1}^{1}f_Z(t,y)dycdotint_{-1}^{1}f_Z(x,s)dx
$$
probability integration random-variables absolute-continuity
$endgroup$
add a comment |
$begingroup$
Let $Z=(X,Y)$ be a absolutely coninuous random variable such that
$$
\operatorname{supp}(f_Z)={(x,y)inmathbb{R}^2||x|+|y|leq1}
$$
Show that $X,Y$ are not independent.
I don't have a good idea how to continue the proof. I need to find $(t,s)inmathbb{R}^2$ that setasfies
$$
\ int_{-1}^{s}int_{-1}^{t}f_Z(x,y)dx dy=int_{-1}^{1}f_Z(t,y)dycdotint_{-1}^{1}f_Z(x,s)dx
$$
probability integration random-variables absolute-continuity
$endgroup$
add a comment |
$begingroup$
Let $Z=(X,Y)$ be a absolutely coninuous random variable such that
$$
\operatorname{supp}(f_Z)={(x,y)inmathbb{R}^2||x|+|y|leq1}
$$
Show that $X,Y$ are not independent.
I don't have a good idea how to continue the proof. I need to find $(t,s)inmathbb{R}^2$ that setasfies
$$
\ int_{-1}^{s}int_{-1}^{t}f_Z(x,y)dx dy=int_{-1}^{1}f_Z(t,y)dycdotint_{-1}^{1}f_Z(x,s)dx
$$
probability integration random-variables absolute-continuity
$endgroup$
Let $Z=(X,Y)$ be a absolutely coninuous random variable such that
$$
\operatorname{supp}(f_Z)={(x,y)inmathbb{R}^2||x|+|y|leq1}
$$
Show that $X,Y$ are not independent.
I don't have a good idea how to continue the proof. I need to find $(t,s)inmathbb{R}^2$ that setasfies
$$
\ int_{-1}^{s}int_{-1}^{t}f_Z(x,y)dx dy=int_{-1}^{1}f_Z(t,y)dycdotint_{-1}^{1}f_Z(x,s)dx
$$
probability integration random-variables absolute-continuity
probability integration random-variables absolute-continuity
asked Dec 12 '18 at 19:00
J. DoeJ. Doe
16111
16111
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Hint: Can $X$ and $Y$ simultaneously be close to $1$? Can you show that each individually has a positive probability of being close to $1$?
Hint 2: I mean the following. Note that since the set ${x > frac{1}{2}, y > frac{1}{2}}$ intersects the support of $f_Z$ trivially, we must have that $P[X > frac{1}{2}, Y > frac{1}{2}] = 0,.$ To show that they're not independent, you'd just now need to show that $P[X > frac{1}{2}] > 0$ and $P[Y > frac{1}{2}] > 0$, since we'd then have $$Pleft[X > frac{1}{2}, Y > frac{1}{2}right] neq Pleft[X > frac{1}{2}right] cdot Pleft[Y > frac{1}{2}right],. $$
$endgroup$
$begingroup$
Do you mean $lim_{tto1}int_{-1}^{1}f_Z(t,y)dy=int_{-1}^1f_Z(1,y)dy=mathbb{P}(-1<Yleq1)$ and same for $X$? Not sure how it helps me. @Marcuus
$endgroup$
– J. Doe
Dec 12 '18 at 19:40
1
$begingroup$
@J.Doe, no that's not what I mean. I added a second, more involved hint that puts you nearly all the way there.
$endgroup$
– Marcus M
Dec 12 '18 at 19:53
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%2f3037089%2foperatornamesuppf-x-y-x-y-in-mathbbr2xy-leq1-then-x-y%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$
Hint: Can $X$ and $Y$ simultaneously be close to $1$? Can you show that each individually has a positive probability of being close to $1$?
Hint 2: I mean the following. Note that since the set ${x > frac{1}{2}, y > frac{1}{2}}$ intersects the support of $f_Z$ trivially, we must have that $P[X > frac{1}{2}, Y > frac{1}{2}] = 0,.$ To show that they're not independent, you'd just now need to show that $P[X > frac{1}{2}] > 0$ and $P[Y > frac{1}{2}] > 0$, since we'd then have $$Pleft[X > frac{1}{2}, Y > frac{1}{2}right] neq Pleft[X > frac{1}{2}right] cdot Pleft[Y > frac{1}{2}right],. $$
$endgroup$
$begingroup$
Do you mean $lim_{tto1}int_{-1}^{1}f_Z(t,y)dy=int_{-1}^1f_Z(1,y)dy=mathbb{P}(-1<Yleq1)$ and same for $X$? Not sure how it helps me. @Marcuus
$endgroup$
– J. Doe
Dec 12 '18 at 19:40
1
$begingroup$
@J.Doe, no that's not what I mean. I added a second, more involved hint that puts you nearly all the way there.
$endgroup$
– Marcus M
Dec 12 '18 at 19:53
add a comment |
$begingroup$
Hint: Can $X$ and $Y$ simultaneously be close to $1$? Can you show that each individually has a positive probability of being close to $1$?
Hint 2: I mean the following. Note that since the set ${x > frac{1}{2}, y > frac{1}{2}}$ intersects the support of $f_Z$ trivially, we must have that $P[X > frac{1}{2}, Y > frac{1}{2}] = 0,.$ To show that they're not independent, you'd just now need to show that $P[X > frac{1}{2}] > 0$ and $P[Y > frac{1}{2}] > 0$, since we'd then have $$Pleft[X > frac{1}{2}, Y > frac{1}{2}right] neq Pleft[X > frac{1}{2}right] cdot Pleft[Y > frac{1}{2}right],. $$
$endgroup$
$begingroup$
Do you mean $lim_{tto1}int_{-1}^{1}f_Z(t,y)dy=int_{-1}^1f_Z(1,y)dy=mathbb{P}(-1<Yleq1)$ and same for $X$? Not sure how it helps me. @Marcuus
$endgroup$
– J. Doe
Dec 12 '18 at 19:40
1
$begingroup$
@J.Doe, no that's not what I mean. I added a second, more involved hint that puts you nearly all the way there.
$endgroup$
– Marcus M
Dec 12 '18 at 19:53
add a comment |
$begingroup$
Hint: Can $X$ and $Y$ simultaneously be close to $1$? Can you show that each individually has a positive probability of being close to $1$?
Hint 2: I mean the following. Note that since the set ${x > frac{1}{2}, y > frac{1}{2}}$ intersects the support of $f_Z$ trivially, we must have that $P[X > frac{1}{2}, Y > frac{1}{2}] = 0,.$ To show that they're not independent, you'd just now need to show that $P[X > frac{1}{2}] > 0$ and $P[Y > frac{1}{2}] > 0$, since we'd then have $$Pleft[X > frac{1}{2}, Y > frac{1}{2}right] neq Pleft[X > frac{1}{2}right] cdot Pleft[Y > frac{1}{2}right],. $$
$endgroup$
Hint: Can $X$ and $Y$ simultaneously be close to $1$? Can you show that each individually has a positive probability of being close to $1$?
Hint 2: I mean the following. Note that since the set ${x > frac{1}{2}, y > frac{1}{2}}$ intersects the support of $f_Z$ trivially, we must have that $P[X > frac{1}{2}, Y > frac{1}{2}] = 0,.$ To show that they're not independent, you'd just now need to show that $P[X > frac{1}{2}] > 0$ and $P[Y > frac{1}{2}] > 0$, since we'd then have $$Pleft[X > frac{1}{2}, Y > frac{1}{2}right] neq Pleft[X > frac{1}{2}right] cdot Pleft[Y > frac{1}{2}right],. $$
edited Dec 12 '18 at 19:52
answered Dec 12 '18 at 19:09
Marcus MMarcus M
8,80311047
8,80311047
$begingroup$
Do you mean $lim_{tto1}int_{-1}^{1}f_Z(t,y)dy=int_{-1}^1f_Z(1,y)dy=mathbb{P}(-1<Yleq1)$ and same for $X$? Not sure how it helps me. @Marcuus
$endgroup$
– J. Doe
Dec 12 '18 at 19:40
1
$begingroup$
@J.Doe, no that's not what I mean. I added a second, more involved hint that puts you nearly all the way there.
$endgroup$
– Marcus M
Dec 12 '18 at 19:53
add a comment |
$begingroup$
Do you mean $lim_{tto1}int_{-1}^{1}f_Z(t,y)dy=int_{-1}^1f_Z(1,y)dy=mathbb{P}(-1<Yleq1)$ and same for $X$? Not sure how it helps me. @Marcuus
$endgroup$
– J. Doe
Dec 12 '18 at 19:40
1
$begingroup$
@J.Doe, no that's not what I mean. I added a second, more involved hint that puts you nearly all the way there.
$endgroup$
– Marcus M
Dec 12 '18 at 19:53
$begingroup$
Do you mean $lim_{tto1}int_{-1}^{1}f_Z(t,y)dy=int_{-1}^1f_Z(1,y)dy=mathbb{P}(-1<Yleq1)$ and same for $X$? Not sure how it helps me. @Marcuus
$endgroup$
– J. Doe
Dec 12 '18 at 19:40
$begingroup$
Do you mean $lim_{tto1}int_{-1}^{1}f_Z(t,y)dy=int_{-1}^1f_Z(1,y)dy=mathbb{P}(-1<Yleq1)$ and same for $X$? Not sure how it helps me. @Marcuus
$endgroup$
– J. Doe
Dec 12 '18 at 19:40
1
1
$begingroup$
@J.Doe, no that's not what I mean. I added a second, more involved hint that puts you nearly all the way there.
$endgroup$
– Marcus M
Dec 12 '18 at 19:53
$begingroup$
@J.Doe, no that's not what I mean. I added a second, more involved hint that puts you nearly all the way there.
$endgroup$
– Marcus M
Dec 12 '18 at 19:53
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%2f3037089%2foperatornamesuppf-x-y-x-y-in-mathbbr2xy-leq1-then-x-y%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