Skip to main content

Welcome to a Grasp lesson

Create a free account to keep studying and create your own study path.

Lesson 35

Classical Probability

Recommended resources

In our previous lesson, we established the foundational vocabulary of probability by defining random experiments, sample spaces, and events. You learned to see the sample space () as the complete set of all possible outcomes and an event () as any subset of those outcomes (). This set-theoretic framework is the perfect launchpad for what comes next.

Now that we can clearly define the "universe" of possibilities and the specific outcomes we care about, our goal is to assign a numerical value to an event that quantifies its likelihood. This lesson introduces the first and most intuitive method for doing so: the classical definition of probability. We will learn the core formula and, just as importantly, the critical assumption upon which it rests.

The Classical Definition: A Ratio of Counts

The classical approach to probability, developed from analyzing games of chance, is elegant in its simplicity. It defines the probability of an event as the ratio of the number of outcomes that constitute the event to the total number of possible outcomes in the sample space.

This is often expressed as:

Given our work with set theory, we can state this more formally. If is the sample space and is an event, the probability of is:

where denotes the cardinality (the number of elements) of the set .

This image illustrates the classical probability formula, P(A) = n(A) / n(S), connecting the concept of an event (A) and the sample space (S) to their respective counts.

This definition has one crucial prerequisite: all elementary outcomes in the sample space must be equally likely. A fair coin, a balanced die, or a well-shuffled deck of cards are all physical systems designed to satisfy this condition.

Let's ground this with a formal definition from a set of lecture notes on probability.

probability.pdf

These notes from a Cambridge University course provide a concise, formal introduction to classical probability.

Please read the section titled 1.1 Classical probability. Focus on the initial definition and then the formal definition of probability using set notation. Note the explicit mention that this assumes equally likely outcomes.


From Formula to Calculation

With the definition in hand, let's apply it. The process is a direct follow-on from our last lesson:

  1. Identify the random experiment.
  2. Enumerate all outcomes to define the sample space, , and find its size, .
  3. Identify the outcomes corresponding to the event of interest, , and find its size, .
  4. Calculate the ratio .

The following video walks through this process with several clear examples, including rolling a die, picking cherries from a bag, and drawing a card from a deck.

Probability statistics tutorial || Probability for data science

This video from the My CS channel provides a step-by-step guide to calculating basic probabilities.

Watch from this segment, where the narrator computes the probability of rolling a specific number on a die and then rolling a number within a certain range. Continue with the next two examples on cherries and cards. Notice how in each case, the first step is always to determine the total number of outcomes (|S|) and the number of favorable outcomes (|A|).

This infographic breaks down the classical probability calculation for a simple coin flip. The experiment has two equally likely outcomes (Heads, Tails), making the probability of getting heads 1/2 or 50%.

A More Involved Example: Rolling Two Dice

Let's apply this to a more complex experiment we analyzed in the previous lesson: rolling two six-sided dice. As we established, the sample space consists of 36 equally likely ordered pairs, from (1, 1) to (6, 6). So, .

Now, let's calculate the probability of a few events:

  • Event A: The sum of the dice is 7.
    The outcomes that satisfy this event are .
    The size of the event set is .
    Therefore, the probability is .

  • Event B: Both dice show the same number (doubles).
    The outcomes are .
    The size of the event set is .
    The probability is .

The following reading walks through a similar example from the casino game of craps, showing how to systematically identify the winning outcomes and calculate the probability.

5.3: How to Calculate Classical Probability - Statistics LibreTexts

This article from Statistics LibreTexts provides a detailed, practical application of classical probability using the Field bet in craps.

Start by reviewing the probability formula in the section beginning "After carefully listing". Then, follow the Field Bet example. Read how the author first constructs the sample space of 36 outcomes. Finally, see how the event (winning numbers) is identified as a subset of the sample space to calculate the final probability.


The Principle of Indifference

The condition that outcomes must be "equally likely" or "equally possible" is the most important constraint of the classical model. But what does it mean? The 18th-century mathematician Pierre-Simon Laplace articulated this with what is now called the Principle of Indifference: if we have no reason to believe one outcome is more probable than another, we should assign them equal probabilities.

This principle works perfectly for idealized systems like fair dice, where physical symmetry provides a strong reason to assume each face is equally likely to land up. However, it also highlights the limits of this interpretation. We cannot use it to determine the probability that a biased coin will land heads, or the probability of rain tomorrow, as the outcomes are not symmetrical or equally likely.

The video below discusses this core assumption and its philosophical underpinnings.

Probability: The Classical Interpretation

This video by philosopher Kevin deLaplante explores the logic behind the classical interpretation of probability.

Watch the explanation of the core idea, which defines probability as the ratio of favorable to total cases, using coin and dice examples. Next, focus on the discussion about the critical condition of "equally possible" outcomes and how Laplace's Principle of Indifference provides a justification for this assumption.

From a computer science perspective, this principle is implicitly used in many algorithms. When you use a random number generator to select an index from an array of size , you assume that each index has a probability of being chosen. This is a direct application of classical probability, predicated on the assumption that your random function generates outcomes with uniform likelihood.


Conclusion

In this lesson, we took the crucial step from describing possibilities to quantifying them. By learning the classical definition of probability, you can now calculate the likelihood of events in a wide range of well-defined scenarios.

Key Takeaways:

  • The classical probability of an event is the ratio of the number of outcomes in to the total number of outcomes in the sample space .
  • The formula is .
  • This definition is only valid when all elementary outcomes in the sample space are equally likely.
  • The Principle of Indifference provides the logical basis for assuming outcomes are equally likely when there is no evidence to the contrary.

We've focused on the probability of single events. But what if we are interested in the probability of event A or event B occurring? In our next lesson, we will explore this question by learning about the addition rule of probability, which allows us to combine probabilities of different events.