TheoremBase

The first three clauses are the one-variable fundamental theorem and constancy criterion applied to each component or entry; the mean value inequality follows Rudin by applying the real mean value theorem to t -> z.x(t) with z = x(v)-x(u), and the matrix case applies the vector case to t -> A(t)w and uses the least-constant property of the operator norm.

Proof

For a map xx into Rq\mathbb{R}^{q} the component maps are written xkx_{k}, and for a map AA into Mp×q(R)\mathcal{M}_{p\times q}(\mathbb{R}) the entry maps are written AijA_{ij}, as in Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (i) and Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (ii). By these two clauses, a map into Rq\mathbb{R}^{q} is differentiable at a point if and only if each component map is, and then its derivative there has the derivatives of the component maps as components; likewise for matrices with entries. By Riemann Integral of a Vector-Valued or Matrix-Valued Map (ii) and Riemann Integral of a Vector-Valued or Matrix-Valued Map (iv), ∫uvx\int_{u}^{v}x is defined if and only if every ∫uvxk\int_{u}^{v}x_{k} is, and then (∫uvx)k=∫uvxk\bigl(\int_{u}^{v}x\bigr)_{k}=\int_{u}^{v}x_{k}; likewise for matrices with entries. The values of a map into Rq\mathbb{R}^{q}, respectively Mp×q(R)\mathcal{M}_{p\times q}(\mathbb{R}), lie in Rq\mathbb{R}^{q}, respectively Mp×q(R)\mathcal{M}_{p\times q}(\mathbb{R}) (Values of a Map between Classes, and Distances in a Metric Space (iii)), so their components and entries are defined. Vectors and matrices are equal when their components, respectively entries, agree (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iii), Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iii)), and differences are formed componentwise and entrywise (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iv), Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv)). In (i), (ii) and (iv) we write out the vector case; the matrix case is the same argument applied to the entries AijA_{ij}, in (i) with Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (ii) in place of Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (i). Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations is applied with (X,d)=(R,dR)(X,d)=(\mathbb{R},d_{\mathbb{R}}) and with SS the domain of the map concerned.

Proof of (i). As a<ba<b, also a≤ba\le b (Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (v)), so the interval [a,b][a,b] contains two distinct points by Basic Facts about Intervals of the Real Line (v), so Rules for the Riemann Integral of Vector- and Matrix-Valued Maps (i), with [a,b][a,b] in place of II, shows that ∫ctx\int_{c}^{t}x is defined for every t∈[a,b]t\in[a,b]. Fix k∈[q]k\in[q]. Then Xk(t)=∫ctxkX_{k}(t)=\int_{c}^{t}x_{k} for t∈[a,b]t\in[a,b]. By Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (v), in the form of Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (i) with S=[a,b]S=[a,b], xkx_{k} is continuous on [a,b][a,b], so it is bounded and integrable on [a,b][a,b] by A Continuous Function on a Closed Interval is Riemann Integrable (i). Let F:[a,b]→RF:[a,b]\to\mathbb{R} be the map of Fundamental Theorem of Calculus, Part I: the Indefinite Integral is Lipschitz, Continuous, and Differentiable at Points of Continuity (i) for f=xkf=x_{k}, so F(t)=∫atxkF(t)=\int_{a}^{t}x_{k}, and let γ=∫caxk\gamma=\int_{c}^{a}x_{k}. By Additivity of the Riemann Integral over Adjacent Intervals, Subintervals and Oriented Integrals, and Integrals of Restrictions (iii), for every t∈[a,b]t\in[a,b],

Xk(t)=∫caxk+∫atxk=γ+F(t),X_{k}(t)=\int_{c}^{a}x_{k}+\int_{a}^{t}x_{k}=\gamma+F(t),

so XkX_{k} is the sum of FF and the constant map [a,b]→R[a,b]\to\mathbb{R} with value γ\gamma (Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (i)). Let t∈[a,b]t\in[a,b]. Since xkx_{k} is continuous on [a,b][a,b], it is continuous at tt relative to [a,b][a,b] (Continuous Map Between Metric Spaces (ii)), that is, continuous at tt in the sense of The Real Line: Standing Notation and Background for Calculus on Intervals (vi), and Fundamental Theorem of Calculus, Part I: the Indefinite Integral is Lipschitz, Continuous, and Differentiable at Points of Continuity (iv) shows that FF is differentiable at tt with F′(t)=xk(t)F'(t)=x_{k}(t), and by Derivatives of Constants, the Identity, Sums, Scalar Multiples, Products, Reciprocals, Quotients and Powers (i) and Derivatives of Constants, the Identity, Sums, Scalar Multiples, Products, Reciprocals, Quotients and Powers (iv) XkX_{k} is differentiable at tt with Xk′(t)=xk(t)X_{k}'(t)=x_{k}(t). Hence XX is differentiable at tt and X′(t)X'(t) has components xk(t)x_{k}(t), that is, X′(t)=x(t)X'(t)=x(t); as tt is arbitrary, XX is differentiable (Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (iii)).

Proof of (ii). By Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (iv) and Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (i), the kk-th component of x′(s)x'(s) is xk′(s)x_{k}'(s) for s∈Is\in I, so the kk-th component map of x′x' is the derivative map xk′x_{k}' of Derivative of a Real Function on an Interval (iv), and ∫uvxk′\int_{u}^{v}x_{k}' is defined for every k∈[q]k\in[q]. As xx is differentiable, every xkx_{k} is differentiable at every point of II, that is, differentiable on II (Derivative of a Real Function on an Interval (iii)), with derivative xk′x_{k}'. By Rules for Oriented Riemann Integrals of Real-Valued Maps: Sums, Scalar Multiples, Constants, Continuous Maps, Additivity and Evaluation by an Antiderivative (vi), applied to xkx_{k}, ∫uvxk′=xk(v)−xk(u)\int_{u}^{v}x_{k}'=x_{k}(v)-x_{k}(u), the kk-th component of x(v)−x(u)x(v)-x(u); this gives the clause.

Proof of (iii). Let u,v∈Iu,v\in I. Since x′x' is continuous on II, ∫uvx′\int_{u}^{v}x' is defined by Rules for the Riemann Integral of Vector- and Matrix-Valued Maps (i), applied to x′x', and (ii) gives ∫uvx′=x(v)−x(u)\int_{u}^{v}x'=x(v)-x(u). The matrix case is the same, with the matrix statements of Rules for the Riemann Integral of Vector- and Matrix-Valued Maps (i) and (ii).

Proof of (iv). Fix k∈[q]k\in[q]. For every t∈It\in I, xkx_{k} is differentiable at tt with xk′(t)x_{k}'(t) the kk-th component of x′(t)=0x'(t)=0, which is 00 (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (v)), and xkx_{k} is continuous at tt relative to II by The Increment Form of the Derivative, and Differentiability Implies Continuity (ii); so xkx_{k} is continuous on II (Continuous Map Between Metric Spaces (ii)). By The Sign and Size of the Derivative: Monotonicity, Constancy and Lipschitz Bounds (v), xk(u)=xk(v)x_{k}(u)=x_{k}(v) for all u,v∈Iu,v\in I; hence x(u)=x(v)x(u)=x(v). For matrices, the entries of 0p×q0_{p\times q} are 00 by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (v).

Proof of (v), vectors. Let u,v∈Iu,v\in I. If u=vu=v, then ∥x(u)−x(u)∥=∥0∥=0=M ∣u−u∣\lVert x(u)-x(u)\rVert=\lVert0\rVert=0=M\,|u-u| by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (iii). If v<uv<u, the case u<vu<v with uu and vv exchanged gives ∥x(u)−x(v)∥≤M ∣u−v∣\lVert x(u)-x(v)\rVert\le M\,|u-v|, and ∥x(v)−x(u)∥=∥−(x(u)−x(v))∥=∥x(u)−x(v)∥\lVert x(v)-x(u)\rVert=\lVert-(x(u)-x(v))\rVert=\lVert x(u)-x(v)\rVert by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v), while ∣u−v∣=∣v−u∣|u-v|=|v-u|. So let u<vu<v, and let z=x(v)−x(u)z=x(v)-x(u) and φ:I→R\varphi:I\to\mathbb{R}, t↦z⋅x(t)t\mapsto z\cdot x(t) (Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (i) and Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (iii), with the map of The Summation Map on Real-Valued Maps over a Finite Set, and the Dot Product, Euclidean Norm and Euclidean Distance as Maps (ii)). The constant map I→RqI\to\mathbb{R}^{q}, t↦zt\mapsto z, and xx are continuous on II, so φ\varphi is continuous on II by Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (iv) and Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (v). At every inner point tt of II, xx is differentiable at tt, so φ\varphi is differentiable at tt with φ′(t)=z⋅x′(t)\varphi'(t)=z\cdot x'(t), by Rules for Derivatives of Vector- and Matrix-Valued Maps (x). By Mean Value Theorem on a Closed Real Interval and on Any Interval (ii) there is ξ∈I\xi\in I with u<ξ<vu<\xi<v and φ(v)−φ(u)=φ′(ξ) (v−u)\varphi(v)-\varphi(u)=\varphi'(\xi)\,(v-u); ξ\xi is an inner point of II. Hence ∥x′(ξ)∥≤M\lVert x'(\xi)\rVert\le M by hypothesis, and 0≤∥x′(ξ)∥0\le\lVert x'(\xi)\rVert by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i); so M≥∥x′(ξ)∥≥0M\ge\lVert x'(\xi)\rVert\ge0. By the difference form of The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite (iii), and by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i) for the last step,

φ(v)−φ(u)=z⋅x(v)−z⋅x(u)=z⋅(x(v)−x(u))=z⋅z=∥z∥2.\varphi(v)-\varphi(u)=z\cdot x(v)-z\cdot x(u)=z\cdot\bigl(x(v)-x(u)\bigr)=z\cdot z=\lVert z\rVert^{2}.

By Rules of Arithmetic and Order in an Ordered Field (x) and The Cauchy-Schwarz Inequality on Rn\mathbb{R}^n (i), and since 0≤∥z∥0\le\lVert z\rVert (Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i)) and ∥x′(ξ)∥≤M\lVert x'(\xi)\rVert\le M,

φ′(ξ)=z⋅x′(ξ)≤∣z⋅x′(ξ)∣≤∥z∥ ∥x′(ξ)∥≤∥z∥ M.\varphi'(\xi)=z\cdot x'(\xi)\le|z\cdot x'(\xi)|\le\lVert z\rVert\,\lVert x'(\xi)\rVert\le\lVert z\rVert\,M .

Multiplying by v−u>0v-u>0 (Rules of Arithmetic and Order in an Ordered Field (vi)) and using φ(v)−φ(u)=φ′(ξ)(v−u)\varphi(v)-\varphi(u)=\varphi'(\xi)(v-u) gives the chain

∥z∥2=φ′(ξ) (v−u)≤∥z∥ ∥x′(ξ)∥ (v−u)≤∥z∥ M (v−u).\lVert z\rVert^{2}=\varphi'(\xi)\,(v-u)\le\lVert z\rVert\,\lVert x'(\xi)\rVert\,(v-u)\le\lVert z\rVert\,M\,(v-u).

If ∥z∥=0\lVert z\rVert=0, then ∥z∥=0≤M(v−u)\lVert z\rVert=0\le M(v-u) because M≥0M\ge0; otherwise multiplying by ∥z∥−1>0\lVert z\rVert^{-1}>0 (Rules of Arithmetic and Order in an Ordered Field (viii), Rules of Arithmetic and Order in an Ordered Field (vi)) gives ∥z∥≤M(v−u)=M ∣v−u∣\lVert z\rVert\le M(v-u)=M\,|v-u|.

Proof of (v), matrices. Let u,v∈Iu,v\in I and w∈Rqw\in\mathbb{R}^{q}, and let y:I→Rpy:I\to\mathbb{R}^{p}, t↦A(t)wt\mapsto A(t)w (Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (i) and Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (iii), with the map of The Matrix Product, Matrix-Vector Product, Transpose, Trace, Identity Matrix and Standard Basis Vectors Exist and Are Unique (ii)). Then yy is continuous on II by Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (iv) and Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (v), the constant map t↦wt\mapsto w being continuous by the former. At every inner point tt of II, yy is differentiable at tt with y′(t)=A′(t)wy'(t)=A'(t)w by Rules for Derivatives of Vector- and Matrix-Valued Maps (x), and ∥y′(t)∥≤∥A′(t)∥ ∥w∥≤M ∥w∥\lVert y'(t)\rVert\le\lVert A'(t)\rVert\,\lVert w\rVert\le M\,\lVert w\rVert by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (ii) and 0≤∥w∥0\le\lVert w\rVert (Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i)). The vector case, with pp in place of qq and M∥w∥M\lVert w\rVert in place of MM, gives ∥A(v)w−A(u)w∥≤M ∥w∥ ∣v−u∣\lVert A(v)w-A(u)w\rVert\le M\,\lVert w\rVert\,|v-u|. By Matrix-Vector Product (i), Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv) and Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality (ii), for i∈[p]i\in[p],

((A(v)−A(u))w)i=∑j=1q(Aij(v)wj−Aij(u)wj)=∑j=1qAij(v)wj−∑j=1qAij(u)wj,\bigl((A(v)-A(u))w\bigr)_{i}=\sum_{j=1}^{q}\bigl(A_{ij}(v)w_{j}-A_{ij}(u)w_{j}\bigr)=\sum_{j=1}^{q}A_{ij}(v)w_{j}-\sum_{j=1}^{q}A_{ij}(u)w_{j},

so (A(v)−A(u))w=A(v)w−A(u)w(A(v)-A(u))w=A(v)w-A(u)w. Hence ∥(A(v)−A(u))w∥≤(M ∣v−u∣)∥w∥\lVert(A(v)-A(u))w\rVert\le\bigl(M\,|v-u|\bigr)\lVert w\rVert for every w∈Rqw\in\mathbb{R}^{q}, and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (iii) gives ∥A(v)−A(u)∥≤M ∣v−u∣\lVert A(v)-A(u)\rVert\le M\,|v-u|.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…