Probability Concepts: Mutually Exclusive Events, Venn Diagrams, Sample Space, and 5-Card Hand Calculation
Mutually Exclusive Events
Mutually exclusive means the events cannot happen at the same time.
Example from lecture: rolling doubles and obtaining a sum of five cannot both occur on a single roll of two dice.
Another example: rolling a sum of seven has the same probability as rolling doubles, but they are mutually exclusive (no overlap).
Therefore, if A and B are mutually exclusive, the intersection probability is
P(A\cap B)=0,
and the union probability simplifies to
P(A\cup B)=P(A)+P(B).Visual aid: the Euler diagram for mutually exclusive events is two separate circles with no overlap.
Union and Intersection (basic rules)
For any events A and B (not assuming exclusivity):
P(A\cup B)=P(A)+P(B)-P(A\cap B).If A and B are mutually exclusive, the intersection term drops out:
P(A\cup B)=P(A)+P(B).If you’re given the union and the individuals but you know they’re disjoint, you can still use the general formula and recognize that the intersection term is 0.
Venn Diagrams, Regions, and Partitions
Venn diagrams help visualize the decomposition of outcomes into mutually exclusive regions.
For two events A and B, the diagram partitions the universe into four regions:
A only, B only, A∩B, and neither A nor B.
The probability of any event is the sum of the probabilities of the regions that comprise that event.
Important note: the entire universe (sample space) always sums to 1 (or 100%).
The regions inside the circles are mutually exclusive; they don’t overlap, even though the circles themselves may intersect.
If you know the probabilities of the regions, you can obtain the probability of any compound event by summing the appropriate regions.
Probability Distributions vs Relative Frequencies
A probability distribution table lists mutually exclusive outcomes (events) and their probabilities.
Each entry corresponds to a region/outcome that is disjoint from the others
and the sum of all probabilities equals 1:
\sumi P(Ei)=1.Relative frequency table (from data) approximates probabilities but is based on observed frequencies; a probability distribution is the theoretical counterpart.
A distribution table often partitions the sample space into non-overlapping parts; those parts are a partition of the sample space.
In a distribution table, every entry is typically a positive probability (no zero if you’re listing only outcomes that can occur, though you may include a zero-probability category for completeness).
A probability distribution table is analogous to a partition of the sample space S: S is the union of disjoint events whose probabilities sum to 1.
The Sample Space and Cardinality
The sample space S is the set of all possible outcomes.
The cardinality of S is denoted |S| or n(S).
When working with card decks, specific problems require counting outcomes in S and the favorable outcomes for the event of interest.
Notation for counting combinations:
Often written as \binom{n}{k} (also denoted NCR in some calculators) meaning “n choose k.”
Alternative calculator input: you might see 52C5 or (52 5) to denote the same thing.
The sample space cardinality influences which counting method to use (combinatorial vs. exponential vs. permutation). If the order matters, use permutations; if order does not matter, use combinations.
The 5-Card Hand Example: Hearts in a Hand
Scenario: deal a five-card hand from a standard 52-card deck and ask how many hearts are in the hand.
Key quantities:
Total cards in deck: N=52.
Total hearts in deck: K=13. (13 hearts, 39 non-hearts)
Hand size: n=5. (order does not matter for a hand; this is a “without replacement” scenario)
Total number of five-card hands (the denominator):
N(S)=\binom{52}{5}=2{,}598{,}960.Number of hands with exactly k hearts:
N_k = \binom{13}{k}\binom{39}{5-k},\quad k=0,1,2,3,4,5.Probability of exactly k hearts in a five-card hand:
P(k\text{ hearts})=\frac{N_k}{N(S)}=\frac{\binom{13}{k}\binom{39}{5-k}}{\binom{52}{5}}.Example calculation (k=3):
Number of favorable hands: N3=\binom{13}{3}\binom{39}{2}=\ \binom{13}{3}=286,\ \binom{39}{2}=741,\ N3=286\times 741=211{,}926.
Probability: P(3\text{ hearts})=\frac{211{,}926}{2{,}598{,}960}\approx 0.0815.
Example: k=5 (all hearts):
N_5=\binom{13}{5}\binom{39}{0}=\binom{13}{5}=1287.
P(5\text{ hearts})=\frac{1287}{2{,}598{,}960}\approx 0.000496.
The set of six probabilities (k=0,1,2,3,4,5) partitions the sample space of five-card hands by the number of hearts in the hand.
Practical calculation tips from lecture:
Start with the denominator (the size of the sample space) N(S)=\binom{52}{5}.
Then fill in the numerators for each k using N_k=\binom{13}{k}\binom{39}{5-k}.
Use the hypergeometric reasoning: you’re drawing without replacement from two sub-populations (hearts vs non-hearts).
If you use a decision-tree approach, you would multiply the ways to select the hearts by the ways to select the non-hearts (dependent steps). In practice, using the binomial-coefficient counts is typically easier.
Important nuance: the problem is a without-replacement drawing from a finite deck; hence order does not matter for the hand, so combinations are appropriate.
Practical Calculations: Notation and Calculator Tips
Notation recap:
52 choose 5 can be written as \binom{52}{5} or 52C5 or (52 5) depending on the calculator.
Calculator tips:
Use the NCR (nCr) function to compute combinations directly.
For a single calculation, you can enter \binom{13}{3} \times \binom{39}{2} and then divide by \binom{52}{5} in one expression with parentheses to ensure order of operations.
Denominator is common to all k values; the numerator varies with k.
Decision Trees vs Direct Counting in Probability
Decision-tree approach: enumerate branches for each draw and multiply the counts across levels (useful for sequential events and conditional structures).
Direct counting with combinations: often simpler for card problems where order does not matter and you’re counting distinct hands.
Key idea: when you see an “and” condition, think about the intersection of independent choices; the counts multiply when branches are independent in the decision tree.
Important Checks and Probabilistic Reasoning
Basic sanity checks:
Probabilities must lie in [0,1]. If you get a negative probability or a value greater than 1, there’s a calculation error.
If a probability is 0, that event can never occur; if it’s 1, the event always occurs.
For a complete partition of the sample space, the probabilities of all regions sum to 1:
\sumi P(Ei)=1.
If you know two events are mutually exclusive, you can add their probabilities to obtain the union probability directly.
Always verify you’ve accounted for all possible outcomes (e.g., in the hearts example, include k=0,1,2,3,4,5).
Zero or one sometimes appear for edge cases (e.g., probability of sum 15 with two fair dice is 0; probability of sum less than 15 is 1).
Quick Real-World Connections and Examples
Card games and card-drawing problems are classic illustrations of sampling without replacement and hypergeometric distributions. The same approach generalizes to many practical settings (e.g., quality control, survey sampling).
The grant/tenure example in the transcript touches on conditional probability: given some condition (e.g., years of service), what is the probability of a separate outcome (e.g., grant denial)? This is a precursor to conditional probability concepts (P(A|B)).
The two-hats or two-urns illustration mirrors the idea of partitioning the sample space into disjoint subspaces and then combining results multiplicatively when selecting from each partition.
Summary of Key Formulas to Remember
Union and intersection:
P(A\cup B)=P(A)+P(B)-P(A\cap B).Mutually exclusive:
A\cap B=\emptyset \Rightarrow P(A\cap B)=0 \Rightarrow P(A\cup B)=P(A)+P(B).Probability distribution over a partition of the sample space:
If the region events are disjoint and cover S, then
\sumi P(Ei)=1.
Card deck hand counting:
Denominator (total hands):
N(S)=\binom{52}{5}=2{,}598{,}960.Favorable hands for k hearts:
N_k=\binom{13}{k}\binom{39}{5-k}.Probability of exactly k hearts:
P(k\text{ hearts})=\frac{N_k}{N(S)}=\frac{\binom{13}{k}\binom{39}{5-k}}{\binom{52}{5}}.
Example for k=3 hearts:
N_3=\binom{13}{3}\binom{39}{2}=211{,}926.
P(3\text{ hearts})=\frac{211{,}926}{2{,}598{,}960}\approx 0.0815.
Notation and calculator input:
\binom{n}{k} is the binomial coefficient (n choose k).
Common shorthand: 52C5, (52 5), or 52 choose 5 depending on the tool.
Quick recap: when you’re stuck
Start with the size of the sample space S.
Identify whether the problem is with replacement or without replacement.
Determine if you should use combinations (order doesn’t matter) or permutations (order matters).
Build the correct counting expression for the number of favorable outcomes, then divide by |S| to obtain the probability.
Check that the probabilities sum to 1 if you’re enumerating all mutually exclusive outcomes.
Next topics hinted in lecture
Conditional probability P(A|B) and how to compute it from a partitioned sample space.
Deeper practice with probability distributions and two-way tables as alternatives to Venn diagrams.
More worked examples to solidify the method for different kinds of questions (e.g., different numbers of categories, with/without replacement, and more complex event descriptions).