Proving that if $A$ and $B$ are events, then $Pr[A ∩ B] ge Pr[A] + Pr[B] - 1$Probability of the union of $3$ events?$K$ events that are $(K-1)$-wise Independent but not Mutually/Fully IndependentProbability of a Union of EventsProving that three events are mutually independentProving that $Pleft ( bigcup_i=1^nA_i right )leq sum_i=1^nP(A_i)$ by inductionProbability: Prove that events are independentCan two different events generate the same set of probabilities?If $A$ and B are two events such that $P(A) > 0$ and $P(A) + P(B) > 1$Given $A, B$, and $C$ are mutually independent events, find $ P(A cap B' cap C')$Bounding the probability of a set of non independent events
Should I tell management that I intend to leave due to bad software development practices?
How to show a landlord what we have in savings?
Bullying boss launched a smear campaign and made me unemployable
What is an equivalently powerful replacement spell for Yuan-Ti's Suggestion spell?
What historical events would have to change in order to make 19th century "steampunk" technology possible?
How to coordinate airplane tickets?
Does int main() need a declaration on C++?
Can compressed videos be decoded back to their uncompresed original format?
Obtaining database information and values in extended properties
Label inside tikzcd square
What is a Samsaran Word™?
How can saying a song's name be a copyright violation?
What does the same-ish mean?
How to compactly explain secondary and tertiary characters without resorting to stereotypes?
Forgetting the musical notes while performing in concert
How does a dynamic QR code work?
How to travel to Japan while expressing milk?
Is it a bad idea to plug the other end of ESD strap to wall ground?
Was the Stack Exchange "Happy April Fools" page fitting with the '90's code?
Do Iron Man suits sport waste management systems?
files created then deleted at every second in tmp directory
Unlock My Phone! February 2018
How exploitable/balanced is this homebrew spell: Spell Permanency?
Convert seconds to minutes
Proving that if $A$ and $B$ are events, then $Pr[A ∩ B] ge Pr[A] + Pr[B] - 1$
Probability of the union of $3$ events?$K$ events that are $(K-1)$-wise Independent but not Mutually/Fully IndependentProbability of a Union of EventsProving that three events are mutually independentProving that $Pleft ( bigcup_i=1^nA_i right )leq sum_i=1^nP(A_i)$ by inductionProbability: Prove that events are independentCan two different events generate the same set of probabilities?If $A$ and B are two events such that $P(A) > 0$ and $P(A) + P(B) > 1$Given $A, B$, and $C$ are mutually independent events, find $ P(A cap B' cap C')$Bounding the probability of a set of non independent events
$begingroup$
I am just looking for some guidance whether I am approaching the questions correctly. New to probability!
Prove that if $A$ and $B$ are events, then $$Pr[A cap B] geq Pr[A]+Pr[B]-1$$
I rewrote the statement in the following way :
$$1 geq Pr[A] + Pr[B] - Pr[A cap B]$$
And based on some probability properties, I rewrote out the statement again:
$$1 geq Pr[A cup B]$$
Is this enough to prove the statement?
probability proof-verification
$endgroup$
add a comment |
$begingroup$
I am just looking for some guidance whether I am approaching the questions correctly. New to probability!
Prove that if $A$ and $B$ are events, then $$Pr[A cap B] geq Pr[A]+Pr[B]-1$$
I rewrote the statement in the following way :
$$1 geq Pr[A] + Pr[B] - Pr[A cap B]$$
And based on some probability properties, I rewrote out the statement again:
$$1 geq Pr[A cup B]$$
Is this enough to prove the statement?
probability proof-verification
$endgroup$
2
$begingroup$
Perfect! ... ...
$endgroup$
– Maria Mazur
Mar 20 at 17:51
add a comment |
$begingroup$
I am just looking for some guidance whether I am approaching the questions correctly. New to probability!
Prove that if $A$ and $B$ are events, then $$Pr[A cap B] geq Pr[A]+Pr[B]-1$$
I rewrote the statement in the following way :
$$1 geq Pr[A] + Pr[B] - Pr[A cap B]$$
And based on some probability properties, I rewrote out the statement again:
$$1 geq Pr[A cup B]$$
Is this enough to prove the statement?
probability proof-verification
$endgroup$
I am just looking for some guidance whether I am approaching the questions correctly. New to probability!
Prove that if $A$ and $B$ are events, then $$Pr[A cap B] geq Pr[A]+Pr[B]-1$$
I rewrote the statement in the following way :
$$1 geq Pr[A] + Pr[B] - Pr[A cap B]$$
And based on some probability properties, I rewrote out the statement again:
$$1 geq Pr[A cup B]$$
Is this enough to prove the statement?
probability proof-verification
probability proof-verification
edited Mar 20 at 19:55
Maria Mazur
49.5k1361124
49.5k1361124
asked Mar 20 at 17:49
RobinRobin
525
525
2
$begingroup$
Perfect! ... ...
$endgroup$
– Maria Mazur
Mar 20 at 17:51
add a comment |
2
$begingroup$
Perfect! ... ...
$endgroup$
– Maria Mazur
Mar 20 at 17:51
2
2
$begingroup$
Perfect! ... ...
$endgroup$
– Maria Mazur
Mar 20 at 17:51
$begingroup$
Perfect! ... ...
$endgroup$
– Maria Mazur
Mar 20 at 17:51
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
So you use $$P(Acup B ) = P(A)+P(B)-P(Acap B)$$ and that $P(Acup B)leq 1$
So you got $$1geq P(A)+P(B)-P(Acap B)$$ and now swap $1$ and $P(Acap B)$ and you got what you want.
That is correct.
$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%2f3155778%2fproving-that-if-a-and-b-are-events-then-pra-%25e2%2588%25a9-b-ge-pra-prb-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$
So you use $$P(Acup B ) = P(A)+P(B)-P(Acap B)$$ and that $P(Acup B)leq 1$
So you got $$1geq P(A)+P(B)-P(Acap B)$$ and now swap $1$ and $P(Acap B)$ and you got what you want.
That is correct.
$endgroup$
add a comment |
$begingroup$
So you use $$P(Acup B ) = P(A)+P(B)-P(Acap B)$$ and that $P(Acup B)leq 1$
So you got $$1geq P(A)+P(B)-P(Acap B)$$ and now swap $1$ and $P(Acap B)$ and you got what you want.
That is correct.
$endgroup$
add a comment |
$begingroup$
So you use $$P(Acup B ) = P(A)+P(B)-P(Acap B)$$ and that $P(Acup B)leq 1$
So you got $$1geq P(A)+P(B)-P(Acap B)$$ and now swap $1$ and $P(Acap B)$ and you got what you want.
That is correct.
$endgroup$
So you use $$P(Acup B ) = P(A)+P(B)-P(Acap B)$$ and that $P(Acup B)leq 1$
So you got $$1geq P(A)+P(B)-P(Acap B)$$ and now swap $1$ and $P(Acap B)$ and you got what you want.
That is correct.
answered Mar 20 at 17:52
Maria MazurMaria Mazur
49.5k1361124
49.5k1361124
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%2f3155778%2fproving-that-if-a-and-b-are-events-then-pra-%25e2%2588%25a9-b-ge-pra-prb-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
2
$begingroup$
Perfect! ... ...
$endgroup$
– Maria Mazur
Mar 20 at 17:51