TheoremBase

Everything follows from the infimum being the greatest lower bound, the triangle inequality, and the ball description of closure points.

Proof

Throughout, for x∈Xx\in X we write Tx={d(x,a):a∈A}T_{x}=\{d(x,a):a\in A\}, so that dist⁡(x,A)=inf⁡Tx\operatorname{dist}(x,A)=\inf T_{x} by Distance from a Point to a Nonempty Subset of a Metric Space (i), the infimum being the greatest lower bound in the sense of Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (i) and Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv).

We begin with the bounds (i). Since dist⁡(x,A)\operatorname{dist}(x,A) is a lower bound of TxT_{x}, we have dist⁡(x,A)≤d(x,a)\operatorname{dist}(x,A)\le d(x,a) for every a∈Aa\in A. Distances are nonnegative (Metric Space (ii)), so 00 is a lower bound of TxT_{x}, and therefore 0≤dist⁡(x,A)0\le\operatorname{dist}(x,A). Now let r>dist⁡(x,A)r>\operatorname{dist}(x,A). If rr were a lower bound of TxT_{x}, it would satisfy r≤dist⁡(x,A)r\le\operatorname{dist}(x,A), the infimum being the greatest lower bound. Hence rr is not a lower bound of TxT_{x}, which means that d(x,a)<rd(x,a)<r for some a∈Aa\in A.

For the Lipschitz estimate (ii), let x,y∈Xx,y\in X. For every a∈Aa\in A, (i) and Metric Space (v) give

dist⁡(x,A)≤d(x,a)≤d(x,y)+d(y,a).\operatorname{dist}(x,A)\le d(x,a)\le d(x,y)+d(y,a).

Thus dist⁡(x,A)−d(x,y)\operatorname{dist}(x,A)-d(x,y) is a lower bound of TyT_{y}, and so

dist⁡(x,A)−d(x,y)≤dist⁡(y,A).\operatorname{dist}(x,A)-d(x,y)\le\operatorname{dist}(y,A).

Exchanging the roles of xx and yy gives dist⁡(y,A)−d(x,y)≤dist⁡(x,A)\operatorname{dist}(y,A)-d(x,y)\le\operatorname{dist}(x,A), and the two inequalities together are the claim.

Continuity (iii) follows at once. Let K⊆XK\subseteq X, let x∈Kx\in K and ε>0\varepsilon>0, and take δ=ε\delta=\varepsilon. For every y∈Ky\in K with d(x,y)<δd(x,y)<\delta, (ii) gives

dR(dist⁡(y,A),dist⁡(x,A))=∣dist⁡(y,A)−dist⁡(x,A)∣≤d(x,y)<ε,d_{\mathbb{R}}\bigl(\operatorname{dist}(y,A),\operatorname{dist}(x,A)\bigr)=\bigl|\operatorname{dist}(y,A)-\operatorname{dist}(x,A)\bigr|\le d(x,y)<\varepsilon,

where dR(s,t)=∣s−t∣d_{\mathbb{R}}(s,t)=|s-t| is the metric of the real line (Metric Spaces: Balls, the Metric Topology, and the Real and Complex Numbers as Metric Spaces (iv)). This is continuity at xx relative to KK in the sense of Continuous Map Between Metric Spaces (i); as x∈Kx\in K was arbitrary, the function is continuous on KK (Continuous Map Between Metric Spaces (ii)).

For (iv), recall from Closure of a Subset of a Metric Space (i) and Open Ball in a Metric Space (ii) that xx is a closure point of AA if and only if

for every real r>0 there is a∈A with d(x,a)<r.\text{for every real }r>0\text{ there is }a\in A\text{ with }d(x,a)<r.

If dist⁡(x,A)=0\operatorname{dist}(x,A)=0, this condition is the last part of (i). Conversely, if it holds, then (i) gives dist⁡(x,A)≤d(x,a)<r\operatorname{dist}(x,A)\le d(x,a)<r for every r>0r>0, so dist⁡(x,A)\operatorname{dist}(x,A) cannot be positive (take r=dist⁡(x,A)r=\operatorname{dist}(x,A)); together with dist⁡(x,A)≥0\operatorname{dist}(x,A)\ge0 this gives dist⁡(x,A)=0\operatorname{dist}(x,A)=0.

Finally, for (v), suppose that AA is closed and x∈X∖Ax\in X\setminus A. By Closure and Interior in a Metric Space: Containments, the Closure is Closed, the Interior is Open (iv), AA equals its closure cl⁡A\operatorname{cl}A in the sense of Closure of a Subset of a Metric Space (ii), so xx is not a closure point of AA, and dist⁡(x,A)≠0\operatorname{dist}(x,A)\neq0 by (iv). Since dist⁡(x,A)≥0\operatorname{dist}(x,A)\ge0 by (i), we conclude that dist⁡(x,A)>0\operatorname{dist}(x,A)>0.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…