# Independence and Events.

Let A, B and C are independent events. How am I supposed to prove that:

This is my approach:

for Nr 3.

$P(ABC') = P(A)P(B)P(C').$
But $P(AB)=P(ABC)+P(ABC')$ and using independence
$P(A)P(B) = P(A)P(B)P(C)+ P(ABC')$,
therefore $P(A)P(B)(1-P(C))=P(ABC')$,
$P(ABC') = P(A)P(B)P(C')$.

for Nr 2.

$P(AB'C') = P(A)P(B')P(C')$.
But $P(AC')=P(ABC')+P(ABC')$ and using independence
$P(A)P(C') = P(A)P(B)P(C')+ P(A B' C')$,
therefore $P(A)P(C')(1-P(B))=P(AB' C')$,
$P(AB'C') = P(A)P(B')P(C')$.

And for Nr 1.

$P(A'B'C') = P(A')P(B')P(C')$.
But $P(A'B')=P(A'B' C )+P(A'B'C')$ and using independence
$P(A')P(B') = P(A')P(B')P(C)+ P(A'B'C')$,
therefore $P(A')P(B')(1-P(C))=P(A'B'C')$,
$P(ABC') = P(A')P(B')P(C')$.

What do you think people? is this way of proving right?

#### Solutions Collecting From Web of "Independence and Events."

You have shown this, but for clarity, using independence you have
$$\Pr(ABC)=\Pr(A)\Pr(B)\Pr(C)$$
and
$$\Pr(AB)=\Pr(A)\Pr(B)$$
so
$$\Pr(ABC')=\Pr(AB)-\Pr(ABC)$$ $$=\Pr(A)\Pr(B)- \Pr(A)\Pr(B)\Pr(C)$$ $$= \Pr(A)\Pr(B)(1-\Pr(C))$$ $$=\Pr(A)\Pr(B)\Pr(C')$$

so $A$, $B$ and $C'$ are independent events.

Since this is all commutative, as martini says, you can then derive (2) and (1).

Your answer/proof is incomplete. In order to assert that three events $D$, $E$, $F$ are mutually independent, you have to verify that four equations hold:
\begin{align*} P(DEF) &= P(D)P(E)P(F)\\ P(DE) &= P(D)P(E)\\ P(DF) &= P(D)P(F)\\ P(EF) &= P(E)P(F)\\ \end{align*}
Taking $D=A$, $E=B$, $F=C^\prime$, you have verified the first of the four equations above. Now you need to say that $P(AB)=P(A)P(B)$ follows from the independence
of $A$ and $B$,
and either prove that $P(AC^\prime) = P(A)P(C^\prime)$ and
$P(BC^\prime) = P(B)P(C^\prime)$,
or assert that these follow from the independence of $A$ and $C$, and $B$ and $C$ respectively if you have done these kinds of calculations previously.

Another definition of independence of $n$ events $A_i$ is that all $2^n$ equations
$$P(A_1^*A_2^*\cdots A_n^*) = P(A_1^*)P(A_2^*)\cdots P(A_n^*)$$
must hold, where each $A_i^*$ stands for either $A_i$ or $A_i^\prime$, the same
on both sides of the equation. With this definition, the statements to be
proved in the OP’s problem are true by definition and there is nothing to prove.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}