\documentclass[12pt,titlepage]{article} \usepackage{amsmath} \usepackage{mathrsfs} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsthm} \usepackage{mathtools} \usepackage{graphicx} \usepackage{color} \usepackage{ucs} \usepackage[utf8x]{inputenc} \usepackage{xparse} \usepackage{hyperref} %----Macros---------- % % Unresolved issues: % % \righttoleftarrow % \lefttorightarrow % % \color{} with HTML colorspec % \bgcolor % \array with options (without options, it's equivalent to the matrix environment) % Of the standard HTML named colors, white, black, red, green, blue and yellow % are predefined in the color package. Here are the rest. \definecolor{aqua}{rgb}{0, 1.0, 1.0} \definecolor{fuschia}{rgb}{1.0, 0, 1.0} \definecolor{gray}{rgb}{0.502, 0.502, 0.502} \definecolor{lime}{rgb}{0, 1.0, 0} \definecolor{maroon}{rgb}{0.502, 0, 0} \definecolor{navy}{rgb}{0, 0, 0.502} \definecolor{olive}{rgb}{0.502, 0.502, 0} \definecolor{purple}{rgb}{0.502, 0, 0.502} \definecolor{silver}{rgb}{0.753, 0.753, 0.753} \definecolor{teal}{rgb}{0, 0.502, 0.502} % Because of conflicts, \space and \mathop are converted to % \itexspace and \operatorname during preprocessing. % itex: \space{ht}{dp}{wd} % % Height and baseline depth measurements are in units of tenths of an ex while % the width is measured in tenths of an em. \makeatletter \newdimen\itex@wd% \newdimen\itex@dp% \newdimen\itex@thd% \def\itexspace#1#2#3{\itex@wd=#3em% \itex@wd=0.1\itex@wd% \itex@dp=#2ex% \itex@dp=0.1\itex@dp% \itex@thd=#1ex% \itex@thd=0.1\itex@thd% \advance\itex@thd\the\itex@dp% \makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}} \makeatother % \tensor and \multiscript \makeatletter \newif\if@sup \newtoks\@sups \def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}% \def\reset@sup{\@supfalse\@sups={}}% \def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else% \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}% \else \append@sup#2 \@suptrue \fi% \expandafter\mk@scripts\fi} \def\tensor#1#2{\reset@sup#1\mk@scripts#2_/} \def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2% \reset@sup\mk@scripts#3_/} \makeatother % \slash \makeatletter \newbox\slashbox \setbox\slashbox=\hbox{$/$} \def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$} \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa \copy\slashbox \kern-\@tempdima \box\@tempboxa} \def\slash{\protect\itex@pslash} \makeatother % math-mode versions of \rlap, etc % from Alexander Perlis, "A complement to \smash, \llap, and lap" % http://math.arizona.edu/~aprl/publications/mathclap/ \def\clap#1{\hbox to 0pt{\hss#1\hss}} \def\mathllap{\mathpalette\mathllapinternal} \def\mathrlap{\mathpalette\mathrlapinternal} \def\mathclap{\mathpalette\mathclapinternal} \def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}} \def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}} \def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}} % Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2} \let\oldroot\root \def\root#1#2{\oldroot #1 \of{#2}} \renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}} % Manually declare the txfonts symbolsC font \DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n} \SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n} \DeclareFontSubstitution{U}{txsyc}{m}{n} % Manually declare the stmaryrd font \DeclareSymbolFont{stmry}{U}{stmry}{m}{n} \SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n} % Manually declare the MnSymbolE font \DeclareFontFamily{OMX}{MnSymbolE}{} \DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n} \SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n} \DeclareFontShape{OMX}{MnSymbolE}{m}{n}{ <-6> MnSymbolE5 <6-7> MnSymbolE6 <7-8> MnSymbolE7 <8-9> MnSymbolE8 <9-10> MnSymbolE9 <10-12> MnSymbolE10 <12-> MnSymbolE12}{} % Declare specific arrows from txfonts without loading the full package \makeatletter \def\re@DeclareMathSymbol#1#2#3#4{% \let#1=\undefined \DeclareMathSymbol{#1}{#2}{#3}{#4}} \re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46} \re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12} \re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64} \re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6} \re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77} \re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77} \makeatother % \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE \makeatletter \def\Decl@Mn@Delim#1#2#3#4{% \if\relax\noexpand#1% \let#1\undefined \fi \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}} \def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}} \def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}} \Decl@Mn@Open{\llangle}{mnomx}{'164} \Decl@Mn@Close{\rrangle}{mnomx}{'171} \Decl@Mn@Open{\lmoustache}{mnomx}{'245} \Decl@Mn@Close{\rmoustache}{mnomx}{'244} \makeatother % Widecheck \makeatletter \DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}} \def\@widecheck#1#2{% \setbox\z@\hbox{\m@th$#1#2$}% \setbox\tw@\hbox{\m@th$#1% \widehat{% \vrule\@width\z@\@height\ht\z@ \vrule\@height\z@\@width\wd\z@}$}% \dp\tw@-\ht\z@ \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@ \setbox\tw@\hbox{% \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box \tw@}}}% {\ooalign{\box\tw@ \cr \box\z@}}} \makeatother % \mathraisebox{voffset}[height][depth]{something} \makeatletter \NewDocumentCommand\mathraisebox{moom}{% \IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{% \IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}% }{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}% \mathpalette\@temp{#4}} \makeatletter % udots (taken from yhmath) \makeatletter \def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.} \mkern2mu\raise4\p@\hbox{.}\mkern1mu \raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}} \makeatother %% Fix array \newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}} %% \itexnum is a noop \newcommand{\itexnum}[1]{#1} %% Renaming existing commands \newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}} \newcommand{\widevec}{\overrightarrow} \newcommand{\darr}{\downarrow} \newcommand{\nearr}{\nearrow} \newcommand{\nwarr}{\nwarrow} \newcommand{\searr}{\searrow} \newcommand{\swarr}{\swarrow} \newcommand{\curvearrowbotright}{\curvearrowright} \newcommand{\uparr}{\uparrow} \newcommand{\downuparrow}{\updownarrow} \newcommand{\duparr}{\updownarrow} \newcommand{\updarr}{\updownarrow} \newcommand{\gt}{>} \newcommand{\lt}{<} \newcommand{\map}{\mapsto} \newcommand{\embedsin}{\hookrightarrow} \newcommand{\Alpha}{A} \newcommand{\Beta}{B} \newcommand{\Zeta}{Z} \newcommand{\Eta}{H} \newcommand{\Iota}{I} \newcommand{\Kappa}{K} \newcommand{\Mu}{M} \newcommand{\Nu}{N} \newcommand{\Rho}{P} \newcommand{\Tau}{T} \newcommand{\Upsi}{\Upsilon} \newcommand{\omicron}{o} \newcommand{\lang}{\langle} \newcommand{\rang}{\rangle} \newcommand{\Union}{\bigcup} \newcommand{\Intersection}{\bigcap} \newcommand{\Oplus}{\bigoplus} \newcommand{\Otimes}{\bigotimes} \newcommand{\Wedge}{\bigwedge} \newcommand{\Vee}{\bigvee} \newcommand{\coproduct}{\coprod} \newcommand{\product}{\prod} \newcommand{\closure}{\overline} \newcommand{\integral}{\int} \newcommand{\doubleintegral}{\iint} \newcommand{\tripleintegral}{\iiint} \newcommand{\quadrupleintegral}{\iiiint} \newcommand{\conint}{\oint} \newcommand{\contourintegral}{\oint} \newcommand{\infinity}{\infty} \newcommand{\bottom}{\bot} \newcommand{\minusb}{\boxminus} \newcommand{\plusb}{\boxplus} \newcommand{\timesb}{\boxtimes} \newcommand{\intersection}{\cap} \newcommand{\union}{\cup} \newcommand{\Del}{\nabla} \newcommand{\odash}{\circleddash} \newcommand{\negspace}{\!} \newcommand{\widebar}{\overline} \newcommand{\textsize}{\normalsize} \renewcommand{\scriptsize}{\scriptstyle} \newcommand{\scriptscriptsize}{\scriptscriptstyle} \newcommand{\mathfr}{\mathfrak} \newcommand{\statusline}[2]{#2} \newcommand{\tooltip}[2]{#2} \newcommand{\toggle}[2]{#2} % Theorem Environments \theoremstyle{plain} \newtheorem{theorem}{Theorem} \newtheorem{lemma}{Lemma} \newtheorem{prop}{Proposition} \newtheorem{cor}{Corollary} \newtheorem*{utheorem}{Theorem} \newtheorem*{ulemma}{Lemma} \newtheorem*{uprop}{Proposition} \newtheorem*{ucor}{Corollary} \theoremstyle{definition} \newtheorem{defn}{Definition} \newtheorem{example}{Example} \newtheorem*{udefn}{Definition} \newtheorem*{uexample}{Example} \theoremstyle{remark} \newtheorem{remark}{Remark} \newtheorem{note}{Note} \newtheorem*{uremark}{Remark} \newtheorem*{unote}{Note} %------------------------------------------------------------------- \begin{document} %------------------------------------------------------------------- \section*{differentiable map} \begin{quote}% See also \emph{[[differentiation]]} and \emph{[[derivative]]}. \end{quote} \hypertarget{context}{}\subsubsection*{{Context}}\label{context} \hypertarget{differential_geometry}{}\paragraph*{{Differential geometry}}\label{differential_geometry} [[!include synthetic differential geometry - contents]] \hypertarget{differentiable_maps}{}\section*{{Differentiable maps}}\label{differentiable_maps} \noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak \noindent\hyperlink{definitions}{Definitions}\dotfill \pageref*{definitions} \linebreak \noindent\hyperlink{from_a_cartesian_space_to_the_real_numbers}{From a Cartesian space to the real numbers}\dotfill \pageref*{from_a_cartesian_space_to_the_real_numbers} \linebreak \noindent\hyperlink{partial_and_directional_derivatives}{Partial and directional derivatives}\dotfill \pageref*{partial_and_directional_derivatives} \linebreak \noindent\hyperlink{functions_between_cartesian_spaces}{Functions between Cartesian spaces}\dotfill \pageref*{functions_between_cartesian_spaces} \linebreak \noindent\hyperlink{functions_between_differentiable_manifolds}{Functions between differentiable manifolds}\dotfill \pageref*{functions_between_differentiable_manifolds} \linebreak \noindent\hyperlink{higher_differentiability}{Higher differentiability}\dotfill \pageref*{higher_differentiability} \linebreak \noindent\hyperlink{iterated_differentiability}{Iterated differentiability}\dotfill \pageref*{iterated_differentiability} \linebreak \noindent\hyperlink{symmetry_of_higher_derivatives}{Symmetry of higher derivatives}\dotfill \pageref*{symmetry_of_higher_derivatives} \linebreak \noindent\hyperlink{a_direct_definition_of_the_second_derivative}{A direct definition of the second derivative}\dotfill \pageref*{a_direct_definition_of_the_second_derivative} \linebreak \noindent\hyperlink{higher_differentiability_on_tangent_spaces_and_the_chain_rule}{Higher differentiability on tangent spaces and the chain rule}\dotfill \pageref*{higher_differentiability_on_tangent_spaces_and_the_chain_rule} \linebreak \noindent\hyperlink{for_maps_between_manifolds}{For maps between manifolds}\dotfill \pageref*{for_maps_between_manifolds} \linebreak \noindent\hyperlink{examples_and_nonexamples}{Examples and non-examples}\dotfill \pageref*{examples_and_nonexamples} \linebreak \noindent\hyperlink{DifferentiabilityOpposedToPartialDifferentiability}{Differentiability versus partial differentiability}\dotfill \pageref*{DifferentiabilityOpposedToPartialDifferentiability} \linebreak \noindent\hyperlink{differentiability_versus_continuous_and_higher_differentiability}{Differentiability versus continuous and higher differentiability}\dotfill \pageref*{differentiability_versus_continuous_and_higher_differentiability} \linebreak \noindent\hyperlink{symmetry_of_the_second_partial_derivatives}{Symmetry of the second partial derivatives}\dotfill \pageref*{symmetry_of_the_second_partial_derivatives} \linebreak \noindent\hyperlink{twice_differentiability_versus_quadratic_approximation}{Twice differentiability versus quadratic approximation}\dotfill \pageref*{twice_differentiability_versus_quadratic_approximation} \linebreak \noindent\hyperlink{the_second_derivative_as_a_quadratic_form}{The second derivative as a quadratic form}\dotfill \pageref*{the_second_derivative_as_a_quadratic_form} \linebreak \noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak \hypertarget{idea}{}\subsection*{{Idea}}\label{idea} A [[function]] (map) is \emph{differentiable} at some point if it can be well approximated by a [[linear map]] near that point. The approximating linear maps at different points together form the \emph{derivative} of the map. One may then ask whether the derivative itself is differentiable, and so on. This leads to a hierarchy of ever more differentiable maps, starting with [[continuous maps]] and progressing through maps that are $n$ times (continuously) differentiable to those that are infinitely differentiable, and finally to those that are [[analytic map|analytic]]. Infinitely differentiable maps are sometimes called \emph{smooth}. Differentiability is first defined directly for maps between (open subsets of) a [[Cartesian space]]. These differentiable maps can then be used to define the notion of [[differentiable manifold]], and then a more general notion of differentiable map \emph{between} differentiable manifolds, forming a [[category]] called [[Diff]]. We have a parallel hierarchy of ever more differentiable manifolds and ever more differentiable maps between them. Since every more differentiable manifold has an [[underlying]] less differentiable manifold, we may always consider maps that are less differentiable than the manifolds between which they run. \hypertarget{definitions}{}\subsection*{{Definitions}}\label{definitions} In all of the following $\mathbb{R}$ denotes the [[real numbers]] and $\mathbb{R}^n$ for $n \in \mathbb{N}$ their $n$-fold [[Cartesian product]]. For $i \in \{1, \cdots, n\}$ we write \begin{displaymath} \itexarray{ \mathbb{R}^n &\overset{pr_i}{\longrightarrow}& \mathbb{R} \\ \vec v = (v_1, \cdots, v_n) &\mapsto& v_i } \end{displaymath} for the [[projection]] map onto the $i$th factor. When considering [[convergence]] of [[sequences]] of elements of these sets we regard them as [[Euclidean space|Euclidean]] [[metric spaces]] with the [[Euclidean norm]] \begin{displaymath} {\Vert -\Vert} \;\colon\; \mathbb{R}^n \longrightarrow [0,\infty) \subset \mathbb{R} \,. \end{displaymath} The [[open subsets]] of the corresponding [[metric topology]] are the [[unions]] of [[open balls]] in $\mathbb{R}^n$. \hypertarget{from_a_cartesian_space_to_the_real_numbers}{}\subsubsection*{{From a Cartesian space to the real numbers}}\label{from_a_cartesian_space_to_the_real_numbers} \begin{defn} \label{DerivativeOfFunctionFromRnToR}\hypertarget{DerivativeOfFunctionFromRnToR}{} \textbf{(differentiation of real-valued functions on Cartesian space)} Let $n \in \mathbb{N}$ and let $U \subset \mathbb{R}^n$ be an [[open subset]]. Then a [[function]] $f \;\colon\; U \longrightarrow \mathbb{R}$ is called \textbf{differentiable} at $x\in U$ if there exists a [[linear map]] $d f_x : \mathbb{R}^n \to \mathbb{R}$ such that the following [[limit of a sequence|limit]] exists as $h$ approaches zero ``from all directions at once'': \begin{displaymath} \lim_{h\to 0} \frac{f(x+h)-f(x) - d f_x(h)}{\Vert h\Vert} = 0. \end{displaymath} This means that for all $\epsilon \in (0,\infty)$ there exists an [[open subset]] $V\subseteq U$ containing $x$ such that whenever $x+h\in V$ we have $\frac{f(x+h)-f(x) - d f_x(h)}{\Vert h\Vert} \lt \epsilon$. We say that $f$ is \textbf{differentiable on} a [[subset]] $I$ of $U$ if $f$ is differentiable at every $x\in I$, and \textbf{differentiable} (tout court) if $f$ is differentiable on all of $U$. We say that $f$ is \textbf{continuously differentiable} if it is differentiable and $d f$ is a [[continuous function]]. The map $d f_x$ is called the \textbf{derivative} or \textbf{differential of $f$ at $x$}. \end{defn} \begin{remark} \label{}\hypertarget{}{} \textbf{(Notation and Terminology)} If $n=1$, as in classical one-variable calculus, then $d f_x$ in def. \ref{DerivativeOfFunctionFromRnToR} may be identified with a [[real number]], and that number is also called the derivative of $f$ at $x$ and often written $f'(x)$. (In that case, the notation $d f$ is generally still reserved for the corresponding linear map, with its input denoted by $d x$, so that we have $d f = f'(x) d x$.) \end{remark} \begin{remark} \label{}\hypertarget{}{} \textbf{(equivalent formulation)} An equivalent way to state def. \ref{DerivativeOfFunctionFromRnToR} is to say that \begin{displaymath} f(x+h) = f(x) + d f_x(h) + E(h){\Vert h\Vert} \end{displaymath} where $E$ is a function such that $\lim_{h\to 0}E(h) = 0$. This is easy to see; just let $E(h) = \frac{f(x+h)-f(x) - d f_x(h)}{\Vert h\Vert}$. Another equivalent way to say it is that \begin{displaymath} f(x+h) = f(x) + d f_x(h) + E_1(h) h_1 + \cdots + E_n(h) h_n \end{displaymath} where $E_i$ are functions such that $\lim_{h\to 0}E_i(h) = 0$. For if this is true, then $E(h) = \frac{1}{\Vert h\Vert}(E_1(h) h_1 + \cdots + E_n(h) h_n)$ satisfies the previous definition. Conversely, if the previous definition holds, then defining $E_i(h) = \frac{h_i}{\Vert h \Vert} E(h)$ satisfies this definition. \end{remark} \hypertarget{partial_and_directional_derivatives}{}\subsubsection*{{Partial and directional derivatives}}\label{partial_and_directional_derivatives} A weaker notion of differentiability is the following: \begin{defn} \label{DirectionalDerivative}\hypertarget{DirectionalDerivative}{} \textbf{([[partial derivative|directional derivative]])} Let $n \in \mathbb{N}$ and $U \subset \mathbb{R}^n$ an [[open subset]]. Then a [[function]] $f \colon U \longrightarrow \mathbb{R}$ is said to have \textbf{directional derivative} in the direction of $v \in \mathbb{R}^n$ at $x\in U$ if the [[limit of a sequence|limit]] \begin{displaymath} \lim_{h\to 0} \frac{f(x+h v)- f(x)}{h} \end{displaymath} exists. Here $h$ is just a real number. \end{defn} Historically, the term `directional derivative' was reserved for when $v$ is a [[unit vector]] (or divide the derivative above by $\|v\|$), but the general concept involves less structure and is more important but has no other established name. If $v$ is a standard basis vector $e_i$, then the directional derivative is called a \textbf{[[partial derivative]]} with respect to the corresponding coordinate, and often written $\frac{\partial f}{\partial x_i}$ or $f_{x_i}$. If $f$ is differentiable at $x$ in the sense of def. \ref{DerivativeOfFunctionFromRnToR}, then $d f_x(v)$ is its directional derivative along $v$. In particular, the coordinates of $d f_x$ are the partial derivatives of $f$. In general, $f$ may have all partial derivatives, and even all directional derivatives, without being differentiable; see the examples \hyperlink{DifferentiabilityOpposedToPartialDifferentiability}{below}. However, if $f$ has all partial derivatives and they are \emph{continuous} as functions of $x$, then in fact $f$ is differentiable (and indeed continuously differentiable). \hypertarget{functions_between_cartesian_spaces}{}\subsubsection*{{Functions between Cartesian spaces}}\label{functions_between_cartesian_spaces} \begin{defn} \label{FunctionBetweenCartesianSpacesDifferentiation}\hypertarget{FunctionBetweenCartesianSpacesDifferentiation}{} \textbf{(differentiation of functions between Cartesian spaces)} Let $n_1, n_2 \in \mathbb{N}$ and let $U\subseteq \mathbb{R}^{n_1}$ be an [[open subset]]. Then a [[function]] $f \;\colon\; U \longrightarrow \mathbb{R}^{n_2}$ is \emph{differentiable} if for all $i \in \{1, \cdots, n_2\}$ the component function \begin{displaymath} f_i \;\colon\; U \overset{f}{\longrightarrow} \mathbb{R}^{n_2} \overset{pr_u}{\longrightarrow} \mathbb{R} \end{displaymath} is differentiable in the sense of def. \ref{DerivativeOfFunctionFromRnToR}. In this case, the derivatives $d f_i \colon \mathbb{R}^n \to \mathbb{R}$ of the $f_i$ assemble into a linear map of the form \begin{displaymath} d f_x \;\colon\; \mathbb{R}^{n_1} \to \mathbb{R}^{n_2} \,. \end{displaymath} \end{defn} \hypertarget{functions_between_differentiable_manifolds}{}\subsubsection*{{Functions between differentiable manifolds}}\label{functions_between_differentiable_manifolds} \begin{defn} \label{}\hypertarget{}{} For $X$ and $Y$ [[differentiable manifolds]], then a [[function]] $f \colon X \longrightarrow Y$ is called \emph{differentiable} if for $\left\{ \mathbb{R}^{n} \underoverset{\simeq}{\phi_i}{\to} U_i \subset X\right\}$ an [[atlas]] for $X$ and $\left\{ \mathbb{R}^{n'} \underoverset{\simeq}{\psi_j}{\to} V_j \subset X_2\right\}$ and atlas for $Y$ then for all $i \in I$ and $j \in J$ the function \begin{displaymath} \mathbb{R}^n \supset \phantom{AA} (f\circ \phi_i)^{-1}(V_j) \overset{\phi_i}{\longrightarrow} f^{-1}(V_j) \overset{f}{\longrightarrow} V_j \overset{\psi_j^{-1}}{\longrightarrow} \mathbb{R}^{n'} \end{displaymath} is differentiable in the sense of def. \ref{FunctionBetweenCartesianSpacesDifferentiation}. \end{defn} \hypertarget{higher_differentiability}{}\subsection*{{Higher differentiability}}\label{higher_differentiability} \hypertarget{iterated_differentiability}{}\subsubsection*{{Iterated differentiability}}\label{iterated_differentiability} For $U \subset \mathbb{R}^n$ an [[open subset]] and $f \;\colon\; U\to \mathbb{R}^m$ a differentiable function (def. \ref{DerivativeOfFunctionFromRnToR}), we may regard its differential $d f$ as a function from a subset of $U$ (the points where $f$ is differentiable) to the space $L(\mathbb{R}^n,\mathbb{R}^m)$ of [[linear maps]]. Since $L(\mathbb{R}^n,\mathbb{R}^m) \cong \mathbb{R}^{n m}$ is again a Cartesian space, we may then ask whether $d f$ is differentiable. We can then iterate, obtaining the following hierarchy of differentiability. Because iterated differentiability by itself is not very useful, and a differentiable map is necessarily continuous, one generally includes continuity of the last assumed derivatives. \begin{itemize}% \item The map $f$ is \textbf{continuous} or \textbf{$C^0$} if it is a [[continuous map]] between underlying [[topological spaces]]. We begin with this since a differentiable map is necessarily continuous. \item The map $f$ is \textbf{continuously differentiable} or \textbf{$C^1$} on $U$ if it is differentiable at all points of $U$ and the resulting map $d f$ is [[continuous map|continuous]]. (At this point, if we generalize to infinite-dimensional spaces, we get a variety of notions of when the differential is `continuous'; see [[continuously differentiable map]] for discussion.) \item The map $f$ is \textbf{twice differentiable} if it is differentiable and its derivative $d f$ is differentiable. A twice differentiable map must be continuously differentiable. Similarly, $f$ is \textbf{twice continuously differentiable} or \textbf{$C^2$} if it is twice differentiable and the second derivative $d d f$ is continuous. \item By [[recursion]], $f$ is \textbf{$n + 1$ times differentiable} if $f$ is $n$ times differentiable and the $n$th derivative of $f$ is differentiable. Similarly, $f$ is \textbf{$n$ times continuously differentiable} or \textbf{$C^n$} if $f$ is $n$ times differentiable and the $n$th derivative of $f$ is continuous. \item The map $f$ is \textbf{[[smooth map|smooth]]} or \textbf{infinitely differentiable} or \textbf{$C^\infty$} if it is $n$ times differentiable for all $n$, or equivalently if it is $C^n$ for all $n$. (There is no difference between infinite differentiability and infinite continuous differentiability.) One may also define this notion [[coinductive definition|coinductively]]: $f$ is infinitely differentiable if it is differentiable and its derivative $d f$ is infinitely differentiable. \item One step higher, we may ask whether $f$ is [[analytic function|analytic]] or $C^\omega$. \end{itemize} \hypertarget{symmetry_of_higher_derivatives}{}\subsubsection*{{Symmetry of higher derivatives}}\label{symmetry_of_higher_derivatives} If $f:U\to \mathbb{R}^m$ is twice differentiable with $U\subseteq \mathbb{R}^n$, its second derivative \begin{displaymath} d(d f) : U \to L(\mathbb{R}^n,L(\mathbb{R}^n,\mathbb{R}^m)) \cong Bilin(\mathbb{R}^n,\mathbb{R}^n;\mathbb{R}^m) \end{displaymath} is a function from $U$ into the space of [[bilinear maps]] from $\mathbb{R}^n\times \mathbb{R}^n$ to $\mathbb{R}^m$. \begin{theorem} \label{}\hypertarget{}{} If $f:U\to \mathbb{R}^m$ is twice differentiable, then its second derivative $d(d f)$ lands in the space of \emph{symmetric} bilinear maps, i.e. for any $x\in U$ and $v,w\in \mathbb{R}^n$ we have \begin{displaymath} d(d f)_x(v,w) = d(d f)_x(w,v). \end{displaymath} \end{theorem} \begin{proof} It suffices to assume $m=1$; otherwise we just consider it componentwise. Define a function $g:\mathbb{R}\to \mathbb{R}$ by \begin{displaymath} g(\xi) = f(x+\xi v+w) - f(x+\xi v). \end{displaymath} Then by the chain rule, $g$ is differentiable and \begin{displaymath} \begin{aligned} g'(\xi) &= d f_{x+\xi v+w}(v) - d f_{x+\xi v}(v)\\ &= \Big(d f_{x+\xi v+w}(v) - d f_{x}(v)\Big) - \Big(d f_{x+\xi v}(v) - d f_x(v)\Big)\\ &= d(d f)_{x}(v,\xi v + w) + E_1 |v|\,|\xi v + w| - d(d f)_x(v,\xi v) - E_2 |v|\,|\xi v|\\ &= d(d f)_x(v,w) + E |v|\, (|v|+|w|) \end{aligned} \end{displaymath} where $E_1, E_2, E \to 0$ as $(v,w)\to 0$. Now the [[mean value theorem]] tells us that for some $\xi\in(0,1)$ we have \begin{displaymath} \begin{aligned} f(x+v+w) - f(x+v) - f(x+w) + f(x) &= g(1) - g(0)\\ &= g'(\xi)\\ &= d(d f)_x(v,w) + E (|v|+|w|)^2. \end{aligned} \end{displaymath} But the ``second-order difference'' $f(x+v+w) - f(x+v) - f(x+w) + f(x)$ is manifestly symmetric in $v$ and $w$, so we have \begin{displaymath} d(d f)_x(v,w) - d(d f)_x(w,v) = E (|v|+|w|)^2 \end{displaymath} where $\lim_{(v,w)\to 0} E = 0$. But bilinearity of the LHS then implies that it is identically zero. \end{proof} The components of the bilinear map $d(d f)$ are the second-order partial derivatives $\frac{\partial^2 f}{\partial x_i \partial x_j}$ of $f$. Thus, this theorem says that if $f$ is twice differentiable, then the \emph{mixed partials} are equal, \begin{displaymath} \frac{\partial^2 f}{\partial x_i \partial x_j} = \frac{\partial^2 f}{\partial x_j \partial x_i}. \end{displaymath} The second-order partial derivatives may \emph{exist} without the mixed partials being equal; see below for a counterexample. However, the theorem shows that if we require $f$ to actually be twice differentiable rather than merely having second-order partial derivatives, then this cannot happen. In particular, we have the following corollary, which is more commonly found in textbooks. \begin{cor} \label{}\hypertarget{}{} If $f$ has first and second-order partial derivatives, and the latter are continuous in a neighborhood of $x$, then the mixed partial derivatives are equal, \begin{displaymath} \frac{\partial^2 f}{\partial x_i \partial x_j} = \frac{\partial^2 f}{\partial x_j \partial x_i}. \end{displaymath} \end{cor} \begin{proof} Continuity of the second-order partials implies that the first-order partials are differentiable, and hence so is the differential $d f$. \end{proof} \hypertarget{a_direct_definition_of_the_second_derivative}{}\subsubsection*{{A direct definition of the second derivative}}\label{a_direct_definition_of_the_second_derivative} Note that the proof of the theorem implies that if $f$ is twice differentiable at $x$, then there exists a bilinear map $\partial^2 f_x : \mathbb{R}^n \times \mathbb{R}^n \to \mathbb{R}^m$ such that \begin{displaymath} f(x+v+w) - f(x+v) - f(x+w) + f(x) = \partial^2 f_x(v,w) + E(v,w) ({|v|+|w|})^2 \end{displaymath} where $\lim_{v,w\to 0} E(v,w) = 0$. This is a condition that makes sense as a condition on an arbitrary $f$ without assuming differentiability. and if it holds, then the bilinear map $\partial^2 f_x$ must be symmetric. Moreover, as explained \href{http://mathoverflow.net/a/165733/49}{here}, if $f$ is differentiable in a neighborhood of $x$ and satisfies this condition at $x$, then it is in fact twice differentiable at $x$. To see this, it suffices to show that each coordinate of $d f$ is differentiable, so let $w=\delta e_i$, with $e_i$ a unit basis vector and $\delta$ a real number $\neq 0$. Then we have \begin{displaymath} E(v,\delta e_i) = \frac{f(x+v+\delta e_i) - f(x+v) - f(x+\delta e_i) + f(x) - \partial^2 f_x(v,\delta w)}{{|v|}{\delta}} \end{displaymath} Taking the limit as $\delta\to 0$ and using differentiability of $f$ at $x$ and $x+v$ (for sufficiently small $v$), we get \begin{displaymath} \lim_{\delta \to 0} E(v,\delta e_i) = \frac{d f_{x+v}(e_i) - d f_x(e_i) - \partial^2 f_x(v,e_i)}{{|v|}}. \end{displaymath} Now take the limit as $v\to 0$; on the left we get $0$ by assumption, so the function $y\mapsto d f_y(e_i)$ is differentiable at $x$ with derivative $\partial^2 f_x(-,e_i)$. Thus, $d f$ is differentiable at $x$. On the other hand, this condition by itself does not even imply that $f$ is continuous. For instance, if $f$ is a $\mathbb{Q}$-linear map $\mathbb{R}\to \mathbb{R}$, then the second-order difference $f(x+v+w) - f(x+v) - f(x+w) + f(x)$ is identically zero. \hypertarget{higher_differentiability_on_tangent_spaces_and_the_chain_rule}{}\subsubsection*{{Higher differentiability on tangent spaces and the chain rule}}\label{higher_differentiability_on_tangent_spaces_and_the_chain_rule} Let $f:\mathbb{R}^n\to \mathbb{R}$ be differentiable. Instead of asking whether $d f : U \to L(\mathbb{R}^n,\mathbb{R})$ is differentiable, we can ask whether its exponential transpose $d f : U\times \mathbb{R}^n \to \mathbb{R}$ is differentiable. (Note that $U\times \mathbb{R}^n$ is the [[tangent bundle]] of $U\subseteq \mathbb{R}^n$.) This amounts to asking that for $x\in U$ and $v\in \mathbb{R}^n$, we have \begin{displaymath} d f_{x+w}(v+h) - d f_x(v) = d^2 f_{(x,v)}(w,h) + E(|w|+|h|) \end{displaymath} for a linear map $d^2 f_{(x,v)}:\mathbb{R}^{2n} \to \mathbb{R}$, where $\lim_{(w,h)\to 0} E = 0$. Setting $h=0$, we see that this implies that $d f : U \to L(\mathbb{R}^n,\mathbb{R})$ is differentiable, with differential $d(d f)_x = d^2 f_{(x,v)}(w,0)$ for any $v$. And setting $w=0$, we obtain $d f_x(h) = d^2 f_{(x,v)}(0,h)$ for any $v$. Thus, we can write \begin{displaymath} d^2 f_{(x,v)}(w,h) = \partial^2 f_x(v,w) + d f_x(h) \end{displaymath} where $\partial^2 f_x$ is the symmetric bilinear map from the previous section. Conversely, if $f$ is twice differentiable, then using linearity and continuity of $d f$ it is easy to see that the above condition holds. Therefore, these two kinds of twice-differentiability of $f$ are equivalent as \emph{conditions} on $f$, but the resulting \emph{second differential} is different. In the second case, we get \begin{displaymath} d^2f = \partial^2 f + d f = \sum_{i,j} \frac{\partial^2f}{\partial x_i \partial x_j} d x_i \, d x_j + \sum_i \frac{\partial f}{\partial x_i} d^2 x_i. \end{displaymath} rather than merely the first term $\sum_{i,j} \frac{\partial^2f}{\partial x_i \partial x_j} d x_i \, d x_j$. There are two advantages to the second approach (asking that $d f : U\times \mathbb{R}^n \to \mathbb{R}$ be differentiable). Firstly, we can reformulate it in terms of $f$ by asking that there exists a linear map $d f_x : \mathbb{R}^n \to \mathbb{R}^m$ and a bilinear map $\partial^2 f_x : \mathbb{R}^n \times \mathbb{R}^n \to \mathbb{R}^m$ such that \begin{displaymath} f(x+v+w+h) - f(x+v) - f(x+w) + f(x) = \partial^2 f_x(v,w) + d f_x(h) + E(v,w,h) \sqrt{{|v|}^2{|w|}^2 + {|h|}^2}. \end{displaymath} where $\lim_{v,w,h \to 0} E(v,w,h) = 0$. This holds if $f$ is twice differentiable, for then we can write \begin{displaymath} \begin{aligned} f(x+v+w+h) &= f(x+v+w) + d f_{x+v+w}(h) + E {|h|}\\ &= f(x+v+w) + d f_x(h) + d(d f)_x(v+w,h) + E {|v+w|}{|h|} + E{|h|} \end{aligned} \end{displaymath} and $d(d f)_x(v+w,h)$ can also be incorporated into the error term. Of course, setting $h=0$ we obtain the characterization of twice-differentiability from the previous section. But setting $v=w=0$, we find that $f$ is differentiable at $x$ with derivative $d f_x$. So here we have a direct characterization of the second derivative which also implies that the first derivative exists (although it seems that it doesn't imply differentiability in a neighborhood of $x$, so that the resulting ``second derivative'' may not actually be the derivative of the first derivative). Secondly, the virtue of a second differential incorporating the first derivatives is that like the first differential $d f$, but unlike the bilinear map $\partial^2 f$, it satisfies [[Cauchy's invariant rule]]. This means that we can express the [[chain rule]] for second differentials of composite maps simply by substitution: if $y = f(u)$ and $u = g(x)$, then finding $d^2 y$ in terms of $d u$ and $d^2 u$, and $d u$ and $d^2 u$ in terms of $d x$ and $d^2 x$, and substituting, gives the correct expression for $d^2 y$ in terms of $d x$ and $d^2 x$. In fact, this can be proven using the above direct characterization of the second differential, in essentially exactly the same way that we prove the ordinary chain rule for first derivatives. We sketch the proof, omitting the explicit error terms. We can write \begin{displaymath} g(f(x+v+w+h)) - g(f(x+v)) - g(f(x+w)) + g(f(x)) \end{displaymath} as \begin{displaymath} g(f(x) + v' + w' + h') - g(f(x) + v') - g(f(x) + w') + g(f(x)) \end{displaymath} where $v' = f(x+v) - f(x)$ and $w' = f(x+w) - f(x)$ and $h' = f(x+v+w+h) - f(x+v) - f(x+w) + f(x)$. Now by extra-strong twice differentiability of $g$, this is approximately equal to \begin{displaymath} \partial^2 g_{f(x)}(v',w') + d g_{f(x)}(h'). \end{displaymath} But by differentiability of $f$, we have $v' \approx d f_x(v)$ and $w' \approx d f_x(w)$, while by extra-strong twice differentiability of $f$ we have $h' \approx \partial^2 f_x(v,w) + d f_x(h)$. Thus, we obtain approximately \begin{displaymath} \partial^2 g_{f(x)}(d f_x(v), d f_x(w)) + d g_{f(x)}(\partial^2 f_x(v,w) + d f_x(h)) \end{displaymath} which is exactly what we would get by substitution. \hypertarget{for_maps_between_manifolds}{}\subsubsection*{{For maps between manifolds}}\label{for_maps_between_manifolds} If $X$ and $Y$ are $C^k$-[[differentiable manifolds]], then we may define what it means for a map $f:X\to Y$ to be $n$ times differentiable, or $C^n$, for any $n\le k$, by asking that it yield such a map when restricted to any charts. The most common case is when $X$ and $Y$ are smooth (infinitely differentiable) manifolds, so that we can define $C^n$ functions between them for all $n\le \infty$. (Analytic manifolds, which are necessary in order to define analyticity of $f$, are somewhat rarer.) A differentiable map between manifolds induces a map between their [[tangent bundles]] $d f : T X \to T Y$; this operation extends to a [[functor]] from $C^{k+1}$ manifolds and $C^{k+1}$ maps to $C^k$ manifolds and $C^k$ maps. See [[differentiation]] for more. \hypertarget{examples_and_nonexamples}{}\subsection*{{Examples and non-examples}}\label{examples_and_nonexamples} \hypertarget{DifferentiabilityOpposedToPartialDifferentiability}{}\subsubsection*{{Differentiability versus partial differentiability}}\label{DifferentiabilityOpposedToPartialDifferentiability} The function $f:\mathbb{R}^2 \to \mathbb{R}$ defined by \begin{displaymath} f(x,y) = \begin{cases} \frac{y^3}{x^2+y^2} &\quad (x,y) \neq (0,0)\\ 0 &\quad (x,y) = (0,0) \end{cases} \end{displaymath} is continuous everywhere, and has directional derivatives (def. \ref{DirectionalDerivative}) at $(0,0)$ in all directions, but is not differentiable at $(0,0)$ in the sense of def. \ref{DerivativeOfFunctionFromRnToR}. Note that the directional derivative along the line $y=m x$ is $\frac{m^3}{1+m^2}$, which is not a linear function. One may wonder whether existence of a linear map $d f_x$ is enough, but this is also not the case. The function $f:\mathbb{R}^2 \to \mathbb{R}$ defined by \begin{displaymath} f(x,y) = \begin{cases} \frac{y^3}{x} &\quad x\neq 0\\ 0 &\quad x=0 \end{cases} \end{displaymath} has all directional derivatives at $(0,0)$ equaling $0$, so that in particular there is a linear map $d f_{(0,0)}$ whose values are the directional derivatives. But it is not differentiable at $(0,0)$; in fact, it is not even continuous at $(0,0)$. (Thus it also provides an example of a discontinuous function which has all directional derivatives.) [[Mike Shulman]]: Is there a function that is continuous in a neighborhood of $(0,0)$ \emph{and} has all directional derivatives there equaling $0$, but is not differentiable? Chris Brown: If $f:\mathbb{R} \to \mathbb{R}$ is continuous everywhere and differentiable nowhere, then $\hat{f}:\mathbb{R}^{2} \to \mathbb{R}$ that sends $(r, \theta)$ to $r^{2} f(\theta)$ is continuous everywhere, has all directional derivatives at $(0,0)$ equaling $0$, but is differentiable on no open set, and so is not differentiable at $(0,0)$. \hypertarget{differentiability_versus_continuous_and_higher_differentiability}{}\subsubsection*{{Differentiability versus continuous and higher differentiability}}\label{differentiability_versus_continuous_and_higher_differentiability} Let $k$ be a [[natural number]], and consider the function \begin{displaymath} f_k(x) \coloneqq x^k \sin(1/x) \end{displaymath} from the [[real line]] to itself, with $f(0) \coloneqq 0$. Away from $0$, $f_k$ is smooth (even analytic); but at $0$, $f_0$ is not continuous, $f_1$ is continuous but not differentiable, $f_2$ is differentiable but not continuously differentiable, and so on: \begin{itemize}% \item If $k = 2 n$ is even, then $f_k$ is differentiable $n$ times but not continuously differentiable $n$ times; \item If $k = 2 n + 1$ is odd, then $f_k$ is continuously differentiable $n$ times but not differentiable $n + 1$ times. \end{itemize} Similarly, in two dimensions we can consider functions such as \begin{displaymath} f(x,y) = (x^2+y^2)\sin(\frac{1}{\sqrt{x^2+y^2}}). \end{displaymath} together with $f(0,0) = 0$. This is smooth away from $0$, and once differentiable at $0$, even in the strong sense that it is well-approximated by a linear function near $0$. However, its derivative is not continuous at $0$. In particular, this shows that the converse of the theorem ``if the partial derivatives exist and are continuous at a point, then the function is differentiable there'' fails, even in higher dimensions. \hypertarget{symmetry_of_the_second_partial_derivatives}{}\subsubsection*{{Symmetry of the second partial derivatives}}\label{symmetry_of_the_second_partial_derivatives} The function $f:\mathbb{R}^2 \to \mathbb{R}$ defined by \begin{displaymath} f(x,y) = \frac{x y (x^2-y^2)}{x^2+y^2} \end{displaymath} plus $f(0,0) = 0$, has partial derivatives $\frac{\partial^2f}{\partial x \partial y}$ and $\frac{\partial^2f}{\partial y \partial x}$ that both exist but are not equal at $(0,0)$ (nor are they continuous at $(0,0)$). Therefore, by the theorem proven above, it is not twice differentiable at $(0,0)$. \hypertarget{twice_differentiability_versus_quadratic_approximation}{}\subsubsection*{{Twice differentiability versus quadratic approximation}}\label{twice_differentiability_versus_quadratic_approximation} While differentiability means approximability by a linear function, twice differentiability does \emph{not} mean approximability by a quadratic function. For example, the function \begin{displaymath} f(x) = x^3 \sin(1/x) \end{displaymath} (with $f(0) =0$, to make it continuous there) is not twice differentiable at $x=0$, but it is well-approximated by the quadratic polynomial $p(x) = 0$ in the sense that their difference is $o(x^2)$ as $x\to 0$. Even worse, the function \begin{displaymath} f(x) = e^{-1/x^2} \sin(e^{1/x^2}) \end{displaymath} is not twice differentiable at $x=0$, but it is well-approximated by a polynomial of \emph{any} finite degree $n$ (namely, the zero polynomial), in the sense that their difference is $o(x^n)$ as $x\to 0$. In some contexts, it is useful to say that functions such as these have ``pointwise second derivatives''. More precisely, we say that a function $f$ has a \textbf{pointwise $k^{th}$ derivative} at $a$ if it is continuous at $a$ and there exists a polynomial $p$ of degree $k$ such that \begin{displaymath} \lim_{x\to a} \frac{f(x) - p(x)}{(x-a)^k} = 0. \end{displaymath} (We have to state continuity explicitly in order to match the usual notion of differentiability when $k = 1$, since nothing in this limit constrains the value of $f(a)$.) In this case, the pointwise $k^{th}$ derivative is $f^{(k)}_{pt}(a) = p^{(k)}(a)$ (and it follows that all lower-order pointwise derivatives match as well). Thus we would say that while $f(x) = x^3 \sin(1/x)$ does not have a second derivative at $0$, it does have a \emph{pointwise} second derivative at $0$, and $f_{pt}''(0) = 0$. Similarly, $e^{-1/x^2} \sin(e^{1/x^2})$ is pointwise smooth. See e.g. \href{http://math.stackexchange.com/a/160383/91608}{this MSE answer}. The polynomial $p$ may be thought of as the $k$th-order [[Taylor polynomial]] of $f$ at $a$, and the limit above is Taylor's theorem with the Peano remainder. (Thus the subscript $pt$ can be thought of as standing for `Peano--Taylor' as well as for `pointwise'.) Note that while $k$-times pointwise differentiability is weaker than $k$-times differentiability for $k \gt 1$ and equivalent for $k = 1$, it is stronger for $k = 0$ (since even $0$-times pointwise differentiability requires continuity). \hypertarget{the_second_derivative_as_a_quadratic_form}{}\subsubsection*{{The second derivative as a quadratic form}}\label{the_second_derivative_as_a_quadratic_form} In the definition of strong twice-differentiability, we cannot replace the symmetric [[bilinear map]] $\partial^2 f_x(v,w)$ by the corresponding [[quadratic form]] $Q_x(v) = \partial^2f_x(v,v)$. In other words, if we suppose that \begin{displaymath} f(x+2v) - 2 f(x+v) + f(x) = Q_x(v) + E(v) {|v|}^2 \end{displaymath} where $\lim_{v\to 0} E(v) = 0$, for some quadratic form $Q_x$, it does not follow that $f$ is twice differentiable at $x$, even in one dimension. The same old counterexample \begin{displaymath} f(x) = x^3 \sin(1/x) \end{displaymath} (with $f(0)=0$) works: we have \begin{displaymath} f(0+2v) - 2 f(0+v) + f(0)= 2v^3(4\sin(\frac{1}{2v}) - \sin(\frac{1}{v})) \end{displaymath} so $E(v) = v (4\sin(\frac{1}{2v}) - \sin(\frac{1}{v})) \to 0$. \hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts} \begin{itemize}% \item [[extremum]] \item [[chain rule]] [[total derivative]] \item [[continuous function]], \textbf{differentiable function}, [[continuously differentiable function]], [[smooth function]], [[analytic function]] \item [[derivative of distributions]] \item [[continuous function]], [[differentiable function]], [[smooth function]] \item [[integrable function]], [[square-integrable function]] \item [[bounded function]] \item [[compactly supported function]] \item [[measurable function]] \item [[rapidly decreasing function]] \end{itemize} [[!redirects differentiable map]] [[!redirects differentiable maps]] [[!redirects differentiable function]] [[!redirects differentiable functions]] [[!redirects twice differentiable map]] [[!redirects twice differentiable maps]] [[!redirects twice differentiable function]] [[!redirects twice differentiable functions]] [[!redirects C-n map]] [[!redirects C-n maps]] [[!redirects C-n function]] [[!redirects C-n functions]] [[!redirects C{\tt \symbol{94}}n map]] [[!redirects C{\tt \symbol{94}}n maps]] [[!redirects C{\tt \symbol{94}}n function]] [[!redirects C{\tt \symbol{94}}n functions]] [[!redirects C-k map]] [[!redirects C-k maps]] [[!redirects C-k function]] [[!redirects C-k functions]] [[!redirects C{\tt \symbol{94}}k map]] [[!redirects C{\tt \symbol{94}}k maps]] [[!redirects C{\tt \symbol{94}}k function]] [[!redirects C{\tt \symbol{94}}k functions]] [[!redirects differentiability]] \end{document}