ACE 328/Chapter 13

Integration and Measure Theory

Darboux sums and the Riemann integral. Jordan content and zero Lebesgue measure. Lebesgue's criterion for Riemann integrability. Introduction to sigma-algebras, Borel sets, outer measures, and Lebesgue measure.

In this chapter we develop the Riemann integral from first principles via Darboux sums, establish a sharp criterion for Riemann integrability (Lebesgue's theorem), and introduce the basic language of measure theory. The goal is twofold: first, to understand exactly which functions can be integrated in the classical Riemann sense and which cannot; and second, to lay the groundwork for a much more flexible theory of integration — the Lebesgue integral — that resolves the defects of the Riemann theory. Along the way we meet Jordan content, sets of Lebesgue measure zero, sigma-algebras, Borel sets, outer measures, Caratheodory's criterion, and the construction of Lebesgue measure on R\mathbb{R}.


Partitions and Darboux Sums

DefinitionPartition and Refinement

Let [a,b]R[a, b] \subseteq \mathbb{R} be a compact interval. A partition of [a,b][a, b] is a finite set P={x0,x1,,xn}P = \{x_0, x_1, \dots, x_n\} with a=x0<x1<<xn1<xn=b.a = x_0 < x_1 < \cdots < x_{n-1} < x_n = b. Given two partitions P,PP, P' of [a,b][a, b], we say PP' is a refinement of PP iff PPP \subseteq P'.

Remark.

Intuition: A partition chops [a,b][a, b] into finitely many subintervals. A refinement adds more dividing points, so every subinterval of PP' sits inside a subinterval of PP. Finer partitions give finer approximations of area.

DefinitionUpper and Lower Riemann–Darboux Sums

Let f:[a,b]Rf : [a, b] \to \mathbb{R} be bounded and let P={x0,x1,,xn}P = \{x_0, x_1, \dots, x_n\} be a partition of [a,b][a, b]. For k=1,,nk = 1, \dots, n, set Mk:=supx[xk1,xk]f(x),mk:=infx[xk1,xk]f(x).M_k := \sup_{x \in [x_{k-1}, x_k]} f(x), \qquad m_k := \inf_{x \in [x_{k-1}, x_k]} f(x). The upper Riemann–Darboux sum and the lower Riemann–Darboux sum of ff over [a,b][a, b] with partition PP are U(f,P):=k=1nMk(xkxk1),L(f,P):=k=1nmk(xkxk1).U(f, P) := \sum_{k=1}^{n} M_k (x_k - x_{k-1}), \qquad L(f, P) := \sum_{k=1}^{n} m_k (x_k - x_{k-1}).

Remark.

Intuition: The upper sum is the area of the smallest "staircase" that fits above the graph of ff, while the lower sum is the area of the largest staircase fitting below. A finer partition can only make UU smaller and LL larger, squeezing them toward the "true" area.

LemmaMonotonicity of Darboux Sums Under Refinement

If PPP \subseteq P' are partitions of [a,b][a, b] and f:[a,b]Rf : [a, b] \to \mathbb{R} is bounded, then L(f,P)L(f,P)U(f,P)U(f,P).L(f, P) \leq L(f, P') \leq U(f, P') \leq U(f, P). Moreover, if P1,P2P_1, P_2 are any two partitions, L(f,P1)U(f,P2)L(f, P_1) \leq U(f, P_2).


The Riemann Integral

DefinitionRiemann Integrability

Let f:[a,b]Rf : [a, b] \to \mathbb{R} be bounded. We say ff is Riemann integrable on [a,b][a, b] iff infP partitionU(f,P)=supP partitionL(f,P),\inf_{P \text{ partition}} U(f, P) = \sup_{P \text{ partition}} L(f, P), and this common value is called the Riemann integral of ff over [a,b][a, b], denoted [a,b]f  =  abf  =  abf(x)dx.\int_{[a, b]} f \;=\; \int_a^b f \;=\; \int_a^b f(x)\, dx.

Remark.

Intuition: The upper integral infPU(f,P)\inf_P U(f, P) is the best upper estimate for the area under ff; the lower integral supPL(f,P)\sup_P L(f, P) is the best lower estimate. When they agree, there is a unique sensible notion of area, and we call the common value the Riemann integral. From the lemma above, we always have lower integral \leq upper integral.

TheoremRiemann Integrability Criterion

A bounded function f:[a,b]Rf : [a, b] \to \mathbb{R} is Riemann integrable if and only if for every ε>0\varepsilon > 0 there exists a partition PεP_\varepsilon of [a,b][a, b] with U(f,Pε)L(f,Pε)<ε.U(f, P_\varepsilon) - L(f, P_\varepsilon) < \varepsilon.

Remark.

Intuition: Riemann integrability is equivalent to the gap between upper and lower sums being controllable. This "squeeze" criterion is the workhorse for proving integrability in practice.

Basic Properties

TheoremProperties of the Riemann Integral

Let f,g:[a,b]Rf, g : [a, b] \to \mathbb{R} be Riemann integrable, α,βR\alpha, \beta \in \mathbb{R}, and c(a,b)c \in (a, b).

(1) Linearity: αf+βg\alpha f + \beta g is Riemann integrable and ab(αf+βg)=αabf+βabg.\int_a^b (\alpha f + \beta g) = \alpha \int_a^b f + \beta \int_a^b g.

(2) Monotonicity: If fgf \leq g pointwise, then abfabg\int_a^b f \leq \int_a^b g.

(3) Additivity over intervals: ff is Riemann integrable on [a,c][a, c] and on [c,b][c, b], and abf=acf+cbf.\int_a^b f = \int_a^c f + \int_c^b f.

(4) Absolute integrability: f|f| is Riemann integrable and abfabf\left|\int_a^b f\right| \leq \int_a^b |f|.

Remark.

Intuition: These properties are the bedrock of calculus. Linearity and monotonicity follow directly from the definition of Darboux sums; additivity is proved by concatenating partitions on [a,c][a, c] and [c,b][c, b]; and absolute integrability uses f(x)f(y)f(x)f(y)||f(x)| - |f(y)|| \leq |f(x) - f(y)| to control oscillations of f|f| by oscillations of ff.

ExampleA Non-Riemann-Integrable Function

Let f:[0,1]Rf : [0, 1] \to \mathbb{R} be the Dirichlet function f(x)=1f(x) = 1 if xQx \in \mathbb{Q}, f(x)=0f(x) = 0 otherwise. For any partition PP, every subinterval contains both rationals and irrationals, so Mk=1M_k = 1 and mk=0m_k = 0 for every kk. Therefore U(f,P)=1U(f, P) = 1 and L(f,P)=0L(f, P) = 0 for every partition PP. The upper integral is 11 and the lower integral is 00; they do not agree, so ff is not Riemann integrable.


Integrating on Bounded Subsets and Jordan Content

We extend the Riemann integral to bounded subsets ARA \subseteq \mathbb{R} by zero-extension.

DefinitionIntegral on a Bounded Set

Let ARA \subseteq \mathbb{R} be bounded, f:ARf : A \to \mathbb{R} bounded. Let [a,b]A[a, b] \supseteq A and define fA:RR,fA(x):={f(x)if xA0if xA.f_A : \mathbb{R} \to \mathbb{R}, \qquad f_A(x) := \begin{cases} f(x) & \text{if } x \in A \\ 0 & \text{if } x \notin A. \end{cases} If fAf_A is Riemann integrable on [a,b][a, b], we define Af:=[a,b]fA.\int_A f := \int_{[a, b]} f_A. This definition is independent of the choice of [a,b][a, b] containing AA.

Remark.

Intuition: To integrate on a general bounded set, we set ff to be zero outside and integrate over any enclosing interval. The choice of enclosing interval does not matter because extending the partition outside AA only adds zero contributions.

DefinitionJordan Content

Let ARA \subseteq \mathbb{R} be bounded. Consider the indicator function 1A(x)={1xA0xA.\mathbf{1}_A(x) = \begin{cases} 1 & x \in A \\ 0 & x \notin A. \end{cases} We say AA is Jordan measurable (or has Jordan content) iff A1A\int_A \mathbf{1}_A exists (equivalently, 1A\mathbf{1}_A is Riemann integrable on any enclosing interval). In that case, the value c(A):=A1Ac(A) := \int_A \mathbf{1}_A is called the Jordan content of AA.

Remark.

Intuition: Jordan content is the Riemann theorist's notion of "length" (or "area" in higher dimensions). A set is Jordan measurable exactly when its characteristic function is Riemann integrable, i.e. when upper and lower sums of 1A\mathbf{1}_A can be made arbitrarily close. Intervals [a,b][a, b] have Jordan content bab - a; finite sets have Jordan content 00.

ExampleA Set Without Jordan Content

The set A=Q[0,1]A = \mathbb{Q} \cap [0, 1] does not have Jordan content. Indeed, 1A\mathbf{1}_A is the Dirichlet function restricted to [0,1][0, 1], which is not Riemann integrable by the previous example. Heuristically, AA is "too irregular" for Jordan's theory of length, despite being countable.

TheoremJordan Content Zero — Finite Covers

A bounded set ARA \subseteq \mathbb{R} has Jordan content zero if and only if for every ε>0\varepsilon > 0 there is a finite collection of intervals [a1,b1],,[am,bm][a_1, b_1], \dots, [a_m, b_m] with Ai=1m[ai,bi]andi=1m(biai)<ε.A \subseteq \bigcup_{i=1}^{m} [a_i, b_i] \qquad \text{and} \qquad \sum_{i=1}^{m}(b_i - a_i) < \varepsilon.

Remark.

Intuition: Jordan content zero sets can be covered by a finite collection of intervals of arbitrarily small total length. This finiteness is the crucial limitation: it rules out sets like Q[0,1]\mathbb{Q} \cap [0, 1], which would require countably (not finitely) many intervals.


Sets of Lebesgue Measure Zero

Relaxing "finite cover" to "countable cover" gives a much more permissive notion.

DefinitionZero Lebesgue Measure

A set ARA \subseteq \mathbb{R} has zero Lebesgue measure iff for every ε>0\varepsilon > 0 there exists a sequence of open intervals (aj,bj)(a_j, b_j), j1j \geq 1, such that Aj1(aj,bj)andj1(bjaj)<ε.A \subseteq \bigcup_{j \geq 1} (a_j, b_j) \qquad \text{and} \qquad \sum_{j \geq 1}(b_j - a_j) < \varepsilon.

Remark.

Intuition: A set has zero Lebesgue measure if it can be covered by a countable collection of intervals of arbitrarily small total length. The difference from Jordan content zero is that we now allow infinitely many intervals, which is far more flexible: countable sets always have Lebesgue measure zero, even when they have no Jordan content.

ExampleCountable Sets Have Measure Zero

The set Q[0,1]\mathbb{Q} \cap [0, 1] has zero Lebesgue measure. Enumerate Q[0,1]={q1,q2,}\mathbb{Q} \cap [0, 1] = \{q_1, q_2, \dots\} and given ε>0\varepsilon > 0, for each j1j \geq 1 let Ij:=(qjε2j+1,  qj+ε2j+1).I_j := \left(q_j - \tfrac{\varepsilon}{2^{j+1}},\; q_j + \tfrac{\varepsilon}{2^{j+1}}\right). Then Q[0,1]jIj\mathbb{Q} \cap [0, 1] \subseteq \bigcup_j I_j and jlength(Ij)=jε2j=ε\sum_j \text{length}(I_j) = \sum_j \tfrac{\varepsilon}{2^j} = \varepsilon. So Q[0,1]\mathbb{Q} \cap [0, 1] has zero Lebesgue measure even though it has no Jordan content.

Remark.

Jordan content zero implies zero Lebesgue measure. If AA has Jordan content zero, then the finite interval covers in the Jordan definition form (in particular) countable covers, so AA has zero Lebesgue measure. The converse is false in general, as Q[0,1]\mathbb{Q} \cap [0, 1] shows. However, for compact sets the two notions coincide: a compact set has Jordan content zero iff it has zero Lebesgue measure.

TheoremCountable Unions of Measure-Zero Sets

A countable union of sets of zero Lebesgue measure has zero Lebesgue measure.

Remark.

Intuition: This is the first essential advantage of Lebesgue measure over Jordan content: Jordan content is not closed under countable unions. Countable additivity of Lebesgue measure is what will eventually make the Lebesgue integral so much more flexible.

Lebesgue's Criterion for Riemann Integrability

The notion of Lebesgue measure zero has a stunning consequence in Riemann theory.

TheoremLebesgue Criterion for Riemann Integrability

Let f:[a,b]Rf : [a, b] \to \mathbb{R} be bounded. Then ff is Riemann integrable on [a,b][a, b] if and only if the set of points where ff is discontinuous has zero Lebesgue measure.

Remark.

Intuition: This is the cleanest possible description of which bounded functions are Riemann integrable. Continuity is not necessary; being almost everywhere continuous — with the "bad" set being negligible in the measure sense — is exactly what's needed. For example, the Dirichlet function is discontinuous on all of [0,1][0, 1], which is a set of Lebesgue measure 101 \neq 0, so it is not Riemann integrable. A bounded function continuous except on a countable set is Riemann integrable.

CorollaryJordan Content via Boundary

Let ARA \subseteq \mathbb{R} be a bounded set. Then AA has Jordan content if and only if its topological boundary A\partial A has zero Lebesgue measure.

CorollaryRiemann Integrability on Jordan-Measurable Sets

Let ARA \subseteq \mathbb{R} be Jordan measurable and f:ARf : A \to \mathbb{R} bounded. Then ff is Riemann integrable on AA if and only if ff is continuous almost everywhere on the interior of AA (i.e. the set of points in int(A)\mathrm{int}(A) where ff is discontinuous has zero Lebesgue measure).


Sigma-Algebras and Measurable Spaces

To develop measure theory properly we need to decide which subsets of a set XX we are allowed to assign a "measure" to. The right structure is a σ\sigma-algebra.

DefinitionSigma-Algebra

Let XX be a set, and write 2X2^X for the power set of XX (all subsets). A collection A2X\mathcal{A} \subseteq 2^X is a σ\sigma-algebra iff

(1) A\emptyset \in \mathcal{A} and XAX \in \mathcal{A}.

(2) If AAA \in \mathcal{A}, then Ac:=XAAA^c := X \setminus A \in \mathcal{A}.

(3) If AjAA_j \in \mathcal{A} for every jNj \in \mathbb{N}, then jNAjA\bigcup_{j \in \mathbb{N}} A_j \in \mathcal{A}.

If A\mathcal{A} is a σ\sigma-algebra of subsets of XX, the pair (X,A)(X, \mathcal{A}) is called a measurable space and sets in A\mathcal{A} are called A\mathcal{A}-measurable (or simply measurable).

Remark.

Intuition: A σ\sigma-algebra is a collection of sets that is closed under complementation and countable unions. Together with ,X\emptyset, X, this closure makes it stable under every countable set-theoretic operation: finite and countable intersections, differences, symmetric differences, limsup/liminf of sequences of sets, and so on. It is exactly the minimal structure needed to consistently assign "sizes" via countable operations.

LemmaClosure Under Countable Intersections

If A\mathcal{A} is a σ\sigma-algebra and AjAA_j \in \mathcal{A} for every jNj \in \mathbb{N}, then jNAjA\bigcap_{j \in \mathbb{N}} A_j \in \mathcal{A}.

Generation of Sigma-Algebras

TheoremIntersection of Sigma-Algebras

Let {Aα:αI}\{\mathcal{A}_\alpha : \alpha \in I\} be an arbitrary family of σ\sigma-algebras of subsets of XX. Then αIAα\bigcap_{\alpha \in I} \mathcal{A}_\alpha is a σ\sigma-algebra.

DefinitionGenerated Sigma-Algebra

Let G2X\mathcal{G} \subseteq 2^X. The σ\sigma-algebra generated by G\mathcal{G}, denoted σ(G)\sigma(\mathcal{G}), is the intersection of all σ\sigma-algebras of subsets of XX that contain G\mathcal{G}: σ(G):={A:A is a σ-algebra on X,GA}.\sigma(\mathcal{G}) := \bigcap \{\mathcal{A} : \mathcal{A} \text{ is a } \sigma\text{-algebra on } X, \mathcal{G} \subseteq \mathcal{A}\}.

Remark.

Intuition: σ(G)\sigma(\mathcal{G}) is the smallest σ\sigma-algebra containing G\mathcal{G}. It exists because 2X2^X itself is always a σ\sigma-algebra containing G\mathcal{G}, so the collection being intersected is nonempty, and the intersection is a σ\sigma-algebra by the previous theorem.

Borel Sets on R\mathbb{R}

DefinitionBorel Sigma-Algebra

Let (X,τ)(X, \tau) be a topological space. The Borel σ\sigma-algebra on XX is B(X):=σ(τ)\mathcal{B}(X) := \sigma(\tau), the σ\sigma-algebra generated by the open sets. Sets in B(X)\mathcal{B}(X) are called Borel sets.

Remark.

Intuition: Borel sets are the sets you can build from open sets by applying countable unions, countable intersections, and complements (possibly repeatedly). Every open set is Borel, every closed set is Borel, every countable union of closed sets (an FσF_\sigma) is Borel, every countable intersection of open sets (a GδG_\delta) is Borel, and so on. For practical purposes, every set you can "describe reasonably" on R\mathbb{R} is Borel.

TheoremGenerators of the Borel Sigma-Algebra on the Real Line

On R\mathbb{R} with its Euclidean topology τ\tau, the Borel σ\sigma-algebra coincides with the σ\sigma-algebra generated by each of the following collections: G1={(a,b):a<b},G2={[a,b):a<b},G3={(a,b]:a<b},G4={[a,b]:a<b}.\mathcal{G}_1 = \{(a, b) : a < b\}, \quad \mathcal{G}_2 = \{[a, b) : a < b\}, \quad \mathcal{G}_3 = \{(a, b] : a < b\}, \quad \mathcal{G}_4 = \{[a, b] : a < b\}. That is, B(R)=σ(τ)=σ(G1)=σ(G2)=σ(G3)=σ(G4)\mathcal{B}(\mathbb{R}) = \sigma(\tau) = \sigma(\mathcal{G}_1) = \sigma(\mathcal{G}_2) = \sigma(\mathcal{G}_3) = \sigma(\mathcal{G}_4).

Remark.

Intuition: Any of these natural collections of intervals generates the Borel σ\sigma-algebra. The essential observation is that open intervals, closed intervals, and half-open intervals can all be built from one another using countable operations (e.g. [a,b]=n(a1/n,b+1/n)[a, b] = \bigcap_n (a - 1/n, b + 1/n) and (a,b)=n[a+1/n,b1/n](a, b) = \bigcup_n [a + 1/n, b - 1/n]).


Measures

DefinitionMeasure

Given a measurable space (X,Σ)(X, \Sigma), a measure on (X,Σ)(X, \Sigma) is a function μ:Σ[0,+]\mu : \Sigma \to [0, +\infty] such that

(1) μ(A)<\mu(A) < \infty for at least one AΣA \in \Sigma.

(2) Countable additivity: If (Aj)jN(A_j)_{j \in \mathbb{N}} is a sequence of pairwise disjoint sets in Σ\Sigma, then μ(jNAj)=jNμ(Aj).\mu\left(\bigcup_{j \in \mathbb{N}} A_j\right) = \sum_{j \in \mathbb{N}} \mu(A_j).

In this case we call (X,Σ,μ)(X, \Sigma, \mu) a measure space. If in addition μ(X)=1\mu(X) = 1, μ\mu is a probability measure and (X,Σ,μ)(X, \Sigma, \mu) is a probability space.

Remark.

Intuition: A measure is a consistent way of assigning a nonnegative size to each measurable set, respecting the fact that disjoint pieces should have sizes that add. Countable additivity is the key axiom: it handles limit operations correctly. From countable additivity one derives μ()=0\mu(\emptyset) = 0 (using any AA with μ(A)<\mu(A) < \infty and the disjoint union A=AA = A \cup \emptyset \cup \emptyset \cup \cdots).

TheoremBasic Properties of Measures

Let (X,Σ,μ)(X, \Sigma, \mu) be a measure space.

(1) Monotonicity: If A,BΣA, B \in \Sigma with ABA \subseteq B, then μ(A)μ(B)\mu(A) \leq \mu(B). Moreover if μ(B)<\mu(B) < \infty, μ(BA)=μ(B)μ(A)\mu(B \setminus A) = \mu(B) - \mu(A).

(2) Countable subadditivity: If AjΣA_j \in \Sigma for jNj \in \mathbb{N}, then μ(jAj)jμ(Aj)\mu\left(\bigcup_j A_j\right) \leq \sum_j \mu(A_j).

(3) Continuity from below: If AjΣA_j \in \Sigma and AjAj+1A_j \subseteq A_{j+1} for every jj, then μ(jAj)=limjμ(Aj).\mu\left(\bigcup_j A_j\right) = \lim_{j \to \infty} \mu(A_j).

(4) Continuity from above: If AjΣA_j \in \Sigma and AjAj+1A_j \supseteq A_{j+1} for every jj, and there exists j0j_0 with μ(Aj0)<\mu(A_{j_0}) < \infty, then μ(jAj)=limjμ(Aj).\mu\left(\bigcap_j A_j\right) = \lim_{j \to \infty} \mu(A_j).


Outer Measures and Caratheodory's Construction

The axiomatic definition of measure leaves open the question of existence. A standard route is to first build an outer measure defined on all subsets of XX, then restrict to a carefully chosen sub-σ\sigma-algebra on which the outer measure is actually countably additive.

DefinitionOuter Measure

Given a set XX, an outer measure on XX is a function μ:2X[0,+]\mu^* : 2^X \to [0, +\infty] such that

(1) μ()=0\mu^*(\emptyset) = 0.

(2) Monotonicity: if ABA \subseteq B, then μ(A)μ(B)\mu^*(A) \leq \mu^*(B).

(3) Countable subadditivity: if AjXA_j \subseteq X for jNj \in \mathbb{N}, then μ(jAj)jμ(Aj).\mu^*\left(\bigcup_j A_j\right) \leq \sum_j \mu^*(A_j).

Remark.

Intuition: An outer measure is a set function defined on every subset that is monotone and subadditive over countable unions. It is not a measure in general — there is no additivity, only subadditivity. The point is that outer measures are easy to construct, and we can restrict to measurable sets to recover genuine additivity.

Constructing Outer Measures

DefinitionSequential Covering Class

A collection K2X\mathcal{K} \subseteq 2^X is a sequential covering class of XX iff

(1) K\emptyset \in \mathcal{K}.

(2) For every AXA \subseteq X, there exists a sequence (Ej)jN(E_j)_{j \in \mathbb{N}} with EjKE_j \in \mathcal{K} such that AjNEjA \subseteq \bigcup_{j \in \mathbb{N}} E_j.

ExampleHalf-Open Intervals Cover the Real Line

K={[a,b):ab}\mathcal{K} = \{[a, b) : a \leq b\} is a sequential covering class of R\mathbb{R}: =[a,a)K\emptyset = [a, a) \in \mathcal{K}, and any ARA \subseteq \mathbb{R} is covered by jZ[j,j+1)\bigcup_{j \in \mathbb{Z}} [j, j+1), a countable union of sets in K\mathcal{K}.

TheoremOuter Measure from a Covering Class

Let K\mathcal{K} be a sequential covering class of XX and λ:K[0,+]\lambda : \mathcal{K} \to [0, +\infty] with λ()=0\lambda(\emptyset) = 0. Define, for every AXA \subseteq X, μ(A):=inf{jNλ(Ej):EjK,  AjNEj}.\mu^*(A) := \inf\left\{\sum_{j \in \mathbb{N}} \lambda(E_j) : E_j \in \mathcal{K}, \; A \subseteq \bigcup_{j \in \mathbb{N}} E_j\right\}. Then μ\mu^* is an outer measure on XX.

DefinitionLebesgue Outer Measure

Take X=RX = \mathbb{R}, K={[a,b):ab}\mathcal{K} = \{[a, b) : a \leq b\}, and λ([a,b)):=ba\lambda([a, b)) := b - a. The associated outer measure μ\mu^* is called the Lebesgue outer measure on R\mathbb{R}.

Remark.

Intuition: The Lebesgue outer measure of AA is the infimum of total lengths of countable covers of AA by half-open intervals. This is exactly the definition of "zero Lebesgue measure" from earlier — that case corresponds to μ(A)=0\mu^*(A) = 0.

Caratheodory's Criterion

DefinitionCaratheodory Measurable

Let μ\mu^* be an outer measure on XX. A set AXA \subseteq X is μ\mu^*-measurable (or Caratheodory measurable) iff for every EXE \subseteq X, μ(E)=μ(EA)+μ(EAc).\mu^*(E) = \mu^*(E \cap A) + \mu^*(E \cap A^c).

Remark.

Intuition: The Caratheodory criterion says that AA cleanly "splits" every test set EE into two pieces whose outer measures add. By countable subadditivity, the inequality μ(E)μ(EA)+μ(EAc)\mu^*(E) \leq \mu^*(E \cap A) + \mu^*(E \cap A^c) is automatic; the content is the reverse inequality. The criterion singles out sets that are nice enough for additivity to hold.

TheoremCaratheodory — From Outer Measure to Measure

Let μ\mu^* be an outer measure on XX. The collection M:={AX:A is μ-measurable}\mathcal{M} := \{A \subseteq X : A \text{ is } \mu^*\text{-measurable}\} is a σ\sigma-algebra of subsets of XX, and the restriction μ:=μM\mu := \mu^*|_{\mathcal{M}} is a measure on (X,M)(X, \mathcal{M}).

Remark.

Intuition: Caratheodory's theorem is the engine that produces measures out of outer measures. Starting from any outer measure, we obtain a σ\sigma-algebra (automatically closed under all countable operations) and a genuine measure on it. The trade-off is that M\mathcal{M} may be smaller than 2X2^X: not every set is Caratheodory measurable.


Lebesgue Measure on R\mathbb{R}

DefinitionLebesgue Sigma-Algebra and Lebesgue Measure

Let μ\mu^* be the Lebesgue outer measure on R\mathbb{R}. The σ\sigma-algebra M\mathcal{M} of all μ\mu^*-measurable sets is called the Lebesgue σ\sigma-algebra on R\mathbb{R}. The measure μ:=μM\mu := \mu^*|_{\mathcal{M}} is called the Lebesgue measure on R\mathbb{R}.

Remark.

Intuition: Lebesgue measure is the unique "natural" extension of length from intervals to a large class of subsets of R\mathbb{R}, obtained by combining the covering-class outer measure construction with the Caratheodory restriction. It is countably additive, assigns length bab - a to the interval [a,b)[a, b), and contains every Borel set.

TheoremFundamental Properties of Lebesgue Measure

Let μ\mu denote Lebesgue measure on R\mathbb{R}, M\mathcal{M} the Lebesgue σ\sigma-algebra. Then

(1) Extension of length: μ([a,b))=μ((a,b))=μ([a,b])=μ((a,b])=ba\mu([a, b)) = \mu((a, b)) = \mu([a, b]) = \mu((a, b]) = b - a for all aba \leq b.

(2) Borel sets are measurable: B(R)M\mathcal{B}(\mathbb{R}) \subseteq \mathcal{M}. In particular, all open and closed sets are Lebesgue measurable.

(3) Countable additivity: For any sequence (Aj)(A_j) of pairwise disjoint sets in M\mathcal{M}, μ(jAj)=jμ(Aj)\mu\left(\bigcup_j A_j\right) = \sum_j \mu(A_j).

(4) Translation invariance: For any AMA \in \mathcal{M} and tRt \in \mathbb{R}, the translate A+t:={a+t:aA}A + t := \{a + t : a \in A\} is in M\mathcal{M} and μ(A+t)=μ(A)\mu(A + t) = \mu(A).

(5) Null sets: A set NRN \subseteq \mathbb{R} has zero Lebesgue measure (in the sense of the earlier definition) iff NMN \in \mathcal{M} and μ(N)=0\mu(N) = 0.

Remark.

Intuition: These are the basic features that justify calling μ\mu "length": it agrees with usual length on intervals, it contains all Borel sets (so in particular every set we can "describe"), it is countably additive, and it is invariant under translation — the geometry of the real line is respected. Countable additivity makes it vastly more flexible than Jordan content, and countable unions of null sets remain null, which is the technical underpinning of the Lebesgue integral.

Remark.

Why not just use Borel sets? The Lebesgue σ\sigma-algebra is strictly larger than the Borel σ\sigma-algebra; it contains, for instance, every subset of a Lebesgue null Borel set (such subsets need not be Borel). This completeness property is useful because it implies that changing an integrable function on a null set does not affect measurability or integrability.

Lebesgue Measure Agrees with Length

LemmaLebesgue Outer Measure of an Interval

For every aba \leq b, μ([a,b))=ba.\mu^*([a, b)) = b - a. In particular, μ([a,b])=μ((a,b))=μ((a,b])=ba\mu^*([a, b]) = \mu^*((a, b)) = \mu^*((a, b]) = b - a as well.

Remark.

Intuition: Covering [a,b)[a, b) by itself gives μ([a,b))ba\mu^*([a, b)) \leq b - a. The nontrivial direction is that every countable cover of [a,b)[a, b) by half-open intervals has total length ba\geq b - a; this is proved by a compactness argument (reduce to finite covers using Heine–Borel after a small ε\varepsilon-enlargement to open intervals, then add up lengths along the interval). So the outer measure truly extends length.

TheoremBorel Sets Are Lebesgue Measurable

Every Borel subset of R\mathbb{R} is Lebesgue measurable, i.e. B(R)M\mathcal{B}(\mathbb{R}) \subseteq \mathcal{M}.

Remark.

Intuition: Since the Lebesgue σ\sigma-algebra M\mathcal{M} is a σ\sigma-algebra that contains every interval (via the Caratheodory criterion applied to half-open intervals), it must contain the σ\sigma-algebra generated by intervals — which is exactly B(R)\mathcal{B}(\mathbb{R}). Hence open sets, closed sets, FσF_\sigma's, GδG_\delta's, and so on, are all Lebesgue measurable.

Approximation by Open and Closed Sets

Although sets in M\mathcal{M} can be extremely irregular, their Lebesgue measure is well-approximated by nicer sets.

TheoremOuter and Inner Regularity of Lebesgue Measure

A set ARA \subseteq \mathbb{R} is Lebesgue measurable if and only if for every ε>0\varepsilon > 0 there exists an open set ΩA\Omega \supseteq A with μ(ΩA)<ε\mu^*(\Omega \setminus A) < \varepsilon, which happens if and only if for every ε>0\varepsilon > 0 there exists a closed set FAF \subseteq A with μ(AF)<ε\mu^*(A \setminus F) < \varepsilon.

Remark.

Intuition: Measurability is exactly the same as "approximable above by an open set and below by a closed set, to arbitrary precision." This is the technical underpinning of many constructions in integration: we can always replace a measurable set by an open or closed approximation and control the error by the measure of the symmetric difference.

Existence of Non-Measurable Sets

TheoremVitali — Non-Lebesgue-Measurable Sets Exist

There exists a subset of R\mathbb{R} that is not Lebesgue measurable, i.e. M2R\mathcal{M} \subsetneq 2^\mathbb{R}.

Remark.

Intuition: The explicit construction (due to Vitali) uses the axiom of choice to pick one representative from each coset of Q\mathbb{Q} inside [0,1][0, 1]. The resulting "Vitali set" cannot be assigned a Lebesgue measure consistent with translation invariance and countable additivity. The proof is outside the main development, but the take-away is important: extending "length" to every subset of R\mathbb{R} in a way compatible with countable additivity and translation invariance is impossible. Lebesgue's σ\sigma-algebra is as large as we can hope for without abandoning these properties.


Simple Functions and the Lebesgue Integral

Now that we have the Lebesgue measure on R\mathbb{R}, we can begin to build the Lebesgue integral. The simplest functions to integrate are those that take only finitely many values.

DefinitionSimple Function

A function f:RRf : \mathbb{R} \to \mathbb{R} is a simple function iff its range is a finite set {a1,,aN}R\{a_1, \dots, a_N\} \subseteq \mathbb{R} and, for each jj, the level set Ej:={xR:f(x)=aj}E_j := \{x \in \mathbb{R} : f(x) = a_j\} is Lebesgue measurable. Equivalently, f=j=1Naj1Ejf = \sum_{j=1}^{N} a_j \mathbf{1}_{E_j} with the EjE_j measurable and pairwise disjoint.

Remark.

Intuition: Simple functions are the measure-theoretic analogue of step functions, with arbitrary measurable level sets replacing intervals. Their integral is defined by "area = value times measure of level set," summed over level sets. Every measurable function is a monotone limit of simple functions, so Lebesgue integration of general measurable functions is built by extending this definition through limits.

DefinitionLebesgue Integral of a Simple Function

Let f=j=1Naj1Ejf = \sum_{j=1}^{N} a_j \mathbf{1}_{E_j} be a simple function with EjME_j \in \mathcal{M} pairwise disjoint. The Lebesgue integral of ff (with respect to Lebesgue measure μ\mu) is fdμ:=j=1Najμ(Ej),\int f \, d\mu := \sum_{j=1}^{N} a_j \, \mu(E_j), with the convention 0(+)=00 \cdot (+\infty) = 0.

Remark.

Intuition: This mirrors the Riemann sum kf(ξk)(xkxk1)\sum_k f(\xi_k) (x_k - x_{k-1}), but instead of partitioning the domain into intervals, we partition the range into level values and weight each by the measure of the preimage. This "horizontal slicing" is what makes Lebesgue integration so flexible: it makes sense whenever the preimages are measurable, regardless of how wildly they are scattered in the domain.

ExampleIndicator Functions

If EME \in \mathcal{M} has μ(E)<\mu(E) < \infty, the indicator 1E\mathbf{1}_E is simple with range {0,1}\{0, 1\} and 1Edμ=1μ(E)+0μ(RE)=μ(E).\int \mathbf{1}_E \, d\mu = 1 \cdot \mu(E) + 0 \cdot \mu(\mathbb{R} \setminus E) = \mu(E). For instance, 1[2,5)dμ=5(2)=7\int \mathbf{1}_{[-2, 5)} \, d\mu = 5 - (-2) = 7.

ExampleLebesgue Integral of the Dirichlet Function

Let f:[0,1]Rf : [0, 1] \to \mathbb{R} be the Dirichlet function from earlier: f(x)=1f(x) = 1 if xQ[0,1]x \in \mathbb{Q} \cap [0, 1], f(x)=0f(x) = 0 otherwise. Since Q[0,1]\mathbb{Q} \cap [0, 1] is countable, it is Lebesgue measurable with measure zero, so ff is a simple function. By the definition, fdμ=1μ(Q[0,1])+0μ([0,1]Q)=10+01=0.\int f \, d\mu = 1 \cdot \mu(\mathbb{Q} \cap [0, 1]) + 0 \cdot \mu([0, 1] \setminus \mathbb{Q}) = 1 \cdot 0 + 0 \cdot 1 = 0. So the Dirichlet function, which fails to be Riemann integrable, has Lebesgue integral equal to 00 — matching the intuition that the function is "essentially zero" (differing from zero only on a null set).

Remark.

Intuition: This example is the cleanest illustration of the superiority of the Lebesgue theory. Changing an integrable function on a null set does not affect its Lebesgue integral; in particular, functions that agree almost everywhere have the same integral. Riemann integration lacks this property because the Riemann integral is too closely tied to the continuity of the function at individual points rather than to its global behaviour on the level sets.

Remark.

Beyond simple functions. The Lebesgue integral can be extended to a much wider class of functions — the measurable functions — by approximating them as monotone (or dominated) limits of simple functions and taking the limits of the corresponding integrals. This is developed in the standard reference (Terrell, Chapter 17), and yields the full-fledged Lebesgue integral, along with its powerful convergence theorems (monotone convergence, dominated convergence, Fatou's lemma). For the purposes of this course, the key ideas are: (i) what measurable sets are, (ii) that Lebesgue measure genuinely extends length, and (iii) that simple functions can already integrate examples out of reach of the Riemann theory.