Math 2.0

Real functions Proof

Proof of the monotonicity of the integral

Builds on Riemann integrable functionRiemann integralRiemann sumMesh of a partitionThe reals are Archimedean

Proof

We compare Riemann sums for the same tagged partition.

  1. Let a<ba < b, and let f,g ⁣:[a,b]→ℝf, g \colon [a, b] \to \mathbb{R} be Riemann integrable with f≤gf \le g on [a,b][a, b]. Let IfI_f and IgI_g be their integrals.
  2. For each tagged partition (P,t)(P, t) with P=(x0,…,xn)P = (x_0, \dots, x_n), we have f(ti)(xi−xi−1)≤g(ti)(xi−xi−1)f(t_i)(x_i - x_{i-1}) \le g(t_i)(x_i - x_{i-1}) for each ii. Adding gives S(f,P,t)≤S(g,P,t)S(f, P, t) \le S(g, P, t) for the Riemann sums.
  3. Let ε>0\varepsilon > 0. Take δf>0\delta_f > 0 such that the Riemann sums of ff for tagged partitions of mesh less than δf\delta_f are within ε\varepsilon of IfI_f. Take δg>0\delta_g > 0 in the same way for gg and IgI_g. Let δ=min⁡(δf,δg)\delta = \min(\delta_f, \delta_g).
  4. By the Archimedean property, take nn with nδ>b−an \delta > b - a. The points xi=a+i(b−a)/nx_i = a + i(b - a)/n with tags ti=xit_i = x_i give a tagged partition (P,t)(P, t) of mesh less than δ\delta.
  5. By steps 2 and 3, If−ε<S(f,P,t)≤S(g,P,t)<Ig+εI_f - \varepsilon < S(f, P, t) \le S(g, P, t) < I_g + \varepsilon. So If<Ig+2εI_f < I_g + 2 \varepsilon.
  6. This holds for each ε>0\varepsilon > 0. Hence If≤IgI_f \le I_g, that is, ∫abf(x) dx≤∫abg(x) dx\int_a^b f(x) \, dx \le \int_a^b g(x) \, dx.

Idea

For the same tagged partition, each Riemann sum of ff is at most the Riemann sum of gg. Inequalities that hold for every approximation survive in the limit.

Reading path

To understand this page from the ground up, read these 42 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. Set bounded above definition
  10. Set definition
  11. Ring of integers statement
  12. Archimedean ordered field definition
  13. Mesh of a partition definition
  14. Riemann sum definition
  15. Implication definition
  16. Predicate definition
  17. The reals form a field statement
  18. Supremum definition
  19. Ordered pair definition
  20. Riemann integrable function definition
  21. The rationals form a field statement
  22. Universal quantifier definition
  23. Completeness axiom statement
  24. Cartesian product definition
  25. Riemann integral definition
  26. Subset definition
  27. The rationals form an ordered field statement
  28. Binary relation definition
  29. Order on the reals definition
  30. Antisymmetric relation definition
  31. Reflexive relation definition
  32. Transitive relation definition
  33. Preorder definition
  34. Partial order definition
  35. Total order definition
  36. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  37. The reals form an ordered field statement
  38. Proof of the approximation property of the supremum proof
  39. Approximation property of the supremum statement
  40. Proof that the reals are Archimedean from the completeness axiom proof
  41. The reals are Archimedean statement
  42. Proof of the monotonicity of the integral proof

Where this leads

716 pages build on this one.

Further reading

  1. Web https://www.math.ucdavis.edu/~hunter/m125b/ch1.pdf, Theorem 1.27 and Definition 1.85
About this page
TagW8BV2CKYHP
URIm2://W8BV2CKYHP
Kindproof
WritingW0 stub
MSC26A42
ProvesMonotonicity of the integral
UsesRiemann integrable function, Riemann integral, Riemann sum, Mesh of a partition, 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.