TheoremBase

Sketch: the extension is McShane's canonical infimum F(x) = inf over u in D of f(u) + L d(x,u), so no choice is made.

Proof

The extension is given by an explicit infimum.

Fix u0∈Du_{0}\in D, which exists as Dβ‰ βˆ…D\neq\emptyset. For x∈Xx\in X let

Sx={f(u)+L d(x,u):u∈D},S_{x}=\{f(u)+L\,d(x,u):u\in D\},

a nonempty set of real numbers. It is bounded below: for u∈Du\in D the hypothesis gives f(u)β‰₯f(u0)βˆ’L d(u0,u)f(u)\ge f(u_{0})-L\,d(u_{0},u) (with d(u,u0)=d(u0,u)d(u,u_{0})=d(u_{0},u) by Metric Space (iv)), and d(u0,u)≀d(u0,x)+d(x,u)d(u_{0},u)\le d(u_{0},x)+d(x,u) by Metric Space (v), so, as Lβ‰₯0L\ge0,

f(u)+L d(x,u)β‰₯f(u0)βˆ’L d(u0,u)+L d(x,u)β‰₯f(u0)βˆ’L d(u0,x).f(u)+L\,d(x,u)\ge f(u_{0})-L\,d(u_{0},u)+L\,d(x,u)\ge f(u_{0})-L\,d(u_{0},x).

Hence the infimum

F(x)=inf⁑SxF(x)=\inf S_{x}

exists by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (viii), and this defines a function F:X→RF:X\to\mathbb{R}.

The function FF extends ff. Let u∈Du\in D. Taking uu itself as the point of DD in SuS_{u} gives F(u)≀f(u)+L d(u,u)=f(u)F(u)\le f(u)+L\,d(u,u)=f(u), since d(u,u)=0d(u,u)=0 by Metric Space (iii). Conversely, the hypothesis gives f(u)≀f(v)+L d(u,v)f(u)\le f(v)+L\,d(u,v) for every v∈Dv\in D, so f(u)f(u) is a lower bound of SuS_{u}, and f(u)≀F(u)f(u)\le F(u) because the infimum is the greatest lower bound (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv)). Hence F(u)=f(u)F(u)=f(u).

Finally, FF is LL-Lipschitz. Let x,y∈Xx,y\in X. For every v∈Dv\in D, by Metric Space (v),

F(x)≀f(v)+L d(x,v)≀f(v)+L d(y,v)+L d(x,y).F(x)\le f(v)+L\,d(x,v)\le f(v)+L\,d(y,v)+L\,d(x,y).

So F(x)βˆ’L d(x,y)F(x)-L\,d(x,y) is a lower bound of SyS_{y}, whence F(x)βˆ’L d(x,y)≀F(y)F(x)-L\,d(x,y)\le F(y) by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv). Exchanging xx and yy, and using d(y,x)=d(x,y)d(y,x)=d(x,y) (Metric Space (iv)), gives F(y)βˆ’L d(x,y)≀F(x)F(y)-L\,d(x,y)\le F(x); together, ∣F(x)βˆ’F(y)βˆ£β‰€L d(x,y)|F(x)-F(y)|\le L\,d(x,y). This proves (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…