Analyzing the Setup
We are given three events E, F, and G with the following probabilities:
P(E)=81, P(F)=61, and P(G)=41.
The intersection of all three events is given as:
P(E∩F∩G)=101
The Non-Negativity Constraint
The fundamental rule of probability dictates that no disjoint region within a set can have a negative probability. For event
E, the sum of its disjoint parts must satisfy:
P(E∩F∩Gc)+P(E∩F∩G)≤P(E)
Substituting the known values:
P(E∩F∩Gc)+101≤81
Solving for the intersection, we find:
P(E∩F∩Gc)≤81−101=405−4=401
Thus, Option A is verified.
Applying the same logic to event
F:
P(Ec∩F∩G)+P(E∩F∩G)≤P(F)
P(Ec∩F∩G)+101≤61
Solving this yields:
P(Ec∩F∩G)≤61−101=305−3=302=151
Thus, Option B is verified.
The Power of Boole's Inequality
To evaluate the union
P(E∪F∪G), we utilize Boole's Inequality, which states that the probability of a union is at most the sum of the individual probabilities:
P(E∪F∪G)≤P(E)+P(F)+P(G)
Substituting the given values:
P(E∪F∪G)≤81+61+41=243+4+6=2413
Thus, Option C is verified.
The De Morgan Trap
Finally, we examine the region outside all events, denoted as P(Ec∩Fc∩Gc). By De Morgan's Laws, this is equivalent to 1−P(E∪F∪G).
Since
P(E∪F∪G)≤2413, it follows that:
P(Ec∩Fc∩Gc)≥1−2413=2411
Option D claims this probability is ≤125 (which is 2410). Since 2411>2410, this statement is mathematically impossible.
Option D is false.