An upper bound for a conditional probability

In summary: P(A| B\cup C) = P(A|B) + P(A|C) - P(A| B \cap C) I'm taking the OPs question at face value. As posed, this is question is about the summation of (conditional) probabilities, not a calculation of posterior probabilities. It seems clear that if B and C are disjoint sets then: P(A|B\cup C)= P(A|B)+P(A|C).This would be the maximum value of the left side of the equation which I understand to be the OP's question. It's not clear to me why you replaced the OP's notation with the notation involving posterior probabilities.
  • #1
sabbagh80
38
0
Hi everyone,

The problem:
Is this relation true? If so, how (or maybe where) it could be proved?P(A│B∪C)≤P(A│B)+P(A│C)-P(A|BC)

and what about its possible generalization?
thanks a lot in advance.
 
Last edited:
Physics news on Phys.org
  • #2
What about this:

[itex] P(x)= 1/8 [/itex] for [itex] x = 1,2,..,8 [/itex]

[tex] B = \{ 1,2,3 \} [/tex]
[tex] C = \{ 3,4,5 \} [/tex]
[tex] A = \{2,3,4,6,7,8 \} [/tex]
 
  • #3
so you mean that this inequality is not always true. But of course we have: P(A│B∪C)≤P(A│B)+P(A│C)
Can we find a better upper bound for P(A│B∪C)?
 
  • #4
sabbagh80 said:
so you mean that this inequality is not always true. But of course we have: P(A│B∪C)≤P(A│B)+P(A│C)
Can we find a better upper bound for P(A│B∪C)?

The upper bound of [tex] P(A|B\cup C)[/tex] is when [tex]P(A|B) + P(A|C)\geq P(A)[/tex]. Draw Venn diagrams to see why.
 
Last edited:
  • #5
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.
 
  • #6
by "better", I mean "tighter" than the derived upper bound. can we further improve this bound?
 
  • #7
sabbagh80 said:
by "better", I mean "tighter" than the derived upper bound. can we further improve this bound?

That doesn't clarify what you want because it doesn't say what quantities are desired on the right hand side.

The equality:
[tex] P(A|B \cup C) = 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]
is "tighter" than any inequality.
 
  • #8
Stephen Tashi said:
That doesn't clarify what you want because it doesn't say what quantities are desired on the right hand side.

The equality:
[tex] P(A|B \cup C) = 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]
is "tighter" than any inequality.

you are right, I have not explain it precisely.
What I mean is this:
If I want to have both P(A|B) and P(A|C) on the right hand side of inequality and I want to find a coefficient for P(A|BC) such that the obtained expression be the tightest upper bound for the left side expression, what is it?
in other words,
[tex] P(A|B \cup C) \leq P(A|B)+P(A|C)-?P(A|B \cap C) [/tex]
 
  • #9
See if I have rephrased you problem correctly:

To find
Max [itex] K [/itex] such that [itex] P(A|B \cup C) \leq P(A|B)+P(A|C)- K P(A|B \cap C) [/itex]


Define:

[tex] P_1 = Pr( A B C) [/tex]
[tex] P_2 = Pr( A B C^c) [/tex]
[tex] P_3 = Pr( A B^c C) [/tex]
[tex] P_4 = Pr( A B^c C^c) [/tex]
[tex] P_5 = Pr( A^c B C) [/tex]
[tex] P_6 = Pr( A^c B C^c) [/tex]
[tex] P_7 = Pr( A^c B^c C) [/tex]
[tex] P_8 = Pr( A^c B^c C^c) [/tex]


The problem becomes: Minimize [itex] K [/itex] subject as a function of the [itex] P_i [/itex] subject to the constraints:

[tex] 0 \leq P_i \leq 1 [/tex]
[tex] \sum_{i=1}^8 P_i = 1 [/tex]
[tex] \frac{P_1 + P_2 + P_3}{P_1 + P_2 + P_3 + P_5 + P_6 + P_7} =
\frac{P_1 + P_2}{P_1 + P_2 + P_5 + P_6} + \frac{P_1 + P_3}{P_1 + P_3 + P_5 + P_7} - K \frac{P_1}{P1 + P_5} [/tex]
 
  • #10
sabbagh80 said:
you are right, I have not explain it precisely.
What I mean is this:
If I want to have both P(A|B) and P(A|C) on the right hand side of inequality and I want to find a coefficient for P(A|BC) such that the obtained expression be the tightest upper bound for the left side expression, what is it?
in other words,
[tex] P(A|B \cup C) \leq P(A|B)+P(A|C)-?P(A|B \cap C) [/tex]

If B and C are disjoint sets then [tex] P(A|B\cup C)=P(A|B)+P(A|C)- (K = P(A|B\cap C))[/tex] where K=0.

The maximum value of K will be the maximal intersection of B and C. K is not a coefficient. It is simply the value of the last term on the right side of the equation. Note the maximum value of the left side is when K=0.
 
Last edited:
  • #11
[tex] P(A|B\cup C)=P(A|B)+P(A|C)- (K = P(A|B\cap C))[/tex] where K=0.
Are we using the same notation? For [itex] P(X|Y) [/itex] meaning "the probability of X given Y" we have:
[tex] P(B \cup C | A) = P(B|A) + P(C|A) - P(B \cap C | A) [/tex]
but not
[tex] P(A| B\cup C) = P(A|B) + P(A|C) - P(A| B \cap C) [/tex]
 
  • #12
Stephen Tashi said:
Are we using the same notation? For [itex] P(X|Y) [/itex] meaning "the probability of X given Y" we have:
[tex] P(B \cup C | A) = P(B|A) + P(C|A) - P(B \cap C | A) [/tex]
but not
[tex] P(A| B\cup C) = P(A|B) + P(A|C) - P(A| B \cap C) [/tex]

I'm taking the OPs question at face value. As posed, this is question is about the summation of (conditional) probabilities, not a calculation of posterior probabilities.

It seems clear that if B and C are disjoint sets then:
[tex]P(A|B\cup C)= P(A|B)+P(A|C).[/tex]

This would be the maximum value of the left side of the equation which I understand to be the OP's question. It's not clear to me why you replaced the OP's notation with the likelihoods.
 
Last edited:
  • #13
this is question is about the summation of (conditional) probabilities
It's not clear to me why you replaced the OP's notation with the likelihoods.

In terms of conditional probabilities, an example of what I'm talking about is:

[itex] P(x)= 1/8 [/itex] for [itex] x = 1,2,..,8 [/itex]

[tex] B = \{ 1,2\} [/tex]
[tex] C = \{ 4,5\} [/tex]
[tex] A = \{2,3,4,6,7,8 \} [/tex]

[tex] P(A|B \cup C) = \frac{ P(\{2,4\} }{P(\{1,2,4,5\}} = (2/8)/(4/8) = 1/2 [/tex]
[tex] P(A|B) = \frac{ P(\{2\})}{P(\{1,2\}} = (1/8)/(2/8) = 1/2[/tex]
[tex] P(A|C) = \frac{ P(\{4\}}{P(\{4,5\})}= (1/8)/(2/8) = 1/2[/tex]

sabbagh80 can say if he means something different.

I don't know what distinction you are making between probabilities and liklihoods.
 
  • #14
Stephen Tashi said:
Are we using the same notation? For [itex] P(X|Y) [/itex] meaning "the probability of X given Y" we have:
[tex] P(B \cup C | A) = P(B|A) + P(C|A) - P(B \cap C | A) [/tex]
but not
[tex] P(A| B\cup C) = P(A|B) + P(A|C) - P(A| B \cap C) [/tex]

Stephen Tashi said:
I don't know what distinction you are making between probabilities and liklihoods.

The top line of terms above are the likelihoods of the corresponding terms of the bottom line.
 
Last edited:
  • #15
I'm satisfied with both comments #5 and #9 (by "Stephen Tashi").
I also thank "SW VandeCarr" for his/her useful discussions.
 

1. What is an upper bound for a conditional probability?

An upper bound for a conditional probability is the maximum possible value that the probability of an event occurring can have, given certain conditions or information. It is a way to limit the range of potential probabilities and provide a more precise estimation.

2. How is an upper bound for a conditional probability calculated?

The upper bound for a conditional probability is typically calculated using mathematical formulas or equations, depending on the specific scenario. It may involve considering the probability of multiple events occurring together, or taking into account previous probabilities or information.

3. What is the purpose of determining an upper bound for a conditional probability?

Determining an upper bound for a conditional probability can be useful in many contexts, such as risk assessment, decision-making, and statistical analysis. It allows for a more accurate estimation of the likelihood of an event occurring, and can help in making informed decisions based on this information.

4. Can an upper bound for a conditional probability change?

Yes, an upper bound for a conditional probability can change depending on the conditions or information being considered. As more data or information is gathered, the upper bound may shift to reflect a more precise estimation of the probability of an event occurring.

5. How does an upper bound for a conditional probability differ from a lower bound?

An upper bound for a conditional probability represents the maximum possible value, while a lower bound represents the minimum possible value. Together, these bounds can provide a range within which the true probability is likely to fall.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
0
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
814
  • Set Theory, Logic, Probability, Statistics
Replies
7
Views
446
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
926
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
16
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
4K
  • Set Theory, Logic, Probability, Statistics
Replies
7
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
Back
Top