9
$\begingroup$

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.

$\endgroup$
2
  • 2
    $\begingroup$ Are you principally interested in functions that can be built out of polynomials, exp, log, by closing under arithmetic operations and composition? There is a rich literature on Hardy fields, of which the class of functions just described is a special case, which might be useful here. This is not a specialty of mine, but Symbolic Asymptotics by John Shackell might be worth perusing for techniques: books.google.com/books/about/… $\endgroup$
    – Todd Trimble
    Apr 24, 2017 at 0:25
  • 1
    $\begingroup$ If $g$ satisfies $g(x)>x$ for all $x$, I would introduce a function $h$ such that $h$ is increasing and $h(g(x))=h(x)+1$. That is, $h(x)$ counts how many times you have to apply $g$ to 0 to get to $x$. Now if you conjugate by $h$, $g$ becomes increasing by 1 and your question is whether $\tilde f(x+1)-\tilde f(x)$ is greater than 1, where $\tilde f$ is the conjugated version of $f$. Probably if $g$ belongs to a Hardy field (as per @ToddTrimble's comment), then the field can be extended to contain $h$ also. $\endgroup$ Apr 24, 2017 at 13:16

2 Answers 2

2
$\begingroup$

Suppose that $g$ satisfies $g(x)>x$ for all $x$, and also that $f$ and $g$ lie in a Hardy field, as suggested by Todd Trimble. (A Hardy Field, called an order of infinity by Hardy is a collection of germs of differentiable functions at $\infty$ that is closed under differentiation and composition, as well as the field operations. In particular, this means that for any Hardy field, $H$, and any $f\ne g\in H$, $f-g\in H\setminus\{0\}$, so that $1/(f-g)\in H$. In particular, $f-g$ is eventually positive, or eventually negative. That is, there is a total ordering on a Hardy field.)

Then I believe there is an extension Hardy field containing $f$, $g$ and a function, $h$ satisfying $h(g(x))=h(x)+1$. That is, $h(x)$ counts how many times you have to apply $g$ to 0 to get to $x$ (think of $\log^* x$).

Assuming the existence of such a Hardy field, there is now an affirmative answer to your question. If you conjugate $g$ by $h$, you obtain $\tilde g:=h\circ g\circ h^{-1}$ is $\tilde g(x)=x+1$. Conjugating $f$ by $h$ also to obtain $\tilde f$, your question is equivalent to asking whether $\tilde f(\tilde g(x))>\tilde g(\tilde f(x))$. That is, whether $\tilde f(x+1)>\tilde f(x)+1$. Notice that both $\tilde f$ and $\tilde g$ belong to the Hardy field.

The condition that $f>g^n$ for all $n$ means that $\tilde f(x)>x+n$ for large $x$, that is $\tilde f(x)-x\to\infty$. In a Hardy field, any function satisfying this satisfies $\tilde f'(x)>1$ for all large $x$. By the mean value theorem, this implies that $\tilde f(x+1)>\tilde f(x)+1$, as required.

$\endgroup$
0
-2
$\begingroup$

You might get clarity by studying the case where f and g are sufficiently differentiable, perhaps $C^1$.

In this realm, you are interested in which grows faster at a point or in an interval, $f \circ g$ or $g \circ f$. The $C^1$ assumption along with both functions strictly increasing lets us use the chain rule. Doing the computation and some rearranging brings us to asking which is larger: $f'(g(x))/g'(f(x))$ or $f'(x)/g'(x)$? Thus, the answer depends not just on how $f$ and $g$ are changing at $x$, but how they are changing at other places as well. Unless you have a lot of info on the intervals around the values $f(x)$ and $g(x)$ of how $g$ and $f$ behave, there isn't much you can say. I think your best bet is to restrict $f$ and $g$ to a narrow family of functions and study your problem there.

Gerhard "Left Uncomposed By Considering Composition" Paseman, 2017.04.23.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.