I asked this Question on Math.StackExchange without success. Then I learned, that this might be the better place to ask. So, sorry for crossposting. I would agree on deleting my old question.
Let $\mathbb R_0^+:=\{x\in\mathbb R\mid x\geq 0\}$. Further let $f:\mathbb R_0^+\rightarrow \mathbb R_0^+$ and $g:\mathbb R_0^+\rightarrow \mathbb R_0^+$ two strictly increasing continuous functions (this can be weakened if necessary).
Is there anything that can be said about which of the functions $f\circ g$ and $g\circ f$ grows asymptotically faster (in some sense) with only assuming something about the asymptotic growth behavior of $g$ and $f$?
I want to discuss this in a very general context. So I am open for all kinds of useful definitions of "grows faster" and "growth behavior". E.g. one can consider the usual $\mathcal O$-notation and ask for whether
$$ f\circ g\in\Omega(g\circ f)$$
whenever $f\in\Omega (g)$ or $g\in\Omega(f)$. But neither seems to hold in general. For example, conider $$f(x)=\log(x)\quad\text{and}\quad g(x)=x^\alpha.$$ Which of $f\circ g$ and $g\circ f$ grows faster depends on $\alpha$, while $g\in\Omega(f)$ regardless of $\alpha$. Also possible: we can call $f$ growing faster than $g$ if $f(x)>g(x)$ for all sufficiently large $x$.
I was not abled to proof anything remotely useful for the connection between the "growth" of $f$ and $g$ and the connection between the "growth" of $f\circ g$ and $g\circ f$. So this is a soft question because I hope for input from no specific branch of math.
Further useful assumptions might be
- $f$ and $g$ are convex functions.
- $f(x)>x$ and $g(x)>x$.
I tried to prove
If $f>g^n$ for all $n\in\mathbb N$ ($g^n$ means $g$ iterated $n$ times), it holds $g\circ f< f\circ g$.
For example, use $g(x)=x^2$ and $f=\exp$. I have not succeeded for any definition of growth so far but it seems plausible to me, at least for convex functions $f$ and $g$ strictly greater than identity.