Math 2.0

Real functions Proof

Proof of the linearity of the derivative

Builds on Fréchet derivativeDerivative as a little-o approximationBounded linear maps are continuousTriangle inequality for norms

Proof

We add the two error terms, and we scale one of them.

  1. Let VV, WW, UU, ff, gg, xx and cc be as in the statement. Put A=Df(x)A = Df(x) and B=Dg(x)B = Dg(x).
  2. Since AA and BB are bounded, 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 h∈Vh \in V. This is the meaning of bounded.
  3. The map A+BA + B is linear, and ∥(A+B)h∥≤∥Ah∥+∥Bh∥≤(CA+CB)∥h∥\|(A + B) h\| \le \|A h\| + \|B h\| \le (C_A + C_B) \|h\| by the triangle inequality. So A+BA + B is bounded.
  4. The map cAc A is linear, and ∥cAh∥=∣c∣ ∥Ah∥≤∣c∣CA∥h∥\|c A h\| = |c| \, \|A h\| \le |c| C_A \|h\|. So cAc A is bounded.
  5. For h∈Vh \in V with x+h∈Ux + h \in U, put r(h)=f(x+h)−f(x)−Ahr(h) = f(x + h) - f(x) - A h and s(h)=g(x+h)−g(x)−Bhs(h) = g(x + h) - g(x) - B h.
  6. Then (f+g)(x+h)−(f+g)(x)−(A+B)h=r(h)+s(h)(f + g)(x + h) - (f + g)(x) - (A + B) h = r(h) + s(h), and (cf)(x+h)−(cf)(x)−(cA)h=c r(h)(c f)(x + h) - (c f)(x) - (c A) h = c \, r(h).
  7. Let ε>0\varepsilon > 0. By the little-o form of the derivative for ff and for gg, there is δ>0\delta > 0 with ∥r(h)∥≤ε∥h∥\|r(h)\| \le \varepsilon \|h\| and ∥s(h)∥≤ε∥h∥\|s(h)\| \le \varepsilon \|h\|. This holds for ∥h∥<δ\|h\| < \delta with x+h∈Ux + h \in U. We take δ\delta as the smaller of the two numbers given by ff and by gg.
  8. For these hh, the triangle inequality gives ∥r(h)+s(h)∥≤2ε∥h∥\|r(h) + s(h)\| \le 2 \varepsilon \|h\|. Given ε′>0\varepsilon' > 0, we can apply this with ε=ε′/2\varepsilon = \varepsilon' / 2. So r(h)+s(h)=o(∥h∥)r(h) + s(h) = o(\|h\|).
  9. For these hh, also ∥c r(h)∥=∣c∣ ∥r(h)∥≤∣c∣ε∥h∥\|c \, r(h)\| = |c| \, \|r(h)\| \le |c| \varepsilon \|h\|. Given ε′>0\varepsilon' > 0, we can apply this with ε=ε′/(∣c∣+1)\varepsilon = \varepsilon' / (|c| + 1). So c r(h)=o(∥h∥)c \, r(h) = o(\|h\|).
  10. By steps 3, 6 and 8 and the little-o form, f+gf + g is Fréchet differentiable at xx with D(f+g)(x)=A+BD(f + g)(x) = A + B.
  11. By steps 4, 6 and 9 and the little-o form, cfc f is Fréchet differentiable at xx with D(cf)(x)=cAD(c f)(x) = c A.

Idea

The error of a sum is the sum of the errors, and the error of cfc f is cc times the error of ff. Both operations keep an error that is small compared with ∥h∥\|h\|. The candidate derivatives are again bounded linear maps, so the definition applies.

Reading path

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

Where this leads

115 pages build on this one.

Further reading

  1. Web https://www.jirka.org/ra/realanal2.pdf, Proposition 8.3.6
About this page
TagCWADDJ6942
URIm2://CWADDJ6942
Kindproof
WritingW0 stub
MSC26B05
ProvesLinearity of the derivative
UsesFréchet derivative, Derivative as a little-o approximation, 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.