TheoremBase

One argument covers both spaces, using only nonnegativity, homogeneity and the triangle inequality of the norm: the map is defined by cases, rescaling gives norm R, and the Lipschitz bound follows by splitting into four cases according to which points lie in the ball.

Proof

Let VV be Rn\mathbb{R}^{n} or Mp×q(R)\mathcal{M}_{p\times q}(\mathbb{R}), with its sum, scalar multiple and difference (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iv), respectively Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv)), which obey the vector-space laws of the pointwise operations (Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices (iii)), and with its norm ∥⋅∥\lVert\cdot\rVert as in the statement. Only the following three properties of the norm are used: for all z,z′∈Vz,z'\in V and t∈Rt\in\mathbb{R},

(N1) ∥z∥≥0\lVert z\rVert\ge0;

(N2) ∥tz∥=∣t∣ ∥z∥\lVert tz\rVert=|t|\,\lVert z\rVert;

(N3) ∥z+z′∥≤∥z∥+∥z′∥\lVert z+z'\rVert\le\lVert z\rVert+\lVert z'\rVert.

For V=RnV=\mathbb{R}^{n} these are Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v) and Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi); for V=Mp×q(R)V=\mathcal{M}_{p\times q}(\mathbb{R}) they are Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (i), Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (v) and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vi). Two consequences: since z′−z=(−1)(z−z′)z'-z=(-1)(z-z'), (N2) gives

∥z′−z∥=∥z−z′∥;(N4)\lVert z'-z\rVert=\lVert z-z'\rVert;\qquad(\mathrm{N4})

and since z=(z−z′)+z′z=(z-z')+z' and z′=(z′−z)+zz'=(z'-z)+z, (N3) and (N4) give ∥z∥≤∥z−z′∥+∥z′∥\lVert z\rVert\le\lVert z-z'\rVert+\lVert z'\rVert and ∥z′∥≤∥z−z′∥+∥z∥\lVert z'\rVert\le\lVert z-z'\rVert+\lVert z\rVert, that is,

∣∥z∥−∥z′∥∣≤∥z−z′∥.(N5)\bigl|\lVert z\rVert-\lVert z'\rVert\bigr|\le\lVert z-z'\rVert.\qquad(\mathrm{N5})

We write ρ\rho for πR\pi_{R} if V=RnV=\mathbb{R}^{n} and for ΠR\Pi_{R} if V=Mp×q(R)V=\mathcal{M}_{p\times q}(\mathbb{R}). For z∈Vz\in V, by totality of the order of R\mathbb{R}, either ∥z∥≤R\lVert z\rVert\le R or ∥z∥>R\lVert z\rVert>R, and not both.

The map ((i)). Apply Maps Defined by Cases (i) with VV as both the domain and the codomain set, the property P(z)P(z): ∥z∥≤R\lVert z\rVert\le R, expressed by a predicative formula, t1(z)=zt_{1}(z)=z and t2(z)=(R/∥z∥) zt_{2}(z)=(R/\lVert z\rVert)\,z. For zz with P(z)P(z), t1(z)=z∈Vt_{1}(z)=z\in V. For zz without P(z)P(z), ∥z∥>R>0\lVert z\rVert>R>0, so ∥z∥≠0\lVert z\rVert\ne0, the quotient R/∥z∥R/\lVert z\rVert is a real number and t2(z)∈Vt_{2}(z)\in V. The lemma gives exactly one map ρ:V→V\rho:V\to V with ρ(z)=z\rho(z)=z when ∥z∥≤R\lVert z\rVert\le R and ρ(z)=(R/∥z∥) z\rho(z)=(R/\lVert z\rVert)\,z when ∥z∥>R\lVert z\rVert>R.

The values ((ii)). Let z∈Vz\in V. If ∥z∥≤R\lVert z\rVert\le R, then ρ(z)=z\rho(z)=z and ∥ρ(z)∥=∥z∥≤R\lVert\rho(z)\rVert=\lVert z\rVert\le R. If ∥z∥>R\lVert z\rVert>R, then R/∥z∥>0R/\lVert z\rVert>0, and by (N2)

∥ρ(z)∥=R∥z∥ ∥z∥=R.\lVert\rho(z)\rVert=\frac{R}{\lVert z\rVert}\,\lVert z\rVert=R.

The Lipschitz bound ((iii)). For z∈Vz\in V with ∥z∥>R\lVert z\rVert>R put uz=R/∥z∥u_{z}=R/\lVert z\rVert; then 0<uz<10<u_{z}<1 and uz∥z∥=Ru_{z}\lVert z\rVert=R. Let z,z′∈Vz,z'\in V. There are four cases.

Case 1: ∥z∥≤R\lVert z\rVert\le R and ∥z′∥≤R\lVert z'\rVert\le R. Then ρ(z)−ρ(z′)=z−z′\rho(z)-\rho(z')=z-z', and ∥z−z′∥≤2∥z−z′∥\lVert z-z'\rVert\le2\lVert z-z'\rVert by (N1).

Case 2: ∥z∥≤R<∥z′∥\lVert z\rVert\le R<\lVert z'\rVert. Put v=uz′v=u_{z'}. Then ρ(z)−ρ(z′)=z−vz′=(z−z′)+(1−v)z′\rho(z)-\rho(z')=z-vz'=(z-z')+(1-v)z', and 1−v>01-v>0. By (N3), (N2), v∥z′∥=Rv\lVert z'\rVert=R, R≥∥z∥R\ge\lVert z\rVert and (N5),

∥ρ(z)−ρ(z′)∥≤∥z−z′∥+(1−v)∥z′∥=∥z−z′∥+∥z′∥−R≤∥z−z′∥+(∥z′∥−∥z∥)≤2∥z−z′∥.\lVert\rho(z)-\rho(z')\rVert\le\lVert z-z'\rVert+(1-v)\lVert z'\rVert=\lVert z-z'\rVert+\lVert z'\rVert-R\le\lVert z-z'\rVert+\bigl(\lVert z'\rVert-\lVert z\rVert\bigr)\le2\lVert z-z'\rVert.

Case 3: ∥z′∥≤R<∥z∥\lVert z'\rVert\le R<\lVert z\rVert. Case 2 with zz and z′z' exchanged gives ∥ρ(z′)−ρ(z)∥≤2∥z′−z∥\lVert\rho(z')-\rho(z)\rVert\le2\lVert z'-z\rVert, and by (N4), applied to ρ(z),ρ(z′)\rho(z),\rho(z') and to z,z′z,z', this is ∥ρ(z)−ρ(z′)∥≤2∥z−z′∥\lVert\rho(z)-\rho(z')\rVert\le2\lVert z-z'\rVert.

Case 4: ∥z∥>R\lVert z\rVert>R and ∥z′∥>R\lVert z'\rVert>R. Put u=uzu=u_{z} and v=uz′v=u_{z'}. Then ρ(z)−ρ(z′)=uz−vz′=u(z−z′)+(u−v)z′\rho(z)-\rho(z')=uz-vz'=u(z-z')+(u-v)z'. By (N2) and 0<u<10<u<1, ∥u(z−z′)∥=u∥z−z′∥≤∥z−z′∥\lVert u(z-z')\rVert=u\lVert z-z'\rVert\le\lVert z-z'\rVert. Moreover

(u−v)∥z′∥=R∥z′∥∥z∥−R=u(∥z′∥−∥z∥),(u-v)\lVert z'\rVert=\frac{R\lVert z'\rVert}{\lVert z\rVert}-R=u\bigl(\lVert z'\rVert-\lVert z\rVert\bigr),

so by (N2), 0<u<10<u<1 and (N5), ∥(u−v)z′∥=∣u−v∣ ∥z′∥=u ∣∥z′∥−∥z∥∣≤∥z−z′∥\lVert(u-v)z'\rVert=|u-v|\,\lVert z'\rVert=u\,\bigl|\lVert z'\rVert-\lVert z\rVert\bigr|\le\lVert z-z'\rVert. By (N3), ∥ρ(z)−ρ(z′)∥≤2∥z−z′∥\lVert\rho(z)-\rho(z')\rVert\le2\lVert z-z'\rVert.

The four cases exhaust all z,z′∈Vz,z'\in V, which proves (iii) for πR\pi_{R} (V=RnV=\mathbb{R}^{n}) and for ΠR\Pi_{R} (V=Mp×q(R)V=\mathcal{M}_{p\times q}(\mathbb{R})).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…