Axioms for Probabilities

Given a sample space S, we say that P(A) for some event A is the probability of the event A. These must satisfy the following axioms:

Axioms for Probabilities

  1. For any event A, P(A)≥0
  2. P(S)=1
  3. If A1,A2,... is an infinite collection of disjoint events (so no two events have the same outcomes in common) then:
P(A1∪A2∪…)=∑i=1∞P(Ai)

For context:

  1. Axiom 1 says all events must be non-negative
  2. The sample space is all events, so the probability any event occurs is 1.
  3. The probability of one event in a collection is the sum of disjoint events (no two can occur simultaneously) then you just add up the probabilities.
Axiom 3 Finite Case

The case where we have A1,...,An events that are disjoint is similarly:

P(A1∪⋯∪An)=∑i=1nP(Ai)

But this is derived from Axiom 3, so it itself isn't an axiom.

P(∅)=0

P(∅)=0 where ∅ is the null event.

Using this proposition allows us to derive the finite case of axiom 3.

Proof
First consider the infite collection A1=∅,A2=∅,.... Since ∅∩∅=∅ then the events in this collection are disjoint and just ⋃Ai=∅. Axiom 3 tells us:

P(∅)=P(⋃Ai)=∑P(Ai)=∑P(∅)

This can only happen when P(∅)=0.

Now suppose that A1,...,Ak are disjoint events, and append to these the infinite collection Ak+1=∅,... . Then the events A1,...,Ak,Ak+1,... are disjoint, since A∩∅=∅ for all events A. Again using Axiom 3 then:

P(⋃i=1kAi)=P(⋃i=1∞Ai)=∑i=1∞P(Ai)=∑i=1kP(Ai)+∑i=k+1∞P(Ai)=∑i=1kP(Ai)+∑i=k+1∞0=∑i=1kP(Ai)

☐

Thumbtack Example

If you toss a thumbtack in the air, either it points up or down. Thus S={U,D} as it's sample space. Since U,D are disjoint then since P(S)=1:

1=P(S)=P(U)+P(D)⇒P(D)=1−P(U)

So if you know either P(U) or P(D) then you know the other.

References

  1. [[Matthew A. Carlton, Jay L. Devore - Probability with STEM Applications-Wiley (2020).pdf#page=43]]