TheoremBase

Proof

Order arithmetic is taken from Elementary Arithmetic in an Ordered Field and Elementary Order Arithmetic in an Ordered Field. Fix ε∈R\varepsilon\in\mathbb{R} with 0<ε0<\varepsilon.

Step 1 (a modulus from upper semicontinuity). Since vv is upper semicontinuous at ξ\xi relative to RM\mathbb{R}^{M}, there is δ∈R\delta\in\mathbb{R} with 0<δ0<\delta such that every y∈RMy\in\mathbb{R}^{M} with d(ξ,y)<δd(\xi,y)<\delta satisfies v(y)<v(ξ)+εv(y)<v(\xi)+\varepsilon.

Step 2 (choice of λ0\lambda_{0}). Put K=C−v(ξ)K=C-v(\xi), so that 0≤K0\le K by claim 3 of Elementary Arithmetic in an Ordered Field, since v(ξ)≤Cv(\xi)\le C. Put b=δ22b=\frac{\delta^{2}}{2}. From 0<δ0<\delta we get 0<δ20<\delta^{2} by claim 5 of Elementary Order Arithmetic in an Ordered Field, and 0<2−10<2^{-1} by claim 7 of the same result, so 0<b0<b by claim 5 again; hence b−1b^{-1} exists and 0<b−10<b^{-1} by claim 7. Also 1≤K+11\le K+1 by claim 3 of Elementary Arithmetic in an Ordered Field and 0<10<1 by claim 6 of Elementary Order Arithmetic in an Ordered Field, so 0<K+10<K+1 by mixed transitivity (claim 2). Put

λ0=(K+1) b−1,\lambda_{0}=(K+1)\,b^{-1},

so that 0<λ00<\lambda_{0} by claim 5 of Elementary Order Arithmetic in an Ordered Field and λ0 b=K+1\lambda_{0}\,b=K+1.

Step 3 (the estimate). Let λ∈R\lambda\in\mathbb{R} with λ0≤λ\lambda_{0}\le\lambda; then 0<λ0<\lambda by mixed transitivity, so the sup-convolution vλv^{\lambda} is defined. By claim 1 of Domination, Monotonicity and Semiconvexity of the Sup-Convolution we have v(ξ)≤vλ(ξ)v(\xi)\le v^{\lambda}(\xi), so only the upper estimate remains.

By claim 2 of The Sup-Convolution of an Upper Semicontinuous Function Attains its Supremum there is y∈RMy\in\mathbb{R}^{M} with

vλ(ξ)=v(y)−λ2∥y−ξ∥2andλ2∥y−ξ∥2≤K.v^{\lambda}(\xi)=v(y)-\frac{\lambda}{2}\lVert y-\xi\rVert^{2}\qquad\text{and}\qquad\frac{\lambda}{2}\lVert y-\xi\rVert^{2}\le K .

Suppose δ≤∥y−ξ∥\delta\le\lVert y-\xi\rVert. Both numbers are nonnegative, so claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field gives δ2≤∥y−ξ∥2\delta^{2}\le\lVert y-\xi\rVert^{2}, and multiplying by the nonnegative number λ2\frac{\lambda}{2} (claim 5 of Elementary Arithmetic in an Ordered Field) gives

λ b=λ2 δ2≤λ2∥y−ξ∥2≤K.\lambda\,b=\frac{\lambda}{2}\,\delta^{2}\le\frac{\lambda}{2}\lVert y-\xi\rVert^{2}\le K .

On the other hand λ0≤λ\lambda_{0}\le\lambda and 0≤b0\le b give K+1=λ0b≤λbK+1=\lambda_{0}b\le\lambda b by claim 5 of Elementary Arithmetic in an Ordered Field, so K+1≤KK+1\le K; this contradicts K<K+1K<K+1, which holds by claims 6 and 1 of Elementary Order Arithmetic in an Ordered Field. Hence ∥y−ξ∥<δ\lVert y-\xi\rVert<\delta.

By claim 2 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square and the symmetry clause 3 of a metric, d(ξ,y)=∥y−ξ∥<δd(\xi,y)=\lVert y-\xi\rVert<\delta, so Step 1 gives v(y)<v(ξ)+εv(y)<v(\xi)+\varepsilon. Since λ2∥y−ξ∥2\frac{\lambda}{2}\lVert y-\xi\rVert^{2} is nonnegative, as observed in Sup-Convolution of a Function on RM\mathbb{R}^M, claim 3 of Elementary Arithmetic in an Ordered Field gives v(y)−λ2∥y−ξ∥2≤v(y)v(y)-\frac{\lambda}{2}\lVert y-\xi\rVert^{2}\le v(y), and mixed transitivity yields

vλ(ξ)=v(y)−λ2∥y−ξ∥2≤v(y)<v(ξ)+ε.v^{\lambda}(\xi)=v(y)-\frac{\lambda}{2}\lVert y-\xi\rVert^{2}\le v(y)<v(\xi)+\varepsilon .

As λ≥λ0\lambda\ge\lambda_{0} was arbitrary, λ0\lambda_{0} has the required property.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…