logo

Proof of Cauchy's Mean Value Theorem 📂Calculus

Proof of Cauchy's Mean Value Theorem

Theorem1

Let’s say a<ba < b. If the function f,g:RRf,g : \mathbb{R} \to \mathbb{R} is continuous at all points of [a,b][a,b], differentiable at all x(a,b)x \in (a,b), and if g(x)0g ' (x) \ne 0, then there exists at least one c(a,b)c \in (a,b) that satisfies the following: f(c)g(c)=f(b)f(a)g(b)g(a) {{f ' (c)}\over{g ' (c)}}={{f(b)-f(a)}\over{g(b)-g(a)}}

Explanation

If there’s any difference from the mean value theorem, it’s just that there’s one more function added. Seen as g(x)=xg(x) = x, it means that gg becomes more flexible, which can be considered a generalization of the mean value theorem.

Proof

Contrapositive of Rolle’s theorem: If there does not exist cc that satisfies g(c)=0g ' (c)=0 in (a,b)(a,b), then g(a)g(b)g(a) \ne g(b)

Given the premise of the theorem g(x)0g ' (x) \ne 0, we can guarantee g(a)g(b)g(a) \ne g(b) through the contrapositive of Rolle’s theorem. Thus, let us define a new function h:RRh : \mathbb{R} \to \mathbb{R} as follows: h(x):=[g(b)g(a)][f(b)f(x)][f(b)f(a)][g(b)g(x)] h(x) := \left[ g(b)-g(a) \right] \left[ f(b)-f(x) \right] - \left[ f(b)-f(a) \right] \left[ g(b)-g(x) \right] According to the definition of hh, we have h(a)=0=h(b)h(a)= 0 = h(b), and by Rolle’s theorem, there exists at least one cc that satisfies h(c)=0h ' (c)=0 in (a,b)(a,b). Differentiating both sides with respect to xx yields: h(x)=[g(b)g(a)]f(x)+[f(b)f(a)]g(x) h ' (x)=- \left[ g(b)-g(a) \right] f ' (x)+ \left[ f(b)-f(a) \right] g ' (x) Substituting x=cx=c into h(x)h(x) gives: h(c)=[g(b)g(a)]f(c)+[f(b)f(a)]g(c)=0 h ' (c)=- \left[ g(b)-g(a) \right] f ' (c)+ \left[ f(b)-f(a) \right] g ' (c)=0 Therefore, we can conclude that there exists at least one cc that satisfies f(c)g(c)=f(b)f(a)g(b)g(a)\displaystyle {{f ' (c)}\over{g ' (c)}}={{f(b)-f(a)}\over{g(b)-g(a)}} in (a,b)(a,b).

See Also


  1. James Stewart, Daniel Clegg, and Saleem Watson, Calculus (early transcendentals, 9E), pA47-A48 ↩︎