sabbagh80 said:
Can we find a better upper bound for P(A│B∪C)?
You'll have to explain what you are trying to do before anyone will know what "better"means in this context.
Using the idea:
[tex]P(X|Y) = P(Y|X) \frac{P(X)}{P(Y)}[/tex]
and not worrying about the possibility of division by zero, you could try:
[tex]P(A| B \cup C) = P(B \cup C | A) \frac{P(A)}{P(B \cup C)}[/tex]
[tex]= \Bigg( P(B|A) + P(C|A) - P(BC| A) \Bigg) \frac{P(A)}{P(B \cup C)}[/tex]
[tex]= \Bigg( P(A|B) \frac{P(B)}{P(A)} + P(A|C) \frac{P(C)}{P(A)} - P(A|BC) \frac{P(BC}{P(A)} \Bigg) \frac{P(A)}{P(B \cup C)}[/tex]
[tex]= P(A|B) \frac{P(B)}{P(B \cup C)} + P(A|C)\frac{P(C)}{P(B \cup C)} - P(A|BC)\frac{P(BC)}{P(B \cup C)}[/tex]
[tex]\leq P(A|B) + P(A|C) - P(A|BC) \frac{P(BC)}{P(B \cup C)}[/tex]
Another approach is the algebraic realization of a Venn diagram. The possible sets in this problem are: [tex]ABC, ABC^c, AB^cC,A^cBC,A^cBC^c,A^cB^cC,A^cB^cC^c[/tex]
Each probability, such as [tex]P(A|B)[/tex] can be expressed as a fraction involving sums of the probabilities of those sets.