3
$\begingroup$

Let $X,Y,Z$ be Banach spaces, $f:X\to Y,g: Y\to Z$ be two functions of class $C^k$, which means that $f^{(k)}(x)$ exists as a $k$-linear form $\mathcal B^k(X;Y)$ and similarly for $g^{(k)}$.

Is the a Faà di Bruno-like formula for computing the $k$-linear form $(g\circ f)^{(k)}(x)\in \mathcal B^k(X;Z)$?

The usual Faà di Bruno's formula already looks horrible enough for real-valued $f,g$. I can't imagine how complicated its Banach-valued would be but I am sure someone must have thought about it. If anyone know where I can look for such a formula I would be very grateful.

Alternatively, I would be satisfied with a proof of the following statement:

For $f\in C^k(X;Y)$ and $g\in C^k(Y;Z)$, it is the case that $g\circ f\in C^k(X;Z)$.

It would be a direct consequence of the Banach version of Faà di Bruno's formula (if there is one, which I'm quite sure there is). The statement seems simple enough and I tried proving it using induction. However, applying chain rule twice in the case $k=2$ already looks horrible and I'm not sure what's the correct way to prove it. Maybe I should do an induction on some tree-like structures but I'm not sure of the details.

$\endgroup$
5
  • $\begingroup$ arxiv.org/pdf/1202.0264.pdf $\endgroup$ Commented May 15, 2020 at 18:02
  • $\begingroup$ @MattSamuel Very interesting, thank you so much! I skimmed through it and it seems like the article deals mostly with Gateaux derivative while I'm mostly interested in Frechet derivative. Perhaps it's also in there but I'll have a closer look later as it's really late now where I live. $\endgroup$
    – BigbearZzz
    Commented May 15, 2020 at 18:14
  • $\begingroup$ I'm guessing you could find something similar for the Frechet derivative with a Google search. $\endgroup$ Commented May 15, 2020 at 18:19
  • $\begingroup$ Now that I tried googling again it actually provided some interesting result. I could swear I almost found nothing at first, hence this question. Maybe I used bad keywords. Anyway, thank you for the suggestion. $\endgroup$
    – BigbearZzz
    Commented May 15, 2020 at 18:24
  • $\begingroup$ In case anyone stumble upon this question in the future, there's an equivalent question with the formula I was looking for here: mathoverflow.net/questions/106323/… $\endgroup$
    – BigbearZzz
    Commented May 16, 2020 at 4:42

1 Answer 1

2
$\begingroup$

The proof of your second statement is actually pretty easy using induction. The base case $k=0$ is true based on elementary arguments. Now, suppose inductively that the result is true for any $k \geq 0$. We'll show it's true for $k+1$. Note that by the chain rule, \begin{align} D(g \circ f)_x &= (Dg)_{f(x)} \circ Df_x. \end{align} Now, the following three maps: \begin{align} \begin{cases} K:\mathcal{B}(Y;Z) \times \mathcal{B}(X;Y) \to \mathcal{B}(X;Z) \qquad &(T,S) \mapsto T \circ S \\\\ \iota_1:\mathcal{B}(Y;Z) \to \mathcal{B}(Y;Z) \times \mathcal{B}(X;Y) \qquad &T \mapsto(T,0) \\\\ \iota_2:\mathcal{B}(X;Y) \to \mathcal{B}(Y;Z) \times \mathcal{B}(X;Y) \qquad &T \mapsto(0,T) \end{cases} \end{align} $K$ is the "composition map", and $\iota_1, \iota_2$ are the "canonical inclusions." Note that $K$ is a continuous bilinear map, and hence $C^{\infty}$ (the third derivative vanishes identically), and $\iota_1, \iota_2$ are continuous linear maps, and hence $C^{\infty}$ (their second derivatives vanish). With this, we can write: \begin{align} D(g \circ f)_x &= K\left( Dg_{f(x)}, Df_x\right) \\ &= K\bigg( [\iota_1 \circ (Dg) \circ f](x) + [\iota_2 \circ Df](x)\bigg) \\ &= \bigg[K \circ \left(\iota_1 \circ (Dg) \circ f + \iota_2 \circ Df \right) \bigg](x) \end{align} Or as an equality of functions, we can write: \begin{align} D(g \circ f) &= K \circ \bigg( \iota_1 \circ (Dg) \circ f + \iota_2 \circ Df\bigg) \tag{$*$} \end{align} By the induction hypothesis, $f$ and $g$ are $C^{k+1}$, so $Df, Dg$ are $C^k$. As explained above, the maps $K, \iota_1, \iota_2$ are all $C^{\infty}$. Thus, in $(*)$, we have expressed $D(g \circ f)$ as a sum and composition of functions all of which are atleast $C^k$. By induction hypothesis, it follows that $D(g \circ f)$ is $C^k$, but this means exactly that $g \circ f$ is $C^{k+1}$. Hence, the induction is completed.


Very often, to show smoothness of maps between Banach spaces the quickest way is to define such auxillary maps, defined on a larger space, which we already know to be smooth. Then, after some practice, it becomes unnecessary to explicitly introduce them, and you can just "see" for example directly from the equation $D(g \circ f)_x = Dg_{f(x)} \circ Df_x$ that the RHS is smooth "as a function of $x$".

For example, in a Banach algebra $A$ (such as $\mathcal{B}(X,Y)$ with "multiplication" being composition of linear maps), let $U$ be the open set of all invertible elements of the algebra $A$ (the fact that this set is open shouldn't be too hard to prove). Consider the inversion mapping $\psi: U \to U$, $\psi(a) = a^{-1}$. By a direct "difference-estimate", one can show that $\psi$ is differentiable on $U$, with derivative given by \begin{align} D \psi_a(h) &= -a^{-1}\cdot h \cdot a^{-1} \\ &= - \psi(a) \cdot h \cdot \psi(a). \end{align} Notice that this is a type of "differential equation" for the function $\psi$ (we have the derivative on the LHS and the function on the RHS). By similar trickery in the induction process, one can prove that $\psi$ is actually $C^{\infty}$.

$\endgroup$
2
  • $\begingroup$ Looks pretty good, thanks! I tried using induction to get a general formula but this indeed seems better for proving the smoothness. $\endgroup$
    – BigbearZzz
    Commented May 16, 2020 at 3:15
  • $\begingroup$ Your remark is also very interestingly related to what I was doing. I actually tried to derive the formula for the higher derivatives of $\psi$ but I succeeded because it has simpler structure. Your trick would have saved me some time if I only want to prove smoothness. math.stackexchange.com/questions/3660523/… $\endgroup$
    – BigbearZzz
    Commented May 16, 2020 at 4:05

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .