Math 2.0

Real functions Proof

Proof of the product rule in several variables

Builds on Differentiable function of several variablesLinear maps on finite-dimensional spaces are continuousBounded linear maps are continuousTriangle inequality for norms

Proof

We write ff and gg as linear approximations plus errors, multiply out, and bound each error term.

  1. Let UU, ff, gg and aa be as in the statement. Put A=Df(a)A = Df(a) and B=Dg(a)B = Dg(a), two linear maps ℝn→ℝ\mathbb{R}^n \to \mathbb{R}.
  2. By linear maps on finite-dimensional spaces are continuous and bounded linear maps are continuous, there are CA,CB≥0C_A, C_B \ge 0 with ∣Ah∣≤CA∥h∥|A h| \le C_A \|h\| and ∣Bh∣≤CB∥h∥|B h| \le C_B \|h\| for each hh.
  3. For hh with a+h∈Ua + h \in U, put r(h)=f(a+h)−f(a)−Ahr(h) = f(a + h) - f(a) - A h and s(h)=g(a+h)−g(a)−Bhs(h) = g(a + h) - g(a) - B h. Put Δ(h)=f(a+h)−f(a)=Ah+r(h)\Delta(h) = f(a + h) - f(a) = A h + r(h).
  4. Let L ⁣:ℝn→ℝL \colon \mathbb{R}^n \to \mathbb{R} be the map Lh=f(a) Bh+g(a) AhL h = f(a) \, B h + g(a) \, A h. It is linear, since AA and BB are linear.
  5. Multiply out, using f(a+h)=f(a)+Δ(h)f(a + h) = f(a) + \Delta(h) and g(a+h)=g(a)+Bh+s(h)g(a + h) = g(a) + B h + s(h): f(a+h)g(a+h)=f(a)g(a)+f(a)Bh+f(a)s(h)+Δ(h)(g(a)+Bh+s(h)).f(a + h) g(a + h) = f(a) g(a) + f(a) B h + f(a) s(h) + \Delta(h) \big(g(a) + B h + s(h)\big).
  6. Since Δ(h)g(a)=g(a)Ah+g(a)r(h)\Delta(h) g(a) = g(a) A h + g(a) r(h), step 5 gives f(a+h)g(a+h)−f(a)g(a)−Lh=R(h)f(a + h) g(a + h) - f(a) g(a) - L h = R(h), where R(h)=f(a) s(h)+g(a) r(h)+Δ(h)(Bh+s(h)).R(h) = f(a) \, s(h) + g(a) \, r(h) + \Delta(h) \big(B h + s(h)\big).
  7. Since ff and gg are differentiable at aa, there is δ0>0\delta_0 > 0 with ∣r(h)∣≤∥h∥|r(h)| \le \|h\| and ∣s(h)∣≤∥h∥|s(h)| \le \|h\|. This holds for ∥h∥<δ0\|h\| < \delta_0 with a+h∈Ua + h \in U.
  8. For these hh, steps 2 and 7 give ∣Δ(h)∣≤(CA+1)∥h∥|\Delta(h)| \le (C_A + 1) \|h\| and ∣Bh+s(h)∣≤(CB+1)∥h∥|B h + s(h)| \le (C_B + 1) \|h\|.
  9. For 0<∥h∥<δ00 < \|h\| < \delta_0 with a+h∈Ua + h \in U, the triangle inequality and step 8 give ∣R(h)∣∥h∥≤∣f(a)∣∣s(h)∣∥h∥+∣g(a)∣∣r(h)∣∥h∥+(CA+1)(CB+1)∥h∥.\frac{|R(h)|}{\|h\|} \le |f(a)| \frac{|s(h)|}{\|h\|} + |g(a)| \frac{|r(h)|}{\|h\|} + (C_A + 1)(C_B + 1) \|h\|.
  10. As h→0h \to 0, the first two terms tend to 00 by the differentiability of gg and ff at aa. The last term tends to 00 as well.
  11. So ∣R(h)∣/∥h∥→0|R(h)| / \|h\| \to 0. By step 6, fgf g is differentiable at aa with D(fg)(a)=LD(f g)(a) = L.
  12. That is, D(fg)(a)(h)=f(a) Dg(a)(h)+g(a) Df(a)(h)D(f g)(a)(h) = f(a) \, Dg(a)(h) + g(a) \, Df(a)(h) for each h∈ℝnh \in \mathbb{R}^n.

Idea

Multiplying the two linear approximations gives the constant f(a)g(a)f(a) g(a), the two cross terms f(a)Bhf(a) B h and g(a)Ahg(a) A h, and some leftovers. Each leftover contains an error term, or a product of two quantities of size about ∥h∥\|h\|. So the leftovers are small compared with ∥h∥\|h\|.

Reading path

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

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Product_rule, Linear approximations
About this page
TagXDWQGKH180
URIm2://XDWQGKH180
Kindproof
WritingW0 stub
MSC26B05
ProvesProduct rule in several variables
UsesDifferentiable function of several variables, Linear maps on finite-dimensional spaces are continuous, Bounded linear maps are continuous, 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.