Monotonicity of the Integral

Basis
Last updated: Tags: Calculus, Integration

Once you have the integral as a limit of Darboux sums, the first order of business is to understand what you can do with it. One of the most useful facts is also the most intuitive: if one function lies above another, its integral is larger. This single property — monotonicity — is the source of almost every estimate involving integrals.

Monotonicity

Theorem. Let f,g:[a,b]→Rf, g: [a,b] \to \mathbb{R} be Riemann integrable. If f(x)≤g(x)f(x) \le g(x) for all x∈[a,b]x \in [a,b], then

∫abf(x) dx  ≤  ∫abg(x) dx.\int_a^b f(x)\,dx \;\le\; \int_a^b g(x)\,dx.

Proof. For any partition PP, every upper Darboux sum satisfies U(f,P)≤U(g,P)U(f, P) \le U(g, P) because sup⁡[xi−1,xi]f≤sup⁡[xi−1,xi]g\sup_{[x_{i-1},x_i]} f \le \sup_{[x_{i-1},x_i]} g. Taking the infimum over all partitions gives ∫abf≤∫ab‾g=∫abg\int_a^b f \le \overline{\int_a^b} g = \int_a^b g. (An identical argument works with lower sums.) □\square

Linearity of the integral

As a companion to monotonicity, the integral is linear: if ff and gg are integrable and α,β∈R\alpha, \beta \in \mathbb{R}, then αf+βg\alpha f + \beta g is integrable and

∫ab(αf+βg)=α∫abf+β∫abg.\int_a^b (\alpha f + \beta g) = \alpha \int_a^b f + \beta \int_a^b g.

This follows from the definition: linearity of sums passes through the supremum/infimum to the integral.

The absolute-value estimate

Corollary. If ff is integrable on [a,b][a,b], then ∣f∣|f| is also integrable and

∣∫abf(x) dx∣  ≤  ∫ab∣f(x)∣ dx.\left|\int_a^b f(x)\,dx\right| \;\le\; \int_a^b |f(x)|\,dx.

Proof. From −∣f(x)∣≤f(x)≤∣f(x)∣-|f(x)| \le f(x) \le |f(x)|, apply monotonicity twice:

−∫ab∣f∣  ≤  ∫abf  ≤  ∫ab∣f∣.-\int_a^b |f| \;\le\; \int_a^b f \;\le\; \int_a^b |f|.

This is equivalent to ∣∫abf∣≤∫ab∣f∣|\int_a^b f| \le \int_a^b |f|. (Integrability of ∣f∣|f| follows because the oscillation of ∣f∣|f| on any interval is ≤\le the oscillation of ff, so the Darboux criterion carries over.) □\square

This estimate is the integral analogue of the triangle inequality for sums ∣∑ai∣≤∑∣ai∣|\sum a_i| \le \sum |a_i|.

Bounds via pointwise estimates

Corollary. If ff is integrable and m≤f(x)≤Mm \le f(x) \le M for all x∈[a,b]x \in [a,b], then

m(b−a)  ≤  ∫abf(x) dx  ≤  M(b−a).(1)m(b-a) \;\le\; \int_a^b f(x)\,dx \;\le\; M(b-a). \tag{1}

Proof. Apply monotonicity to m≤f≤Mm \le f \le M: since the integral of the constant mm over [a,b][a,b] is m(b−a)m(b-a), and similarly for MM. □\square

The bounds (1)(1) are the key ingredient in the mean value theorem for integrals: squeeze ∫f/(b−a)\int f / (b-a) between mm and MM and apply the Intermediate Value Theorem.

A worked estimate

How large can ∫01e−x2 dx\int_0^1 e^{-x^2}\,dx be? The integrand satisfies e−1≤e−x2≤1e^{-1} \le e^{-x^2} \le 1 on [0,1][0,1] (since 0≤x2≤10 \le x^2 \le 1), so (1)(1) gives immediately:

e−1  ≤  ∫01e−x2 dx  ≤  1.e^{-1} \;\le\; \int_0^1 e^{-x^2}\,dx \;\le\; 1.

The exact value (π2 erf(1)≈0.747\frac{\sqrt\pi}{2}\,\mathrm{erf}(1) \approx 0.747) requires more work, but the bound comes for free from monotonicity.

Summary

  • Monotonicity: f≤gf \le g pointwise implies ∫f≤∫g\int f \le \int g.
  • Linearity: ∫(αf+βg)=α∫f+β∫g\int (\alpha f + \beta g) = \alpha \int f + \beta \int g.
  • Absolute-value estimate: ∣∫abf∣≤∫ab∣f∣|\int_a^b f| \le \int_a^b |f| — the integral version of the triangle inequality.
  • Bound: if m≤f≤Mm \le f \le M everywhere, then m(b−a)≤∫abf≤M(b−a)m(b-a) \le \int_a^b f \le M(b-a).
  • These properties combine to give all the standard estimates used in analysis.