I was little nervous that in Henryk's formula for tetration with real/complex heights ( see here:Post ) any time logarithm takes negative value, iteration has to be stopped or complex values of logarithm used. Especially for all numbers < 1 iteration stops without even beginning.
So I constructed the following function to see what happens when its iterated:
\( f(x) = \ln(x) \text{ if } x>0 \)
\( f(x) = \ln(-x) \text{ if }x<0 \)
Since \( \ln(\Omega=0,567143..) = - \Omega \) it is obvious that \( \Omega \) is the only starting point that will not move since every iteration will return to \( \Omega \) as argument for \( \ln \) and \( {1/\Omega} \) will be next one to converge to \( \Omega \) after first iteration.
So \( \Omega \) may play a special role in this, and as we will see later, it does.Firstly, all iterations from 1 to \( \infty \) pass via this point \( x=\Omega \).
Then I found \( f(x) \) iterates in the region x = ]0.001:0.001:2.71[ (for a starter, it can be done for negative /positive x>1 as well), via formula:
\( f(x)_n = \ln(f(x)_{n-1}) \text{ if } f(x)_{n-1}>0 \)
\( f(x)_n = \ln(-f(x)_{n-1}) \text{ if } f(x)_{n-1} <0 \)
It is clear that starting with all relatives to e like e, 1/e, e^(1/e), e^-e, e^e ; ((e^-e)^-e)^-e.......... etc iteration stops rather soon via sequence f(f(e) or f(f(f(1/e).
The questions remains, if iterations are infinite, are there many numbers left on real axis which are not in some way related to iterated e-powers of smaller e parent? In case of infinite logarithmic iteration, some numbers would start at infinitesimal seed of e-sequence relative or parent, while some trees will stop at finite number of steps. Excuse me for obvious choice of names. Are there any numbers left? Probably yes.
Well, this is how first 5 iterations look like:
And iterations 6-10 obviuously increase the frequency of spikes.
I did 8522 iterations in Excel with ordinary precision and what happens is interesting:
AverageValueperIterationof100pointsX0.01_0.01_0.99.bmp (Size: 41.11 KB / Downloads: 2,137)
The limit of average when n-> infinity of all points per iteration seems to converge to \( -\Omega \).
The same limit value is reached as average value of iteration at each point x (Average of 8522 iterations in this case)
This means that iterated sequences are More negative than positive, and in fact, the maximum postive value at any iteration over all points is always smaller than maximum negative, and their ratio (negative lower bound/positive upper bound) in limit tends to something very close to \( -{1/\pi} \)
This last value has to be checked with better precision iteration, but about convergence to \( -\Omega \) for averages mentioned above I have no doubt as it is logical.
So first conclusion from all this is very interesting:
\( \lim_{n\to\infty}\frac{\sum_{n=1}^\infty f^{\circ n}(x)}{n}= -\Omega=-0.567143.. \)
This was so long, excuse me for mistakes but I hope tex and pictures explain.
Ivars
So I constructed the following function to see what happens when its iterated:
\( f(x) = \ln(x) \text{ if } x>0 \)
\( f(x) = \ln(-x) \text{ if }x<0 \)
Since \( \ln(\Omega=0,567143..) = - \Omega \) it is obvious that \( \Omega \) is the only starting point that will not move since every iteration will return to \( \Omega \) as argument for \( \ln \) and \( {1/\Omega} \) will be next one to converge to \( \Omega \) after first iteration.
So \( \Omega \) may play a special role in this, and as we will see later, it does.Firstly, all iterations from 1 to \( \infty \) pass via this point \( x=\Omega \).
Then I found \( f(x) \) iterates in the region x = ]0.001:0.001:2.71[ (for a starter, it can be done for negative /positive x>1 as well), via formula:
\( f(x)_n = \ln(f(x)_{n-1}) \text{ if } f(x)_{n-1}>0 \)
\( f(x)_n = \ln(-f(x)_{n-1}) \text{ if } f(x)_{n-1} <0 \)
It is clear that starting with all relatives to e like e, 1/e, e^(1/e), e^-e, e^e ; ((e^-e)^-e)^-e.......... etc iteration stops rather soon via sequence f(f(e) or f(f(f(1/e).
The questions remains, if iterations are infinite, are there many numbers left on real axis which are not in some way related to iterated e-powers of smaller e parent? In case of infinite logarithmic iteration, some numbers would start at infinitesimal seed of e-sequence relative or parent, while some trees will stop at finite number of steps. Excuse me for obvious choice of names. Are there any numbers left? Probably yes.
Well, this is how first 5 iterations look like:
And iterations 6-10 obviuously increase the frequency of spikes.
I did 8522 iterations in Excel with ordinary precision and what happens is interesting:
AverageValueperIterationof100pointsX0.01_0.01_0.99.bmp (Size: 41.11 KB / Downloads: 2,137)
The limit of average when n-> infinity of all points per iteration seems to converge to \( -\Omega \).
The same limit value is reached as average value of iteration at each point x (Average of 8522 iterations in this case)
This means that iterated sequences are More negative than positive, and in fact, the maximum postive value at any iteration over all points is always smaller than maximum negative, and their ratio (negative lower bound/positive upper bound) in limit tends to something very close to \( -{1/\pi} \)
This last value has to be checked with better precision iteration, but about convergence to \( -\Omega \) for averages mentioned above I have no doubt as it is logical.
So first conclusion from all this is very interesting:
\( \lim_{n\to\infty}\frac{\sum_{n=1}^\infty f^{\circ n}(x)}{n}= -\Omega=-0.567143.. \)
This was so long, excuse me for mistakes but I hope tex and pictures explain.
Ivars