Math 2.0

Real functions Proof

Proof of the additivity of the integral over intervals

Builds on Riemann integrable functionRiemann sumUpper and lower Darboux sumsUpper and lower Darboux integralsPartition of an intervalThe reals are ArchimedeanSupremumInfimumRiemann's criterion for integrabilityDarboux and Riemann integrals agree

Proof

We use Riemann's criterion and split partitions at cc. Write U(g,P)U(g, P) and L(g,P)L(g, P) for the upper and lower Darboux sums of a bounded function gg for a partition PP.

  1. First a lemma: a function gg that is Riemann integrable on an interval [r,s][r, s] is bounded there. Let II be its integral. Take δ>0\delta > 0 such that each tagged partition of mesh less than δ\delta has Riemann sum within 11 of II.
  2. By the Archimedean property, fix a partition P=(x0,…,xn)P = (x_0, \dots, x_n) of [r,s][r, s] with all subintervals shorter than δ\delta, and fix tags tt.
  3. Fix ii and x∈[xi−1,xi]x \in [x_{i-1}, x_i]. Let t′t' be the tags tt with tit_i replaced by xx. Both sums are within 11 of II, so ∣S(g,P,t′)−S(g,P,t)∣<2|S(g, P, t') - S(g, P, t)| < 2. This difference is (g(x)−g(ti))(xi−xi−1)(g(x) - g(t_i))(x_i - x_{i-1}). So ∣g(x)∣<∣g(ti)∣+2xi−xi−1|g(x)| < |g(t_i)| + \frac{2}{x_i - x_{i-1}}.
  4. So gg is bounded on each of the nn subintervals. The largest of these nn bounds bounds gg on [r,s][r, s]. This proves the lemma.
  5. Now let a<c<ba < c < b and f ⁣:[a,b]→ℝf \colon [a, b] \to \mathbb{R}. For a partition P1P_1 of [a,c][a, c] and a partition P2P_2 of [c,b][c, b], let P1⊕P2P_1 \oplus P_2 be the partition of [a,b][a, b] with the points of both. Its subintervals are those of P1P_1 and those of P2P_2. So U(f,P1⊕P2)=U(f,P1)+U(f,P2)U(f, P_1 \oplus P_2) = U(f, P_1) + U(f, P_2), and the same holds for LL.
  6. Each partition of [a,b][a, b] that contains cc has this form P1⊕P2P_1 \oplus P_2.
  7. Let PP be a partition of [a,b][a, b] and let P′P' be PP with the point cc added. We claim U(f,P′)≤U(f,P)U(f, P') \le U(f, P) and L(f,P′)≥L(f,P)L(f, P') \ge L(f, P). If cc is a point of PP, then P′=PP' = P. Otherwise cc lies inside one subinterval [xj−1,xj][x_{j-1}, x_j]. Its term Mj(xj−xj−1)M_j (x_j - x_{j-1}) is replaced by M′(c−xj−1)+M′′(xj−c)M' (c - x_{j-1}) + M'' (x_j - c).
  8. Here M′M' and M′′M'' are suprema over subsets of [xj−1,xj][x_{j-1}, x_j], so M′,M′′≤MjM', M'' \le M_j. This gives U(f,P′)≤U(f,P)U(f, P') \le U(f, P). The same argument with infima gives L(f,P′)≥L(f,P)L(f, P') \ge L(f, P).
  9. Assume that ff is integrable on [a,b][a, b]. By the lemma, ff is bounded. Let ε>0\varepsilon > 0. By Riemann's criterion, there is PP with U(f,P)−L(f,P)<εU(f, P) - L(f, P) < \varepsilon.
  10. Write P′=P1⊕P2P' = P_1 \oplus P_2 as in steps 6 and 7. Since U(f,P2)≥L(f,P2)U(f, P_2) \ge L(f, P_2), steps 5 and 8 give U(f,P1)−L(f,P1)≤U(f,P′)−L(f,P′)≤U(f,P)−L(f,P)<ε.U(f, P_1) - L(f, P_1) \le U(f, P') - L(f, P') \le U(f, P) - L(f, P) < \varepsilon.
  11. By Riemann's criterion, ff is integrable on [a,c][a, c]. The same argument with P1P_1 and P2P_2 exchanged shows that ff is integrable on [c,b][c, b].
  12. Conversely, assume that ff is integrable on [a,c][a, c] and on [c,b][c, b]. By the lemma, ff is bounded on each of them, so on [a,b][a, b].
  13. Let ε>0\varepsilon > 0. By Riemann's criterion, there are partitions P1P_1 of [a,c][a, c] and P2P_2 of [c,b][c, b] with U(f,Pi)−L(f,Pi)<ε/2U(f, P_i) - L(f, P_i) < \varepsilon/2 for i=1,2i = 1, 2.
  14. Let P=P1⊕P2P = P_1 \oplus P_2. By step 5, U(f,P)−L(f,P)<εU(f, P) - L(f, P) < \varepsilon. By Riemann's criterion, ff is integrable on [a,b][a, b].
  15. Now let ff be integrable on all three intervals. Let II, I1I_1 and I2I_2 be its integrals over [a,b][a, b], [a,c][a, c] and [c,b][c, b].
  16. Take a bounded integrable function and any partition QQ of its interval. Then L(Q)L(Q) is at most the lower Darboux integral and U(Q)U(Q) is at least the upper one. Both equal the integral, since Darboux and Riemann integrals agree. So L(Q)L(Q) is at most the integral, and U(Q)U(Q) is at least the integral.
  17. Let ε>0\varepsilon > 0, and take P1P_1, P2P_2 and P=P1⊕P2P = P_1 \oplus P_2 as in steps 13 and 14. By step 16 on each piece, L(f,P1)+L(f,P2)≤I1+I2≤U(f,P1)+U(f,P2)L(f, P_1) + L(f, P_2) \le I_1 + I_2 \le U(f, P_1) + U(f, P_2).
  18. By step 5, this says L(f,P)≤I1+I2≤U(f,P)L(f, P) \le I_1 + I_2 \le U(f, P). By step 16 on [a,b][a, b], also L(f,P)≤I≤U(f,P)L(f, P) \le I \le U(f, P).
  19. So ∣I−(I1+I2)∣≤U(f,P)−L(f,P)<ε|I - (I_1 + I_2)| \le U(f, P) - L(f, P) < \varepsilon. This holds for each ε>0\varepsilon > 0, so ∫abf(x) dx=∫acf(x) dx+∫cbf(x) dx\int_a^b f(x) \, dx = \int_a^c f(x) \, dx + \int_c^b f(x) \, dx.

Idea

Adding the point cc to a partition only brings the upper and lower sums closer. A partition containing cc is two partitions side by side, and its Darboux sums are the sums of the two pieces. So small gaps on [a,b][a, b] give small gaps on both halves, and conversely, and the integrals are trapped in the same small interval.

Reading path

To understand this page from the ground up, read these 53 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 the reals form an ordered field, with the Cauchy sequence construction, Proof of Riemann's criterion for integrability, 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
  50. Darboux and Riemann integrals agree statement
  51. Proof of Riemann's criterion for integrability proof
  52. Riemann's criterion for integrability statement
  53. Proof of the additivity of the integral over intervals proof

Where this leads

693 pages build on this one.

Further reading

  1. Web https://www.math.ucdavis.edu/~hunter/m125b/ch1.pdf, Theorem 1.33
About this page
TagSY6DGAJAGV
URIm2://SY6DGAJAGV
Kindproof
WritingW0 stub
MSC26A42
ProvesAdditivity of the integral over intervals
UsesRiemann integrable function, Riemann sum, Upper and lower Darboux sums, Upper and lower Darboux integrals, Partition of an interval, The reals are Archimedean, Supremum, Infimum, Riemann's criterion for integrability, Darboux and Riemann integrals agree
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.