Hey folks,
the conjecture about the equality of the 3 methods of tetration is shattered.
I received an e-mail of Dan Asimov where he mentions that the continuous iterations of
at the lower and upper real fixed points,
, differ! He, Dean Hickerson and Richard Schroeppel found this arround 1991, however there is no paper about it.
The numerical computations veiled this fact because the differences are in the order of
. I reverified this by setting the computation exactness to 100 decimal digits and using the recurrence formula described here:
, where
is the fixed point of
and
and
.
Currently (running since a day) there is a computation in progress where I compute the differences over the interval
with exactness of 150 (and internally to 450) decimal digits (lets have a look whether it finishes in my life time
). I will post the graph here when finished.
Generally we can assume that it is rather the exception that the regular iterations at two different fixed points are the same functions. Moreover I actually dont know any analytic function except the identity function where this would be the case!
So the first lesson is: dont trust naive numerical verifcations. We have to reconsider the equality of our 3 methods and I guess there will show up differences too.
But apart from that we have also hard non-numerical consequences:
There can not be *any* analytic function
with
that is analytic in
. At least one of the fixed points is a singularity in the sense that
does not exist (however of course
). It applies particularly to Andrew's
and Gottfried's solution. And of course that probably is true for any base
.
I can just demonstrate it with the continuous iteration of the function
. The effect is similar to
however the differences already occur at exactness
so the computations are not that expensive. Lets have a look at the graph of the function:
It has two fixed points, one at
and one at
with the slope
and
respectively. So the condition of positive
slope of regular iteration is satisfied. By the previously given formula we compute the iterative square root at both fixed points and their difference:
We see this oscillating behaviour, which implies if the first derivative for one function at a fixed point exists it does not exist for the other.
the conjecture about the equality of the 3 methods of tetration is shattered.
I received an e-mail of Dan Asimov where he mentions that the continuous iterations of
The numerical computations veiled this fact because the differences are in the order of
Currently (running since a day) there is a computation in progress where I compute the differences over the interval

Generally we can assume that it is rather the exception that the regular iterations at two different fixed points are the same functions. Moreover I actually dont know any analytic function except the identity function where this would be the case!
So the first lesson is: dont trust naive numerical verifcations. We have to reconsider the equality of our 3 methods and I guess there will show up differences too.
But apart from that we have also hard non-numerical consequences:
There can not be *any* analytic function
I can just demonstrate it with the continuous iteration of the function
It has two fixed points, one at
We see this oscillating behaviour, which implies if the first derivative for one function at a fixed point exists it does not exist for the other.