ScalingStacks

Proof. [02DK]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Proof.

Fix s0>0s_{0}>0 large enough so that f​(s0)α<1/2​Bf(s_{0})^{\alpha}<1/2B. We define a sequence (sj)∈ℝ+ℕ(s_{j})\in\mathbb{R}_{+}^{\mathbb{N}} by induction in the following way. If f⁡(s0)=0f(s_{0})=0 we stop here, otherwise we set

s1:=sup{s>s0/f(s)>12f(s0)}.s_{1}:=\sup\left\{s>s_{0}\,/\,f(s)>\frac{1}{2}f(s_{0})\right\}.

Observe that s1≤1+s0s_{1}\leq 1+s_{0} thanks to H⁡(α,B)H(\alpha,B) and by definition of s0s_{0}.

Since ff is right-continuous we get f⁡(s1)≤f⁡(s0)/2f(s_{1})\leq f(s_{0})/2. If f⁡(s1)=0f(s_{1})=0 we stop here, otherwise we go on by induction, setting

sj+1:=sup{s>sj/f(s)>12f(sj)}.s_{j+1}:=\sup\left\{s>s_{j}\,/\,f(s)>\frac{1}{2}f(s_{j})\right\}.

At each step f⁡(sj+1)≤f⁡(sj)/2f(s_{j+1})\leq f(s_{j})/2 and sj+1≤1+sjs_{j+1}\leq 1+s_{j}. However the sequence (sj)(s_{j}) does not grow too fast. It follows indeed from H⁡(α,B)H(\alpha,B) that if s∈]sj,sj+1[s\in]s_{j},s_{j+1}[,

(s−sj)​f​(s)≤B​f​(sj)1+α≤2​B​f​(s)​f​(sj)α,(s-s_{j})f(s)\leq Bf(s_{j})^{1+\alpha}\leq 2Bf(s)f(s_{j})^{\alpha},

since f⁡(sj)/2≤f⁡(s)≤f⁡(sj)f(s_{j})/2\leq f(s)\leq f(s_{j}) on the interval [sj,sj+1][s_{j},s_{j+1}]. We infer

sj+1−sj≤2​B​f​(sj)α≤2​B​2−j​α​f​(s0)α≤2−j​α.s_{j+1}-s_{j}\leq 2Bf(s_{j})^{\alpha}\leq 2B2^{-j\alpha}f(s_{0})^{\alpha}\leq 2^{-j\alpha}.

Thus the sequence (sj)(s_{j}) is bounded from above, with limit

S∞=s0+∑j≥0(sj+1−sj)≤s0+2​B​f​(s0)α1−2−α≤s0+11−2−α.S_{\infty}=s_{0}+\sum_{j\geq 0}(s_{j+1}-s_{j})\leq s_{0}+\frac{2Bf(s_{0})^{\alpha}}{1-2^{-\alpha}}\leq s_{0}+\frac{1}{1-2^{-\alpha}}.

∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.