How do we assign "size" to a set? For finite collections of points, counting works. For intervals on the real line, length works. For rectangles in the plane, area works. But modern analysis demands far more: we must assign sizes to highly irregular sets — the preimage of an interval under a measurable function, the zero set of a Sobolev function, the support of a probability distribution — and we must do so in a way that is compatible with countable operations (unions, intersections, limits). The theory of measure spaces provides the rigorous framework for this assignment.

The need for such a framework is not merely aesthetic. The [Lebesgue integral](/page/Lebesgue%20Integral) partitions the *range* of a function and measures the size of each preimage set. Without a consistent way to measure those preimage sets, the integral cannot be defined. The [$L^p$ spaces](/page/L%5Ep%20Spaces) that form the backbone of functional analysis and PDE theory are quotient spaces modulo sets of "measure zero" — a concept that requires a measure. [Probability theory](/page/Probability%20Space) models random phenomena through probability measures on spaces of outcomes. In each case, the underlying structure is a measure space.

But building this framework forces us to confront a fundamental obstruction: **not every collection of sets can be consistently measured.** The Vitali construction (using the Axiom of Choice to select one representative from each coset of $\mathbb{Q}$ in $\mathbb{R}/\mathbb{Q}$) produces a set $V \subset [0,1]$ that cannot be assigned a Lebesgue measure without contradicting the translation invariance and countable additivity that make the theory useful. This means we cannot simply define a measure on *all* subsets of $\mathbb{R}$ — we must first restrict attention to a well-behaved collection of "measurable" sets.

[example: The Vitali Obstruction] Suppose, seeking a contradiction, that every subset of $[0,1]$ could be assigned a measure $\mu$ satisfying: - $\mu([0,1]) = 1$, - $\mu$ is countably additive: $\mu\bigl(\bigsqcup_{k=1}^\infty A_k\bigr) = \sum_{k=1}^\infty \mu(A_k)$ for pairwise disjoint sets, - $\mu$ is translation invariant: $\mu(A + t \mod 1) = \mu(A)$ for every $t \in \mathbb{R}$ (where addition is modulo $1$). Construct the Vitali set $V$ by choosing one representative from each equivalence class of $[0,1]$ under the relation $x \sim y \iff x - y \in \mathbb{Q}$. Let $\{q_k\}_{k=1}^\infty$ be an enumeration of $\mathbb{Q} \cap [-1,1]$, and define $V_k := (V + q_k) \mod 1$. The sets $V_k$ are pairwise disjoint (if $v_1 + q_j \equiv v_2 + q_k \pmod{1}$ with $v_1, v_2 \in V$, then $v_1 - v_2 \in \mathbb{Q}$, forcing $v_1 = v_2$ and $q_j = q_k$). Moreover, $[0,1] = \bigsqcup_{k=1}^\infty V_k$ (every $x \in [0,1]$ is equivalent to some $v \in V$, so $x \in V_k$ for $k$ such that $q_k = x - v \mod 1$). By countable additivity and translation invariance: \begin{align*} 1 = \mu([0,1]) = \sum_{k=1}^\infty \mu(V_k) = \sum_{k=1}^\infty \mu(V). \end{align*} If $\mu(V) = 0$, the sum is $0 \neq 1$. If $\mu(V) > 0$, the sum diverges to $+\infty \neq 1$. Both cases produce contradictions. The conclusion is inescapable: no measure on *all* subsets of $[0,1]$ can simultaneously satisfy countable additivity and translation invariance. We must restrict the domain of the measure to a proper subcollection of subsets — and that subcollection is the $\sigma$-algebra. [/example]

The Vitali construction reveals that the question is not "what is a measure?" but rather "on which sets can a measure be defined?" The answer — a $\sigma$-algebra — is a collection of sets closed under the operations that arise naturally in analysis: complementation, countable unions, and countable intersections. A **measure space** is then a set $X$ equipped with a $\sigma$-algebra $\mathcal{F}$ of "measurable" subsets and a measure $\mu$ that assigns a non-negative size to each set in $\mathcal{F}$.

## Definition

The definition of a measure space has three components, each addressing a specific need. The $\sigma$-algebra specifies which sets can be measured. The measure assigns sizes to those sets. The axioms of countable additivity ensure compatibility with the limit operations that pervade analysis.

[definition: Measure Space] A **measure space** is a triple $(X, \mathcal{F}, \mu)$ consisting of: 1. A non-empty set $X$ (the **underlying set** or **sample space**). 2. A **$\sigma$-algebra** $\mathcal{F}$ on $X$: a collection $\mathcal{F} \subset \mathcal{P}(X)$ of subsets of $X$ satisfying: - (i) $\varnothing \in \mathcal{F}$, - (ii) if $A \in \mathcal{F}$, then $A^c := X \setminus A \in \mathcal{F}$ (closure under complementation), - (iii) if $A_1, A_2, \ldots \in \mathcal{F}$, then $\bigcup_{k=1}^\infty A_k \in \mathcal{F}$ (closure under countable unions). The pair $(X, \mathcal{F})$ is called a **measurable space**, and the elements of $\mathcal{F}$ are called **$\mathcal{F}$-measurable sets** (or simply **measurable sets** when $\mathcal{F}$ is clear from context). 3. A **measure** $\mu$ on $(X, \mathcal{F})$: a function $\mu: \mathcal{F} \to [0, \infty]$ satisfying: - (i) $\mu(\varnothing) = 0$, - (ii) **countable additivity** ($\sigma$-additivity): if $A_1, A_2, \ldots \in \mathcal{F}$ are pairwise disjoint, then \begin{align*} \mu\!\left(\bigsqcup_{k=1}^\infty A_k\right) = \sum_{k=1}^\infty \mu(A_k). \end{align*} The measure space is called **finite** if $\mu(X) < \infty$, and a **probability space** if $\mu(X) = 1$ (in which case we write $\mathbb{P}$ for $\mu$ and call $\mathcal{F}$ the **event $\sigma$-algebra**). [/definition]

Several aspects of this definition deserve attention.

First, the $\sigma$-algebra axioms are designed to produce a collection of sets that is stable under the operations used in analysis. Axiom (ii) ensures that if a set $A$ is measurable, so is its complement — we can speak of the "set where $f > 0$" and the "set where $f \le 0$" simultaneously. Axiom (iii), closure under *countable* unions, is the crucial upgrade from an algebra (which requires only *finite* unions). This upgrade is what makes $\sigma$-algebras compatible with limits: if each set $A_k = \{f_k > 0\}$ is measurable, then $\limsup_{k \to \infty} A_k = \bigcap_{m=1}^\infty \bigcup_{k=m}^\infty A_k$ is also measurable, which is essential for the [Borel-Cantelli lemma](/page/Probability%20Space) and the definition of convergence almost everywhere.

Note that closure under countable intersections follows from the axioms: $\bigcap_{k=1}^\infty A_k = \bigl(\bigcup_{k=1}^\infty A_k^c\bigr)^c$, and both complementation and countable union are available. Similarly, $X = \varnothing^c \in \mathcal{F}$.

Second, countable additivity is the heart of the measure axioms. Finite additivity alone — the weaker requirement that $\mu(A \sqcup B) = \mu(A) + \mu(B)$ — is insufficient for modern analysis, because it does not imply the continuity properties (from below and from above) that underpin the Monotone Convergence Theorem and the Dominated Convergence Theorem. Without countable additivity, the passage from "each approximation $f_k$ is integrable" to "the limit $f$ is integrable" breaks down.

Third, we allow $\mu$ to take the value $+\infty$. This is essential for Lebesgue measure on $\mathbb{R}^n$ (where $\mathcal{L}^n(\mathbb{R}^n) = +\infty$) and for counting measure (where any infinite set has measure $+\infty$). The extended non-negative reals $[0, \infty]$ form a natural codomain for measures.

## Generating $\sigma$-Algebras

A basic difficulty in working with $\sigma$-algebras is that they are typically enormous — too large to describe by listing their elements. The Borel $\sigma$-algebra $\mathcal{B}(\mathbb{R})$ has cardinality $2^{\aleph_0}$ (the cardinality of the continuum), and even "small" $\sigma$-algebras on uncountable sets contain uncountably many elements. Directly verifying that a collection of sets satisfies the $\sigma$-algebra axioms, or that a particular set belongs to a given $\sigma$-algebra, is usually impractical.

The solution is to specify a $\sigma$-algebra through a **generating family**: a (often small) collection of sets whose $\sigma$-algebraic closure is the desired $\sigma$-algebra.

[definition: Generated Sigma-Algebra] Let $X$ be a non-empty set and let $\mathcal{C} \subset \mathcal{P}(X)$ be an arbitrary collection of subsets. The **$\sigma$-algebra generated by $\mathcal{C}$**, denoted $\sigma(\mathcal{C})$, is the smallest $\sigma$-algebra on $X$ containing $\mathcal{C}$: \begin{align*} \sigma(\mathcal{C}) := \bigcap \bigl\{ \mathcal{G} : \mathcal{G} \text{ is a } \sigma\text{-algebra on } X \text{ and } \mathcal{C} \subset \mathcal{G} \bigr\}. \end{align*} This intersection is well-defined and is itself a $\sigma$-algebra: the family $\mathcal{P}(X)$ is always a $\sigma$-algebra containing $\mathcal{C}$, so the intersection is taken over a non-empty collection of $\sigma$-algebras, and an arbitrary intersection of $\sigma$-algebras is a $\sigma$-algebra (verified directly from the axioms). [/definition]

The generated $\sigma$-algebra $\sigma(\mathcal{C})$ is characterised by a universal property: it is the unique $\sigma$-algebra $\mathcal{F}$ on $X$ satisfying (i) $\mathcal{C} \subset \mathcal{F}$, and (ii) if $\mathcal{G}$ is any $\sigma$-algebra with $\mathcal{C} \subset \mathcal{G}$, then $\mathcal{F} \subset \mathcal{G}$. This minimality is the key to the **good sets principle**: to show that every set in $\sigma(\mathcal{C})$ has a property $P$, it suffices to check that (a) every set in $\mathcal{C}$ has property $P$, and (b) the collection of sets with property $P$ forms a $\sigma$-algebra. Since this collection is a $\sigma$-algebra containing $\mathcal{C}$, it must contain $\sigma(\mathcal{C})$.

The most important generated $\sigma$-algebra in analysis is the Borel $\sigma$-algebra.

[definition: Borel Sigma-Algebra] Let $(X, \tau)$ be a topological space. The **Borel $\sigma$-algebra** on $X$, denoted $\mathcal{B}(X)$, is the $\sigma$-algebra generated by the open sets: \begin{align*} \mathcal{B}(X) := \sigma(\tau). \end{align*} The elements of $\mathcal{B}(X)$ are called **Borel sets**. Since $\sigma(\tau) = \sigma(\{\text{closed subsets of } X\})$ (every open set is the complement of a closed set and vice versa), the Borel $\sigma$-algebra is equivalently generated by the closed sets. [/definition]