Math 2.0

Real functions Proof

Proof that Darboux and Riemann integrals agree

Builds on Riemann integrable functionRiemann integralUpper and lower Darboux integralsUpper and lower Darboux sumsRiemann sumPartition of an intervalMesh of a partitionRefinement of a partitionSupremumInfimumThe reals are Archimedean

Proof

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]. Write U(P)U(P) and L(P)L(P) for the upper and lower Darboux sums of ff for a partition PP. Write S(P,t)S(P, t) for the Riemann sum with tags tt. Let U∗U^* and L∗L^* be the upper and lower Darboux integrals. We first prove four facts, then the two directions.

  1. Let P=(x0,…,xn)P = (x_0, \dots, x_n) with tags ti∈[xi−1,xi]t_i \in [x_{i-1}, x_i]. Then mi≤f(ti)≤Mim_i \le f(t_i) \le M_i for each ii. Multiply by xi−xi−1>0x_i - x_{i-1} > 0 and add: L(P)≤S(P,t)≤U(P)L(P) \le S(P, t) \le U(P).
  2. Let RR be a refinement of a partition Q=(y0,…,ym)Q = (y_0, \dots, y_m). Each subinterval of RR lies in exactly one subinterval [yj−1,yj][y_{j-1}, y_j] of QQ, because no point of QQ lies strictly between two consecutive points of RR. The subintervals of RR inside [yj−1,yj][y_{j-1}, y_j] have total length yj−yj−1y_j - y_{j-1}.
  3. A supremum over a subset is at most the supremum over the whole set, and an infimum over a subset is at least the infimum. Group the terms of U(R)U(R) by step 2. This gives U(R)≤U(Q)U(R) \le U(Q), and in the same way L(R)≥L(Q)L(R) \ge L(Q).
  4. For any partitions PP and QQ, let RR consist of the points of both. By steps 3 and 1, L(P)≤L(R)≤U(R)≤U(Q)L(P) \le L(R) \le U(R) \le U(Q). Taking the supremum over PP and then the infimum over QQ gives L∗≤U∗L^* \le U^*.
  5. For each δ>0\delta > 0 there is a partition with mesh less than δ\delta. Indeed, take nn with nδ>b−an \delta > b - a, by the Archimedean property, and xi=a+i(b−a)/nx_i = a + i (b - a)/n.

First assume that ff is Riemann integrable with integral II.

  1. Let ε>0\varepsilon > 0. Take δ>0\delta > 0 such that ∣S(P,t)−I∣<ε/2|S(P, t) - I| < \varepsilon / 2 for each tagged partition of mesh less than δ\delta. By step 5, fix such a partition P=(x0,…,xn)P = (x_0, \dots, x_n).
  2. For each ii, the number Mi−ε2(b−a)M_i - \frac{\varepsilon}{2(b - a)} is not an upper bound of ff on [xi−1,xi][x_{i-1}, x_i]. So there is tit_i there with f(ti)>Mi−ε2(b−a)f(t_i) > M_i - \frac{\varepsilon}{2(b - a)}.
  3. Multiply by xi−xi−1x_i - x_{i-1} and add. This gives S(P,t)>U(P)−ε/2S(P, t) > U(P) - \varepsilon/2. So U∗≤U(P)<S(P,t)+ε/2<I+εU^* \le U(P) < S(P, t) + \varepsilon / 2 < I + \varepsilon.
  4. In the same way, choose tags ti′t'_i with f(ti′)<mi+ε2(b−a)f(t'_i) < m_i + \frac{\varepsilon}{2(b - a)}. This gives L∗≥L(P)>S(P,t′)−ε/2>I−εL^* \ge L(P) > S(P, t') - \varepsilon/2 > I - \varepsilon.
  5. So I−ε<L∗≤U∗<I+εI - \varepsilon < L^* \le U^* < I + \varepsilon for each ε>0\varepsilon > 0, using step 4. Hence L∗=U∗=IL^* = U^* = I.

Now assume that L∗=U∗L^* = U^*, and call this number DD.

  1. Let ε>0\varepsilon > 0. Since D+ε/8D + \varepsilon / 8 is not a lower bound of the upper sums, there is Q1Q_1 with U(Q1)<D+ε/8U(Q_1) < D + \varepsilon/8. In the same way, there is Q2Q_2 with L(Q2)>D−ε/8L(Q_2) > D - \varepsilon / 8.
  2. Let QQ consist of the points of Q1Q_1 and Q2Q_2. By step 3, U(Q)−L(Q)≤U(Q1)−L(Q2)<ε/4U(Q) - L(Q) \le U(Q_1) - L(Q_2) < \varepsilon / 4. Let mm be the number of subintervals of QQ, and put δ=ε8mK\delta = \frac{\varepsilon}{8 m K}.
  3. Let P=(x0,…,xn)P = (x_0, \dots, x_n) have mesh less than δ\delta, and let P′P' consist of the points of PP and QQ. Then P′P' refines both PP and QQ.
  4. Call a subinterval [xk−1,xk][x_{k-1}, x_k] of PP split if a point of QQ lies strictly inside it. Only the m−1m - 1 points of QQ other than aa and bb can do this. Each lies inside at most one subinterval of PP. So at most m−1m - 1 subintervals are split.
  5. Group the terms of U(P′)U(P') by the subintervals of PP, as in step 2. A subinterval of PP that is not split is also a subinterval of P′P', and its terms cancel in U(P)−U(P′)U(P) - U(P').
  6. For a split subinterval JJ of length ∣J∣<δ|J| < \delta, its term in U(P)U(P) is at most K∣J∣K |J|. Its terms in U(P′)U(P') add up to at least −K∣J∣-K |J|, since every supremum is at least −K-K. So it adds at most 2K∣J∣<2Kδ2 K |J| < 2 K \delta to U(P)−U(P′)U(P) - U(P').
  7. By steps 14 to 16, U(P)−U(P′)≤2(m−1)Kδ<ε/4U(P) - U(P') \le 2 (m - 1) K \delta < \varepsilon / 4. With step 3 for P′P' and QQ, U(P)<U(P′)+ε/4≤U(Q)+ε/4U(P) < U(P') + \varepsilon/4 \le U(Q) + \varepsilon / 4.
  8. The same argument with infima gives L(P)>L(P′)−ε/4≥L(Q)−ε/4L(P) > L(P') - \varepsilon/4 \ge L(Q) - \varepsilon / 4.
  9. By steps 17, 18 and 12, U(P)−L(P)<U(Q)−L(Q)+ε/2<εU(P) - L(P) < U(Q) - L(Q) + \varepsilon / 2 < \varepsilon.
  10. By the definitions of L∗L^* and U∗U^*, we have L(P)≤D≤U(P)L(P) \le D \le U(P). By step 1, also L(P)≤S(P,t)≤U(P)L(P) \le S(P, t) \le U(P) for all tags tt. So ∣S(P,t)−D∣≤U(P)−L(P)<ε|S(P, t) - D| \le U(P) - L(P) < \varepsilon.
  11. This holds for every tagged partition of mesh less than δ\delta. So ff is Riemann integrable, and its integral is DD.

Steps 10 and 21 prove both directions. In both cases the Riemann integral equals the common value of the Darboux integrals.

Idea

A Riemann sum always lies between the lower and the upper Darboux sum. If Riemann sums converge, tags near the suprema and infima force the Darboux sums together. Conversely, a fine partition differs from a good fixed partition QQ only on the few short subintervals that contain points of QQ. So its Darboux sums are also close together.

Reading path

To understand this page from the ground up, read these 49 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof that the reals are Archimedean from the completeness axiom.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Integers object
  4. Ordered field definition
  5. Partition of an interval definition
  6. Proposition concept
  7. Rational numbers object
  8. Real numbers object
  9. Sequence definition
  10. Set bounded above definition
  11. Set definition
  12. Ring of integers statement
  13. Archimedean ordered field definition
  14. Mesh of a partition definition
  15. Refinement of a partition definition
  16. Riemann sum definition
  17. Implication definition
  18. Predicate definition
  19. The reals form a field statement
  20. Real sequence definition
  21. Infimum definition
  22. Supremum definition
  23. Ordered pair definition
  24. The rationals form a field statement
  25. Riemann integrable function definition
  26. Universal quantifier definition
  27. Bounded sequence definition
  28. Completeness axiom statement
  29. Cartesian product definition
  30. Riemann integral definition
  31. The rationals form an ordered field statement
  32. Subset definition
  33. Upper and lower Darboux sums definition
  34. Order on the reals definition
  35. Binary relation definition
  36. Upper and lower Darboux integrals definition
  37. Antisymmetric relation definition
  38. Reflexive relation definition
  39. Transitive relation definition
  40. Preorder definition
  41. Partial order definition
  42. Total order definition
  43. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  44. The reals form an ordered field statement
  45. Proof of the approximation property of the supremum proof
  46. Approximation property of the supremum statement
  47. Proof that the reals are Archimedean from the completeness axiom proof
  48. The reals are Archimedean statement
  49. Proof that Darboux and Riemann integrals agree proof

Where this leads

749 pages build on this one.

Further reading

  1. Web https://www.math.ucdavis.edu/~hunter/m125b/ch1.pdf, Theorem 1.86
About this page
Tag12E1W3P0R5
URIm2://12E1W3P0R5
Kindproof
WritingW0 stub
MSC26A42
ProvesDarboux and Riemann integrals agree
UsesRiemann integrable function, Riemann integral, Upper and lower Darboux integrals, Upper and lower Darboux sums, Riemann sum, Partition of an interval, Mesh of a partition, Refinement of a partition, Supremum, Infimum, The reals are Archimedean
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.