Elementary measurability tools

Written by GPT-6.1 Sol (OpenAI), Ultra, October 2026. Self-checked by the writing AI. Original text: CC0 1.0.

The first two results supply the exact background used in the measurable-field and diagonal-algebra chapters. They assume neither a topology nor a measure on the domain. The final two results supply finite-measure and Lebesgue approximation inputs for the finite-algebra and MASA examples.

1. Separable Hilbert space measurability

Let (X,Σ)(X,\Sigma) be a measurable space, let HH be a separable complex Hilbert space, and let f:X→Hf:X\to H. Inner products are linear in the first variable. The following conditions are equivalent:

  1. x↦⟨f(x),v⟩x\mapsto\langle f(x),v\rangle is measurable for every v∈Hv\in H.
  2. ff is measurable for the norm-Borel sigma algebra of HH.
  3. ff is the pointwise norm limit of a sequence of measurable functions with finite range.

Proof. Choose a finite or countable orthonormal basis (ej)(e_j) of HH, as provided by the Hilbert space basis theorem. If (1) holds, then, for every v∈Hv\in H, Parseval's identity gives ∥f(x)−v∥2=∑j∣⟨f(x),ej⟩−⟨v,ej⟩∣2. \|f(x)-v\|^2=\sum_j|\langle f(x),e_j\rangle-\langle v,e_j\rangle|^2. The finite partial sums are measurable and their increasing limit is measurable. Hence the inverse image of every norm ball is measurable. A separable metric space has a countable base of balls, with centres in a countable dense set and positive rational radii. Each open set is the union of a subfamily of that countable base. Its inverse image is therefore measurable, proving (2).

For (2) implies (3), choose a norm-dense sequence (vj)j≥1(v_j)_{j\ge1} in HH. For each nn, define jn(x)j_n(x) to be the least index in {1,…,n}\{1,\ldots,n\} that minimizes ∥f(x)−vj∥\|f(x)-v_j\|, and set fn(x)=vjn(x)f_n(x)=v_{j_n(x)}. The distances are measurable, and each event jn(x)=jj_n(x)=j is a finite intersection of strict or weak comparisons between these measurable real functions. Thus fnf_n is measurable and has finite range. Moreover, ∥f(x)−fn(x)∥=min⁡1≤j≤n∥f(x)−vj∥⟶0 \|f(x)-f_n(x)\|=\min_{1\le j\le n}\|f(x)-v_j\|\longrightarrow0 by density. Finally, (3) implies (1), since scalar products of the finite-range functions are measurable and converge pointwise to ⟨f(x),v⟩\langle f(x),v\rangle. The zero Hilbert space causes no exception. □\square

Consequence. For a measure space, the corresponding almost-everywhere assertion follows by applying the theorem on the common conull set where the representatives are defined. If the measure space is complete, extension by zero across a null set preserves measurability. No such extension is needed when the map is defined everywhere as in the theorem.

The basis theorem and Parseval identity are proved in Hilbert spaces and compact operators. The proof above contains the measurability argument rather than assuming a Pettis theorem.

2. The monotone class theorem for sets

An algebra of subsets of XX contains XX and is closed under complements and finite unions. A monotone class is closed under countable increasing unions and countable decreasing intersections. If A\mathcal A is an algebra, the smallest monotone class C\mathcal C containing A\mathcal A is σ(A)\sigma(\mathcal A).

Proof. The sigma algebra σ(A)\sigma(\mathcal A) is a monotone class, so C⊆σ(A)\mathcal C\subseteq\sigma(\mathcal A). The class D={B⊆X:Bc∈C} \mathcal D=\{B\subseteq X:B^c\in\mathcal C\} is a monotone class: complementation interchanges increasing unions and decreasing intersections. It contains A\mathcal A, so minimality gives C⊆D\mathcal C\subseteq\mathcal D. Thus C\mathcal C is closed under complements.

Fix A∈AA\in\mathcal A. The class {B⊆X:A∩B∈C}\{B\subseteq X:A\cap B\in\mathcal C\} is a monotone class and contains A\mathcal A, since the algebra is closed under finite intersections. It consequently contains C\mathcal C. Now fix B∈CB\in\mathcal C. The class {A⊆X:A∩B∈C}\{A\subseteq X:A\cap B\in\mathcal C\} is again a monotone class; the preceding conclusion says that it contains A\mathcal A, so it contains C\mathcal C. Therefore C\mathcal C is closed under finite intersections, hence under finite unions by complements. For any sequence (Bn)(B_n) in C\mathcal C, the finite unions ⋃n≤kBn\bigcup_{n\le k}B_n increase to ⋃nBn\bigcup_nB_n, which is in C\mathcal C. Hence C\mathcal C is a sigma algebra containing A\mathcal A, and σ(A)⊆C\sigma(\mathcal A)\subseteq\mathcal C. □\square

In particular, if a class of measurable sets is monotone and contains an algebra generating the domain sigma algebra, it contains every measurable set. This is the exact set-class argument used to extend commutation from generating indicator multipliers to all indicator multipliers.

3. Uniform convergence outside a small set

Let (X,Σ,μ)(X,\Sigma,\mu) have finite measure. If measurable complex functions fnf_n converge to a measurable function ff almost everywhere, then for every ε>0\varepsilon>0 there is a measurable E⊆XE\subseteq X with μ(X∖E)<ε\mu(X\setminus E)<\varepsilon such that fn→ff_n\to f uniformly on EE.

Proof. Let NN be a measurable null set outside which convergence holds, and define Bk,n=⋃m≥n{x:∣fm(x)−f(x)∣>1/k}(k,n≥1). B_{k,n}=\bigcup_{m\ge n}\{x:|f_m(x)-f(x)|>1/k\}\quad(k,n\ge1). For each kk, these sets decrease with nn, and their intersection is contained in NN. Continuity of a finite measure from above gives μ(Bk,n)→0\mu(B_{k,n})\to0. Choose nkn_k with μ(Bk,nk)<ε2−k\mu(B_{k,n_k})<\varepsilon2^{-k}, and put E=X∖(N∪⋃k≥1Bk,nk). E=X\setminus\left(N\cup\bigcup_{k\ge1}B_{k,n_k}\right). Countable subadditivity gives μ(X∖E)<ε\mu(X\setminus E)<\varepsilon. On EE, for every kk and every m≥nkm\ge n_k, ∣fm−f∣≤1/k|f_m-f|\le1/k. This is uniform convergence. Continuity from above itself follows from countable additivity by applying continuity from below to complements in the finite-measure set XX. □\square

If XX is compact Hausdorff and μ\mu is a finite Radon measure, inner regularity gives a compact F⊆EF\subseteq E with μ(E∖F)<ε/2\mu(E\setminus F)<\varepsilon/2, after using ε/2\varepsilon/2 in the theorem. Thus μ(F)>μ(X)−ε\mu(F)>\mu(X)-\varepsilon and convergence is uniform on FF. This is the precise Egoroff-and-compact-cutoff input in the finite type-II representation proof. Radon regularity, including regularity on finite-measure Borel sets, is proved in Theorem 2.2 and Proposition 2.3 of Haar measure on locally compact groups.

4. Interval and arc step functions

Finite linear combinations of bounded interval indicators are dense in L1(R)L^1(\mathbb R) for Lebesgue measure. Finite linear combinations of arc indicators are dense in L1(T)L^1(\mathbb T) for normalized Lebesgue measure.

Proof. Proposition 3.1(4) of Haar measure on locally compact groups proves that compactly supported continuous functions are dense in L1L^1 of a Radon measure. Lebesgue measure is Radon: the interval-cover construction gives open outer approximations with arbitrarily small excess measure, and, for a finite-measure set, first cutting off a small tail outside [−R,R][-R,R] and then taking the complement of an open outer approximation to its complement inside [−R,R][-R,R] gives a compact inner approximation. Open sets are countable disjoint unions of intervals, so their inner regularity also follows by retaining finitely many slightly shortened bounded intervals. The normalized circle measure is the image of Lebesgue measure on [0,1][0,1]; compact inner approximations pass to their compact images, and outer regularity follows by applying inner regularity to complements in this finite-measure compact space. For a compactly supported continuous gg on R\mathbb R, choose a bounded interval [−R,R][-R,R] containing its support. On this interval gg is uniformly continuous. Indeed, if uniform continuity failed, there would be pairs xn,ynx_n,y_n whose distance tends to zero but whose value difference is bounded away from zero; a convergent subsequence of xnx_n, and hence of yny_n to the same limit, contradicts continuity. Partition [−R,R][-R,R] into intervals of sufficiently small length and give the step function on each interval the value of gg at one endpoint. The uniform approximation error on [−R,R][-R,R] tends to zero, and both functions vanish outside it. Their L1L^1 distance is at most 2R2R times that error. Endpoint values affect no integral. This proves the first density assertion. For the circle, apply the same argument to the continuous periodic representative on [0,1][0,1]; the partition intervals become arcs, and the L1L^1 error is at most the uniform error. Density of continuous functions proves the second assertion. □\square

For a translated interval indicator, the L1L^1 difference is the measure of its symmetric difference and is at most twice the translation distance; the same bound holds for arc indicators and sufficiently small circle distance. The density just proved and the fact that translation is an L1L^1 isometry then prove continuity of translation on every L1L^1 function. Reflection, translation and nonzero scalar dilation preserve or scale Lebesgue measure by the interval-cover construction. In the rational-translation proof, the two-variable map (t,x)↦(x−t,x)(t,x)\mapsto(x-t,x) preserves product Lebesgue measure: Tonelli integrates first in tt, and reflection followed by translation changes that inner integral to integration in y=x−ty=x-t. The same argument applies to normalized circle measure. The exact Tonelli and Fubini theorems, including their sigma-finite support condition, are proved in Sections 4 and 5 of the linked Haar-measure chapter; the real line and circle meet that condition.

Editable source · Sources and component terms