If $X$, $Y$ are i.i.d and mutually exclusive, then is $Pr(min(X,Y)=n)=Pr(X=n)+Pr(Y=n)$? ...
Why constant symbols in a language?
What is the correct way to use the pinch test for dehydration?
Why is black pepper both grey and black?
What is the musical term for a note that continously plays through a melody?
Withdrew £2800, but only £2000 shows as withdrawn on online banking; what are my obligations?
What's the purpose of writing one's academic bio in 3rd person?
Does accepting a pardon have any bearing on trying that person for the same crime in a sovereign jurisdiction?
Why aren't air breathing engines used as small first stages
When is phishing education going too far?
How much radiation do nuclear physics experiments expose researchers to nowadays?
Is the address of a local variable a constexpr?
When to stop saving and start investing?
Is 1 ppb equal to 1 μg/kg?
Should I discuss the type of campaign with my players?
Sorting numerically
Stars Make Stars
How to recreate this effect in Photoshop?
Why does Python start at index -1 when indexing a list from the end?
Storing hydrofluoric acid before the invention of plastics
Why one of virtual NICs called bond0?
Output the ŋarâþ crîþ alphabet song without using (m)any letters
Did Xerox really develop the first LAN?
G-Code for resetting to 100% speed
I am not a queen, who am I?
If $X$, $Y$ are i.i.d and mutually exclusive, then is $Pr(min(X,Y)=n)=Pr(X=n)+Pr(Y=n)$?
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Probability and independent vs mutually exclusive eventsIndependent and mutually exclusiveMutually Exclusive Events (or not)how to prove that mutually exclusive events are dependent eventsMutually exclusive events are also independent??Mutually exclusive/independent eventsAbout Independent and mutually exclusive eventsConnection of independent, depended, mutually exclusive, and mutually eventsAre mutually exclusive events are independent. why?Are mutually exclusive events are always independent?
$begingroup$
I was wondering if $X$, $Y$ are independent and mutually exclusive, then is $Pr(min(X,Y)=n)=Pr(X=n)+Pr(Y=n)$?
$Pr(min(X,Y)=n)=Pr(X=n text{ or }Y=n)=Pr(X=n)+Pr(Y=n)$. Is this correct or am I missing something?
probability probability-theory
$endgroup$
|
show 2 more comments
$begingroup$
I was wondering if $X$, $Y$ are independent and mutually exclusive, then is $Pr(min(X,Y)=n)=Pr(X=n)+Pr(Y=n)$?
$Pr(min(X,Y)=n)=Pr(X=n text{ or }Y=n)=Pr(X=n)+Pr(Y=n)$. Is this correct or am I missing something?
probability probability-theory
$endgroup$
$begingroup$
You might be confusing a random variable and an event
$endgroup$
– Vladislav
Mar 23 at 22:23
$begingroup$
What I mean is X=n and Y=n are mutually exclusive events
$endgroup$
– Heisenberg
Mar 23 at 22:25
$begingroup$
It's not generally true that $$color{red}{Pr(min(X,Y)=n)=Pr(X=ntext{ or } Y=n)}.$$ You maybe be thinking that $min(X,Y)=n$ if and only if $X=n$ or $Y=n$, but this is not the case (if it were the case though, the above equation would be correct).
$endgroup$
– Minus One-Twelfth
Mar 23 at 22:32
$begingroup$
Then they cannot be iid.
$endgroup$
– kimchi lover
Mar 23 at 22:32
$begingroup$
$min(X,Y)=n$ requires one of them $=n$ and the other $ge n$.
$endgroup$
– herb steinberg
Mar 23 at 22:36
|
show 2 more comments
$begingroup$
I was wondering if $X$, $Y$ are independent and mutually exclusive, then is $Pr(min(X,Y)=n)=Pr(X=n)+Pr(Y=n)$?
$Pr(min(X,Y)=n)=Pr(X=n text{ or }Y=n)=Pr(X=n)+Pr(Y=n)$. Is this correct or am I missing something?
probability probability-theory
$endgroup$
I was wondering if $X$, $Y$ are independent and mutually exclusive, then is $Pr(min(X,Y)=n)=Pr(X=n)+Pr(Y=n)$?
$Pr(min(X,Y)=n)=Pr(X=n text{ or }Y=n)=Pr(X=n)+Pr(Y=n)$. Is this correct or am I missing something?
probability probability-theory
probability probability-theory
edited Mar 23 at 22:35
Rócherz
3,0263823
3,0263823
asked Mar 23 at 22:16
HeisenbergHeisenberg
1,3281742
1,3281742
$begingroup$
You might be confusing a random variable and an event
$endgroup$
– Vladislav
Mar 23 at 22:23
$begingroup$
What I mean is X=n and Y=n are mutually exclusive events
$endgroup$
– Heisenberg
Mar 23 at 22:25
$begingroup$
It's not generally true that $$color{red}{Pr(min(X,Y)=n)=Pr(X=ntext{ or } Y=n)}.$$ You maybe be thinking that $min(X,Y)=n$ if and only if $X=n$ or $Y=n$, but this is not the case (if it were the case though, the above equation would be correct).
$endgroup$
– Minus One-Twelfth
Mar 23 at 22:32
$begingroup$
Then they cannot be iid.
$endgroup$
– kimchi lover
Mar 23 at 22:32
$begingroup$
$min(X,Y)=n$ requires one of them $=n$ and the other $ge n$.
$endgroup$
– herb steinberg
Mar 23 at 22:36
|
show 2 more comments
$begingroup$
You might be confusing a random variable and an event
$endgroup$
– Vladislav
Mar 23 at 22:23
$begingroup$
What I mean is X=n and Y=n are mutually exclusive events
$endgroup$
– Heisenberg
Mar 23 at 22:25
$begingroup$
It's not generally true that $$color{red}{Pr(min(X,Y)=n)=Pr(X=ntext{ or } Y=n)}.$$ You maybe be thinking that $min(X,Y)=n$ if and only if $X=n$ or $Y=n$, but this is not the case (if it were the case though, the above equation would be correct).
$endgroup$
– Minus One-Twelfth
Mar 23 at 22:32
$begingroup$
Then they cannot be iid.
$endgroup$
– kimchi lover
Mar 23 at 22:32
$begingroup$
$min(X,Y)=n$ requires one of them $=n$ and the other $ge n$.
$endgroup$
– herb steinberg
Mar 23 at 22:36
$begingroup$
You might be confusing a random variable and an event
$endgroup$
– Vladislav
Mar 23 at 22:23
$begingroup$
You might be confusing a random variable and an event
$endgroup$
– Vladislav
Mar 23 at 22:23
$begingroup$
What I mean is X=n and Y=n are mutually exclusive events
$endgroup$
– Heisenberg
Mar 23 at 22:25
$begingroup$
What I mean is X=n and Y=n are mutually exclusive events
$endgroup$
– Heisenberg
Mar 23 at 22:25
$begingroup$
It's not generally true that $$color{red}{Pr(min(X,Y)=n)=Pr(X=ntext{ or } Y=n)}.$$ You maybe be thinking that $min(X,Y)=n$ if and only if $X=n$ or $Y=n$, but this is not the case (if it were the case though, the above equation would be correct).
$endgroup$
– Minus One-Twelfth
Mar 23 at 22:32
$begingroup$
It's not generally true that $$color{red}{Pr(min(X,Y)=n)=Pr(X=ntext{ or } Y=n)}.$$ You maybe be thinking that $min(X,Y)=n$ if and only if $X=n$ or $Y=n$, but this is not the case (if it were the case though, the above equation would be correct).
$endgroup$
– Minus One-Twelfth
Mar 23 at 22:32
$begingroup$
Then they cannot be iid.
$endgroup$
– kimchi lover
Mar 23 at 22:32
$begingroup$
Then they cannot be iid.
$endgroup$
– kimchi lover
Mar 23 at 22:32
$begingroup$
$min(X,Y)=n$ requires one of them $=n$ and the other $ge n$.
$endgroup$
– herb steinberg
Mar 23 at 22:36
$begingroup$
$min(X,Y)=n$ requires one of them $=n$ and the other $ge n$.
$endgroup$
– herb steinberg
Mar 23 at 22:36
|
show 2 more comments
2 Answers
2
active
oldest
votes
$begingroup$
$$Pr(min(X,Y)=n)=Pr(X=ncap Y=n)+Pr(X=ncap Ygt n)+Pr(Y=ncap Xgt n) ,$$ since these events are mutually exclusive.
Using independence $Pr(min(X,Y)=n)=Pr(X=n)Pr(Y=n)+Pr(X=n)Pr(Ygt n)+Pr(Y=n)Pr(Xgt n)$.
$endgroup$
add a comment |
$begingroup$
What you want to do is the following:
$$P(min(X,Y)geq n) = P(Xgeq n, Ygeq n) = P(Xgeq n)P(Ygeq n) = (1-F_X(n))(1-F_Y(n))$$
$$ = 1-F_X(n)-F_Y(n)+F_X(n)F_Y(n)$$
where $F_X$ is the cdf of $X.$
Then you have that,
$$P(min(X,Y) = n) = P(min(X,Y)geq n) - P(min(X,Y)geq n+1)$$
$$ = F_X(n+1)-F_X(n)+F_Y(n+1)-F_Y(n)+F_X(n)F_Y(n) - F_X(n+1)F_Y(n+1).$$
$endgroup$
add a comment |
Your Answer
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%2f3159866%2fif-x-y-are-i-i-d-and-mutually-exclusive-then-is-pr-minx-y-n-prx-n%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
$begingroup$
$$Pr(min(X,Y)=n)=Pr(X=ncap Y=n)+Pr(X=ncap Ygt n)+Pr(Y=ncap Xgt n) ,$$ since these events are mutually exclusive.
Using independence $Pr(min(X,Y)=n)=Pr(X=n)Pr(Y=n)+Pr(X=n)Pr(Ygt n)+Pr(Y=n)Pr(Xgt n)$.
$endgroup$
add a comment |
$begingroup$
$$Pr(min(X,Y)=n)=Pr(X=ncap Y=n)+Pr(X=ncap Ygt n)+Pr(Y=ncap Xgt n) ,$$ since these events are mutually exclusive.
Using independence $Pr(min(X,Y)=n)=Pr(X=n)Pr(Y=n)+Pr(X=n)Pr(Ygt n)+Pr(Y=n)Pr(Xgt n)$.
$endgroup$
add a comment |
$begingroup$
$$Pr(min(X,Y)=n)=Pr(X=ncap Y=n)+Pr(X=ncap Ygt n)+Pr(Y=ncap Xgt n) ,$$ since these events are mutually exclusive.
Using independence $Pr(min(X,Y)=n)=Pr(X=n)Pr(Y=n)+Pr(X=n)Pr(Ygt n)+Pr(Y=n)Pr(Xgt n)$.
$endgroup$
$$Pr(min(X,Y)=n)=Pr(X=ncap Y=n)+Pr(X=ncap Ygt n)+Pr(Y=ncap Xgt n) ,$$ since these events are mutually exclusive.
Using independence $Pr(min(X,Y)=n)=Pr(X=n)Pr(Y=n)+Pr(X=n)Pr(Ygt n)+Pr(Y=n)Pr(Xgt n)$.
edited Mar 24 at 3:38
lonza leggiera
1,457128
1,457128
answered Mar 23 at 23:14
herb steinbergherb steinberg
3,1832311
3,1832311
add a comment |
add a comment |
$begingroup$
What you want to do is the following:
$$P(min(X,Y)geq n) = P(Xgeq n, Ygeq n) = P(Xgeq n)P(Ygeq n) = (1-F_X(n))(1-F_Y(n))$$
$$ = 1-F_X(n)-F_Y(n)+F_X(n)F_Y(n)$$
where $F_X$ is the cdf of $X.$
Then you have that,
$$P(min(X,Y) = n) = P(min(X,Y)geq n) - P(min(X,Y)geq n+1)$$
$$ = F_X(n+1)-F_X(n)+F_Y(n+1)-F_Y(n)+F_X(n)F_Y(n) - F_X(n+1)F_Y(n+1).$$
$endgroup$
add a comment |
$begingroup$
What you want to do is the following:
$$P(min(X,Y)geq n) = P(Xgeq n, Ygeq n) = P(Xgeq n)P(Ygeq n) = (1-F_X(n))(1-F_Y(n))$$
$$ = 1-F_X(n)-F_Y(n)+F_X(n)F_Y(n)$$
where $F_X$ is the cdf of $X.$
Then you have that,
$$P(min(X,Y) = n) = P(min(X,Y)geq n) - P(min(X,Y)geq n+1)$$
$$ = F_X(n+1)-F_X(n)+F_Y(n+1)-F_Y(n)+F_X(n)F_Y(n) - F_X(n+1)F_Y(n+1).$$
$endgroup$
add a comment |
$begingroup$
What you want to do is the following:
$$P(min(X,Y)geq n) = P(Xgeq n, Ygeq n) = P(Xgeq n)P(Ygeq n) = (1-F_X(n))(1-F_Y(n))$$
$$ = 1-F_X(n)-F_Y(n)+F_X(n)F_Y(n)$$
where $F_X$ is the cdf of $X.$
Then you have that,
$$P(min(X,Y) = n) = P(min(X,Y)geq n) - P(min(X,Y)geq n+1)$$
$$ = F_X(n+1)-F_X(n)+F_Y(n+1)-F_Y(n)+F_X(n)F_Y(n) - F_X(n+1)F_Y(n+1).$$
$endgroup$
What you want to do is the following:
$$P(min(X,Y)geq n) = P(Xgeq n, Ygeq n) = P(Xgeq n)P(Ygeq n) = (1-F_X(n))(1-F_Y(n))$$
$$ = 1-F_X(n)-F_Y(n)+F_X(n)F_Y(n)$$
where $F_X$ is the cdf of $X.$
Then you have that,
$$P(min(X,Y) = n) = P(min(X,Y)geq n) - P(min(X,Y)geq n+1)$$
$$ = F_X(n+1)-F_X(n)+F_Y(n+1)-F_Y(n)+F_X(n)F_Y(n) - F_X(n+1)F_Y(n+1).$$
answered Mar 23 at 22:46
model_checkermodel_checker
4,45521931
4,45521931
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%2f3159866%2fif-x-y-are-i-i-d-and-mutually-exclusive-then-is-pr-minx-y-n-prx-n%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$
You might be confusing a random variable and an event
$endgroup$
– Vladislav
Mar 23 at 22:23
$begingroup$
What I mean is X=n and Y=n are mutually exclusive events
$endgroup$
– Heisenberg
Mar 23 at 22:25
$begingroup$
It's not generally true that $$color{red}{Pr(min(X,Y)=n)=Pr(X=ntext{ or } Y=n)}.$$ You maybe be thinking that $min(X,Y)=n$ if and only if $X=n$ or $Y=n$, but this is not the case (if it were the case though, the above equation would be correct).
$endgroup$
– Minus One-Twelfth
Mar 23 at 22:32
$begingroup$
Then they cannot be iid.
$endgroup$
– kimchi lover
Mar 23 at 22:32
$begingroup$
$min(X,Y)=n$ requires one of them $=n$ and the other $ge n$.
$endgroup$
– herb steinberg
Mar 23 at 22:36