Math 2.0

Real functions Proof

Proof of the chain rule in several variables

Builds on Differentiable function of several variablesFréchet derivativeDerivative as a little-o approximationLinear maps on finite-dimensional spaces are continuousBounded linear maps are continuousFunction compositionComposition of linear mapsTriangle inequality for norms

Proof

We write both maps as linear approximations plus errors in little-o form, and we substitute one into the other.

  1. Let UU, WW, gg, ff and aa be as in the statement. Put b=g(a)b = g(a), A=Dg(a)A = Dg(a) and B=Df(b)B = Df(b).
  2. By linear maps on finite-dimensional spaces are continuous and bounded linear maps are continuous, each linear map between Euclidean spaces is bounded. So there are CA,CB≥0C_A, C_B \ge 0 with ∥Ah∥≤CA∥h∥\|A h\| \le C_A \|h\| and ∥Bw∥≤CB∥w∥\|B w\| \le C_B \|w\| for all h∈ℝnh \in \mathbb{R}^n and w∈ℝmw \in \mathbb{R}^m.
  3. By step 2, being differentiable at a point with derivative LL means that LL is the Fréchet derivative there, for the Euclidean norms. So the little-o form of the derivative applies.
  4. For hh with a+h∈Ua + h \in U, put r(h)=g(a+h)−g(a)−Ahr(h) = g(a + h) - g(a) - A h. For ww with b+w∈Wb + w \in W, put s(w)=f(b+w)−f(b)−Bws(w) = f(b + w) - f(b) - B w.
  5. For hh with a+h∈Ua + h \in U, put w(h)=g(a+h)−b=Ah+r(h)w(h) = g(a + h) - b = A h + r(h). Then b+w(h)=g(a+h)∈Wb + w(h) = g(a + h) \in W.
  6. By steps 4 and 5, f(g(a+h))=f(b+w(h))=f(b)+Bw(h)+s(w(h))f(g(a + h)) = f(b + w(h)) = f(b) + B w(h) + s(w(h)).
  7. Since BB is linear, Bw(h)=BAh+Br(h)B w(h) = B A h + B r(h). So (f∘g)(a+h)−(f∘g)(a)−(B∘A)h=Br(h)+s(w(h))(f \circ g)(a + h) - (f \circ g)(a) - (B \circ A) h = B r(h) + s(w(h)).
  8. Let ε>0\varepsilon > 0. By the little-o form for ff at bb, there is δ2>0\delta_2 > 0 with ∥s(w)∥≤ε2(CA+1)∥w∥\|s(w)\| \le \frac{\varepsilon}{2 (C_A + 1)} \|w\| for ∥w∥<δ2\|w\| < \delta_2 and b+w∈Wb + w \in W.
  9. By the little-o form for gg at aa, there is δ1>0\delta_1 > 0 with ∥r(h)∥≤min⁡(1,ε2(CB+1))∥h∥\|r(h)\| \le \min\big(1, \frac{\varepsilon}{2 (C_B + 1)}\big) \|h\| for ∥h∥<δ1\|h\| < \delta_1 and a+h∈Ua + h \in U.
  10. Put δ=min⁡(δ1,δ2/(CA+1))\delta = \min\big(\delta_1, \delta_2 / (C_A + 1)\big), and let ∥h∥<δ\|h\| < \delta with a+h∈Ua + h \in U.
  11. By steps 2, 5 and 9 and the triangle inequality, ∥w(h)∥≤CA∥h∥+∥h∥=(CA+1)∥h∥<δ2\|w(h)\| \le C_A \|h\| + \|h\| = (C_A + 1) \|h\| < \delta_2.
  12. So step 8 applies to w=w(h)w = w(h), and ∥s(w(h))∥≤ε2(CA+1)(CA+1)∥h∥=ε2∥h∥\|s(w(h))\| \le \frac{\varepsilon}{2 (C_A + 1)} (C_A + 1) \|h\| = \frac{\varepsilon}{2} \|h\|.
  13. By steps 2 and 9, ∥Br(h)∥≤CB∥r(h)∥≤CBε2(CB+1)∥h∥≤ε2∥h∥\|B r(h)\| \le C_B \|r(h)\| \le \frac{C_B \varepsilon}{2 (C_B + 1)} \|h\| \le \frac{\varepsilon}{2} \|h\|.
  14. By steps 7, 12 and 13, ∥(f∘g)(a+h)−(f∘g)(a)−(B∘A)h∥≤ε∥h∥\|(f \circ g)(a + h) - (f \circ g)(a) - (B \circ A) h\| \le \varepsilon \|h\| for ∥h∥<δ\|h\| < \delta with a+h∈Ua + h \in U.
  15. The composition B∘AB \circ A is a linear map ℝn→ℝk\mathbb{R}^n \to \mathbb{R}^k. By step 14 and the little-o form, the composition f∘gf \circ g is differentiable at aa with derivative B∘AB \circ A.
  16. That is, D(f∘g)(a)=Df(g(a))∘Dg(a)D(f \circ g)(a) = Df(g(a)) \circ Dg(a).

Idea

Near aa, the map gg moves a+ha + h to b+wb + w with w≈Ahw \approx A h, and near bb the map ff acts like BB. So f∘gf \circ g acts like BAB A. The errors stay small: BB cannot blow up the error of gg by more than a fixed factor, and ww is at most a fixed multiple of ∥h∥\|h\|.

Reading path

To understand this page from the ground up, read these 218 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof that open sets are the sets that are neighbourhoods of all their points, Proof of the commutativity of addition by induction, Proof of the Lebesgue number lemma by a finite cover of balls, Proof of the triangle inequality for norms, Proof of the Heine–Borel theorem by sequential compactness, Proof of the derivative as a little-o approximation, Proof that a linear map between normed spaces is continuous if and only if it is bounded, Proof that a function is bijective iff it has a two-sided inverse, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of continuity via closed sets, Proof that compact subsets of a metric space are bounded, Proof that compactness and sequential compactness agree in metric spaces, Proof that subsequences of a convergent sequence converge to the same limit, Proof that the coordinate map is a linear isomorphism, Proof of strong induction from ordinary induction, Proof that linear maps on finite-dimensional normed spaces are continuous, Proof of the existence of square roots of nonnegative reals, Proof that a continuous image of a compact set is compact, Proof that compact subsets of a Hausdorff space are closed, Proof of epsilon-delta continuity at a point in metric spaces, Proof of the description of the open sets of a metric space, Proof of the epsilon-N definition of the limit of a sequence, Proof that compactness of a subset can be tested with open sets of the ambient space, Proof of the existence of the infimum by negation, Proof of the equivalence of norms in finite dimension by compactness of the unit sphere, Proof that every spanning set contains a basis, by Zorn's lemma, Proof that closed sets contain their limits, Proof of Zorn's lemma, Proof that metric spaces are Hausdorff, Proof of the sequence characterisation of uniform continuity, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof that a continuous real function on a compact set attains its bounds, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof of the monotone convergence theorem for sequences, Proof that open balls are open, Proof that Lipschitz maps are uniformly continuous, Proof that a set is open if and only if its complement is closed, Proof of continuity via open sets in metric spaces.

  1. Basis concept
  2. Complex numbers object
  3. Construction of the reals from Cauchy sequences concept
  4. Coordinate space object
  5. Coordinate vector concept
  6. Definition by recursion concept
  7. Element definition
  8. Euclidean metric example
  9. Euclidean space object
  10. Extended real number line object
  11. Function concept
  12. Function composition concept
  13. Integers object
  14. Linear isomorphism concept
  15. Linear map concept
  16. Mathematical induction concept
  17. Natural numbers object
  18. Norm concept
  19. Ordered field definition
  20. Peano axioms concept
  21. Proof of Zorn's lemma proof
  22. Proposition concept
  23. Rational numbers object
  24. Real numbers object
  25. Sequence definition
  26. Set bounded above definition
  27. Vector space definition
  28. p-metric on R^n example
  29. Real and imaginary parts definition
  30. Set definition
  31. Fréchet derivative definition
  32. Function of several variables concept
  33. Ring of integers statement
  34. Successor function definition
  35. Archimedean ordered field definition
  36. Conjunction definition
  37. Disjunction definition
  38. Implication definition
  39. Predicate definition
  40. The reals form a field statement
  41. Real sequence definition
  42. Subsequence definition
  43. Infimum definition
  44. Supremum definition
  45. Linear combination definition
  46. Linear map definition
  47. Linear subspace definition
  48. Norm definition
  49. p-norm on R^n example
  50. Empty set object
  51. Family of sets definition
  52. Ordered pair definition
  53. Intersection definition
  54. Union definition
  55. Limit of a function of several variables concept
  56. Addition of natural numbers definition
  57. Existential quantifier definition
  58. Universal quantifier definition
  59. Bounded sequence definition
  60. Limit of a sequence definition
  61. Monotone sequence definition
  62. The successor function is injective statement
  63. Zero is not a successor statement
  64. The rationals form a field statement
  65. Linear independence definition
  66. Composition of linear maps definition
  67. Linear isomorphism definition
  68. Linear span definition
  69. Normed vector space definition
  70. Completeness axiom statement
  71. Cartesian product definition
  72. Union of a family of sets definition
  73. Subset definition
  74. Differentiable function of several variables definition
  75. Uniqueness quantifier definition
  76. Proof of the commutativity of addition by induction proof
  77. Convergent sequence definition
  78. Proof of the derivative as a little-o approximation proof
  79. Order on the natural numbers definition
  80. The rationals form an ordered field statement
  81. Spanning set definition
  82. Binary relation definition
  83. Topological space definition
  84. Universal set definition
  85. Derivative as a little-o approximation statement
  86. Order on the reals definition
  87. Commutativity of addition statement
  88. Proof of strong induction from ordinary induction proof
  89. Finite-dimensional vector space definition
  90. Basis definition
  91. Antisymmetric relation definition
  92. Reflexive relation definition
  93. Transitive relation definition
  94. Sequential compactness definition
  95. Function definition
  96. Subspace topology definition
  97. Complement definition
  98. Coordinate vector definition
  99. Strong induction statement
  100. Preorder definition
  101. Choice function definition
  102. Image of a set definition
  103. Preimage of a set definition
  104. Codomain definition
  105. Function composition definition
  106. Identity function definition
  107. Injective function definition
  108. Proof of the well-ordering principle from strong induction proof
  109. Metric space definition
  110. Partial order definition
  111. Axiom of choice statement
  112. Surjective function definition
  113. Left inverse definition
  114. Right inverse definition
  115. Closed ball definition
  116. Convergence of a sequence in a metric space definition
  117. Lipschitz map definition
  118. Open ball definition
  119. Triangle inequality for a metric statement
  120. Well-ordering principle statement
  121. Diameter of a set definition
  122. Maximal element definition
  123. Total order definition
  124. Upper bound definition
  125. Bijective function definition
  126. Metric topology definition
  127. Bounded set definition
  128. Proof that every sequence has a monotone subsequence, by peaks proof
  129. Chain definition
  130. Open set definition
  131. Proof that a function is bijective iff it has a two-sided inverse proof
  132. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  133. Every sequence has a monotone subsequence statement
  134. Hausdorff space definition
  135. Open cover definition
  136. Proof that open sets are the sets that are neighbourhoods of all their points proof
  137. Continuous map of topological spaces definition
  138. Closed set definition
  139. Bijective iff it has a two-sided inverse statement
  140. Zorn's lemma statement
  141. Equivalent metrics definition
  142. Proof of the description of the open sets of a metric space proof
  143. The reals form an ordered field statement
  144. Compact space definition
  145. Open sets characterised by neighbourhoods statement
  146. Proof that a set is open if and only if its complement is closed proof
  147. Equivalent norms definition
  148. Open sets of a metric space statement
  149. Proof that the coordinate map is a linear isomorphism proof
  150. Proof that every spanning set contains a basis, by Zorn's lemma proof
  151. Absolute value definition
  152. Proof of the approximation property of the supremum proof
  153. Proof of the existence of the infimum by negation proof
  154. Proof of the existence of square roots of nonnegative reals proof
  155. Continuity at a point of a topological space definition
  156. Complement of an open set is closed statement
  157. Compact set definition
  158. Continuous linear map definition
  159. Proof that closed sets contain their limits proof
  160. Proof that open balls are open proof
  161. Every spanning set contains a basis statement
  162. Proof of the epsilon-N definition of the limit of a sequence proof
  163. Isomorphism with the coordinate space statement
  164. Approximation property of the supremum statement
  165. Existence of the infimum statement
  166. Existence of square roots of nonnegative reals statement
  167. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  168. Proof of continuity via closed sets proof
  169. Closed sets contain their limits statement
  170. Open balls are open statement
  171. Epsilon-N definition of the limit of a sequence statement
  172. Square root definition
  173. Proof that the reals are Archimedean from the completeness axiom proof
  174. Compactness via open covers statement
  175. Modulus of a complex number definition
  176. Continuity via closed sets statement
  177. Proof of epsilon-delta continuity at a point in metric spaces proof
  178. Proof of continuity via open sets in metric spaces proof
  179. Proof of the Lebesgue number lemma by a finite cover of balls proof
  180. Proof that metric spaces are Hausdorff proof
  181. The reals are Archimedean statement
  182. Proof that subsequences of a convergent sequence converge to the same limit proof
  183. Proof of the monotone convergence theorem for sequences proof
  184. Proof that compact subsets of a Hausdorff space are closed proof
  185. Proof that a continuous image of a compact set is compact proof
  186. Epsilon-delta continuity in metric spaces statement
  187. Lebesgue number lemma statement
  188. Proof that compact subsets of a metric space are bounded proof
  189. Metric spaces are Hausdorff statement
  190. Proof that compactness and sequential compactness agree in metric spaces proof
  191. Proof of the sequence characterisation of uniform continuity proof
  192. Subsequences of a convergent sequence converge to the same limit statement
  193. Proof of the triangle inequality for norms proof
  194. Monotone convergence theorem for sequences statement
  195. Compact subsets of a Hausdorff space are closed statement
  196. Continuous image of a compact set is compact statement
  197. Continuity via open sets statement
  198. Compactness and sequential compactness agree in metric spaces statement
  199. Compact subsets of a metric space are bounded statement
  200. Epsilon-delta uniform continuity statement
  201. Proof that a decreasing sequence bounded below converges proof
  202. Triangle inequality for norms statement
  203. Proof that a linear map between normed spaces is continuous if and only if it is bounded proof
  204. Proof that Lipschitz maps are uniformly continuous proof
  205. Decreasing sequence bounded below converges statement
  206. Lipschitz maps are uniformly continuous statement
  207. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  208. Bounded linear maps are continuous statement
  209. Bolzano–Weierstrass theorem statement
  210. Proof of the Heine–Borel theorem by sequential compactness proof
  211. Heine–Borel theorem statement
  212. Proof that a continuous real function on a compact set attains its bounds proof
  213. Continuous real function on a compact set attains its bounds statement
  214. Proof of the equivalence of norms in finite dimension by compactness of the unit sphere proof
  215. Equivalence of norms in finite dimension statement
  216. Proof that linear maps on finite-dimensional normed spaces are continuous proof
  217. Linear maps on finite-dimensional spaces are continuous statement
  218. Proof of the chain rule in several variables proof

Where this leads

329 pages build on this one.

Further reading

  1. Web https://www.jirka.org/ra/realanal2.pdf, Theorem 8.3.7
About this page
Tag6WBM8AKH3P
URIm2://6WBM8AKH3P
Kindproof
WritingW0 stub
MSC26B05
ProvesChain rule in several variables
UsesDifferentiable function of several variables, Fréchet derivative, Derivative as a little-o approximation, Linear maps on finite-dimensional spaces are continuous, Bounded linear maps are continuous, Function composition, Composition of linear maps, Triangle inequality for norms
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.