TheoremBase

Sketch (Brezis, Lemma 1.2): the scaling sets scale with x, convex combinations of x/s and y/t give subadditivity, the large-scaling clause gives the bound, and openness of U gives pUp_U < 1 on U.

Proof

Write TxT_{x} for the set of The Scaling Set of an Open Convex Neighbourhood of the Origin Has an Infimum, so that pU(x)=inf⁑Txp_{U}(x)=\inf T_{x} for x∈Xx\in X by The Minkowski Gauge of an Open Convex Neighbourhood of the Origin (i). Throughout, balls and openness in XX refer to the norm metric dX(u,v)=βˆ₯uβˆ’vβˆ₯d_{X}(u,v)=\lVert u-v\rVert (The Norm Metric of a Real Normed Space (i)), which is a metric, in particular symmetric, by The Norm Metric of a Real Normed Space (ii). Two elementary facts about infima are used below: for Ξ΅>0\varepsilon>0 the number inf⁑Tx+Ξ΅\inf T_{x}+\varepsilon is not a lower bound of TxT_{x}, so some element of TxT_{x} is smaller than it; and a real number that is at most every Ξ΅>0\varepsilon>0 is at most 00.

Homogeneity. Let x∈Xx\in X and Ξ»>0\lambda>0. Since (Ξ»t)βˆ’1(Ξ»x)=tβˆ’1x(\lambda t)^{-1}(\lambda x)=t^{-1}x for t>0t>0 (Vector Space over a Field (v)), a real tt lies in TxT_{x} exactly when Ξ»t\lambda t lies in TΞ»xT_{\lambda x}; that is,

Tλx={λt:t∈Tx}.T_{\lambda x}=\{\lambda t:t\in T_{x}\}.

Hence Ξ»pU(x)\lambda p_{U}(x) is a lower bound of TΞ»xT_{\lambda x}; and if bb is any lower bound of TΞ»xT_{\lambda x}, then Ξ»βˆ’1b\lambda^{-1}b is a lower bound of TxT_{x}, so Ξ»βˆ’1b≀pU(x)\lambda^{-1}b\le p_{U}(x), that is, b≀λpU(x)b\le\lambda p_{U}(x). Thus Ξ»pU(x)\lambda p_{U}(x) is the greatest lower bound of TΞ»xT_{\lambda x} (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv)), and pU(Ξ»x)=Ξ»pU(x)p_{U}(\lambda x)=\lambda p_{U}(x). For Ξ»=0\lambda=0 we have 0x=0X0x=0_{X} (Elementary Identities in a Vector Space (ii)) and tβˆ’10X=0X∈Ut^{-1}0_{X}=0_{X}\in U for every t>0t>0 (Elementary Identities in a Vector Space (iii)), so every real Ξ΅>0\varepsilon>0 lies in T0XT_{0_{X}}. Then 00 is a lower bound of T0XT_{0_{X}}, and every lower bound bb satisfies b≀Ρb\le\varepsilon for all Ξ΅>0\varepsilon>0, hence b≀0b\le0; so, by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv), pU(0x)=pU(0X)=0=0β‹…pU(x)p_{U}(0x)=p_{U}(0_{X})=0=0\cdot p_{U}(x). This is Sublinear Functional (ii).

Subadditivity. Let x,y∈Xx,y\in X and Ξ΅>0\varepsilon>0, and put s=pU(x)+Ξ΅s=p_{U}(x)+\varepsilon and t=pU(y)+Ξ΅t=p_{U}(y)+\varepsilon; both are positive, as pUβ‰₯0p_{U}\ge0 by The Scaling Set of an Open Convex Neighbourhood of the Origin Has an Infimum (iii). Some element of TxT_{x} is smaller than ss, so s∈Txs\in T_{x} by The Scaling Set of an Open Convex Neighbourhood of the Origin Has an Infimum (ii); likewise t∈Tyt\in T_{y}. The identity

1s+t(x+y)=ss+t(1sx)+ts+t(1ty)\frac{1}{s+t}(x+y)=\frac{s}{s+t}\Bigl(\frac{1}{s}x\Bigr)+\frac{t}{s+t}\Bigl(\frac{1}{t}y\Bigr)

holds by Vector Space over a Field (vii) and Vector Space over a Field (v), and its right-hand side is a convex combination of sβˆ’1x∈Us^{-1}x\in U and tβˆ’1y∈Ut^{-1}y\in U, so it lies in UU by Convex Subset of a Real Vector Space (i). Hence s+t∈Tx+ys+t\in T_{x+y}, and

pU(x+y)≀s+t=pU(x)+pU(y)+2Ξ΅.p_{U}(x+y)\le s+t=p_{U}(x)+p_{U}(y)+2\varepsilon .

As Ξ΅>0\varepsilon>0 was arbitrary, pU(x+y)≀pU(x)+pU(y)p_{U}(x+y)\le p_{U}(x)+p_{U}(y), which is Sublinear Functional (i). Together with homogeneity, Sublinear Functional (iii) shows that pUp_{U} is sublinear, proving (i).

Bounds. Let r>0r>0 with B(0X,r)βŠ†UB(0_{X},r)\subseteq U, and let x∈Xx\in X. First, pU(x)β‰₯0p_{U}(x)\ge0 by The Scaling Set of an Open Convex Neighbourhood of the Origin Has an Infimum (iii). By The Scaling Set of an Open Convex Neighbourhood of the Origin Has an Infimum (i) every real t>rβˆ’1βˆ₯xβˆ₯t>r^{-1}\lVert x\rVert lies in TxT_{x}, so pU(x)≀rβˆ’1βˆ₯xβˆ₯+Ξ΅p_{U}(x)\le r^{-1}\lVert x\rVert+\varepsilon for every Ξ΅>0\varepsilon>0, whence pU(x)≀rβˆ’1βˆ₯xβˆ₯p_{U}(x)\le r^{-1}\lVert x\rVert. This proves (ii).

The sublevel set. Let x∈Ux\in U. By Open Subset of a Metric Space (i) fix ρ>0\rho>0 with B(x,ρ)βŠ†UB(x,\rho)\subseteq U, and put ΞΈ=ρ/(βˆ₯xβˆ₯+1)>0\theta=\rho/(\lVert x\rVert+1)>0. By Vector Space over a Field (viii) and Norms and Real Normed Spaces (iii),

βˆ₯(1+ΞΈ)xβˆ’xβˆ₯=ΞΈβˆ₯xβˆ₯<ρ,\lVert(1+\theta)x-x\rVert=\theta\lVert x\rVert<\rho,

so (1+ΞΈ)x∈B(x,ρ)βŠ†U(1+\theta)x\in B(x,\rho)\subseteq U by Open Ball in a Metric Space (ii). Hence (1+ΞΈ)βˆ’1∈Tx(1+\theta)^{-1}\in T_{x}, and since an infimum is a lower bound (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv)), pU(x)≀(1+ΞΈ)βˆ’1<1p_{U}(x)\le(1+\theta)^{-1}<1. Conversely, let pU(x)<1p_{U}(x)<1. Then some s∈Txs\in T_{x} satisfies s<1s<1, so 1∈Tx1\in T_{x} by The Scaling Set of an Open Convex Neighbourhood of the Origin Has an Infimum (ii); that is, x=1βˆ’1x∈Ux=1^{-1}x\in U (Vector Space over a Field (vi)). This proves (iii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…