TheoremBase

Proof sketch: the chain rule gives the partial derivatives of g∘f; induction on k then shows that they, and so g∘f, are of class Cᵏ.

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 (Rn,dE)(\mathbb{R}^{n},d_{E}) and (R,dR)(\mathbb{R},d_{\mathbb{R}}) are metric spaces by 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); membership in C0\mathcal{C}^{0} and Ck+1\mathcal{C}^{k+1} of UU and of VV is read through Functions of Class Cᵏ on an Open Subset of ℝⁿ (i), (g∘f)(x)=g(f(x))(g\circ f)(x)=g(f(x)), and the condition used in the induction below is predicative.

We first prove (i), beginning with a real-valued g:V→Rg:V\to\mathbb{R} of class C1C^{1} on VV. Fix x∈Ux\in U. By Basic Properties of Cᵏ Functions (v), ff is differentiable at xx with derivative matrix Df(x)Df(x), and gg, as a function on the open set V⊆RmV\subseteq\mathbb{R}^{m}, is differentiable at f(x)f(x) with derivative vector ∇g(f(x))\nabla g(f(x)). By Chain Rule for Differentiable Functions Between Euclidean Spaces (ii), g∘fg\circ f is differentiable at xx with derivative vector

∇(g∘f)(x)=Df(x)⊤ ∇g(f(x)).\nabla(g\circ f)(x)=Df(x)^{\top}\,\nabla g\bigl(f(x)\bigr).

By The Derivative Is the Jacobian Matrix, and Is Unique (i), ∂i(g∘f)(x)\partial_{i}(g\circ f)(x) exists and is the ii-th component of this vector. Expanding the transpose (Transpose of a Real Matrix (i)), the matrix-vector product (Matrix-Vector Product (i)), the gradient (Gradient of a Real-Valued Function on an Open Subset of Rn\mathbb{R}^n (i)) and the Jacobian entries (Df(x))li=∂ifl(x)(Df(x))_{li}=\partial_{i}f_{l}(x) (Jacobian Matrix of a Function Between Euclidean Spaces (i)), we get

∂i(g∘f)(x)=∑l∈[m](Df(x))li ∂lg(f(x))=∑l∈[m]∂lg(f(x)) ∂ifl(x).\partial_{i}(g\circ f)(x)=\sum_{l\in[m]}\bigl(Df(x)\bigr)_{li}\,\partial_{l}g\bigl(f(x)\bigr)=\sum_{l\in[m]}\partial_{l}g\bigl(f(x)\bigr)\,\partial_{i}f_{l}(x).

Now let g:V→Rpg:V\to\mathbb{R}^{p} be of class C1C^{1} on VV. Every component gjg_{j} is of class C1C^{1} on VV (Functions of Class Cᵏ on an Open Subset of ℝⁿ (iii)), and (g∘f)j=gj∘f(g\circ f)_{j}=g_{j}\circ f; the real-valued case applied to gjg_{j} gives the formula of (i).

Next we prove (ii) for real-valued gg. We show by induction on kk (The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion (viii)) that for every f:U→Rmf:U\to\mathbb{R}^{m} of class CkC^{k} on UU with f(x)∈Vf(x)\in V for every x∈Ux\in U, and every g∈Ck(V)g\in\mathcal{C}^{k}(V), we have g∘f∈Ck(U)g\circ f\in\mathcal{C}^{k}(U). For k=0k=0, ff is continuous on UU by Basic Properties of Cᵏ Functions (iv), gg is continuous on VV, and so g∘fg\circ f is continuous on UU by Continuity of Identity Maps, Compositions and Reciprocals (ii). For the inductive step, let ff and gg be of class Ck+1C^{k+1}. By Basic Properties of Cᵏ Functions (ii), both are of class C1C^{1} and of class CkC^{k}, so the real-valued case of (i) shows that every ∂i(g∘f)\partial_{i}(g\circ f) exists on UU, with

∂i(g∘f)=∑l∈[m](∂lg∘f) ∂ifl.\partial_{i}(g\circ f)=\sum_{l\in[m]}\bigl(\partial_{l}g\circ f\bigr)\,\partial_{i}f_{l}.

Here ∂lg∈Ck(V)\partial_{l}g\in\mathcal{C}^{k}(V) and ∂ifl∈Ck(U)\partial_{i}f_{l}\in\mathcal{C}^{k}(U) by Basic Properties of Cᵏ Functions (iii), and ∂lg∘f∈Ck(U)\partial_{l}g\circ f\in\mathcal{C}^{k}(U) by the induction hypothesis, applied to ff and ∂lg\partial_{l}g. Each summand therefore lies in Ck(U)\mathcal{C}^{k}(U) by Constants, Affine Functions, Sums, Products and Quotients of Cᵏ Functions (v), and so does their sum over l∈[m]l\in[m], by Constants, Affine Functions, Sums, Products and Quotients of Cᵏ Functions (iv) and induction on the number of summands. Hence g∘f∈Ck+1(U)g\circ f\in\mathcal{C}^{k+1}(U).

For vector-valued g:V→Rpg:V\to\mathbb{R}^{p} of class CkC^{k}, the component maps of g∘fg\circ f are the gj∘fg_{j}\circ f, each of class CkC^{k} by the real-valued case, so g∘fg\circ f is of class CkC^{k} by Functions of Class Cᵏ on an Open Subset of ℝⁿ (iii); this completes (ii). Applying (ii) for every k∈N0k\in\mathbb{N}_{0} gives (iii), since smoothness means being of class CkC^{k} for every kk (Smooth Functions on an Open Subset of ℝⁿ (i), Smooth Functions on an Open Subset of ℝⁿ (ii)).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…