Second Mean Value Theorem for Integrals

Basis
Last updated: Tags: Calculus, Integration, Mean Value Theorems

The first mean value theorem for integrals says that if ff is continuous on [a,b][a, b], there is a point ξ\xi where ∫abf=f(ξ)(b−a)\int_a^b f = f(\xi)(b - a). But what if you want to integrate a product f(x)g(x)f(x) g(x) and gg is only monotonic, not continuous? The second mean value theorem — known in this form as Bonnet’s theorem — handles exactly that case. Instead of factoring gg out as a single number, it gives a split formula: the integral equals g(a)g(a) times an integral over [a,ξ][a, \xi] plus g(b)g(b) times an integral over [ξ,b][\xi, b]. The idea behind the proof is a continuous analogue of Abel summation, combined with integration by parts.

Statement: Bonnet’s form

Theorem (Second Mean Value Theorem for Integrals). Let gg be monotone decreasing on [a,b][a, b] and let ff be Riemann integrable on [a,b][a, b]. Then there exists ξ∈[a,b]\xi \in [a, b] such that

∫abf(x) g(x) dx  =  g(a)∫aξf(x) dx  +  g(b)∫ξbf(x) dx.\int_a^b f(x)\,g(x)\,dx \;=\; g(a) \int_a^\xi f(x)\,dx \;+\; g(b) \int_\xi^b f(x)\,dx.

The statement for monotone increasing gg follows by replacing gg with −g-g.

Motivation: the discrete analogue (Abel summation)

Before proving the continuous theorem it is instructive to see the discrete version, called Abel summation (also Abel’s summation formula). Given sequences (ak)(a_k) and (bk)(b_k) with partial sums Ak=∑j=1kajA_k = \sum_{j=1}^k a_j, one has

∑k=1nakbk  =  Anbn  −  ∑k=1n−1Ak(bk+1−bk).\sum_{k=1}^n a_k b_k \;=\; A_n b_n \;-\; \sum_{k=1}^{n-1} A_k (b_{k+1} - b_k).

This is the discrete analogue of integration by parts: one “integrates” the aka_k sequence into running totals AkA_k, then “differentiates” the bkb_k sequence into differences. If bkb_k is decreasing, the differences bk+1−bk≤0b_{k+1} - b_k \le 0 have a definite sign, which lets you bound the sum by the extreme values of AkA_k. Exactly the same structure works in the continuous setting.

Proof

Step 1: integration by parts. Define G(x)≔∫axf(t) dtG(x) \coloneqq \int_a^x f(t)\,dt, the antiderivative of ff starting at aa. Integration by parts gives

∫abf(x) g(x) dx=∫abG′(x) g(x) dx=[G(x) g(x)]ab−∫abG(x) g′(x) dx.\int_a^b f(x)\,g(x)\,dx = \int_a^b G'(x)\,g(x)\,dx = \bigl[G(x)\,g(x)\bigr]_a^b - \int_a^b G(x)\,g'(x)\,dx.

Since G(a)=0G(a) = 0, the boundary term simplifies to G(b) g(b)G(b)\,g(b). Writing G(b)=∫abfG(b) = \int_a^b f:

∫abf(x) g(x) dx=g(b)∫abf(x) dx−∫abG(x) g′(x) dx.(∗)\int_a^b f(x)\,g(x)\,dx = g(b)\int_a^b f(x)\,dx - \int_a^b G(x)\,g'(x)\,dx. \tag{$*$}

Step 2: apply the first MVT to −∫G g′-\int G\,g'. Because gg is decreasing and differentiable (we assume for now), g′(x)≤0g'(x) \le 0, so −g′(x)≥0-g'(x) \ge 0. The function −g′-g' is a non-negative integrable weight. By the first mean value theorem in its weighted form (see Mean Value Theorem for Integrals), there exists ξ∈[a,b]\xi \in [a, b] such that

−∫abG(x) g′(x) dx=G(ξ)⋅(−∫abg′(x) dx)=G(ξ) (g(a)−g(b)).-\int_a^b G(x)\,g'(x)\,dx = G(\xi) \cdot \left(-\int_a^b g'(x)\,dx\right) = G(\xi)\,\bigl(g(a) - g(b)\bigr).

Step 3: collect. Substituting back into (∗)(*):

∫abf(x) g(x) dx=g(b)∫abf(x) dx+G(ξ) (g(a)−g(b)).\int_a^b f(x)\,g(x)\,dx = g(b)\int_a^b f(x)\,dx + G(\xi)\,\bigl(g(a) - g(b)\bigr).

Rewrite using ∫abf=∫aξf+∫ξbf\int_a^b f = \int_a^\xi f + \int_\xi^b f and G(ξ)=∫aξfG(\xi) = \int_a^\xi f:

=g(b)(∫aξf+∫ξbf)+∫aξf (g(a)−g(b))=g(a)∫aξf(x) dx+g(b)∫ξbf(x) dx.□= g(b)\left(\int_a^\xi f + \int_\xi^b f\right) + \int_a^\xi f\,(g(a) - g(b)) = g(a)\int_a^\xi f(x)\,dx + g(b)\int_\xi^b f(x)\,dx. \quad \square

Remark. The proof above assumed gg is differentiable. For merely monotone gg, the argument is completed using a Riemann–Stieltjes integration by parts or by approximating gg by smooth monotone functions; the conclusion is the same.

Special case: non-negative decreasing weight

If g≥0g \ge 0 and decreasing, then g(b)≥0g(b) \ge 0, and the formula simplifies. Since the split formula holds, and g(b)≥0g(b) \ge 0, one can in fact take g(b)=0g(b) = 0 as a limiting case when g(b)=0g(b) = 0. More directly, when you only know g≥0g \ge 0 and decreasing, you can state:

Corollary. If g≥0g \ge 0 is decreasing on [a,b][a, b] and ff is integrable, there exists ξ∈[a,b]\xi \in [a, b] with

∫abf(x) g(x) dx  =  g(a)∫aξf(x) dx.\int_a^b f(x)\,g(x)\,dx \;=\; g(a)\int_a^\xi f(x)\,dx.

Proof. In the full Bonnet formula, g(b)≥0g(b) \ge 0 and ∫ξbf\int_\xi^b f is bounded. When g(b)=0g(b) = 0 the second term vanishes identically. For the general non-negative decreasing case, the proof is obtained by applying Bonnet to h=g−g(b)≥0h = g - g(b) \ge 0 (which has h(b)=0h(b) = 0) and absorbing the g(b)∫abfg(b)\int_a^b f remainder. □\square

This corollary is sometimes what textbooks call the second mean value theorem; Bonnet’s form is the sharper version that retains the g(b)g(b) term.

Application: convergence of ∫1∞sin⁡xx dx\int_1^\infty \frac{\sin x}{x}\,dx

The integral ∫1∞sin⁡xx dx\int_1^\infty \frac{\sin x}{x}\,dx is not absolutely convergent (we will show this in the Convergence of Improper Integrals checkpoint), yet it does converge. Bonnet’s theorem is the key tool.

Claim. For all 1≤A<B1 \le A < B,

∣∫ABsin⁡xx dx∣  ≤  4A.\left|\int_A^B \frac{\sin x}{x}\,dx\right| \;\le\; \frac{4}{A}.

Proof. Apply Bonnet’s theorem on [A,B][A, B] with f(x)=sin⁡xf(x) = \sin x and g(x)=1/xg(x) = 1/x (which is positive and decreasing). There exists ξ∈[A,B]\xi \in [A, B] such that

∫ABsin⁡xx dx=1A∫Aξsin⁡x dx+1B∫ξBsin⁡x dx.\int_A^B \frac{\sin x}{x}\,dx = \frac{1}{A}\int_A^\xi \sin x\,dx + \frac{1}{B}\int_\xi^B \sin x\,dx.

For any interval [u,v][u, v], ∣∫uvsin⁡x dx∣=∣cos⁡u−cos⁡v∣≤2|\int_u^v \sin x\,dx| = |\cos u - \cos v| \le 2. Therefore

∣∫ABsin⁡xx dx∣  ≤  1A⋅2+1B⋅2  ≤  2A+2A=4A.\left|\int_A^B \frac{\sin x}{x}\,dx\right| \;\le\; \frac{1}{A} \cdot 2 + \frac{1}{B} \cdot 2 \;\le\; \frac{2}{A} + \frac{2}{A} = \frac{4}{A}.

Since the right side tends to 00 as A→∞A \to \infty, the Cauchy criterion for improper integrals (developed in the next checkpoint) confirms convergence. □\square

This is a prototype argument: whenever gg is monotone tending to 00 and the “oscillating part” ff has bounded antiderivative, Bonnet supplies the key estimate.

Summary

  • The second mean value theorem (Bonnet’s form) states: if gg is monotone decreasing and ff is integrable on [a,b][a, b], there exists ξ∈[a,b]\xi \in [a, b] with ∫abfg=g(a)∫aξf+g(b)∫ξbf\int_a^b fg = g(a)\int_a^\xi f + g(b)\int_\xi^b f.
  • The proof integrates ∫fg\int fg by parts, writing F(x)=∫axfF(x) = \int_a^x f, and then applies the first MVT to the resulting integral −∫Fg′-\int F g' (which has a non-negative weight −g′≥0-g' \ge 0).
  • If g≥0g \ge 0 and decreasing, the formula simplifies to ∫abfg=g(a)∫aξf\int_a^b fg = g(a)\int_a^\xi f for some ξ\xi.
  • Bonnet’s theorem is the key ingredient for proving convergence of oscillatory integrals such as ∫1∞sin⁡xx dx\int_1^\infty \frac{\sin x}{x}\,dx, where absolute convergence fails but monotone decay of 1/x1/x tames the oscillation.