TheoremBase

Compare the norm of the error vector with its coordinates, using that each coordinate is at most the norm and the norm is at most the sum of the coordinates.

Proof

Throughout, the arithmetic and order of R\mathbb{R} are used through The Structure of ℝ as a Field and an Ordered Ring (i), The Structure of ℝ as a Field and an Ordered Ring (ii), Arithmetic and Order Rules in the Real Numbers, Stated for ℝ (v), Arithmetic and Order Rules in the Real Numbers, Stated for ℝ (ix), Rules of Arithmetic and Order in an Ordered Field (iii) and The Quotient 1/x, Order Rules for Sums, and Nesting of Closed Intervals in ℝ (i); norms and distances in Rn\mathbb{R}^{n} through Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (ii), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi) and Standard Basis Vectors of ℝ^q: Coordinates, Orthonormality and Unit Length (iii); and the metric spaces (Rn,dE)(\mathbb{R}^{n},d_{E}) and (R,dR)(\mathbb{R},d_{\mathbb{R}}) through Rn\mathbb{R}^n with the Euclidean Distance Is a Complete Metric Space with Coordinatewise Convergence (i) and The Absolute Value Metric on the Real Numbers (i).

For s∈Is\in I with s≠ts\neq t put

z(s)=γ(s)−γ(t)s−t−c,so thatz(s)k=γk(s)−γk(t)s−t−ck(k∈[q]),z(s)=\frac{\gamma(s)-\gamma(t)}{s-t}-c,\qquad\text{so that}\qquad z(s)_{k}=\frac{\gamma_{k}(s)-\gamma_{k}(t)}{s-t}-c_{k}\quad(k\in[q]),

the operations on Rq\mathbb{R}^{q} being coordinatewise. The whole proof rests on comparing the norm of z(s)z(s) with its components: by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (iv),

∣z(s)k∣≤∥z(s)∥≤∑j=1q∣z(s)j∣(k∈[q]).|z(s)_{k}|\le\lVert z(s)\rVert\le\sum_{j=1}^{q}|z(s)_{j}|\qquad(k\in[q]).

The condition is necessary. Suppose that γ\gamma is differentiable at tt with γ′(t)=c\gamma'(t)=c. By Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (i), each component γk\gamma_{k} is differentiable at tt and ck=γk′(t)c_{k}=\gamma_{k}'(t). Let ε>0\varepsilon>0 be given. For each k∈[q]k\in[q], ck=γk′(t)c_{k}=\gamma_{k}'(t) is a derivative of γk\gamma_{k} at tt (Derivative of a Real Function on an Interval (ii)); choose δk>0\delta_{k}>0 by Derivative of a Real Function on an Interval (i) for γk\gamma_{k} with tolerance ε/(q+1)\varepsilon/(q+1), and then set δ=min⁡(1,δ1,…,δq)\delta=\min(1,\delta_{1},\dots,\delta_{q}). For s∈Is\in I with 0<∣s−t∣<δ0<|s-t|<\delta every component satisfies ∣z(s)k∣<ε/(q+1)|z(s)_{k}|<\varepsilon/(q+1), so the right-hand inequality of the display gives

∥z(s)∥≤∑j=1q∣z(s)j∣≤q εq+1<ε.\lVert z(s)\rVert\le\sum_{j=1}^{q}|z(s)_{j}|\le\frac{q\,\varepsilon}{q+1}<\varepsilon .

The condition is sufficient. Suppose that the condition holds, and let k∈[q]k\in[q]. Given ε>0\varepsilon>0, the δ>0\delta>0 that the condition provides for ε\varepsilon gives, by the left-hand inequality of the display,

∣z(s)k∣≤∥z(s)∥<ε(s∈I, 0<∣s−t∣<δ).|z(s)_{k}|\le\lVert z(s)\rVert<\varepsilon\qquad(s\in I,\ 0<|s-t|<\delta).

So ckc_{k} is a derivative of γk\gamma_{k} at tt in the sense of Derivative of a Real Function on an Interval (i), and γk\gamma_{k} is differentiable at tt with γk′(t)=ck\gamma_{k}'(t)=c_{k} (Derivative of a Real Function on an Interval (ii)). As this holds for every kk, Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (i) shows that γ\gamma is differentiable at tt and that γ′(t)\gamma'(t) has components ckc_{k}, that is, γ′(t)=c\gamma'(t)=c.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…