Bourbaki

Exercise 21, § 1

Functions of a Real Variable, II, p. 32

Let ff be an increasing convex continuous numerical function in an interval (0, a) and such that f(0)=0f(0) = 0. If a1≥a2≥⋯≥an≥0a_1 \geq a_2 \geq \cdots \geq a_n \geq 0 is a finite decreasing sequence of points of (0, a), now prove that one has

f(a1)−f(a2)+⋯+(−1)n−1f(an)≥f(a1−a2+⋯+(−1)n−1an). f(a_1) - f(a_2) + \cdots + (-1)^{n-1} f(a_n) \geq f(a_1 - a_2 + \cdots + (-1)^{n-1} a_n ).
(One may restrict oneself to the case where n=2mn = 2m is even; note that for 1≤j≤m1 \leq j \leq m, one has
∫αβf′(t) dt≤∫a2ja2j−1f′(t) dt \int_\alpha^{\beta} f'(t)\,dt \leq \int_{a_{2j}}^{a_{2j-1}} f'(t)\,dt
where α=a2j+1−a2j+2+⋯+a2m−1−a2m\alpha = a_{2j+1} - a_{2j+2} + \cdots + a_{2m-1} - a_{2m} and β=α+(a2j−1−a2j)\beta = \alpha + (a_{2j-1} - a_{2j}).)

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.