Core Probability Rules

1 Core Probability Rules

Probability is the mathematical language we use to describe uncertainty. Whether we are asking how likely it is to roll a six on a fair die, draw an ace from a shuffled deck, or have two independent systems both fail on the same day, we need precise rules to calculate and combine probabilities without error. The core rules of probability form the foundation of all probabilistic reasoning: the complement rule, the addition rules, the multiplication rules, and the concept of conditional probability. Mastering these rules and knowing exactly when each one applies is essential before tackling any multi-step probability problem.

Before diving into individual rules, it helps to recall one non-negotiable constraint: for any well-defined sample space, the probabilities of all possible outcomes must sum to exactly 1. This single constraint spawns an enormous amount of useful reasoning, starting with the simplest rule of all.

Complementary Probability

Every event A within a sample space has a complement, written A' (read "A prime" or "not A"), which consists of every outcome that is not in A. Because A and A' together cover the entire sample space without overlapping, their probabilities must add to 1:

P(A) + P(A') = 1

Rearranging gives two equally useful forms:

P(A') = 1 - P(A)
P(A)  = 1 - P(A')

The power of the complement rule lies in the second form. Many problems ask for the probability that some event happens at least once or that not all outcomes are of a particular type. Computing those probabilities directly can require listing dozens of cases. Computing the complement — the probability that the event never happens or that all outcomes are of a particular type — is often a single, clean calculation.

Example: A bag contains 4 red marbles and 6 blue marbles. You draw one marble at random. What is the probability it is not red?

• P(red) = 4/10 = 0.4
• P(not red) = 1 − 0.4 = 0.6

Example using the "at least one" pattern: You flip a fair coin 5 times. What is the probability of getting at least one head?

• The complement of "at least one head" is "zero heads," meaning all 5 flips are tails.
• P(all tails) = (1/2)⁵ = 1/32 ≈ 0.031
• P(at least one head) = 1 − 1/32 = 31/32 ≈ 0.969

Without the complement rule, you would need to add up the probabilities of getting exactly 1, 2, 3, 4, and 5 heads — five separate calculations. The complement reduces the work to one.

One important caution: the complement rule applies to a single, well-defined event within a fixed sample space. If the sample space itself changes between scenarios, the rule must be re-applied fresh for each scenario.

The Addition Rule for Mutually Exclusive Events

Two events are mutually exclusive (also called disjoint) if they cannot both occur at the same time. In set terms, their intersection is the empty set: P(A and B) = 0. Rolling a 3 and rolling a 5 on a single die roll are mutually exclusive. Drawing a heart and drawing a spade from a single card draw are mutually exclusive.

When events are mutually exclusive, the probability that at least one of them occurs is simply the sum of their individual probabilities:

P(A or B) = P(A) + P(B)    [only when A and B are mutually exclusive]

This formula extends naturally to any number of mutually exclusive events:

P(A or B or C or ...) = P(A) + P(B) + P(C) + ...

Example: A single card is drawn from a standard 52-card deck. What is the probability of drawing a king or a queen?

• A card cannot be both a king and a queen simultaneously — the events are mutually exclusive.
• P(king) = 4/52, P(queen) = 4/52
• P(king or queen) = 4/52 + 4/52 = 8/52 ≈ 0.154

Identifying mutual exclusivity is the critical first step. Students who apply this simpler formula to events that actually can overlap will overcount, arriving at a probability that is too high — sometimes even greater than 1, which is an immediate signal that an error has occurred.

The General Addition Rule

When two events can occur simultaneously — that is, when they are not mutually exclusive — adding their individual probabilities counts the outcomes in their intersection twice: once for event A and once for event B. To correct for this double-counting, we subtract the probability of the intersection:

P(A or B) = P(A) + P(B) - P(A and B)

This is the General Addition Rule. It works universally: if A and B happen to be mutually exclusive, then P(A and B) = 0 and the formula reduces to the simpler version. The general rule therefore subsumes the mutually exclusive version; you can always use the general formula and never go wrong, but knowing mutual exclusivity lets you skip computing P(A and B).

Example: From a standard 52-card deck, one card is drawn. What is the probability that it is a heart or a face card (jack, queen, king)?

• These events overlap: the jack, queen, and king of hearts are both hearts and face cards.
• P(heart) = 13/52
• P(face card) = 12/52 (4 jacks + 4 queens + 4 kings)
• P(heart and face card) = 3/52 (jack, queen, king of hearts)
• P(heart or face card) = 13/52 + 12/52 − 3/52 = 22/52 ≈ 0.423

A useful visual check: think of a Venn diagram. You paint region A, then paint region B. The overlapping region gets painted twice, so you must unpaint it once to get the true area of the union.

The Multiplication Rule for Independent Events

Two events are independent if the occurrence of one has absolutely no effect on the probability of the other. Flipping a coin and rolling a die are independent. Drawing a card, replacing it, shuffling, and drawing again produces independent draws. When independence holds, the probability that both events occur is the product of their individual probabilities:

P(A and B) = P(A) × P(B)    [only when A and B are independent]

This extends to any chain of independent events:

P(A and B and C and ...) = P(A) × P(B) × P(C) × ...

Example: A fair coin is flipped and a fair six-sided die is rolled. What is the probability of getting heads and a 4?

• The coin flip and the die roll are independent.
• P(heads) = 1/2, P(4) = 1/6
• P(heads and 4) = 1/2 × 1/6 = 1/12 ≈ 0.083

Example with repeated trials: A production line produces items with a 2% defect rate. Three items are chosen independently (with replacement from a very large batch). What is the probability all three are defective?

• P(defective) = 0.02 for each item independently.
• P(all three defective) = 0.02 × 0.02 × 0.02 = 0.000008

Confirming independence before applying this rule is essential. A common error is assuming that two events are independent simply because they seem unrelated in everyday language, without verifying that knowing about one truly does not change the probability of the other. If that condition fails even partially, the general multiplication rule must be used instead.

The General Multiplication Rule and Conditional Probability

When events are dependent — meaning the occurrence of one changes the likelihood of the other — we cannot simply multiply individual probabilities. Instead, we use the General Multiplication Rule:

P(A and B) = P(A) × P(B|A)

Here, P(B|A) is the conditional probability of B given that A has already occurred. It is read "the probability of B given A." The vertical bar | always means "given that." The formula says: to find the probability that both A and B happen, multiply the probability that A happens by the probability that B happens under the condition that A already happened.

The formula can also be written starting from B:

P(A and B) = P(B) × P(A|B)

Both expressions are equivalent because the intersection of A and B is the same set regardless of which direction you approach it from.

Note the elegant relationship between the general and independent versions: if A and B are independent, then P(B|A) = P(B) — knowing A happened tells you nothing new about B — so the general formula simplifies directly to P(A) × P(B). Independence is therefore a special case of the general rule, not a separate framework.

Example — Sampling without replacement: A deck of 52 cards has no replacement between draws. What is the probability that the first card is an ace and the second card is also an ace?

• P(first card is ace) = 4/52
• P(second card is ace | first card was an ace) = 3/51 — because one ace and one card have already been removed from the deck.
• P(both aces) = 4/52 × 3/51 = 12/2652 = 1/221 ≈ 0.00452

Conditional probability on its own is also derivable from the general rule. Rearranging P(A and B) = P(A) × P(B|A) gives:

P(B|A) = P(A and B) / P(A)    [provided P(A) > 0]

Example — Using the conditional probability formula directly: In a class of 30 students, 12 play soccer, 8 play basketball, and 5 play both. Given that a randomly selected student plays soccer, what is the probability they also play basketball?

• P(soccer) = 12/30
• P(soccer and basketball) = 5/30
• P(basketball | soccer) = (5/30) ÷ (12/30) = 5/12 ≈ 0.417

Dependent events arise most naturally when sampling without replacement, when items are drawn from a shared pool, or when the result of one trial physically changes the environment for the next. Always ask: "Does knowing that A occurred change the probability that B occurs?" If yes, dependence is present and the general multiplication rule is required.

Applying the Rules Together in Multi-Step Problems

Real-world probability questions rarely call for just one rule in isolation. They typically require you to (1) identify the structure of the events, (2) select the appropriate rules, and (3) combine calculations across multiple steps. A disciplined approach prevents errors.

The first and most important step is classifying the events:

• Are the events mutually exclusive (cannot happen together)? If yes, use the simple addition rule.
• Do the events overlap (can happen together)? Use the general addition rule.
• Are successive events independent (draws with replacement, separate trials)? Use the simple multiplication rule.
• Are successive events dependent (draws without replacement, conditional scenarios)? Use the general multiplication rule with conditional probability.

Strategic use of the complement rule is the second key skill. Whenever a question asks for "at least one," "at least two," "not all," or any phrasing that implies many favorable cases, check whether the complement is simpler. If the complement involves a single clean case — like "none" or "all fail" — compute that and subtract from 1.

Probability trees are especially helpful for multi-step sequential problems. Each branch represents one outcome of one step, labeled with its probability. The probability of any complete path from root to leaf is the product of the branch probabilities along that path (applying the multiplication rule). To find the probability of an event that spans multiple paths, you add the path probabilities (applying the addition rule for mutually exclusive paths).

Two-way frequency tables (also called contingency tables) are powerful for problems involving two categorical characteristics, especially when computing conditional probabilities. Read cell frequencies directly from the table to find joint and marginal probabilities.

Worked multi-step example: A box contains 6 red chips and 4 blue chips. Two chips are drawn without replacement. What is the probability that at least one chip is red?

• Complement approach: P(at least one red) = 1 − P(no red) = 1 − P(both blue)
• P(first chip is blue) = 4/10
• P(second chip is blue | first was blue) = 3/9 (dependent — no replacement)
• P(both blue) = 4/10 × 3/9 = 12/90 = 2/15 ≈ 0.133
• P(at least one red) = 1 − 2/15 = 13/15 ≈ 0.867

Compare this to the direct approach, which would require computing P(exactly one red) + P(both red) — two separate calculations, each involving two branches — then adding them. The complement route is clearly more efficient.

Summary of the core rules:

Fluency with these rules means more than memorizing formulas. It means developing the habit of pausing before calculating to ask: Are these events mutually exclusive or overlapping? Are they independent or dependent? Would the complement be simpler? Answering those three questions correctly determines everything that follows, and doing so consistently is what separates careful probabilistic reasoning from error-prone guessing.