- #1
FabianS
- 4
- 1
Hi, I'm having some trouble solving one of the problems from my homework assignment.
Prove:
Where A,B,C are either true or false.
We can't do this by using a truth table, we can use the following equations:
[tex]P(A + B) = P(A) + P(B) - P(AB)[/tex]
[tex]P(AB | C) = P(A | BC) + P(B | C)[/tex]
[tex]P(A | B) + P(\bar{A} | B) = 1[/tex]
and De Morgan's rules.
The way I have approached it is by stating that if (AB)C = A(BC) then their probabilities must be equal, as well.
I have checked on multiple sites and they either just assume this to be true (http://en.wikipedia.org/wiki/Boolean_logic#Properties", page 6). So, I tried something similar:
[tex]X = (ab)c[/tex]
[tex]Y = a(bc)[/tex]
[tex]aX = a((ab)c) = (a(ab))(ac) = (ab)(ac) = a(bc)[/tex]
[tex]aY = a(a(bc)) = a(bc) = Y[/tex]
[tex]aX = Y = aY[/tex]
[tex]X = Y[/tex]I'm not very good a proving this type property, and I feel like I'm going around in circles. Is this correct or is there some better way of doing this?
Thanks :)
Fabian
Homework Statement
Prove:
[tex]P((AB)C) = P(A(BC))[/tex]
Where A,B,C are either true or false.
Homework Equations
We can't do this by using a truth table, we can use the following equations:
[tex]P(A + B) = P(A) + P(B) - P(AB)[/tex]
[tex]P(AB | C) = P(A | BC) + P(B | C)[/tex]
[tex]P(A | B) + P(\bar{A} | B) = 1[/tex]
and De Morgan's rules.
The Attempt at a Solution
The way I have approached it is by stating that if (AB)C = A(BC) then their probabilities must be equal, as well.
I have checked on multiple sites and they either just assume this to be true (http://en.wikipedia.org/wiki/Boolean_logic#Properties", page 6). So, I tried something similar:
[tex]X = (ab)c[/tex]
[tex]Y = a(bc)[/tex]
[tex]aX = a((ab)c) = (a(ab))(ac) = (ab)(ac) = a(bc)[/tex]
[tex]aY = a(a(bc)) = a(bc) = Y[/tex]
[tex]aX = Y = aY[/tex]
[tex]X = Y[/tex]I'm not very good a proving this type property, and I feel like I'm going around in circles. Is this correct or is there some better way of doing this?
Thanks :)
Fabian
Last edited by a moderator: