Math 2.0

Real functions Proof

Proof of the derivative of a map into a product

Builds on Fréchet derivativeDerivative as a little-o approximationBounded linear maps are continuous

Proof

With the max norm, the error of FF is small exactly when both errors are small.

  1. Let VV, W1W_1, W2W_2, UU, xx, f1f_1, f2f_2 and FF be as in the statement. Put A1=Df1(x)A_1 = Df_1(x) and A2=Df2(x)A_2 = Df_2(x).
  2. Define A ⁣:V→W1×W2A \colon V \to W_1 \times W_2 by Ah=(A1h,A2h)A h = (A_1 h, A_2 h). It is linear, since A1A_1 and A2A_2 are linear and the vector operations on W1×W2W_1 \times W_2 act on each factor.
  3. Since A1A_1 and A2A_2 are bounded, there are C1,C2≥0C_1, C_2 \ge 0 with ∥Aih∥≤Ci∥h∥\|A_i h\| \le C_i \|h\| for i=1,2i = 1, 2 and each h∈Vh \in V.
  4. So ∥Ah∥=max⁡(∥A1h∥,∥A2h∥)≤max⁡(C1,C2)∥h∥\|A h\| = \max(\|A_1 h\|, \|A_2 h\|) \le \max(C_1, C_2) \|h\|, and AA is bounded.
  5. For h∈Vh \in V with x+h∈Ux + h \in U, put ri(h)=fi(x+h)−fi(x)−Aihr_i(h) = f_i(x + h) - f_i(x) - A_i h for i=1,2i = 1, 2.
  6. Then F(x+h)−F(x)−Ah=(r1(h),r2(h))F(x + h) - F(x) - A h = (r_1(h), r_2(h)). Its norm is max⁡(∥r1(h)∥,∥r2(h)∥)\max(\|r_1(h)\|, \|r_2(h)\|).
  7. Let ε>0\varepsilon > 0. By the little-o form of the derivative for f1f_1 and f2f_2, there are δ1,δ2>0\delta_1, \delta_2 > 0 with ∥ri(h)∥≤ε∥h∥\|r_i(h)\| \le \varepsilon \|h\| for ∥h∥<δi\|h\| < \delta_i and x+h∈Ux + h \in U.
  8. Put δ=min⁡(δ1,δ2)\delta = \min(\delta_1, \delta_2). For ∥h∥<δ\|h\| < \delta with x+h∈Ux + h \in U, step 6 gives ∥F(x+h)−F(x)−Ah∥≤ε∥h∥\|F(x + h) - F(x) - A h\| \le \varepsilon \|h\|.
  9. So F(x+h)−F(x)−Ah=o(∥h∥)F(x + h) - F(x) - A h = o(\|h\|). By the little-o form, FF is Fréchet differentiable at xx with DF(x)=ADF(x) = A.
  10. That is, DF(x)(h)=(Df1(x)(h),Df2(x)(h))DF(x)(h) = (Df_1(x)(h), Df_2(x)(h)) for each h∈Vh \in V.

Idea

The error of the pair map is the pair of the two errors. In the max norm, a pair is small exactly when both of its entries are small. So the pair of the two derivatives is a derivative of the pair map.

Reading path

To understand this page from the ground up, read these 84 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that open sets are the sets that are neighbourhoods of all their points, 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 the reals form an ordered field, with the Cauchy sequence construction, 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 sequence characterisation of uniform continuity, Proof that the reals are Archimedean from the completeness axiom, Proof that open balls are open, Proof that Lipschitz maps are uniformly continuous, Proof of continuity via open sets in metric spaces.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Euclidean space object
  4. Integers object
  5. Ordered field definition
  6. Proposition concept
  7. Rational numbers object
  8. Real numbers object
  9. Set bounded above definition
  10. Vector space definition
  11. Set definition
  12. Fréchet derivative definition
  13. Ring of integers statement
  14. Archimedean ordered field definition
  15. Conjunction definition
  16. Disjunction definition
  17. Implication definition
  18. Predicate definition
  19. The reals form a field statement
  20. Supremum definition
  21. Norm definition
  22. Empty set object
  23. Family of sets definition
  24. Ordered pair definition
  25. Intersection definition
  26. Union definition
  27. The rationals form a field statement
  28. Existential quantifier definition
  29. Universal quantifier definition
  30. Completeness axiom statement
  31. Normed vector space definition
  32. Cartesian product definition
  33. Subset definition
  34. Union of a family of sets definition
  35. The rationals form an ordered field statement
  36. Proof of the derivative as a little-o approximation proof
  37. Uniqueness quantifier definition
  38. Binary relation definition
  39. Order on the reals definition
  40. Topological space definition
  41. Derivative as a little-o approximation statement
  42. Antisymmetric relation definition
  43. Reflexive relation definition
  44. Transitive relation definition
  45. Function definition
  46. Preorder definition
  47. Preimage of a set definition
  48. Metric space definition
  49. Partial order definition
  50. Convergence of a sequence in a metric space definition
  51. Lipschitz map definition
  52. Open ball definition
  53. Triangle inequality for a metric statement
  54. Total order definition
  55. Metric topology definition
  56. Open set definition
  57. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  58. Continuous map of topological spaces definition
  59. Equivalent metrics definition
  60. Proof that open sets are the sets that are neighbourhoods of all their points proof
  61. Proof of the description of the open sets of a metric space proof
  62. The reals form an ordered field statement
  63. Equivalent norms definition
  64. Open sets characterised by neighbourhoods statement
  65. Open sets of a metric space statement
  66. Proof of the approximation property of the supremum proof
  67. Continuous linear map definition
  68. Continuity at a point of a topological space definition
  69. Proof that open balls are open proof
  70. Approximation property of the supremum statement
  71. Open balls are open statement
  72. Proof that the reals are Archimedean from the completeness axiom proof
  73. Proof of continuity via open sets in metric spaces proof
  74. Proof of epsilon-delta continuity at a point in metric spaces proof
  75. The reals are Archimedean statement
  76. Proof of the sequence characterisation of uniform continuity proof
  77. Epsilon-delta continuity in metric spaces statement
  78. Continuity via open sets statement
  79. Epsilon-delta uniform continuity statement
  80. Proof that a linear map between normed spaces is continuous if and only if it is bounded proof
  81. Proof that Lipschitz maps are uniformly continuous proof
  82. Lipschitz maps are uniformly continuous statement
  83. Bounded linear maps are continuous statement
  84. Proof of the derivative of a map into a product proof

Where this leads

554 pages build on this one.

Further reading

  1. Web https://www.jirka.org/ra/realanal2.pdf, Proposition 8.3.9
About this page
TagRYV2THNSP1
URIm2://RYV2THNSP1
Kindproof
WritingW0 stub
MSC26B05
ProvesDerivative of a map into a product
UsesFréchet derivative, Derivative as a little-o approximation, Bounded linear maps are continuous
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.