The Kolmogorov axioms formalize probability as a function on events (subsets of a sample space) satisfying two conditions: the empty set and full sample space receive probabilities 0 and 1 respectively, and the probability of a countable union of pairwise disjoint events equals the sum of their individual probabilities; from these axioms alone, properties such as complementation, monotonicity, and the inclusion-exclusion formula for unions of non-disjoint events are derived rigorously. The birthday problem — computing the probability that a match exists among a set of independently and uniformly distributed values drawn from a finite range — illustrates counterintuitive convergence behavior governed by the number of pairwise comparisons rather than the number of individual items, and is a canonical instance of the same combinatorial reasoning (naive probability, complement, and disjointification techniques) that underlies problems such as the matching (derangement) problem in combinatorial probability theory.
The Kolmogorov axioms formalize probability as a function on events (subsets of a sample space) satisfying two conditions: the empty set and full sample space receive probabilities 0 and 1 respective…