Math 2.0

Real functions Proof

Proof of Lebesgue's criterion for Riemann integrability

Builds on Riemann integrable functionRiemann's criterion for integrabilityUpper and lower Darboux sumsPartition of an intervalContinuity at a pointEpsilon-delta definition of continuitySupremumInfimumThe reals are ArchimedeanHeine–Borel theoremCompactness via open coversClosed setCountable union of countable sets is countableOscillation of a function

Proof

We use the oscillation of ff and Riemann's criterion, and compactness for the converse. Let a<ba < b and let f ⁣:[a,b]→ℝf \colon [a, b] \to \mathbb{R} be bounded. Fix K>0K > 0 with ∣f(x)∣≤K|f(x)| \le K for all x∈[a,b]x \in [a, b]. A set E⊆ℝE \subseteq \mathbb{R} has measure zero if for each ε>0\varepsilon > 0 it is covered by countably many open intervals of total length less than ε\varepsilon. Write U(P)U(P) and L(P)L(P) for the upper and lower Darboux sums of ff for a partition PP, with MiM_i and mim_i as in their definition.

  1. For a nonempty set A⊆[a,b]A \subseteq [a, b], let ω(A)=sup⁡f(A)−inf⁡f(A)\omega(A) = \sup f(A) - \inf f(A), using the supremum and the infimum. If A⊆BA \subseteq B, then ω(A)≤ω(B)\omega(A) \le \omega(B). For x,y∈Ax, y \in A we have ∣f(x)−f(y)∣≤ω(A)|f(x) - f(y)| \le \omega(A).
  2. For x∈[a,b]x \in [a, b] and r>0r > 0, let Ar(x)=(x−r,x+r)∩[a,b]A_r(x) = (x - r, x + r) \cap [a, b]. The oscillation of ff at xx is ω(x)=inf⁡r>0ω(Ar(x))≥0\omega(x) = \inf_{r > 0} \omega(A_r(x)) \ge 0.
  3. We claim that ff is continuous at xx if and only if ω(x)=0\omega(x) = 0. Suppose first that ff is continuous at xx, and let ε>0\varepsilon > 0. By the epsilon-delta form of continuity, there is r>0r > 0 with ∣f(y)−f(x)∣<ε/2|f(y) - f(x)| < \varepsilon / 2 for y∈Ar(x)y \in A_r(x). So f(Ar(x))⊆[f(x)−ε/2,f(x)+ε/2]f(A_r(x)) \subseteq [f(x) - \varepsilon/2, f(x) + \varepsilon/2] and ω(x)≤ω(Ar(x))≤ε\omega(x) \le \omega(A_r(x)) \le \varepsilon. Hence ω(x)=0\omega(x) = 0.
  4. Conversely, let ω(x)=0\omega(x) = 0 and ε>0\varepsilon > 0. There is r>0r > 0 with ω(Ar(x))<ε\omega(A_r(x)) < \varepsilon. By step 1, ∣f(y)−f(x)∣<ε|f(y) - f(x)| < \varepsilon for all y∈Ar(x)y \in A_r(x). So ff is continuous at xx.
  5. For α>0\alpha > 0, let Dα={x∈[a,b]:ω(x)≥α}D_\alpha = \{x \in [a, b] : \omega(x) \ge \alpha\}, and let DD be the set of points where ff is not continuous. By steps 3 and 4 and the Archimedean property, x∈Dx \in D if and only if ω(x)≥1/k\omega(x) \ge 1/k for some integer k≥1k \ge 1. So D=⋃k≥1D1/kD = \bigcup_{k \ge 1} D_{1/k}, and Dα⊆DD_\alpha \subseteq D for each α>0\alpha > 0.
  6. We claim that DαD_\alpha is closed. Let x∈[a,b]∖Dαx \in [a, b] \setminus D_\alpha. Then there is r>0r > 0 with ω(Ar(x))<α\omega(A_r(x)) < \alpha. For y∈Ar(x)y \in A_r(x), let s=r−∣y−x∣>0s = r - |y - x| > 0. Then As(y)⊆Ar(x)A_s(y) \subseteq A_r(x), so ω(y)≤ω(As(y))≤ω(Ar(x))<α\omega(y) \le \omega(A_s(y)) \le \omega(A_r(x)) < \alpha. Thus (x−r,x+r)(x - r, x + r) does not meet DαD_\alpha.
  7. Each point outside [a,b][a, b] also has an open interval around it that misses [a,b]⊇Dα[a, b] \supseteq D_\alpha. So the complement of DαD_\alpha in ℝ\mathbb{R} is open, and DαD_\alpha is closed. It is bounded, so it is compact by the Heine–Borel theorem.

First assume that ff is Riemann integrable.

  1. Fix an integer k≥1k \ge 1 and let ε>0\varepsilon > 0. By Riemann's criterion, there is a partition P=(x0,…,xn)P = (x_0, \dots, x_n) with U(P)−L(P)<ε2kU(P) - L(P) < \frac{\varepsilon}{2k}.
  2. Let BB be the set of indices ii such that the open interval (xi−1,xi)(x_{i-1}, x_i) contains a point yy of D1/kD_{1/k}. For such ii and yy, some Ar(y)A_r(y) lies in [xi−1,xi][x_{i-1}, x_i]. So Mi−mi=ω([xi−1,xi])≥ω(Ar(y))≥ω(y)≥1/kM_i - m_i = \omega([x_{i-1}, x_i]) \ge \omega(A_r(y)) \ge \omega(y) \ge 1/k.
  3. Every term (Mi−mi)(xi−xi−1)(M_i - m_i)(x_i - x_{i-1}) of U(P)−L(P)U(P) - L(P) is at least 00. So step 9 gives 1k∑i∈B(xi−xi−1)≤U(P)−L(P)<ε2k\frac{1}{k} \sum_{i \in B} (x_i - x_{i-1}) \le U(P) - L(P) < \frac{\varepsilon}{2k}. Hence ∑i∈B(xi−xi−1)<ε2\sum_{i \in B} (x_i - x_{i-1}) < \frac{\varepsilon}{2}.
  4. Each point of D1/kD_{1/k} lies in some (xi−1,xi)(x_{i-1}, x_i) with i∈Bi \in B, or is a point xjx_j of PP. Let η=ε4(n+1)\eta = \frac{\varepsilon}{4(n + 1)}. The intervals (xi−1,xi)(x_{i-1}, x_i) for i∈Bi \in B and (xj−η,xj+η)(x_j - \eta, x_j + \eta) for j=0,…,nj = 0, \dots, n cover D1/kD_{1/k}. Their total length is less than ε2+2(n+1)η=ε\frac{\varepsilon}{2} + 2(n + 1)\eta = \varepsilon. So D1/kD_{1/k} has measure zero.
  5. Now let ε>0\varepsilon > 0. For each k≥1k \ge 1, step 11 gives countably many open intervals that cover D1/kD_{1/k} with total length less than ε/2k+1\varepsilon / 2^{k + 1}.
  6. Together these intervals cover DD by step 5. They form a countable family, since a countable union of countable sets is countable.
  7. Any finitely many of them lie in the families for k≤Nk \le N, for some NN. So their total length is less than ∑k=1Nε/2k+1<ε/2\sum_{k = 1}^{N} \varepsilon / 2^{k + 1} < \varepsilon / 2. Hence the total length of the whole family is at most ε/2<ε\varepsilon / 2 < \varepsilon. So DD has measure zero.

Now assume that DD has measure zero.

  1. Let ε>0\varepsilon > 0, and let α=ε4(b−a)\alpha = \frac{\varepsilon}{4(b - a)}. By step 5, Dα⊆DD_\alpha \subseteq D. So countably many open intervals of total length less than ε4K\frac{\varepsilon}{4K} cover DαD_\alpha.
  2. By step 7 and compactness via open covers, finitely many of them, say G1,…,GNG_1, \dots, G_N, already cover DαD_\alpha. Their total length is still less than ε4K\frac{\varepsilon}{4K}. If DαD_\alpha is empty, take N=0N = 0.
  3. Let z∈[a,b]z \in [a, b] lie in none of the GjG_j. Then z∉Dαz \notin D_\alpha, so ω(z)<α\omega(z) < \alpha. Choose rz>0r_z > 0 with ω(Arz(z))<α\omega(A_{r_z}(z)) < \alpha, and let Hz=(z−rz/2,z+rz/2)H_z = (z - r_z / 2, z + r_z / 2).
  4. The open intervals G1,…,GNG_1, \dots, G_N and HzH_z cover [a,b][a, b]. By the Heine–Borel theorem [a,b][a, b] is compact, so finitely many Hz1,…,HzmH_{z_1}, \dots, H_{z_m} together with G1,…,GNG_1, \dots, G_N cover [a,b][a, b].
  5. Let P=(x0,…,xn)P = (x_0, \dots, x_n) be the partition whose points are aa, bb and all endpoints of these N+mN + m intervals that lie in (a,b)(a, b).
  6. Fix ii, and let cc be the midpoint of [xi−1,xi][x_{i-1}, x_i]. Choose an interval VV of the finite cover that contains cc, and take V=GjV = G_j for some jj when this is possible.
  7. We claim (xi−1,xi)⊆V(x_{i-1}, x_i) \subseteq V. Suppose that y∈(xi−1,xi)y \in (x_{i-1}, x_i) is not in VV. Since VV is an interval containing cc, one endpoint of VV lies between cc and yy. That endpoint lies in (xi−1,xi)(x_{i-1}, x_i), so it is a point of PP strictly inside a subinterval of PP. This is impossible. So [xi−1,xi][x_{i-1}, x_i] lies in the closure of VV.
  8. Call ii of type 1 if V=GjV = G_j, and of type 2 if V=HzV = H_z. For type 2, [xi−1,xi]⊆[z−rz/2,z+rz/2]∩[a,b]⊆Arz(z)[x_{i-1}, x_i] \subseteq [z - r_z/2, z + r_z/2] \cap [a, b] \subseteq A_{r_z}(z). So Mi−mi≤ω(Arz(z))<αM_i - m_i \le \omega(A_{r_z}(z)) < \alpha by step 1.
  9. For type 1, Mi−mi≤2KM_i - m_i \le 2K. The type 1 subintervals with V=GjV = G_j do not overlap and lie in the closure of GjG_j. So their total length is at most the length of GjG_j.
  10. Adding over jj, the type 1 subintervals have total length less than ε4K\frac{\varepsilon}{4K}. The type 2 subintervals have total length at most b−ab - a.
  11. Hence U(P)−L(P)=∑i=1n(Mi−mi)(xi−xi−1)≤2K⋅ε4K+α(b−a)=3ε4<ε.U(P) - L(P) = \sum_{i = 1}^{n} (M_i - m_i)(x_i - x_{i-1}) \le 2K \cdot \frac{\varepsilon}{4K} + \alpha (b - a) = \frac{3 \varepsilon}{4} < \varepsilon.
  12. Such a partition exists for each ε>0\varepsilon > 0. By Riemann's criterion, ff is Riemann integrable on [a,b][a, b].

Steps 14 and 26 prove both directions.

Idea

The oscillation ω(x)\omega(x) measures how much ff jumps near xx, and ff is discontinuous exactly where it is positive. If ff is integrable, the subintervals where ff jumps by at least 1/k1/k must have small total length, so each set D1/kD_{1/k} is small. Conversely, the points with large oscillation form a compact set, so finitely many short intervals cover them. Elsewhere ff varies little, and the upper and lower sums come close together.

Reading path

To understand this page from the ground up, read these 158 pages in order. The foundations come first. The path takes the proofs Proof that Darboux and Riemann integrals agree, Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof of the commutativity of addition by induction, Proof of the Lebesgue number lemma by a finite cover of balls, Proof of the epsilon-delta form of continuity, Proof of the Heine–Borel theorem by sequential compactness, Proof that a composition of injections is injective, Proof that a countable union of countable sets is countable, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof that compact subsets of a metric space are bounded, Proof that the product of countable sets is countable, Proof that compactness and sequential compactness agree in metric spaces, Proof that subsequences of a convergent sequence converge to the same limit, Proof of strong induction from ordinary induction, Proof that compact subsets of a Hausdorff space are closed, Proof of Riemann's criterion for integrability, Proof of the description of the open sets of a metric space, Proof of the epsilon-N definition of the limit of a sequence, Proof that compactness of a subset can be tested with open sets of the ambient space, Proof that closed sets contain their limits, Proof that metric spaces are Hausdorff, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof of the monotone convergence theorem for sequences, Proof that open balls are open.

  1. Construction of the reals from Cauchy sequences concept
  2. Definition by recursion concept
  3. Element definition
  4. Euclidean metric example
  5. Extended real number line object
  6. Integers object
  7. Limit point of a set definition
  8. Mathematical induction concept
  9. Natural numbers object
  10. Ordered field definition
  11. Oscillation of a function concept
  12. Partition of an interval definition
  13. Peano axioms concept
  14. Proposition concept
  15. Rational numbers object
  16. Real numbers object
  17. Sequence definition
  18. Set bounded above definition
  19. Set definition
  20. Ring of integers statement
  21. Limit of a function definition
  22. Archimedean ordered field definition
  23. Successor function definition
  24. Mesh of a partition definition
  25. Refinement of a partition definition
  26. Riemann sum definition
  27. Conjunction definition
  28. Disjunction definition
  29. Implication definition
  30. Predicate definition
  31. The reals form a field statement
  32. Real sequence definition
  33. Subsequence definition
  34. Infimum definition
  35. Supremum definition
  36. Empty set object
  37. Family of sets definition
  38. Ordered pair definition
  39. Continuity at a point definition
  40. Intersection definition
  41. Union definition
  42. Addition of natural numbers definition
  43. Riemann integrable function definition
  44. The rationals form a field statement
  45. The successor function is injective statement
  46. Zero is not a successor statement
  47. Existential quantifier definition
  48. Universal quantifier definition
  49. Bounded sequence definition
  50. Limit of a sequence definition
  51. Monotone sequence definition
  52. Completeness axiom statement
  53. Cartesian product definition
  54. Proof of the commutativity of addition by induction proof
  55. Union of a family of sets definition
  56. Subset definition
  57. Order on the natural numbers definition
  58. Riemann integral definition
  59. The rationals form an ordered field statement
  60. Uniqueness quantifier definition
  61. Upper and lower Darboux sums definition
  62. Convergent sequence definition
  63. Binary relation definition
  64. Universal set definition
  65. Topological space definition
  66. Order on the reals definition
  67. Commutativity of addition statement
  68. Proof of strong induction from ordinary induction proof
  69. Upper and lower Darboux integrals definition
  70. Antisymmetric relation definition
  71. Reflexive relation definition
  72. Transitive relation definition
  73. Complement definition
  74. Sequential compactness definition
  75. Interval definition
  76. Subspace topology definition
  77. Function definition
  78. Strong induction statement
  79. Preorder definition
  80. Proof of the epsilon-delta form of continuity proof
  81. Choice function definition
  82. Proof of the well-ordering principle from strong induction proof
  83. Codomain definition
  84. Function composition definition
  85. Injective function definition
  86. Metric space definition
  87. Partial order definition
  88. Epsilon-delta definition of continuity statement
  89. Axiom of choice statement
  90. Well-ordering principle statement
  91. Proof that a composition of injections is injective proof
  92. Surjective function definition
  93. Countable set definition
  94. Closed ball definition
  95. Convergence of a sequence in a metric space definition
  96. Open ball definition
  97. Triangle inequality for a metric statement
  98. Diameter of a set definition
  99. Total order definition
  100. Composition of injections is injective statement
  101. Bijective function definition
  102. Metric topology definition
  103. Bounded set definition
  104. Proof that every sequence has a monotone subsequence, by peaks proof
  105. Cantor pairing function example
  106. Open set definition
  107. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  108. Every sequence has a monotone subsequence statement
  109. Hausdorff space definition
  110. Open cover definition
  111. Closed set definition
  112. Proof that the product of countable sets is countable proof
  113. Proof of the description of the open sets of a metric space proof
  114. The reals form an ordered field statement
  115. Compact space definition
  116. Product of countable sets is countable statement
  117. Open sets of a metric space statement
  118. Absolute value definition
  119. Proof of the approximation property of the supremum proof
  120. Proof that a countable union of countable sets is countable proof
  121. Compact set definition
  122. Proof that closed sets contain their limits proof
  123. Proof that open balls are open proof
  124. Proof of the epsilon-N definition of the limit of a sequence proof
  125. Approximation property of the supremum statement
  126. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  127. Countable union of countable sets is countable statement
  128. Closed sets contain their limits statement
  129. Open balls are open statement
  130. Epsilon-N definition of the limit of a sequence statement
  131. Proof that the reals are Archimedean from the completeness axiom proof
  132. Compactness via open covers statement
  133. Proof of the Lebesgue number lemma by a finite cover of balls proof
  134. Proof that metric spaces are Hausdorff proof
  135. The reals are Archimedean statement
  136. Proof that subsequences of a convergent sequence converge to the same limit proof
  137. Proof of the monotone convergence theorem for sequences proof
  138. Proof that compact subsets of a Hausdorff space are closed proof
  139. Lebesgue number lemma statement
  140. Metric spaces are Hausdorff statement
  141. Proof that compact subsets of a metric space are bounded proof
  142. Proof that compactness and sequential compactness agree in metric spaces proof
  143. Proof that Darboux and Riemann integrals agree proof
  144. Subsequences of a convergent sequence converge to the same limit statement
  145. Monotone convergence theorem for sequences statement
  146. Compact subsets of a Hausdorff space are closed statement
  147. Compactness and sequential compactness agree in metric spaces statement
  148. Compact subsets of a metric space are bounded statement
  149. Darboux and Riemann integrals agree statement
  150. Proof that a decreasing sequence bounded below converges proof
  151. Decreasing sequence bounded below converges statement
  152. Proof of Riemann's criterion for integrability proof
  153. Riemann's criterion for integrability statement
  154. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  155. Bolzano–Weierstrass theorem statement
  156. Proof of the Heine–Borel theorem by sequential compactness proof
  157. Heine–Borel theorem statement
  158. Proof of Lebesgue's criterion for Riemann integrability proof

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Riemann_integral, Integrability
About this page
TagNK8394NHRC
URIm2://NK8394NHRC
Kindproof
WritingW0 stub
MSC26A42
ProvesLebesgue's criterion for Riemann integrability
UsesRiemann integrable function, Riemann's criterion for integrability, Upper and lower Darboux sums, Partition of an interval, Continuity at a point, Epsilon-delta definition of continuity, Supremum, Infimum, The reals are Archimedean, Heine–Borel theorem, Compactness via open covers, Closed set, Countable union of countable sets is countable, Oscillation of a function
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.