Math overflow question on fractional exponential iterations
#3
It seems upsetting that the only tetrations that could satisfy this are non-analytic. I'm not prone to believe this, only because it doesn't look nice...

I'm wondering if we can look at it the following way

\( \exp_b^{d}(x) = \exp_b^{c}(\exp_b^{\delta}(x)) \)

Then the question boils into whether, for all \( \delta, \delta' >0 \) then

\( \exp^c_{b+\delta}(x) = o(\exp_b^{c+\delta'}(x)) \)

I think we can show this is true when \( c \in \mathbb{N} \). By induction, first, for \( c = 0 \) the induction step is obvious. Namely \( x = o (\exp_b^{\delta'}(x)) \). Suppose the result holds for \( c = n \) then (taking \( < \) to mean asymptotically less than):

\( \exp_{b+\delta}^{n+1}(x) =\exp^{n}_{b+\delta}(\exp_{b+\delta}(x))<\exp_{b}^{n+\delta'/2}(\exp_{b+\delta}(x)) < \exp_{b}^{n+\delta'/2}(\exp_b^{1+\delta'/2}(x)) = \exp_b^{n+\delta'+1}(x) \)

Sadly, I can't think of anyway to generalize this to non-integral \( c \)....

I'm thinking, a nice way to look at it from here is to look at root functions of the \( \exp \) function. But then we'd need an implication \( f^{\circ n}(x) = o(g^{\circ n}(x)) \Rightarrow f(x) = o(g(x)) \), which looks like it could be true for monotonically growing unbounded functions. But that's probably too easy, we'd probably need a nice condition on the root functions for that to be true.


EDIT:

It appears I made a fruitful mistake in the above proof. The base induction step would have to be (1) \( \exp_{b+\delta}(x) < \exp_b^{1+\delta'}(x) \), not the obvious one \( x < \exp^{\delta'}(x) \). This is the base step I should have used. The proof then says if this base step (1) holds the result holds for all natural \( c \), namely \( \exp_{b+\delta}^n(x) < \exp_b^{n+\delta'}(x) \). And I think with some finesse we can show that this implies it's true for root functions of \( \exp_b \), which should leave for a proof where \( c \in \mathbb{Q} \). Then perhaps a density argument may work on non rational \( c \). I'll work on this more later, but I think maybe we can reduce this entire problem into the condition that if for all \( \delta,\delta'>0 \) we have \( \exp_{b+\delta}(x) < \exp_b^{1+\delta'}(x) \) then it follows that \( \exp_{b+\delta}^c(x) < \exp_b^{c+\delta'}(x) \).

...We'll probably have to assume that \( \exp_b^c(x) \) is monotone non-decreasing in \( x \) and unbounded, or at least, eventually monotone non-decreasing.
Reply


Messages In This Thread
RE: Math overflow question on fractional exponential iterations - by JmsNxn - 03/30/2018, 07:37 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  [note dump] Iterations and Actions MphLee 24 31,975 46 minutes ago
Last Post: MphLee
  [Question] Classifying dynamical system by connected components MphLee 6 7,988 10/22/2025, 11:53 AM
Last Post: MphLee
  Fractional tetration method Koha 2 6,053 06/05/2025, 01:40 AM
Last Post: Pentalogue
  A question about tetration from a newbie TetrationSheep 2 6,268 08/26/2024, 12:38 PM
Last Post: TetrationSheep
  Is there any ways to compute iterations of a oscillating function ? Shanghai46 3 7,829 10/15/2023, 11:21 PM
Last Post: tommy1729
  ChatGPT checks in on fractional iteration. Daniel 0 3,442 05/17/2023, 01:48 PM
Last Post: Daniel
  Question about the properties of iterated functions Shanghai46 9 11,359 04/21/2023, 09:07 PM
Last Post: Shanghai46
  Bridging fractional iteration and fractional calculus Daniel 8 9,206 04/02/2023, 02:16 AM
Last Post: JmsNxn
  Fractional Integration Caleb 11 13,945 02/10/2023, 03:49 AM
Last Post: JmsNxn
  digit extracting iterations tommy1729 0 2,430 02/05/2023, 11:08 PM
Last Post: tommy1729



Users browsing this thread: 1 Guest(s)