The Architecture of Probability
A Journey Through Partitions
Welcome, future engineer. Today, we are not just solving a probability problem; we are dissecting the very structure of how we view uncertainty.
When we talk about a sample space S partitioned into events H1,H2,…,Hn, we are building a map. Imagine a vast, flat landscape where these events are the provinces that divide this land.
Because they are mutually exclusive, no two provinces overlap. Because they are exhaustive, they cover the entire map without leaving a single patch of dirt unclaimed. This is the bedrock of our problem.
Phase 1
The Truth of Statement-2
Let us look at Statement-2: ∑i=1nP(Hi)=1. Is this true? Absolutely.
Since these events are exhaustive, their union is the entire sample space S. By the fundamental axioms of probability, the probability of the entire sample space is P(S)=1.
Therefore, the sum of the probabilities of these disjoint, exhaustive events must equal 1. This is a rock-solid truth and our first anchor point.
Phase 2
The Conditional Lens
Now, we introduce event E. Think of E as a spotlight shining onto our map. It might illuminate parts of H1, parts of H2, or perhaps it misses some provinces entirely.
We are asked to evaluate the inequality P(Hi∣E)>P(E∣Hi)⋅P(Hi). To understand this, we must use the definition of conditional probability.
We know that P(Hi∣E)=P(E)P(Hi∩E). This is the probability of Hi occurring, given that we are restricted to the region illuminated by E.
Simultaneously, the multiplication rule tells us that P(Hi∩E)=P(E∣Hi)P(Hi). If we substitute this into our conditional probability formula, we get:
P(Hi∣E)=P(E)P(E∣Hi)P(Hi)
Phase 3
The Algebraic Trap
Here is where the intuition kicks in. We are given 0<P(E)<1. This is a crucial piece of information.
If P(E) is a fraction between 0 and 1, then its reciprocal, P(E)1, is strictly greater than 1. Let us rewrite our equation to highlight this:
P(Hi∣E)=P(E)1⋅[P(E∣Hi)P(Hi)]
If we look at this, it seems like we are multiplying the term P(E∣Hi)P(Hi) by a factor greater than 1. If the intersection P(Hi∩E) is positive, then yes, P(Hi∣E) will indeed be strictly greater than P(E∣Hi)P(Hi). It feels like we have proven the inequality.
Phase 4
The Moment of Clarity
But wait. In JEE Advanced, the devil is always in the details. The statement claims this inequality holds for all i=1,2,…,n.
What if there exists an event Hk such that Hk∩E=∅? In this scenario, the intersection is empty, and the probability P(Hk∩E)=0.
If we plug this into our inequality, we get 0>0. This is mathematically false. The inequality fails.
Because the problem does not guarantee that E intersects with every single partition Hi, we cannot claim the inequality holds for all i.
Conclusion
This is the beauty of the problem. It teaches us that in mathematics, a universal quantifier like 'for all' is a heavy burden.
It only takes one counter-example—one province that the spotlight of E misses—to bring the entire statement crashing down. Statement-2 is true, but Statement-1 is false.
We have navigated the trap, understood the geometry of the sample space, and emerged with the correct answer: Option (d). Keep this rigor in your toolkit; it will serve you well.