I am a graduate student and I've been thinking about this fun but frustrating problem for some time. Let $d = \frac{d}{dx}$, and let $f \in C^{\infty}(\mathbb{R})$ be such that for every real $x$, $$g(x) := \lim\_{n \to \infty} d^n f(x)$$ converges. A simple example for such an $f$ would be $ce^x + h(x)$ for any constant $c$ where $h(x)$ converges to $0$ everywhere under this iteration (in fact my hunch is that every such $f$ is of this form), eg. $h(x) = e^{x/2}$ or simply a polynomial, of course.


I've been trying to show that $g$ is, in fact, differentiable, and thus is a fixed point of $d$. Whether this is true would provide many interesting properties from a dynamical systems point of view if one can generalize to arbitrary smooth linear differential operators, although they might be too good to be true.


Perhaps this is a known result? If so I would greatly appreciate a reference. If not, and this has a trivial counterexample I've missed, please let me know. Otherwise, I've been dealing with some tricky double limit using tricks such as in [this MSE answer](https://math.stackexchange.com/a/15257/354855), to no avail.


Any help is kindly appreciated.


$\textbf{EDIT}$: Here is a discussion of some nice consequences know that we now the answer is positive, which I hope can be generalized.


Let $A$ be the set of fixed points of $d$ (in this case, just multiples of $e^x$ as we know), let $B$ be the set of functions that converge everywhere to zero under the above iteration. Let $C$ be the set of functions that converges to a smooth function with the above iteration. Then we have the following:


$C$ = $A + B = \{ g + h : g\in A, h \in B \}$.


Proof: Let $f \in C$. Let $g$ be what $d^n f$ converges to. Let $h = f-g$. Clearly $d^n h$ converges to $0$ since $g$ is fixed. Then we get $f = g+h$.


Now take any $g\in A$ and $h \in B$, and set $f = g+h$. Since $d^n h$ converges to $0$ and $g$ is fixed, $d^n f$ converges to $g$, and we are done.


Next, here I'm assuming the result of this thread holds for a general (possibly elliptic) smooth linear differential operator $d : C^\infty (\mathbb{R}) \to C^\infty (\mathbb{R}) $. A first note is that fixed points of one differential operator correspond to solutions of another, i.e. of a homogeneous PDE. Explicitly, if $d\_1 g = g$, then setting $d\_2 = d\_1 - Id$, we get $d\_2 g = 0$. This much is simple.


So given $d$, finding $A$ from above amounts to finding the space of solutions of a PDE. I'm hoping that one can use techniques from dynamical systems to find the set $C$ and thus get $A$ after the iterations. But I'm approaching this naively and I do not know the difficulty or complexity of such an affair.


One thing to note is that once we find some $g \in A$, we can set $h(x) = g(\varepsilon x)$ for small $\varepsilon$ and $h \in B$. Conversely, given $h \in B$, I'm wondering what happens when set set $f(x) = h(x/\varepsilon)$, and vary $\varepsilon$. It might not coincide with a fixed point of $d$, but could very well coincide with a fixed point of the new operator $d^k$ for some $k$. For example, take $h(x) = cos(x/2)$. The iteration converges to 0 everywhere, and multiplying the interior variable by $2$ we do NOT get a fixed point of $d = \frac{d}{dx}$ but we do for $d^4$.


I'll leave it at this, let me know again if there is anything glaringly wrong I missed.



Does iterating the derivative infinitely many times give a smooth function whenever it converges?
I was able to adapt [the accepted answer](https://mathoverflow.net/questions/34059/if-f-is-infinitely-differentiable-then-f-coincides-with-a-polynomial/34067#34067) to [this MathOverflow post](https://mathoverflow.net/questions/34059/if-f-is-infinitely-differentiable-then-f-coincides-with-a-polynomial) to positively answer the question. The point is that one can squeeze more out of Petrov's Baire category argument if one applies it to the "singular set" of the function, rather than to an interval.


The key step is to establish



> 
> **Theorem 1**. Let $f \in C^\infty({\bf R})$ be such that the quantity $M(x) := \sup\_{m \geq 0} |f^{(m)}(x)|$ is finite for all $x$. Then $f$ is the restriction to ${\bf R}$ of an entire function (or equivalently, $f$ is real analytic with an infinite radius of convergence).
> 
> 
> 


**Proof**. Suppose this is not the case. Let $X$ denote the set of real numbers $x$ for which there does not exist any entire function that agrees with $f$ on a neighbourhood of $x$ (this is the "entire-singular set" of $f$). Then $X$ is non-empty (by analytic continuation) and closed. Next, let $S\_n$ denote the set of all $x$ such that $M(x) \leq n$ for all $m$. As $M$ is lower semicontinuous, the $S\_n$ are closed, and by hypothesis one has $\bigcup\_{n=1}^\infty S\_n = {\bf R}$. Hence, by the Baire category theorem applied to the complete non-empty metric space $X$, one of the sets $S\_n \cap X$ contains a non-empty set $(a,b) \cap X$ for some $a < b$.


Now let $(c,e)$ be a maximal interval in the open set $(a,b) \backslash X$, then (by analytic continuation) $f$ agrees with an entire function on $(c,e)$, and hence on $[c,e]$ by smoothness. On the other hand, at least one endpoint, say $c$, lies in $S\_n$, thus
$$ |f^{(m)}(c)| \leq n$$
for all $m$. By Taylor expansion of the entire function, we then have
$$ |f^{(m)}(x)| \leq \sum\_{j=0}^\infty \frac{|f^{(m+j)}(c)|}{j!} |x-c|^j$$
$$ \leq \sum\_{j=0}^\infty \frac{n}{j!} (b-a)^j$$
$$ \leq n \exp(b-a)$$
for all $m$ and $x \in [c,e]$. Letting $(c,e)$ and $m$ vary, we conclude that the bound
$$ M(x) \leq n \exp(b-a)$$
holds for all $x \in (a,b) \backslash X$. Since $(a,b) \cap X$ is contained in $S\_n$, these bounds also hold on $(a,b) \cap X$, hence they hold on all of $(a,b)$. Now from Taylor's theorem with remainder we see that $f$ agrees on $(a,b)$ with an entire function (the Taylor expansion of $f$ around any point in $(a,b)$), and so $(a,b) \cap X$ is empty, giving the required contradiction. $\Box$


The function $f$ in the OP question obeys the hypotheses of Theorem 1. By Taylor expansion applied to the entire function that $f$ agrees with, and performing the same calculation used to prove the above theorem, we obtain the bounds
$$ M(x) = \sup\_{m \geq 0} |f^{(m)}(x)| \leq M(0) \exp(|x|)$$
for all $x \in {\bf R}$. We now have locally uniform bounds on all of the $f^{(m)}$ and the argument given by username (or the variant given in Pinelis's comment to that argument) applies to conclude.


