The first mean value theorem for integrals says that if f is continuous on [a,b], there is a point ξ where ∫abf=f(ξ)(b−a). But what if you want to integrate a product f(x)g(x) and g 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 g out as a single number, it gives a split formula: the integral equals g(a) times an integral over [a,ξ] plus g(b) times an integral over [ξ,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 g be monotone decreasing on [a,b] and let f be Riemann integrable on [a,b]. Then there exists ξ∈[a,b] such that
∫abf(x)g(x)dx=g(a)∫aξf(x)dx+g(b)∫ξbf(x)dx.
The statement for monotone increasingg follows by replacing g with −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) and (bk) with partial sums Ak=∑j=1kaj, one has
k=1∑nakbk=Anbn−k=1∑n−1Ak(bk+1−bk).
This is the discrete analogue of integration by parts: one “integrates” the ak sequence into running totals Ak, then “differentiates” the bk sequence into differences. If bk is decreasing, the differences bk+1−bk≤0 have a definite sign, which lets you bound the sum by the extreme values of Ak. Exactly the same structure works in the continuous setting.
Proof
Step 1: integration by parts. Define G(x):=∫axf(t)dt, the antiderivative of f starting at a. Integration by parts gives
Since G(a)=0, the boundary term simplifies to G(b)g(b). Writing G(b)=∫abf:
∫abf(x)g(x)dx=g(b)∫abf(x)dx−∫abG(x)g′(x)dx.(∗)
Step 2: apply the first MVT to −∫Gg′. Because g is decreasing and differentiable (we assume for now), g′(x)≤0, so −g′(x)≥0. The function −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] such that
Remark. The proof above assumed g is differentiable. For merely monotone g, the argument is completed using a Riemann–Stieltjes integration by parts or by approximating g by smooth monotone functions; the conclusion is the same.
Special case: non-negative decreasing weight
If g≥0 and decreasing, then g(b)≥0, and the formula simplifies. Since the split formula holds, and g(b)≥0, one can in fact take g(b)=0 as a limiting case when g(b)=0. More directly, when you only know g≥0 and decreasing, you can state:
Corollary. If g≥0 is decreasing on [a,b] and f is integrable, there exists ξ∈[a,b] with
∫abf(x)g(x)dx=g(a)∫aξf(x)dx.
Proof. In the full Bonnet formula, g(b)≥0 and ∫ξbf is bounded. When g(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)≥0 (which has h(b)=0) and absorbing the g(b)∫abf remainder. □
This corollary is sometimes what textbooks call the second mean value theorem; Bonnet’s form is the sharper version that retains the g(b) term.
Application: convergence of ∫1∞xsinxdx
The integral ∫1∞xsinxdx 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<B,
∫ABxsinxdx≤A4.
Proof. Apply Bonnet’s theorem on [A,B] with f(x)=sinx and g(x)=1/x (which is positive and decreasing). There exists ξ∈[A,B] such that
∫ABxsinxdx=A1∫Aξsinxdx+B1∫ξBsinxdx.
For any interval [u,v], ∣∫uvsinxdx∣=∣cosu−cosv∣≤2. Therefore
∫ABxsinxdx≤A1⋅2+B1⋅2≤A2+A2=A4.
Since the right side tends to 0 as A→∞, the Cauchy criterion for improper integrals (developed in the next checkpoint) confirms convergence. □
This is a prototype argument: whenever g is monotone tending to 0 and the “oscillating part” f has bounded antiderivative, Bonnet supplies the key estimate.
Summary
The second mean value theorem (Bonnet’s form) states: if g is monotone decreasing and f is integrable on [a,b], there exists ξ∈[a,b] with ∫abfg=g(a)∫aξf+g(b)∫ξbf.
The proof integrates ∫fg by parts, writing F(x)=∫axf, and then applies the first MVT to the resulting integral −∫Fg′ (which has a non-negative weight −g′≥0).
If g≥0 and decreasing, the formula simplifies to ∫abfg=g(a)∫aξf for some ξ.
Bonnet’s theorem is the key ingredient for proving convergence of oscillatory integrals such as ∫1∞xsinxdx, where absolute convergence fails but monotone decay of 1/x tames the oscillation.