Probability proof - what formulas are needed here?

AI Thread Summary
The discussion focuses on proving two probability statements involving events A and B within the same sample space. The first proof demonstrates that if P(A | B') > P(A), then it follows that P(B | A) < P(B). The second proof states that if P(A | B) = P(A), then P(B | A) must equal P(B), but it clarifies that independence cannot be assumed in this context. The participants emphasize using the definitions of conditional probability and independence to derive these conclusions. The conversation highlights the importance of careful reasoning in probability proofs.
SavvyAA3
Messages
23
Reaction score
0
If events A and B are in the same sample space:
  • .
Proove that if P(A I B') > P(A) then P(B I A) < P(B)

(where B' is the Probability of A given not B)


  • .
Proove that if P(A I B) = P(A) then P(B I A) = P(B)

do we assume independence here so that P(A I B) = [P(A)*P(B)]/ P(B) = P(A) and state that since P(A n B) = P(B n A) that P(B I A) = [P(B)*P(A)] / P(A) = P(B) or is it wrong to assume independence here?
 
Physics news on Phys.org
For the second proof use the fact that P(A|B)=P(A&B)/P(B) and similarly for the other one. You can't assume independence, but it is easy to see that they are using the usual definition of independence P(A&B)=P(A)P(B).
 
Please could you show me the steps you would take
 
SavvyAA3 said:
If events A and B are in the same sample space:
  • .
Proove that if P(A I B') > P(A) then P(B I A) < P(B)

(where B' is the Probability of A given not B)

...

assume
P(A|B&#039;)&gt;P(A)
then

\frac{P(A\cap B&#039;)}{P(B&#039;)}&gt;P(A)

\frac{P(B&#039;|A)P(A)}{P(B&#039;)}&gt;P(A)

\frac{P(B&#039;|A)}{P(B&#039;)}&gt;1

P(B&#039;|A)&gt;P(B&#039;)

1-P(B&#039;|A)&lt;1-P(B&#039;)

P(B|A)&lt;P(B)

the other one isn't much different
 
Thanks soo much!
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top