An integral-free construction: h is an explicit convergent series of continuously differentiable quadratic-then-linear ramps switched on at a sequence of radii tending to zero, and each clause is checked directly from elementary estimates for the ramp, the mean value theorem, and facts about series of real numbers.
Sorting t into the three ranges t≤0, 0≤t≤1 and t≥1 gives Q(t)=0 and σ(t)=0 for t≤0; Q(t)=t2/2 and σ(t)=t for 0≤t≤1; and Q(t)=t−21 and σ(t)=1 for t≥1. In particular 0≤σ(t)≤1 for every t.
We claim that ∣P(t+u)−P(t)−t+u∣≤u2/2 for all real t,u. If t≥0 and t+u≥0 the left side is ∣(t+u)2/2−t2/2−tu∣=u2/2. If t≥0 and t+u<0, then 0≤t<−u and the quantity inside the absolute value is −t2/2−tu=t(−u−t/2), which is nonnegative, and u2/2−t(−u−t/2)=(u+t)2/2≥0. If t<0 and t+u≥0, the quantity is (t+u)2/2 and 0≤t+u<u, so it lies between 0 and u2/2. If t<0 and t+u<0 it is 0. Applying the claim at t and at t−1 (note (t−1)+ is the coefficient there) and using the triangle inequality gives
∣Q(t+u)−Q(t)−σ(t)u∣≤u2for all real t,u.(1)
Consequently Q is differentiable at every t∈R with Q′(t)=σ(t), in the sense of Single-Variable Calculus on an Interval §derivative: given ε>0 take δ=ε; for 0<∣u∣<δ, dividing (1) by ∣u∣ gives ∣(Q(t+u)−Q(t))/u−σ(t)∣≤∣u∣<ε. By (1) and ∣σ(t)∣≤1 we also have ∣Q(t+u)−Q(t)∣≤∣u∣+u2, so Q is continuous at every point (given ε>0, δ=min(1,ε/2) works: for ∣u∣<δ we have u2≤∣u∣, so ∣u∣+u2≤2∣u∣<ε), and hence continuous on every closed interval [a,b] in the sense of The Real Line: Standing Notation and Background for Calculus §continuity. Let a<b. The restriction of Q to [a,b] is continuous on [a,b], and it is differentiable at every point x of (a,b) with derivative σ(x), because passing to a subinterval changes neither differentiability nor the derivative, as recorded in Single-Variable Calculus on an Interval §derivative. The mean value theorem Mean Value Theorem on a Closed Real Interval gives c∈(a,b) with Q(b)−Q(a)=σ(c)(b−a), and since 0≤σ(c)≤1,
0≤Q(b)−Q(a)≤b−awhenever a≤b,(2)
the case a=b being trivial.
Step 2: rescaled ramps. For a real ρ>0 define qρ,σρ:R→R by qρ(s)=ρQ(s/ρ−1) and σρ(s)=σ(s/ρ−1). From Step 1 we read off the following, for all real s,t,u.
(a) If s≤ρ then s/ρ−1≤0, so qρ(s)=0 and σρ(s)=0; and always 0≤σρ(s)≤1.
(b) If s≤t then 0≤qρ(t)−qρ(s)≤t−s, by (2) applied to s/ρ−1≤t/ρ−1 and multiplied by ρ.
(c) 0≤qρ(s)≤s+. Indeed, if s≤ρ this is (a); if s>ρ then (b) and qρ(ρ)=0 give 0≤qρ(s)≤s−ρ≤s.
(d) qρ(s)≥s−23ρ. Indeed, if s≥2ρ then s/ρ−1≥1 and qρ(s)=ρ(s/ρ−1−21)=s−23ρ; if s<2ρ then (b) gives qρ(2ρ)−qρ(s)≤2ρ−s, and qρ(2ρ)=ρ/2, so qρ(s)≥s−23ρ.
(e) Writing eρ(s,u)=qρ(s+u)−qρ(s)−σρ(s)u, we have ∣eρ(s,u)∣≤u2/ρ and ∣eρ(s,u)∣≤2∣u∣. The first bound is (1) at the point s/ρ−1 with increment u/ρ, multiplied by ρ; the second follows from ∣qρ(s+u)−qρ(s)∣≤∣u∣, which is (b), and ∣σρ(s)u∣≤∣u∣, which is (a).
Step 3: choice of constants. The constants are chosen in the following order. First, for each k∈N the hypothesis on m, applied with η=2−k−3, gives a real rk′>0 with m(s)≤2−k−3s for every s∈[0,r] with s<rk′; fix such a choice for every k. Such a sequence (rk′)k∈N exists by Axiom of Dependent Choice, applied to the set S of pairs (k,ρ) with k∈N and ρ>0 real such that m(s)≤2−k−3s for every s∈[0,r] with s<ρ, to the relation consisting of the pairs ((k,ρ),(k+1,ρ′)) of elements of S, and to a starting element (1,ρ1)∈S: the hypothesis on m (with η=2−4) shows that S has such an element, and (with η=2−k−4) that every (k,ρ)∈S is related to some element of S; the sequence (ak)k∈N given by the axiom has first coordinate k at every index k, by induction on k, and we let rk′ be the second coordinate of ak. Second, define r1=min(r,r1′) and recursively rk+1=min(rk/2,rk+1′) for k∈N. Then for every k: rk>0, rk+1≤rk/2, rk≤r, rk≤rk′, the sequence (rk) is nonincreasing, and by induction rk≤(21)k−1r1. Hence
m(s)≤2−k−3sfor every k∈N and every s∈[0,r] with s<rk.(3)
Third, since B≥m(0)=0, the number A=4B/r1 satisfies A≥0.
We record a location fact. Let 0<s<r1. Since (21)n→0 by the geometric series clause and s/r1>0, there is n′∈N with (21)n′<s/r1; with n=n′+1 we get (21)n−1<s/r1, that is (21)n−1r1<s, hence rn≤(21)n−1r1<s; so the set of n∈N with rn≤s is nonempty, and its least element n0 satisfies n0≥2 because r1>s. With k=n0−1∈N we get
rk+1≤s<rk.(4)
Step 4: definition of h. Write qj=qrj, σj=σrj and ej=erj for j∈N. For s∈R we have 0≤2−jqj(s)≤s+2−j by (c), so by the comparison test the series ∑j=1∞2−jqj(s) converges, the dominating series ∑js+2−j converging (with sum s+) by the geometric series and linearity of sums, with sum in [0,s+] by comparison of sums. Likewise 0≤2−jσj(s)≤2−j by (a), so ∑j=1∞2−jσj(s) converges with sum in [0,1]. Define H,D:R→R by
Then H(s)≥0 and 0≤D(s)≤A+1 for every s. If s<0 then s<rj for every j, so every qj(s) vanishes by (a) and H(s)=0. Let h:[0,∞)→[0,∞) be the restriction of H to [0,∞). Then the function hˉ of the statement coincides with H on all of R.
Clause (Monotone). Let 0≤s≤t. By (b), Aq2(s)≤Aq2(t) (as A≥0) and 2−jqj(s)≤2−jqj(t) for every j, so comparison of sums gives h(s)≤h(t); thus h is nondecreasing on [0,∞) in the sense of Monotone Real Function §nondecreasing. Since 0≤rj for every j, (a) gives qj(0)=0 for every j, so h(0)=0.
Clause (Differentiable). Fix s∈R and ε>0. Choose, in this order, J∈N with (21)J<ε/8, which exists since (21)n→0; then the positive number CJ=A/r2+∑j=1J2−j/rj+1; then δ=ε/(2CJ). Let u be real with 0<∣u∣<δ. The three series defining H(s+u), H(s) and D(s) converge, so by linearity of sums
H(s+u)−H(s)−D(s)u=Ae2(s,u)+j=1∑∞2−jej(s,u).
By (e), 0≤2−j∣ej(s,u)∣≤2∣u∣2−j, so by the comparison test the series ∑j2−j∣ej(s,u)∣ converges, the dominating series ∑j2∣u∣2−j converging by the geometric series and linearity of sums, and comparison of sums applied to −2−j∣ej(s,u)∣≤2−jej(s,u)≤2−j∣ej(s,u)∣ (the left series converging by linearity) gives ∑j2−jej(s,u)≤∑j2−j∣ej(s,u)∣. The tail bound, applied with μj=2−j, wj=∣ej(s,u)∣, M=2∣u∣ and n=J, together with the geometric series tail (21)J, gives
since ∣u∣CJ<δCJ=ε/2. Dividing by ∣u∣, ∣(H(s+u)−H(s))/u−D(s)∣<ε. As s is an interior point of I=R and ε was arbitrary, hˉ=H is differentiable at s in the sense of Single-Variable Calculus on an Interval §derivative, with hˉ′(s)=D(s), the derivative being unique as recorded there. Hence h′(s)=D(s) for every s≥0.
Clause (Derivative). Since 0<rj for every j, (a) gives σj(0)=0 for every j, hence h′(0)=D(0)=0. With K=A+1 we have ∣h′(s)∣=D(s)≤K for every s≥0, by Step 4. Let η>0. Choose k∈N with k≥2 and (21)k<η, and put r′′=rk>0. Let 0≤s<r′′. For j≤k we have s<rk≤rj, so σj(s)=0 by (a); in particular σ2(s)=0 as k≥2. The tail bound with μj=2−j, wj=σj(s)∈[0,1], M=1 and n=k, whose partial sum up to k vanishes, then gives 0≤h′(s)=∑j=1∞2−jσj(s)≤(21)k<η.
Clause (Majorant). Let s∈[0,r]. If s=0 then h(0)=0=m(0). If s≥r1, then, as the series part of H(s) is nonnegative, (d) and r2≤r1/2 give
If 0<s<r1, let k be as in (4). For j≥k+3 we have rj≤rk+3≤rk+1/4≤s/4, so (d) gives qj(s)≥s−83s≥s/2. Define bj=0 for j≤k+2 and bj=2−js/2 for j≥k+3. Then 0≤bj≤2−jqj(s) for every j, by (c) for j≤k+2. The sequence (bj) differs from (2s2−j) by the finitely supported sequence equal to 2s2−j for j≤k+2 and 0 afterwards, so by linearity of sums and the geometric series tail,
Comparison of sums and Aq2(s)≥0 then give h(s)≥∑j2−jqj(s)≥2−k−3s. Since s∈[0,r] and s<rk, estimate (3) gives m(s)≤2−k−3s≤h(s). This proves h(s)≥m(s) for every s∈[0,r] and completes the proof.