TheoremBase

All six claims are read off the description of Au(x)A_u(x): the bound because xx itself is admissible; upper semicontinuity and boundedness near a point by shrinking the witnessing radius through the triangle inequality; minimality and monotonicity from the inclusion of the sets AA; and the approximation property because otherwise a smaller constant would belong to Au(x)A_u(x).

Proof

Conventions. The order ≀\le and the arithmetic of R\mathbb{R} are those of the ordered field of real numbers; ≀\le is in particular a total order, hence antisymmetric, and of any two real numbers one is at least the other. Multiplication by a nonnegative real number preserves ≀\le: if a≀ba\le b and 0≀λ0\le\lambda then either a=ba=b, and the products are equal, or a<ba<b, and then claim 10 of Elementary Order Arithmetic in an Ordered Field applies when 0<Ξ»0<\lambda, while Ξ»=0\lambda=0 makes both products 00. Among the ordered field axioms is the compatibility of ≀\le with addition: if a≀ba\le b then a+c≀b+ca+c\le b+c for every c∈Rc\in\mathbb{R}. That axiom is what we use for non-strict inequalities; claim 1 of Elementary Order Arithmetic in an Ordered Field is its strict counterpart and is cited only where the inequality is strict. Throughout, Au(x)A_{u}(x) and the witnessing radii are as described in Upper and Lower Semicontinuous Envelopes of a Real-Valued Function, and dd is symmetric and satisfies the triangle inequality by the metric axioms. The claims are established below in the order 1, 3, 2, 4, 6, 5; each argument uses only claims established before it.

Claim 1. As recorded in Upper and Lower Semicontinuous Envelopes of a Real-Valued Function (ii), u(x)u(x) is a lower bound for Au(x)A_{u}(x). Since uβˆ—(x)u^{*}(x) is the greatest lower bound of Au(x)A_{u}(x), we get u(x)≀uβˆ—(x)u(x)\le u^{*}(x).

Claim 3. Let x∈Sx\in S and let Ρ∈R\varepsilon\in\mathbb{R} be positive. Since vv is upper semicontinuous at xx relative to SS, there is a positive δ∈R\delta\in\mathbb{R} such that every y∈Sy\in S with d(x,y)<Ξ΄d(x,y)<\delta satisfies v(y)<v(x)+Ξ΅v(y)<v(x)+\varepsilon. Put r=Ξ΄β‹…2βˆ’1r=\delta\cdot2^{-1}, which is positive and satisfies r<Ξ΄r<\delta by claim 8 of Elementary Order Arithmetic in an Ordered Field. If y∈Sy\in S satisfies d(y,x)≀rd(y,x)\le r, then d(x,y)=d(y,x)≀r<Ξ΄d(x,y)=d(y,x)\le r<\delta, so d(x,y)<Ξ΄d(x,y)<\delta by claim 2 of Elementary Order Arithmetic in an Ordered Field, whence u(y)≀v(y)<v(x)+Ξ΅u(y)\le v(y)<v(x)+\varepsilon and in particular u(y)≀v(x)+Ξ΅u(y)\le v(x)+\varepsilon. Therefore v(x)+Ρ∈Au(x)v(x)+\varepsilon\in A_{u}(x), and since uβˆ—(x)u^{*}(x) is a lower bound for Au(x)A_{u}(x) we get uβˆ—(x)≀v(x)+Ξ΅u^{*}(x)\le v(x)+\varepsilon. As Ξ΅\varepsilon was an arbitrary positive number, Comparison of Real Numbers with Arbitrary Positive Slack (i) gives uβˆ—(x)≀v(x)u^{*}(x)\le v(x).

Claim 2. Let x∈Sx\in S and let Ρ∈R\varepsilon\in\mathbb{R} be positive; put Ξ΅β€²=Ξ΅β‹…2βˆ’1\varepsilon'=\varepsilon\cdot2^{-1}, positive with Ξ΅β€²<Ξ΅\varepsilon'<\varepsilon by claim 8 of Elementary Order Arithmetic in an Ordered Field. The set Au(x)A_{u}(x) is nonempty and bounded below, so claim 4 of Approximation Property of the Supremum and the Infimum in R\mathbb{R} provides c∈Au(x)c\in A_{u}(x) with c<uβˆ—(x)+Ξ΅β€²c<u^{*}(x)+\varepsilon'. Let rr be a positive real number witnessing c∈Au(x)c\in A_{u}(x), so that u(z)≀cu(z)\le c for every z∈Sz\in S with d(z,x)≀rd(z,x)\le r, and put Ξ΄=rβ‹…2βˆ’1\delta=r\cdot2^{-1}, positive with Ξ΄+Ξ΄=r\delta+\delta=r by claim 8.

Let y∈Sy\in S satisfy d(x,y)<Ξ΄d(x,y)<\delta, and let z∈Sz\in S satisfy d(z,y)≀δd(z,y)\le\delta. Then d(z,x)≀d(z,y)+d(y,x)d(z,x)\le d(z,y)+d(y,x), and d(z,y)+d(y,x)<Ξ΄+Ξ΄=rd(z,y)+d(y,x)<\delta+\delta=r by claim 3 of Elementary Order Arithmetic in an Ordered Field, since d(z,y)≀δd(z,y)\le\delta and d(y,x)=d(x,y)<Ξ΄d(y,x)=d(x,y)<\delta; hence d(z,x)<rd(z,x)<r by claim 2 there, and in particular d(z,x)≀rd(z,x)\le r, so u(z)≀cu(z)\le c. Thus Ξ΄\delta witnesses c∈Au(y)c\in A_{u}(y), and therefore

uβˆ—(y)≀c<uβˆ—(x)+Ξ΅β€²<uβˆ—(x)+Ξ΅,u^{*}(y)\le c<u^{*}(x)+\varepsilon'<u^{*}(x)+\varepsilon ,

the last step by claim 1 of Elementary Order Arithmetic in an Ordered Field. Claim 2 there gives uβˆ—(y)<uβˆ—(x)+Ξ΅u^{*}(y)<u^{*}(x)+\varepsilon. As Ξ΅\varepsilon was arbitrary, uβˆ—u^{*} is upper semicontinuous at xx relative to SS, and as xx was arbitrary, uβˆ—u^{*} is upper semicontinuous on SS.

For the second assertion of the claim, fix x∈Sx\in S and run the previous paragraph with Ξ΅=1\varepsilon=1, which is positive by claim 6 of Elementary Order Arithmetic in an Ordered Field; it produces cc and Ξ΄\delta as above. Put ρ=Ξ΄β‹…2βˆ’1\rho=\delta\cdot2^{-1}, positive with ρ<Ξ΄\rho<\delta by claim 8. Every y∈Sy\in S with d(y,x)≀ρd(y,x)\le\rho satisfies d(x,y)=d(y,x)≀ρ<Ξ΄d(x,y)=d(y,x)\le\rho<\delta, hence uβˆ—(y)≀cu^{*}(y)\le c by the previous paragraph. So ρ\rho witnesses c∈Auβˆ—(x)c\in A_{u^{*}}(x), and uβˆ—u^{*} is bounded above near each point of SS.

Claim 4. If uβˆ—(x)=u(x)u^{*}(x)=u(x) for every x∈Sx\in S, then uu is upper semicontinuous on SS by claim 2. Conversely, if uu is upper semicontinuous on SS, then claim 3 applied with v=uv=u gives uβˆ—(x)≀u(x)u^{*}(x)\le u(x) for every x∈Sx\in S; with claim 1 and the antisymmetry of ≀\le this gives uβˆ—(x)=u(x)u^{*}(x)=u(x).

Claim 6. Let x∈Sx\in S and let c∈Av(x)c\in A_{v}(x), with witnessing radius rr. For y∈Sy\in S with d(y,x)≀rd(y,x)\le r we have u(y)≀v(y)≀cu(y)\le v(y)\le c, so rr also witnesses c∈Au(x)c\in A_{u}(x). Hence Av(x)βŠ†Au(x)A_{v}(x)\subseteq A_{u}(x). Since uβˆ—(x)u^{*}(x) is a lower bound for Au(x)A_{u}(x) it is a lower bound for Av(x)A_{v}(x), and since vβˆ—(x)v^{*}(x) is the greatest lower bound of Av(x)A_{v}(x) we conclude uβˆ—(x)≀vβˆ—(x)u^{*}(x)\le v^{*}(x).

Claim 5. Let x∈Sx\in S and let Ρ∈R\varepsilon\in\mathbb{R} be positive. By claim 4 of Approximation Property of the Supremum and the Infimum in R\mathbb{R} there is c∈Au(x)c\in A_{u}(x) with c<uβˆ—(x)+Ξ΅c<u^{*}(x)+\varepsilon; let rr be a positive witnessing radius for cc. Let Ξ΅β€²\varepsilon' be the least of Ξ΅\varepsilon and rr, which exists and is positive by claim 9 of Elementary Order Arithmetic in an Ordered Field, being equal to one of them.

We first find z∈Sz\in S with d(z,x)≀Ρ′d(z,x)\le\varepsilon' and uβˆ—(x)βˆ’Ξ΅β€²<u(z)u^{*}(x)-\varepsilon'<u(z). Suppose no such zz exists. Then, by the totality of ≀\le, every z∈Sz\in S with d(z,x)≀Ρ′d(z,x)\le\varepsilon' satisfies u(z)≀uβˆ—(x)βˆ’Ξ΅β€²u(z)\le u^{*}(x)-\varepsilon', so Ξ΅β€²\varepsilon' witnesses uβˆ—(x)βˆ’Ξ΅β€²βˆˆAu(x)u^{*}(x)-\varepsilon'\in A_{u}(x) and therefore uβˆ—(x)≀uβˆ—(x)βˆ’Ξ΅β€²u^{*}(x)\le u^{*}(x)-\varepsilon'. Adding βˆ’uβˆ—(x)+Ξ΅β€²-u^{*}(x)+\varepsilon' to both sides gives Ρ′≀0\varepsilon'\le0 by the compatibility of ≀\le with addition, contradicting 0<Ξ΅β€²0<\varepsilon'.

Fix such a zz. Since d(z,x)≀Ρ′≀rd(z,x)\le\varepsilon'\le r, we get u(z)≀c<uβˆ—(x)+Ξ΅u(z)\le c<u^{*}(x)+\varepsilon, hence u(z)<uβˆ—(x)+Ξ΅u(z)<u^{*}(x)+\varepsilon by claim 2 of Elementary Order Arithmetic in an Ordered Field and so u(z)βˆ’uβˆ—(x)<Ξ΅u(z)-u^{*}(x)<\varepsilon by claim 1 there. Since Ρ′≀Ρ\varepsilon'\le\varepsilon, claim 4 of that lemma gives βˆ’Ξ΅β‰€βˆ’Ξ΅β€²-\varepsilon\le-\varepsilon', so uβˆ—(x)βˆ’Ξ΅β‰€uβˆ—(x)βˆ’Ξ΅β€²u^{*}(x)-\varepsilon\le u^{*}(x)-\varepsilon' by the compatibility of ≀\le with addition; combined with uβˆ—(x)βˆ’Ξ΅β€²<u(z)u^{*}(x)-\varepsilon'<u(z) and claim 2 of that lemma this gives uβˆ—(x)βˆ’Ξ΅<u(z)u^{*}(x)-\varepsilon<u(z), whence βˆ’Ξ΅<u(z)βˆ’uβˆ—(x)-\varepsilon<u(z)-u^{*}(x) by claim 1 there. Claim 9 of Properties of the Absolute Value in an Ordered Field now gives ∣u(z)βˆ’uβˆ—(x)∣<Ξ΅|u(z)-u^{*}(x)|<\varepsilon, and d(z,x)≀Ρ′≀Ρd(z,x)\le\varepsilon'\le\varepsilon. This proves the first assertion of claim 5.

For the sequence, write kk also for the image in R\mathbb{R} of k∈Nk\in\mathbb{N} under the canonical map of Properties of the Canonical Map from the Natural Numbers to an Ordered Field. By claim 2 there, 1≀k1\le k; since 0<10<1 by claim 6 of Elementary Order Arithmetic in an Ordered Field, claim 2 there gives 0<k0<k, so kβˆ’1k^{-1} exists and is positive by claim 7 there. Applying the first assertion with Ξ΅=kβˆ’1\varepsilon=k^{-1} and choosing, for each k∈Nk\in\mathbb{N}, one of the points it provides β€” an appeal to countable choice β€” yields a point xk∈Sx_{k}\in S with

d(xk,x)≀kβˆ’1and∣u(xk)βˆ’uβˆ—(x)∣<kβˆ’1,d(x_{k},x)\le k^{-1}\qquad\text{and}\qquad|u(x_{k})-u^{*}(x)|<k^{-1},

and these points form a sequence (xk)k∈N(x_{k})_{k\in\mathbb{N}} in SS.

Let η∈R\eta\in\mathbb{R} be positive. By claim 3 of The Archimedean Property of the Real Numbers there is N∈NN\in\mathbb{N} with Nβˆ’1<Ξ·N^{-1}<\eta. Let k∈Nk\in\mathbb{N} satisfy kβ‰₯Nk\ge N. Then N≀kN\le k in R\mathbb{R}: this is an equality if k=Nk=N, and follows from claim 6 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field otherwise. Multiplying N≀kN\le k by the positive number Nβˆ’1kβˆ’1N^{-1}k^{-1} gives kβˆ’1≀Nβˆ’1k^{-1}\le N^{-1}. Hence

d(xk,x)≀kβˆ’1≀Nβˆ’1<Ξ·anddR(u(xk),uβˆ—(x))=∣u(xk)βˆ’uβˆ—(x)∣<kβˆ’1≀Nβˆ’1<Ξ·,d(x_{k},x)\le k^{-1}\le N^{-1}<\eta\qquad\text{and}\qquad d_{\mathbb{R}}(u(x_{k}),u^{*}(x))=|u(x_{k})-u^{*}(x)|<k^{-1}\le N^{-1}<\eta ,

using claim 2 of Elementary Order Arithmetic in an Ordered Field to chain the comparisons. By Convergent Sequence in a Metric Space, (xk)(x_{k}) converges to xx in (M,d)(M,d) and (u(xk))(u(x_{k})) converges to uβˆ—(x)u^{*}(x) in (R,dR)(\mathbb{R},d_{\mathbb{R}}).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…