Summary

Introduced probability as the study of experiments and outcomes. Discussed sample spaces, events, the Fundamental Principle of Counting, permutations, and combinations. Covered unions and intersections of events, leading into the Inclusion-Exclusion Formula.


Probability is frequently the study of experiments, outcomes, and events.

Example

Experiment Outcomes

  • Rolling a die {1,,6}
  • Flipping a coin {heads,tails}

The collection of outcomes is called a sample space (Ω), which can be finite or infinite. We will mostly concern ourselves with finite sample spaces in this course. A roll of a die has a finite sample space, while ,,, are infinite.

Definition

A probability (𝜔) on a sample space Ω is a real number {0,1} given to each possible outcome in a sample space, such that 𝜔Ω(𝜔)=1

The probability measure where all outcomes are equally likely is the uniform distribution. Each element has probability

(𝜔)=1|Ω|𝜔Ω

Definition

An event is a subset of the sample space.

Intuitively, an event is a collection of outcomes.

Example

𝐴={outcome of rolling a die to odd number}={1,3,5} is an event with sample space {1,,6}.

Definition

The probability of an event 𝐴Ω is (𝐴)𝜔𝐴(𝜔)

Intuitively, we sum the probability of each event individually.

Example

Rolling two dice. Ω={(𝑖,𝑗):1𝑖,𝑗6,𝑖,𝑗}={(1,1),(1,2),(6,6)}.

Question

What is |Ω|?

Solution 6×6=36.

36, since there are 6 values for each coordinate, and

Problem

𝐴={𝑖+𝑗=5}={(1,4),(2,3),(3,2),(4,1). (𝐴)=436

Example

Flip a coin three times. Ω={HHH,HHT,HTT,THT,TTH,HTH,THH,TTT}. |Ω|=8=2×2×2.

  • 𝐴={At most one H}={HTT,THT,TTH}. (𝐴)=38.

Example

Flip a coin 𝑛 times. We don’t have a closed form for a general 𝑛, but notice that |Ω|=2𝑛.

For a general 𝑛, a natural probability measure is the general uniform measure.

(𝜔)=12𝑛

𝐴={Tossing coin n times, we get k heads}. (𝐴)=|𝐴||Ω|, though 𝐴 is messy.

Counting

Theorem - Fundamental Principle of Counting

Suppose we have 𝑘 tasks and 𝑖-th task can be done in 𝑛𝑖 ways.

# of ways we can perform k tasks=𝑘𝑖=1𝑛𝑖

Note

We assume every task does not affect any other task

Example

54-card deck. Place cards on table one by one. 𝑘=54,𝑛𝑖=54𝑖+1,1𝑖54. We can do this in 54×53×52××1=54! ways.

Definition

Given a positive integer 𝑛, the factorial of 𝑛 is denoted 𝑛!=𝑛×𝑛1××1

Note

0!=1

Notice that 𝑛! represents the ways of reordering 𝑛 distinct objects. Additionally, 𝑛! counts the number of permutations of a set of 𝑛 numbers.

Example

A deck of cards takes 52! permutations. It’s unlikely that anyone in human history has ever shuffled a deck of cards the same way.

Corollary

n! counts the number of permutations of 𝑛 numbers

Example

Seating 𝑘 guests on 𝑛 chairs (𝑘𝑛). In how many ways can you do this?

𝑛!(𝑛𝑘)!

Example

Select a set of 𝑘 chairs out of 𝑛 chairs. The difference here is order doesn’t matter.

𝑛!𝑘!(𝑛𝑘)!=(𝑛𝑘)

The final example is a combination, where order doesn’t matter. The previous was the formula for a permutation, where order matters. The (𝑛𝑘) notation is also called ”𝑛 choose 𝑘”, as we literally find all the ways of choosing 𝑘 elements from a set of 𝑛.

Note

The binomial coefficient pops up in the binomial formula:

(𝑎+𝑏)𝑛=𝑛𝑘=0(𝑛𝑘)𝑎𝑘𝑏𝑛𝑘

Note

(𝑛𝑘)=(𝑛𝑛𝑘)

Example

Toss a coin 𝑛 times. |Ω|=2𝑛. (𝜔)=1|Ω|=2𝑛𝜔Ω

𝐴{Tossing coin𝑛times and getting𝑘heads} (𝐴)=|𝐴||Ω|=(𝑛𝑘)|Ω|=2𝑛(𝑛𝑘)

Example - Birthday Paradox

What is the probability that 2 people were born on the same day?

(At least 2 birthdays on same day)=1(All birthdays are distinct)1365!(365𝑛)!1365𝑛

The factorial ratio comes from counting “all birthdays distinct”: the first person has 365 choices, the second has 364, …, the 𝑛-th has (365𝑛+1), so the count is 365×364××(365𝑛+1)=365!(365𝑛)!. We divide by 365𝑛 because there are 365𝑛 total equally likely birthday assignments, then take 1 to get “at least one match.”

In a similar light, the probability that someone in a group of people has the same birthday as you is:

1(364365)𝑛

Notice that it’s less likely someone will have the same birthday as you specifically compared to two arbitrary people sharing one.

Operations with Events

Recall that an event (𝐴) is a subset of the sample space (Ω).

Definition

Let 𝐴 be an event. 𝐴𝑐Ω𝐴.

(𝐴𝑐)=(Ω𝐴)=1(𝐴)

Definition

Let 𝐴,𝐵 be events.

  • The union of 𝐴&𝐵 is denoted by 𝐴𝐵 and contains all 𝜔Ωsuch that𝜔𝐴or𝜔𝐵
  • The intersection of 𝐴&𝐵 is denoted by 𝐴𝐵 and contains all 𝜔Ωsuch that𝜔𝐴and𝜔𝐵

We can write the probability of both of these notions.

(𝐴𝐵)=𝜔𝐴𝐵(𝜔)=𝜔𝐴(𝜔)+𝜔𝐵(𝜔)𝜔𝐴𝐵(𝜔)=(𝐴)+(𝐵)(𝐴𝐵)

Inclusion-Exclusion

This is called the inclusion-exclusion formula. We can make a weak claim from this principle, namely that

(𝐴𝐵)(𝐴)+(𝐵)

More generally (the union bound / Boole’s inequality), for events 𝐴1,,𝐴𝑚,

(𝑚𝑖=1𝐴𝑖)𝑚𝑖=1(𝐴𝑖)

What if we instead have 3 events? The inclusion-exclusion formula becomes

(𝐴𝐵𝐶)=(𝐴)+(𝐵)+(𝐶)(𝐴𝐵)(𝐴𝐶)(𝐵𝐶)+(𝐴𝐵𝐶)

This simplifies as

(𝐴𝐶)+(𝐵𝐶)(𝐴𝐵𝐶)

Since we “over-subtracted” the center region, we need to add it back one more time.

Definition

Generalized Inclusion-exclusion Formula For events 𝐴1,,𝐴𝑚,

(𝑚𝑖=1𝐴𝑖)=𝑚𝑘=1(1)𝑘+11𝑖1<<𝑖𝑘𝑚(𝐴𝑖1𝐴𝑖𝑘)

So for even cases, we subtract, and for odd cases, we add. We apply this in Conditional Probability & Independence to derive the law of total probability.