Probability Axioms & Sample Space

1. The Sample Space ($\Omega$)

The Sample Space is the set of all possible outcomes of a random experiment. In rigorous probability theory, the nature of this set dictates the mathematical tools required for analysis.

Types of Sample Spaces

Discrete Sample Spaces: These contain a finite or countably infinite number of outcomes. Examples include rolling a die or counting the number of radioactive decays in a fixed interval.
Continuous Sample Spaces: These contain an uncountably infinite number of outcomes, typically representing measurements on a continuum such as time, distance, or mass.

Term	Definition
Outcome	A single specific result of an experiment ($\omega \in \Omega$).
Event	A subset of the sample space ($A \subseteq \Omega$).
Power Set	The collection of all possible events. For a finite $\Omega$ of size $n$, there are $2^n$ events.

2. The Algebra of Events

Events are manipulated using set-theoretic operations. Let $A$ and $B$ be events in $\Omega$:

Union ($A \cup B$): The event that $A$ occurs, or $B$ occurs, or both occur.
Intersection ($A \cap B$): The event that both $A$ and $B$ occur simultaneously.
Complement ($A^c$): The event that $A$ does not occur.
Mutually Exclusive: Events are disjoint if their intersection is the empty set, $A \cap B = \emptyset$.

3. Kolmogorov’s Axioms of Probability

Modern probability theory is built upon three fundamental axioms proposed by Andrey Kolmogorov in 1933. Any valid probability measure $P$ must satisfy these conditions.

Axiom I: Non-negativity

For any event $A$, the probability is a non-negative real number:

P(A) \geq 0

Axiom II: Normalization

The probability of the entire sample space is exactly 1, representing certainty:

P(\Omega) = 1

Axiom III: Countable Additivity

For any sequence of mutually exclusive events $A_1, A_2, A_3, \dots$, the probability of their union is the sum of their individual probabilities:

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

4. Derived Mathematical Properties

From the fundamental axioms, several critical theorems are derived for calculation:

Impossible Event: $P(\emptyset) = 0$
Complement Rule: $P(A^c) = 1 - P(A)$
Monotonicity: If $A \subseteq B$, then $P(A) \leq P(B)$
Inclusion-Exclusion Principle: For any two events $A$ and $B$: $P(A \cup B) = P(A) + P(B) - P(A \cap B)$

5. Advanced Concept: Sigma-Algebras ($\mathcal{F}$)

In advanced measure-theoretic probability, we define a probability space as a triplet $(\Omega, \mathcal{F}, P)$. The $\sigma$-algebra $\mathcal{F}$ is a collection of subsets of $\Omega$ that is closed under complements and countable unions. This structure ensures that probabilities can be consistently assigned to complex sets without logical contradiction.

6. Advanced Challenge Questions

Question 1: The Limits of Additivity

Suppose you have a sample space $\Omega = \{1, 2, 3, \dots\}$ (the set of all positive integers). Is it possible to define a probability measure $P$ such that every individual outcome has the same probability $p > 0$? Justify your answer using the Axioms.

Question 2: Geometric Probability

Three points $X, Y,$ and $Z$ are chosen independently and uniformly at random on the circumference of a circle. What is the probability that the center of the circle lies inside the triangle formed by these three points?

Question 3: Proving Monotonicity

Using only the three Kolmogorov Axioms, prove the property of monotonicity: if $A \subseteq B$, then $P(A) \leq P(B)$. Hint: Express $B$ as a union of two disjoint sets involving $A$.