Bourbaki

Theorem 2

Tag 0849, permanent. Cite it as [Bourbaki, Tag 0849].

Functions of a Real Variable, chapter I, § 2. THE MEAN VALUE THEOREM

Let ff be a vector function defined and continuous on a closed bounded interval I=[a, b]I = [a,\ b] of R\mathbf{R} (where a<ba < b) and taking values in a normed space E over R\mathbf{R}; let gg be a continuous increasing real function on I. Suppose that ff and gg have right derivatives at all points of the relative complement in [a, b[[a,\ b[ of a countable subset A of this interval (allowing gr′(x)g'_r(x) to be infinite at some of the points x∉Ax \notin A), and suppose that at each of these points we have

∥fd′(x)∥≤gr′(x). \| f'_d(x) \| \leq g'_r(x).

Under these hypotheses one has

∥f(b)−f(a)∥≤g(b)−g(a). \| f(b) - f(a) \| \leq g(b) - g(a).

The proof proceeds similarly to that of prop. 2. Let ε>0\varepsilon > 0 be arbitrary, and (an)(a_n) the sequence obtained by enumerating A in some order. Let J be the set of points y∈Iy \in I such that, for all xx such that a≤x≤ya \leq x \leq y one has

∥f(x)−f(a)∥≤g(x)−g(a)+ε(x−a)+ε∑an<x12n; \| f(x) - f(a) \| \leq g(x) - g(a) + \varepsilon (x - a) + \varepsilon \sum_{a_n < x} \frac{1}{2^n};

we shall show that J=IJ = I. One sees immediately, as in prop. 2, that J is an interval with left-hand endpoint aa; if c is its right-hand endpoint then c∈Jc \in J; indeed, for all x<cx < c one has (8), and a fortiori

∥f(x)−f(a)∥≤g(c)−g(a)+ε(c−a)+ε∑an<c12n \| f(x) - f(a) \| \leq g(c) - g(a) + \varepsilon (c - a) + \varepsilon \sum_{a_n < c} \frac{1}{2^n}

from which, letting xx tend to cc in this inequality, it follows from the continuity of ff that cc satisfies (8).

Let us show that we must have c=bc = b. So suppose that c<bc < b and that moreover c∉Ac \notin A: then fd′(c)f'_d(c) and gr′(c)g'_r(c) exist and satisfy (6); suppose in the first place that gr′(c)g'_r(c) (which is necessarily ≥0\geq 0) is finite; then one can always write fd′(c)=ugr′(c)f'_d(c) = u g'_r(c), with ∥u∥≤1\| u \| \leq 1; since the function f(x)−ug(x)f(x) - u g(x) has zero right derivative at the point cc there must exist a yy such that c<y≤bc < y \leq b and such that for c≤x≤yc \leq x \leq y one has

∥f(x)−f(c)−u(g(x)−g(c))∥≤ε(x−c) \| f(x) - f(c) - u(g(x) - g(c)) \| \leq \varepsilon (x - c)

from which

∥f(x)−f(c)∥≤g(x)−g(c)+ε(x−c) \| f(x) - f(c) \| \leq g(x) - g(c) + \varepsilon (x - c)

and, taking account of (8), in which xx is replaced by cc,

∥f(x)−f(a)∥≤g(x)−g(a)+ε(x−a)+ε∑an<c12n≤g(x)−g(a)+ε(x−a)+ε∑an<x12n. \begin{align*} \| f(x) - f(a) \| &\leq g(x) - g(a) + \varepsilon (x - a) + \varepsilon \sum_{a_n < c} \frac{1}{2^n} \\ &\leq g(x) - g(a) + \varepsilon (x - a) + \varepsilon \sum_{a_n < x} \frac{1}{2^n}. \end{align*}

Thus one has y∈Jy \in J, which is a contradiction. Suppose next that c∉Ac \notin A and that gr′(c)=+∞g'_r(c) = +\infty; then there is a yy such that c<y≤bc < y \leq b and such that for c≤x≤yc \leq x \leq y one has on the one hand

∥f(x)−f(c)∥≤(∥fd′(c)∥+1)(x−c) \| f(x) - f(c) \| \leq (\| f'_d(c) \| + 1) (x - c)

while on the other hand

g(x)−g(c)≥(∥fd′(c)∥+1)(x−c) g(x) - g(c) \geq (\| f'_d(c) \| + 1) (x - c)

from which

∥f(x)−f(c)∥≤g(x)−g(c) \| f(x) - f(c) \| \leq g(x) - g(c)

and one concludes as above. Finally, if one has c=akc = a_k, then there is a yy such that c<y≤bc < y \leq b, and such that for c<x≤yc < x \leq y one has

∥f(x)−f(c)∥≤ε2k \| f(x) - f(c) \| \leq \frac{\varepsilon}{2^k}

from which, taking account of (8), with xx replaced by cc,

∥f(x)−f(a)∥≤g(c)−g(a)+ε(c−a)+ε∑an<x12n≤g(x)−g(a)+ε(x−a)+ε∑an<x12n \begin{align*} \| f(x) - f(a) \| &\leq g(c) - g(a) + \varepsilon (c - a) + \varepsilon \sum_{a_n < x} \frac{1}{2^n} \\ &\leq g(x) - g(a) + \varepsilon (x - a) + \varepsilon \sum_{a_n < x} \frac{1}{2^n} \end{align*}

which again entails a contradiction. The proof finishes as that of prop. 2.

Q.E.D.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Nothing.

Transcribed from the printed volume. Not translated.