I just came across a connection between two problems which I do not yet fully understand:

a) the problem of the different values for fractional iteration if the powerseries for tetration are developed around different fixpoints and

b) the problem of inconsistency between alternating iteration series of increasing (iteration-)height when evaluated by serial summation of terms or when computed by the matrix-inversion in the sense of the "Neumann series" (see http://en.wikipedia.org/wiki/Neumann_series to which I referred up to now only as "closed form of the geometric series for matrices" lacking the knowledge that this was a well-known method ) .

(A basically relevant thread related to this is the "bummer"-thread opened by Hendrik see http://math.eretrandre.org/tetrationforu...php?tid=69 In that thread Hendrik has also considered a similar example polynomial as I do it here)

I'll explain b) first and to make things simple I do not use the tetration-function but some polynomial of order 2, which has two fixpoints and which is bijective in the full range between the two fixpoints. One choice is . The inverse of this function is . The fixpoint by increasing heights is and by decreasing heights is

Denote the iterates beginning at as and the backwards iteration as .

Then the alternating iterationseries from towards may be denoted by

and the complementary by

.

Then the overall sum is

.

With this it is also, that letting x vary from then the sum is periodic with a sinusoidal shape (it is not exactly a sinus-curve).

The Matrix-method:

Next step is the implementation of that sums sp and sn by a Neumann-series of the matrix-operator for the (recentered) functions f and g . In the context of tetration/powertower-series it seemed, that this matrix-based method could provide analytic continuation of that alternating series even for the (extremely) divergent case for bases , see the initial powertower-article, the last link to powertower.pdf below and the discussion in sci.math.research in the first external link below).

Let's denote the version centered at as

and that at as

Then the matrix-method requires the carleman-matrix Mp associated to and the Neumann-series interpretation of this problem is then the use of to compute the matrix-based-version of , let's call it while originally I used the inverse of Mp by to compute the complementary sum .

The result of this was the surprising observation, that either or, complementary which I observed first in the case, that the iterated function is the exponentiation/logarithm but which occurs now in the same manner with that simple polynomial, too.

The view at different fixpoints

Now I find, that the view at the different fixpoints reflects precisely that problem: if I use the matrix Np for but the matrices Mn, Nn which are created analoguously, only using the function at the other fixpoint for then I get equality for both sums:

(at least to some observable accuracy, I've to check this in more depth later).

The interesting observation is here, that the fixpoint-problem occurs although we do not use fractional iteration; it seems to suffice, that infinitely many terms are involved.

I cannot yet claim any useful consequences from this observation, but perhaps we can use it to quantify the difference by application of the two fixpoint-versions and possibly find out the source and an explict correction-term for it. Also this is then a backing argument, that my matrix-based computations for the alternating powertower-series are correct and meaningful even for the divergent cases. See the excerpt of a related discussion in the newsgroup sci.math.research, which I have documented in

http://go.helms-net.de/math/tetdocs/_ser...tion_1.htm

detailed discussion of the discrepancies mentioned above:

http://go.helms-net.de/math/tetdocs/Tetr...roblem.pdf

initial article, should be reworked... :

http://go.helms-net.de/math/tetdocs/10_4_Powertower.pdf

Gottfried

a) the problem of the different values for fractional iteration if the powerseries for tetration are developed around different fixpoints and

b) the problem of inconsistency between alternating iteration series of increasing (iteration-)height when evaluated by serial summation of terms or when computed by the matrix-inversion in the sense of the "Neumann series" (see http://en.wikipedia.org/wiki/Neumann_series to which I referred up to now only as "closed form of the geometric series for matrices" lacking the knowledge that this was a well-known method ) .

(A basically relevant thread related to this is the "bummer"-thread opened by Hendrik see http://math.eretrandre.org/tetrationforu...php?tid=69 In that thread Hendrik has also considered a similar example polynomial as I do it here)

I'll explain b) first and to make things simple I do not use the tetration-function but some polynomial of order 2, which has two fixpoints and which is bijective in the full range between the two fixpoints. One choice is . The inverse of this function is . The fixpoint by increasing heights is and by decreasing heights is

Denote the iterates beginning at as and the backwards iteration as .

Then the alternating iterationseries from towards may be denoted by

and the complementary by

.

Then the overall sum is

.

With this it is also, that letting x vary from then the sum is periodic with a sinusoidal shape (it is not exactly a sinus-curve).

The Matrix-method:

Next step is the implementation of that sums sp and sn by a Neumann-series of the matrix-operator for the (recentered) functions f and g . In the context of tetration/powertower-series it seemed, that this matrix-based method could provide analytic continuation of that alternating series even for the (extremely) divergent case for bases , see the initial powertower-article, the last link to powertower.pdf below and the discussion in sci.math.research in the first external link below).

Let's denote the version centered at as

and that at as

Then the matrix-method requires the carleman-matrix Mp associated to and the Neumann-series interpretation of this problem is then the use of to compute the matrix-based-version of , let's call it while originally I used the inverse of Mp by to compute the complementary sum .

The result of this was the surprising observation, that either or, complementary which I observed first in the case, that the iterated function is the exponentiation/logarithm but which occurs now in the same manner with that simple polynomial, too.

The view at different fixpoints

Now I find, that the view at the different fixpoints reflects precisely that problem: if I use the matrix Np for but the matrices Mn, Nn which are created analoguously, only using the function at the other fixpoint for then I get equality for both sums:

(at least to some observable accuracy, I've to check this in more depth later).

The interesting observation is here, that the fixpoint-problem occurs although we do not use fractional iteration; it seems to suffice, that infinitely many terms are involved.

I cannot yet claim any useful consequences from this observation, but perhaps we can use it to quantify the difference by application of the two fixpoint-versions and possibly find out the source and an explict correction-term for it. Also this is then a backing argument, that my matrix-based computations for the alternating powertower-series are correct and meaningful even for the divergent cases. See the excerpt of a related discussion in the newsgroup sci.math.research, which I have documented in

http://go.helms-net.de/math/tetdocs/_ser...tion_1.htm

detailed discussion of the discrepancies mentioned above:

http://go.helms-net.de/math/tetdocs/Tetr...roblem.pdf

initial article, should be reworked... :

http://go.helms-net.de/math/tetdocs/10_4_Powertower.pdf

Gottfried

Gottfried Helms, Kassel