2: Axioms of probability | Course - StudyGenius | StudyGenius

Course Progress

Victories 0/60
Finished 0/60

StudyGenius Logo

2: Axioms of probability

Choose your name

DesertFox

Your opponent is:

DesertFox

2,359 pts

5 days ago

Choose your name

DesertFox

Your opponent is

DesertFox

2,359 pts
5 days ago
The quiz will be on the following text — learn it for the best chance to win.

Section 1: Basic Probability Concepts - 2: Axioms of Probability

Probability theory requires a rigorous mathematical foundation to avoid paradoxes and ensure consistency. This foundation is provided by the Kolmogorov Axioms, three fundamental rules that define how probability must behave for any event within a sample space (SS).

  1. Non-Negativity: For any event ESE \subseteq S, the probability of EE is a non-negative real number:

    P(E)0P(E) \geq 0

    This axiom states probabilities cannot be negative. For example, the probability of rolling an even number on a fair die cannot be -0.5.

  2. Normalization: The probability assigned to the entire sample space (the event that something happens) is exactly 1:

    P(S)=1P(S) = 1

    This establishes probability as a measure of certainty on a scale from 0 (impossible) to 1 (certain). For a coin toss, P({Heads,Tails})=1P(\{\text{Heads}, \text{Tails}\}) = 1.

  3. Countable Additivity: For any sequence of mutually exclusive (disjoint) events E1,E2,E3,E_1, E_2, E_3, \ldots (where EiEj=E_i \cap E_j = \emptyset for iji \neq j), the probability of their union is the sum of their individual probabilities:

    P(i=1Ei)=i=1P(Ei)P\left(\bigcup_{i=1}^{\infty} E_i\right) = \sum_{i=1}^{\infty} P(E_i)

    This is the core rule for combining probabilities of events that cannot occur simultaneously. For a single die roll, events E1={1}E_1 = \{1\} and E2={2}E_2 = \{2\} are disjoint. The probability of rolling a 1 or a 2 is P({1}{2})=P({1})+P({2})=16+16=13P(\{1\} \cup \{2\}) = P(\{1\}) + P(\{2\}) = \frac{1}{6} + \frac{1}{6} = \frac{1}{3}.

Key Implications:

  • Probability of the Empty Set: The probability of an impossible event (the empty set \emptyset) is 0: P()=0P(\emptyset) = 0. This follows from additivity (consider SS \cup \emptyset \cup \emptyset \cup \ldots) and normalization (P(S)=1P(S) = 1).
  • Finite Additivity: For a finite collection of mutually exclusive events E1,E2,,EnE_1, E_2, \ldots, E_n, additivity holds: P(i=1nEi)=i=1nP(Ei).P\left(\bigcup_{i=1}^{n} E_i\right) = \sum_{i=1}^{n} P(E_i).
  • Probability Bounds: For any event EE, 0P(E)10 \leq P(E) \leq 1. This follows from non-negativity, normalization, and the fact that ESE \subseteq S.
  • Complement Rule: P(Ec)=1P(E)P(E^c) = 1 - P(E), since EE and EcE^c are disjoint and their union is SS (use finite additivity and normalization).

These axioms are minimal but powerful. All other probability rules (like the inclusion-exclusion principle, conditional probability formulas, or Bayes' theorem) are derived from these three core principles. They provide the consistent framework upon which the entire edifice of probability theory is built, ensuring logical coherence for analyzing random phenomena.