Math 2.0

Real functions Proof

Proof that C^k functions are characterised by continuous derivatives

Builds on Iterated derivativeHigher partial derivativesPartial derivativeContinuous partial derivatives imply differentiabilityDerivative gives the directional derivativesDifferentiable function of several variablesFréchet derivativeMultilinear mapEquivalence of norms in finite dimensionLinear maps on finite-dimensional spaces are continuousBounded linear maps are continuousTriangle inequality for norms

Proof

We identify each iterated derivative with the list of its values on basis vectors, and we argue by induction on the order rr.

  1. Let UU, ff and kk be as in the statement. For r≥0r \ge 0, let Er=Lr(ℝn;ℝm)E_r = L^r(\mathbb{R}^n; \mathbb{R}^m), and let e1,…,ene_1, \dots, e_n be the standard basis of ℝn\mathbb{R}^n. For a tuple l=(l1,…,lr)l = (l_1, \dots, l_r) in {1,…,n}r\{1, \dots, n\}^r, write el=(el1,…,elr)e_l = (e_{l_1}, \dots, e_{l_r}).
  2. Define Φr ⁣:Er→(ℝm)nr=ℝN\Phi_r \colon E_r \to (\mathbb{R}^m)^{n^r} = \mathbb{R}^{N}, with N=mnrN = m n^r, by Φr(T)=(T(el))l\Phi_r(T) = (T(e_l))_l. For r=0r = 0, Φ0\Phi_0 is the identity of ℝm\mathbb{R}^m. The map Φr\Phi_r is linear.
  3. The map Φr\Phi_r is a bijection. Write each argument vs=∑tvs,tetv_s = \sum_t v_{s,t} e_t. By multilinearity, T(v1,…,vr)=∑lv1,l1⋯vr,lrT(el)T(v_1, \dots, v_r) = \sum_l v_{1,l_1} \cdots v_{r,l_r} T(e_l), so TT is determined by Φr(T)\Phi_r(T). Conversely, for any family (yl)(y_l) this formula with yly_l in place of T(el)T(e_l) defines an rr-linear map with values yly_l.
  4. Give ErE_r the norm ∥T∥=∥Φr(T)∥\|T\| = \|\Phi_r(T)\|, with the Euclidean norm on ℝN\mathbb{R}^N. All norms on ErE_r are equivalent. Equivalent norms give the same continuous maps, and they change the quotient defining a Fréchet derivative by bounded factors only. So we may use this norm.
  5. Let G ⁣:U→ErG \colon U \to E_r and x∈Ux \in U. Each linear map ℝn→Er\mathbb{R}^n \to E_r is bounded, by linear maps on finite-dimensional spaces are continuous and bounded linear maps are continuous. Since Φr\Phi_r is a linear bijection preserving norms, ∥G(x+h)−G(x)−Ah∥=∥ΦrG(x+h)−ΦrG(x)−ΦrAh∥\|G(x + h) - G(x) - A h\| = \|\Phi_r G(x + h) - \Phi_r G(x) - \Phi_r A h\| for each linear A ⁣:ℝn→ErA \colon \mathbb{R}^n \to E_r.
  6. By step 5, GG is Fréchet differentiable at xx if and only if Φr∘G\Phi_r \circ G is differentiable at xx. For the converse direction, a derivative LL of Φr∘G\Phi_r \circ G gives the linear map A=Φr−1∘LA = \Phi_r^{-1} \circ L in step 5. Then D(Φr∘G)(x)=Φr∘DG(x)D(\Phi_r \circ G)(x) = \Phi_r \circ DG(x). Also GG is continuous if and only if Φr∘G\Phi_r \circ G is continuous.
  7. A map into ℝN\mathbb{R}^N is continuous if and only if each coordinate is continuous. This follows from ∣yq∣≤∥y∥≤∣y1∣+⋯+∣yN∣|y_q| \le \|y\| \le |y_1| + \dots + |y_N| for y∈ℝNy \in \mathbb{R}^N, and the triangle inequality.
  8. When DrfD^r f is defined on UU, let cj,lr(x)c^r_{j,l}(x) be the jj-th entry of Drf(x)(el)D^r f(x)(e_l). These functions are the coordinates of Φr∘Drf\Phi_r \circ D^r f.
  9. For ll of length rr, let pj,l=∂rfj/∂xl1⋯∂xlrp_{j,l} = \partial^r f_j / \partial x_{l_1} \cdots \partial x_{l_r}, where we differentiate first in xlrx_{l_r} and last in xl1x_{l_1}. For r=0r = 0, pj,()=fjp_{j,()} = f_j. By the definition of higher partial derivatives, pj,(i,l)=∂ipj,lp_{j,(i, l)} = \partial_i p_{j,l} whenever the right side exists. As ll varies, the pj,lp_{j,l} are all the partial derivatives of order rr of fjf_j.
  10. Claim: suppose that DrfD^r f is differentiable on UU, for some r≥0r \ge 0. Then for all ii, jj, ll and x∈Ux \in U, the partial derivative ∂icj,lr(x)\partial_i c^r_{j,l}(x) exists and equals cj,(i,l)r+1(x)c^{r+1}_{j,(i,l)}(x).
  11. Proof of the claim. By step 6, Φr∘Drf\Phi_r \circ D^r f is differentiable at xx with derivative Φr∘D(Drf)(x)\Phi_r \circ D(D^r f)(x). Since the derivative gives the directional derivatives, its difference quotients in the direction eie_i tend to Φr(D(Drf)(x)(ei))\Phi_r\big(D(D^r f)(x)(e_i)\big).
  12. Each coordinate of a convergent family in ℝN\mathbb{R}^N converges, by step 7. Taking the coordinate with index (j,l)(j, l), the partial derivative ∂icj,lr(x)\partial_i c^r_{j,l}(x) exists and equals the jj-th entry of D(Drf)(x)(ei)(el)D(D^r f)(x)(e_i)(e_l).
  13. By the definition of the iterated derivative, D(Drf)(x)(ei)(el)=Dr+1f(x)(ei,el1,…,elr)D(D^r f)(x)(e_i)(e_l) = D^{r+1} f(x)(e_i, e_{l_1}, \dots, e_{l_r}). Its jj-th entry is cj,(i,l)r+1(x)c^{r+1}_{j,(i,l)}(x). This proves the claim.
  14. Now suppose that ff is of class CkC^k in the sense of partial derivatives. We show by induction on r≤kr \le k that DrfD^r f is defined on UU and cj,lr=pj,lc^r_{j,l} = p_{j,l} on UU for all jj and ll. For r=0r = 0 both sides are fjf_j.
  15. Suppose that this holds for some r<kr < k. The coordinates of Φr∘Drf\Phi_r \circ D^r f are the pj,lp_{j,l}. Their partial derivatives ∂ipj,l=pj,(i,l)\partial_i p_{j,l} = p_{j,(i,l)} have order r+1≤kr + 1 \le k, so they exist and are continuous on UU.
  16. By the theorem that continuous partial derivatives imply differentiability, Φr∘Drf\Phi_r \circ D^r f is differentiable at each point of UU. By step 6, DrfD^r f is differentiable on UU. So Dr+1fD^{r+1} f is defined on UU.
  17. By the claim and the induction hypothesis, cj,(i,l)r+1=∂icj,lr=∂ipj,l=pj,(i,l)c^{r+1}_{j,(i,l)} = \partial_i c^r_{j,l} = \partial_i p_{j,l} = p_{j,(i,l)} on UU. Each tuple of length r+1r + 1 has the form (i,l)(i, l), so the induction step is complete.
  18. Step 16 shows condition 2 for each r<kr < k. For 1≤r≤k1 \le r \le k, the coordinates cj,lr=pj,lc^r_{j,l} = p_{j,l} of Φr∘Drf\Phi_r \circ D^r f are continuous by hypothesis. By steps 6 and 7, DrfD^r f is continuous on UU.
  19. For r=0r = 0: by step 16 with r=0r = 0, ff is differentiable at each x∈Ux \in U. As in step 5, there is C≥0C \ge 0 with ∥Df(x)h∥≤C∥h∥\|Df(x) h\| \le C \|h\|. The definition gives ∥f(x+h)−f(x)∥≤(C+1)∥h∥\|f(x + h) - f(x)\| \le (C + 1) \|h\| for small hh. So ff is continuous, and condition 1 holds.
  20. Conversely, suppose that conditions 1 and 2 hold. We show by induction on r≤kr \le k that each pj,lp_{j,l} of order rr exists on UU and equals cj,lrc^r_{j,l}. For r=0r = 0 both sides are fjf_j.
  21. Suppose that this holds for some r<kr < k. By condition 2, DrfD^r f is differentiable on UU. By the claim, ∂icj,lr\partial_i c^r_{j,l} exists on UU and equals cj,(i,l)r+1c^{r+1}_{j,(i,l)}.
  22. Since cj,lr=pj,lc^r_{j,l} = p_{j,l} on UU, the partial derivative pj,(i,l)=∂ipj,lp_{j,(i,l)} = \partial_i p_{j,l} exists on UU and equals cj,(i,l)r+1c^{r+1}_{j,(i,l)}. This completes the induction step.
  23. Let r≤kr \le k. By condition 1, DrfD^r f is continuous on UU. By steps 6 and 7, each coordinate cj,lrc^r_{j,l} of Φr∘Drf\Phi_r \circ D^r f is continuous. By step 20, each partial derivative pj,lp_{j,l} of order rr is continuous on UU.
  24. So ff is of class CkC^k on UU. Together with steps 14 to 19, this proves the equivalence.

Idea

The values of Drf(x)D^r f(x) on tuples of basis vectors are exactly the partial derivatives of order rr, with the first argument being the last variable of differentiation. So the iterated derivative and the list of partial derivatives carry the same information, and one is continuous exactly when the other is. Continuous partial derivatives give differentiability, and this lets the induction climb one order at a time.

Reading path

To understand this page from the ground up, read these 298 pages in order. The foundations come first. The path takes the proofs Proof of the limit of a sum of sequences, Proof of Rolle's theorem, Proof of the derivative of a map into R^n by components, 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 epsilon-delta form of continuity, Proof of the triangle inequality for norms, Proof of the Heine–Borel theorem by sequential compactness, Proof that there is a natural number n with 1/n below any positive epsilon, 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 of the double negation law by a truth table, Proof of the extreme value theorem by the Bolzano–Weierstrass theorem, 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 of the uniqueness of limits, 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 limit of a product of sequences, Proof that the absolute value is multiplicative, Proof of the squeeze theorem for sequences, Proof of the existence of square roots of nonnegative reals, Proof of the linearity of differentiation, 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 sequential characterization of limits, Proof of the description of the open sets of a metric space, Proof of the triangle inequality for real numbers, 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 of Fermat's theorem on stationary points, Proof that limits preserve non-strict inequalities, Proof that closed sets contain their limits, Proof of Zorn's lemma, Proof that metric spaces are Hausdorff, Proof that the derivative gives the directional derivatives, Proof that differentiable functions are continuous, Proof of the sequence characterisation of uniform continuity, Proof of the epsilon-delta form of the limit of a function, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof of the Archimedean property in an Archimedean ordered field, Proof that a continuous real function on a compact set attains its bounds, Proof of the derivative of a map into a product, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof that convergent sequences are bounded, Proof of the monotone convergence theorem for sequences, Proof that continuity is equivalent to sequential continuity, Proof that open balls are open, Proof of the boundedness theorem by Bolzano–Weierstrass, Proof that Lipschitz maps are uniformly continuous, Proof that continuous partial derivatives imply differentiability, Proof that a set is open if and only if its complement is closed, Proof of the mean value theorem from Rolle's theorem, Proof of continuity via open sets in metric spaces, Proof of the constant multiple rule.

  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. Limit point of a set definition
  14. Linear isomorphism concept
  15. Linear map concept
  16. Local maximum definition
  17. Mathematical induction concept
  18. Natural numbers object
  19. Norm concept
  20. Ordered field definition
  21. Peano axioms concept
  22. Proof of Zorn's lemma proof
  23. Proposition concept
  24. Rational numbers object
  25. Real numbers object
  26. Sequence definition
  27. Set bounded above definition
  28. Vector space definition
  29. p-metric on R^n example
  30. Real and imaginary parts definition
  31. Set definition
  32. Fréchet derivative definition
  33. Having a directional derivative definition
  34. Total derivative concept
  35. Function of several variables concept
  36. Ring of integers statement
  37. Limit of a function definition
  38. Local minimum definition
  39. Successor function definition
  40. Archimedean ordered field definition
  41. Conjunction definition
  42. Disjunction definition
  43. Implication definition
  44. Negation definition
  45. Predicate definition
  46. The reals form a field statement
  47. Real sequence definition
  48. Subsequence definition
  49. Infimum definition
  50. Supremum definition
  51. Linear combination definition
  52. Linear map definition
  53. Linear subspace definition
  54. Norm definition
  55. p-norm on R^n example
  56. Empty set object
  57. Family of sets definition
  58. Ordered pair definition
  59. Partial derivative concept
  60. Intersection definition
  61. Union definition
  62. Limit of a function of several variables concept
  63. Continuity at a point definition
  64. Derivative definition
  65. Addition of natural numbers definition
  66. Biconditional definition
  67. Truth table concept
  68. Modus ponens concept
  69. Proof of the Archimedean property in an Archimedean ordered field proof
  70. The rationals form a field statement
  71. The successor function is injective statement
  72. Zero is not a successor statement
  73. Existential quantifier definition
  74. Universal quantifier definition
  75. Bounded sequence definition
  76. Limit of a sequence definition
  77. Monotone sequence definition
  78. Linear independence definition
  79. Linear isomorphism definition
  80. Linear span definition
  81. Multilinear map definition
  82. Completeness axiom statement
  83. Normed vector space definition
  84. Cartesian product definition
  85. Jacobian matrix concept
  86. Partial derivative definition
  87. Continuous function definition
  88. Differentiable function of several variables definition
  89. Union of a family of sets definition
  90. Differentiable function definition
  91. Subset definition
  92. Proof of the commutativity of addition by induction proof
  93. Archimedean property statement
  94. Mathematical proof concept
  95. Order on the natural numbers definition
  96. Propositional logic concept
  97. Proof of the derivative as a little-o approximation proof
  98. The rationals form an ordered field statement
  99. Uniqueness quantifier definition
  100. Convergent sequence definition
  101. Sequential continuity definition
  102. Spanning set definition
  103. Higher partial derivatives definition
  104. Binary relation definition
  105. Differentiable on an open set definition
  106. Topological space definition
  107. Universal set definition
  108. Proof of the derivative of a map into R^n by components proof
  109. Derivative as a little-o approximation statement
  110. Order on the reals definition
  111. Commutativity of addition statement
  112. Tautology definition
  113. Proof of strong induction from ordinary induction proof
  114. Finite-dimensional vector space definition
  115. Basis definition
  116. Antisymmetric relation definition
  117. Reflexive relation definition
  118. Transitive relation definition
  119. Iterated derivative definition
  120. Sequential compactness definition
  121. Subspace topology definition
  122. Complement definition
  123. Interval definition
  124. Function definition
  125. Logical equivalence definition
  126. Coordinate vector definition
  127. Strong induction statement
  128. Preorder definition
  129. Choice function definition
  130. Proof of the epsilon-delta form of continuity proof
  131. Proof of the epsilon-delta form of the limit of a function proof
  132. Image of a set definition
  133. Preimage of a set definition
  134. Codomain definition
  135. Function composition definition
  136. Identity function definition
  137. Injective function definition
  138. Metric space definition
  139. Proof of the well-ordering principle from strong induction proof
  140. Proof of the double negation law by a truth table proof
  141. Partial order definition
  142. Axiom of choice statement
  143. Epsilon-delta definition of continuity statement
  144. Epsilon-delta definition of a limit statement
  145. Surjective function definition
  146. Left inverse definition
  147. Right inverse definition
  148. Closed ball definition
  149. Convergence of a sequence in a metric space definition
  150. Lipschitz map definition
  151. Open ball definition
  152. Triangle inequality for a metric statement
  153. Double negation law statement
  154. Well-ordering principle statement
  155. Diameter of a set definition
  156. Maximal element definition
  157. Total order definition
  158. Upper bound definition
  159. Bijective function definition
  160. Metric topology definition
  161. Bounded set definition
  162. Proof by contradiction concept
  163. Proof that every sequence has a monotone subsequence, by peaks proof
  164. Chain definition
  165. Open set definition
  166. Proof that a function is bijective iff it has a two-sided inverse proof
  167. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  168. Every sequence has a monotone subsequence statement
  169. Hausdorff space definition
  170. Continuous map of topological spaces definition
  171. Open cover definition
  172. Proof that open sets are the sets that are neighbourhoods of all their points proof
  173. Closed set definition
  174. Bijective iff it has a two-sided inverse statement
  175. Proof that the derivative gives the directional derivatives proof
  176. Zorn's lemma statement
  177. Equivalent metrics definition
  178. Proof of the description of the open sets of a metric space proof
  179. The reals form an ordered field statement
  180. Compact space definition
  181. Open sets characterised by neighbourhoods statement
  182. Proof that a set is open if and only if its complement is closed proof
  183. Derivative gives the directional derivatives statement
  184. Equivalent norms definition
  185. Proof that the coordinate map is a linear isomorphism proof
  186. Open sets of a metric space statement
  187. Absolute value definition
  188. Proof that every spanning set contains a basis, by Zorn's lemma proof
  189. Proof of the approximation property of the supremum proof
  190. Proof of the existence of the infimum by negation proof
  191. Proof of the existence of square roots of nonnegative reals proof
  192. Complement of an open set is closed statement
  193. Compact set definition
  194. Continuous linear map definition
  195. Continuity at a point of a topological space definition
  196. Proof that closed sets contain their limits proof
  197. Proof of the triangle inequality for real numbers proof
  198. Proof that the absolute value is multiplicative proof
  199. Proof that open balls are open proof
  200. Every spanning set contains a basis statement
  201. Isomorphism with the coordinate space statement
  202. Proof of the epsilon-N definition of the limit of a sequence proof
  203. Approximation property of the supremum statement
  204. Existence of the infimum statement
  205. Existence of square roots of nonnegative reals statement
  206. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  207. Proof of continuity via closed sets proof
  208. Closed sets contain their limits statement
  209. Triangle inequality statement
  210. Absolute value is multiplicative statement
  211. Open balls are open statement
  212. Square root definition
  213. Epsilon-N definition of the limit of a sequence statement
  214. Proof that the reals are Archimedean from the completeness axiom proof
  215. Compactness via open covers statement
  216. Continuity via closed sets statement
  217. Modulus of a complex number definition
  218. Proof that differentiable functions are continuous proof
  219. Proof of the limit of a sum of sequences proof
  220. Proof of the uniqueness of limits proof
  221. Proof of epsilon-delta continuity at a point in metric spaces proof
  222. Proof of continuity via open sets in metric spaces proof
  223. Proof of the Lebesgue number lemma by a finite cover of balls proof
  224. Proof that limits preserve non-strict inequalities proof
  225. Proof of the squeeze theorem for sequences proof
  226. Proof that metric spaces are Hausdorff proof
  227. Proof that convergent sequences are bounded proof
  228. The reals are Archimedean statement
  229. Proof that subsequences of a convergent sequence converge to the same limit proof
  230. Proof of the monotone convergence theorem for sequences proof
  231. Proof that compact subsets of a Hausdorff space are closed proof
  232. Proof that a continuous image of a compact set is compact proof
  233. Differentiable functions are continuous statement
  234. Lebesgue number lemma statement
  235. Proof that compact subsets of a metric space are bounded proof
  236. Epsilon-delta continuity in metric spaces statement
  237. Metric spaces are Hausdorff statement
  238. Proof that compactness and sequential compactness agree in metric spaces proof
  239. Proof of the triangle inequality for norms proof
  240. Limit of a sum of sequences statement
  241. Proof of the sequence characterisation of uniform continuity proof
  242. Uniqueness of limits statement
  243. Limits preserve non-strict inequalities statement
  244. Convergent sequences are bounded statement
  245. Proof that there is a natural number n with 1/n below any positive epsilon proof
  246. Subsequences of a convergent sequence converge to the same limit statement
  247. Squeeze theorem statement
  248. Monotone convergence theorem for sequences statement
  249. Continuous image of a compact set is compact statement
  250. Compact subsets of a Hausdorff space are closed statement
  251. Compactness and sequential compactness agree in metric spaces statement
  252. Compact subsets of a metric space are bounded statement
  253. Continuity via open sets statement
  254. Proof of the limit of a product of sequences proof
  255. Epsilon-delta uniform continuity statement
  256. There is a natural number n with 1/n below any positive epsilon statement
  257. Triangle inequality for norms statement
  258. Proof that a decreasing sequence bounded below converges proof
  259. Proof that a linear map between normed spaces is continuous if and only if it is bounded proof
  260. Proof that Lipschitz maps are uniformly continuous proof
  261. Proof of the sequential characterization of limits proof
  262. Proof that continuity is equivalent to sequential continuity proof
  263. Limit of a product of sequences statement
  264. Decreasing sequence bounded below converges statement
  265. Lipschitz maps are uniformly continuous statement
  266. Continuity is equivalent to sequential continuity statement
  267. Sequential characterization of limits statement
  268. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  269. Bounded linear maps are continuous statement
  270. Proof of the linearity of differentiation proof
  271. Bolzano–Weierstrass theorem statement
  272. Proof of the derivative of a map into a product proof
  273. Linearity of differentiation statement
  274. Proof of the Heine–Borel theorem by sequential compactness proof
  275. Proof of the boundedness theorem by Bolzano–Weierstrass proof
  276. Derivative of a map into a product statement
  277. Proof of the constant multiple rule proof
  278. Boundedness theorem statement
  279. Heine–Borel theorem statement
  280. Constant multiple rule statement
  281. Derivative of a map into R^n by components statement
  282. Proof of the extreme value theorem by the Bolzano–Weierstrass theorem proof
  283. Proof that a continuous real function on a compact set attains its bounds proof
  284. Extreme value theorem statement
  285. Continuous real function on a compact set attains its bounds statement
  286. Proof of Fermat's theorem on stationary points proof
  287. Proof of the equivalence of norms in finite dimension by compactness of the unit sphere proof
  288. Fermat's theorem on stationary points statement
  289. Proof of Rolle's theorem proof
  290. Equivalence of norms in finite dimension statement
  291. Rolle's theorem statement
  292. Proof that linear maps on finite-dimensional normed spaces are continuous proof
  293. Linear maps on finite-dimensional spaces are continuous statement
  294. Proof of the mean value theorem from Rolle's theorem proof
  295. Mean value theorem statement
  296. Proof that continuous partial derivatives imply differentiability proof
  297. Continuous partial derivatives imply differentiability statement
  298. Proof that C^k functions are characterised by continuous derivatives proof

Where this leads

381 pages build on this one.

Further reading

  1. Web https://www.jirka.org/ra/realanal2.pdf, Proposition 8.4.6 and Definition 8.6.1
About this page
TagX6BWVH3G8Z
URIm2://X6BWVH3G8Z
Kindproof
WritingW0 stub
MSC26B05
ProvesC^k function characterised by continuous derivatives
UsesIterated derivative, Higher partial derivatives, Partial derivative, Continuous partial derivatives imply differentiability, Derivative gives the directional derivatives, Differentiable function of several variables, Fréchet derivative, Multilinear map, Equivalence of norms in finite dimension, 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.