Seyed Masoud Hosseini · Overview · Study log · Weekly summaries · Ideas · Search · Transcript · RSS feed

Probability · Lecture 7 of 76 · 14:22

Conditional Probability Example

Conditional Probability Example on YouTube

Study guide

What this lecture covers

This recitation problem works through several conditional-probability calculations on the classic two-dice sample space, reinforcing both the discrete uniform law and the definition of conditional probability. It also compares two ways of solving the same question: applying the definition directly, versus reasoning about a smaller "conditional universe."

The problem builds up from a simple unconditional probability to conditioning on multiple different events, ending with a clear statement of when the shortcut method works.

Key ideas

  • Discrete uniform law: with 36 equally likely outcomes for two dice, any event's probability is its outcome count divided by 36.
  • Doubles as a baseline event: the probability that both dice show the same number is 6/36 = 1/6.
  • Definition-based conditioning: P(D|sum≤4) = P(D ∩ sum≤4) / P(sum≤4), computed by counting outcomes in numerator and denominator separately.
  • Shortcut: conditioning restricts the sample space: since conditioning preserves relative likelihoods, the conditional probability of a uniform model is still uniform, just over the reduced set of outcomes.
  • Two independent applications: the same reasoning is used for "sum ≤ 4" and "the two dice land on different numbers," both giving matching answers by either method.

Walkthrough

Setting up the discrete uniform law (0:00)

The video reviews the discrete uniform law — when all outcomes are equally likely, probability reduces to counting — and applies it to find the probability of rolling doubles on two fair dice: 6 favorable outcomes out of 36, or 1/6.

Conditioning on the sum being small (5:28)

The problem asks for the probability of doubles given that the sum of the two rolls is at most 4. It's solved two ways: first by directly applying the definition of conditional probability and counting outcomes in the numerator and denominator, then by treating the six outcomes with sum ≤ 4 as a new, smaller uniform sample space and counting doubles within it. Both methods give 1/3, and the second is shown to be faster because conditioning doesn't change the relative likelihood of remaining outcomes.

Conditioning on rolling different numbers (8:47)

The video finds the unconditional probability of rolling at least one 6 (11/36), then conditions on the event that the two dice show different numbers, which removes the 6 diagonal (doubles) outcomes, leaving 30 equally likely outcomes. Counting how many of those include at least one 6 gives 10/30 = 1/3, again matching what the definition-based method would produce.

Before you watch

  • Know the discrete uniform law and the definition of conditional probability, covered in the first two lectures of this course.
  • It helps to be comfortable visualizing outcomes for two dice as points on a grid.

Check your understanding

  1. Why does conditioning on "sum ≤ 4" let you treat the six matching outcomes as a new uniform sample space?
  2. What is the difference between solving a conditional probability using the definition versus using the "conditional universe" shortcut?
  3. Why does removing the 6 doubles outcomes leave exactly 30 outcomes when conditioning on "different numbers"?
  4. Would the shortcut method still work if the original 36 outcomes were not equally likely?

Vocabulary

doubles (noun)
The result of two dice showing the same number.
Rolling doubles happens in 6 of the 36 possible outcomes.
baseline (noun)
A simple starting value used for comparison with later results.
The unconditional probability of doubles is the baseline for this problem.
reduced sample space (noun)
A smaller set of outcomes left after conditioning on some event.
Conditioning on the sum being at most 4 gives a reduced sample space.
shortcut (noun)
A faster method that reaches the same correct answer with less work.
Treating the reduced set as uniform is a useful shortcut.
relative likelihood (noun)
How likely one outcome is compared to another.
Conditioning preserves the relative likelihood among remaining outcomes.
conditional universe (noun)
A smaller sample space made of only the outcomes allowed by a condition.
The shortcut works by reasoning within a smaller conditional universe.
definition-based (adjective)
Solved by directly applying a formal definition rather than a shortcut.
The definition-based method counts outcomes in numerator and denominator separately.
reinforce (verb)
To strengthen an idea by showing it again in a new example.
The second example reinforces the uniform-conditioning shortcut.
drill (noun)
A repeated practice exercise meant to build a skill.
This problem is a drill on the discrete uniform law.
fair (dice) (adjective)
Having every outcome equally likely, with no bias.
Two fair dice give 36 equally likely outcomes.
grid (of outcomes) (noun)
A table-like layout showing every combination of two variables.
The two-dice outcomes can be visualized as points on a grid.
compare (methods) (verb)
To look at two approaches side by side to see how they relate.
The video compares the definition-based and shortcut methods.
confirm (verb)
To show that something is indeed true.
Both methods confirm the same final probability.
at most (phrase)
Not more than a stated amount.
The sum of the two dice is at most 4.
matching outcomes (noun)
Outcomes that satisfy a stated condition together.
The six matching outcomes form the new conditional sample space.
faster (method) (adjective)
Quicker to complete while still reaching the correct result.
The shortcut method is shown to be faster than the definition method.
reasoning (noun)
The process of thinking through a problem logically.
The same reasoning applies to a different conditioning event.
diagonal (noun)
The line of outcomes where both dice show the same number.
The doubles outcomes form the diagonal of the grid.
outcome count (noun)
The total number of individual outcomes belonging to an event.
The outcome count for doubles is 6 out of 36.
reinforcement (practice) (noun)
Repeated exposure that strengthens understanding of a concept.
This problem gives reinforcement of the discrete uniform law.

Chapters

From the YouTube description

MIT 6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013
View the complete course: http://ocw.mit.edu/6-041SCF13
Instructor: Katie Szeto

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

← A Coin Tossing Puzzle · The Monty Hall Problem →