In analysis, we frequently encounter sequences of [measurable functions](/page/Measurable%20Functions) $(f_n)$ converging to a limit $f$, and need to pass to the limit in integrals, compositions, or other operations. The most natural notion — pointwise convergence — turns out to be poorly behaved: it is not controlled by any metric on function spaces, it is not stable under rearrangements of the sequence, and two sequences that agree outside a set of measure zero can have completely different pointwise limits. The stronger notion of [convergence in $L^p$](/page/L%5Ep%20Spaces) fixes some of these deficiencies, but demands too much: it requires the *size* of the differences $|f_n - f|$ to be globally controlled, which excludes many natural approximation procedures.

Between these two extremes lies **convergence in measure**, which asks only that the set where $f_n$ and $f$ differ appreciably becomes small — without demanding anything about *how large* the difference is on that set, and without insisting that the convergence happen at every point. This mode of convergence is coarser than $L^p$ convergence but finer than what can be deduced from pointwise convergence alone. It arises naturally in probability theory (where it is called *convergence in probability*), in the construction of the [Lebesgue integral](/page/Lebesgue%20Integral), and in the study of approximation schemes for PDE.

The central surprise of the theory is that convergence in measure, despite being weaker than $L^p$ convergence, retains just enough structure to guarantee the existence of pointwise-convergent subsequences (the Riesz Subsequence Principle). This subsequence extraction is the bridge that connects measure-theoretic convergence to the pointwise world, and it is the reason convergence in measure appears as a hypothesis in results like the Vitali Convergence Theorem.

[example: Typewriter Sequence] The **typewriter sequence** demonstrates that convergence in measure does not imply pointwise convergence at any point. Consider the measure space $([0,1), \mathcal{L}^1)$, and define a sequence of indicator functions as follows. Enumerate the dyadic intervals: for each $n \in \mathbb{N}$, write $n = 2^k + j$ where $0 \le j < 2^k$, and set \begin{align*} f_n := \mathbb{1}_{[j/2^k,\, (j+1)/2^k)}. \end{align*} The intervals have length $2^{-k}$, so for any $\varepsilon \in (0, 1]$, \begin{align*} \mathcal{L}^1\bigl(\{x \in [0,1) : |f_n(x)| > \varepsilon\}\bigr) = 2^{-k} \to 0 \quad \text{as } n \to \infty. \end{align*} Hence $f_n \to 0$ in measure. However, for every $x \in [0,1)$, the value $f_n(x)$ equals $1$ for infinitely many $n$ (since the intervals sweep across $[0,1)$ repeatedly), so $\limsup_{n \to \infty} f_n(x) = 1$ for all $x$. The sequence does not converge pointwise anywhere. This example shows that convergence in measure permits the "bad set" $\{|f_n - f| > \varepsilon\}$ to wander through the domain, as long as its measure shrinks. Pointwise convergence, by contrast, requires the bad set to eventually avoid each individual point. [/example]

## Definition

The definition of convergence in measure captures a single requirement: for each tolerance level $\varepsilon > 0$, the set where the approximation fails must eventually have small measure. No condition is placed on the size of $|f_n - f|$ on this exceptional set, and no condition is placed on the behavior at individual points.

[definition: Convergence in Measure] Let $(X, \mathcal{A}, \mu)$ be a measure space, and let $f, f_1, f_2, \ldots : X \to \mathbb{R}$ be $\mathcal{A}$-measurable functions that are finite $\mu$-a.e. The sequence $(f_n)$ **converges in measure** to $f$, written $f_n \xrightarrow{\mu} f$, if for every $\varepsilon > 0$, \begin{align*} \lim_{n \to \infty} \mu\bigl(\{x \in X : |f_n(x) - f(x)| > \varepsilon\}\bigr) = 0. \end{align*} When $\mu$ is a probability measure $\mathbb{P}$, this is called **convergence in probability**, written $f_n \xrightarrow{\mathbb{P}} f$. [/definition]

Several features of this definition deserve comment.

**The limit is unique $\mu$-a.e.** If $f_n \xrightarrow{\mu} f$ and $f_n \xrightarrow{\mu} g$, then $f = g$ $\mu$-a.e. This follows from the inclusion $\{|f - g| > \varepsilon\} \subset \{|f_n - f| > \varepsilon/2\} \cup \{|f_n - g| > \varepsilon/2\}$ and subadditivity of $\mu$.

**Finite measure is not assumed.** The definition makes sense on $\sigma$-finite or even arbitrary measure spaces. However, several key results — notably Egorov's Theorem and the implication "pointwise a.e. $\Rightarrow$ in measure" — require $\mu(X) < \infty$. On infinite measure spaces, the relationship between convergence in measure and pointwise convergence changes dramatically, as we explore in the section on the hierarchy of modes.

**The role of $\varepsilon$.** The quantifier structure is: for *every* $\varepsilon > 0$, the measures converge to zero. It is not sufficient to check a single $\varepsilon$; the definition requires uniform smallness across all tolerance levels. However, because $\{|f_n - f| > \varepsilon_1\} \subset \{|f_n - f| > \varepsilon_2\}$ whenever $\varepsilon_1 > \varepsilon_2$, it suffices to verify the condition along any sequence $\varepsilon_k \downarrow 0$.

### Cauchy in Measure

Just as Cauchy sequences in $\mathbb{R}$ converge without requiring advance knowledge of the limit, there is an analogous notion for convergence in measure.

[definition: Cauchy in Measure] A sequence $(f_n)$ of $\mathcal{A}$-measurable functions is **Cauchy in measure** if for every $\varepsilon > 0$, \begin{align*} \lim_{m, n \to \infty} \mu\bigl(\{x \in X : |f_m(x) - f_n(x)| > \varepsilon\}\bigr) = 0. \end{align*} [/definition]

The space of measurable functions on a finite measure space, equipped with convergence in measure, is a complete topological vector space: every Cauchy-in-measure sequence converges in measure. This completeness is a consequence of the Riesz Subsequence Principle, which we establish below.

## The Hierarchy of Convergence Modes

The central difficulty in working with sequences of measurable functions is that there are many natural notions of convergence — pointwise, pointwise a.e., uniform, $L^p$, in measure — and none of them implies all the others. Understanding which implications hold, which fail, and under what additional hypotheses a weak mode can be promoted to a stronger one is essential for applying limit theorems correctly.

### From $L^p$ to Measure: What Is Lost

The strongest of the common modes (apart from uniform convergence) is convergence in $L^p$. It controls both the *size* and the *extent* of the set where $f_n$ deviates from $f$. Convergence in measure retains only the latter control.

[quotetheorem:1075]