06/07/2021, 10:45 PM

ALL OF MY CODE IS DRAWN FROM MY GITHUB REPOSITORY FOR THE BETA METHOD

ALL OF SHELDON'S CODE IS DRAWN FROM fatou.gp

https://github.com/JmsNxn92/Recursive_Tetration_PARI

https://math.eretrandre.org/tetrationfor...p?tid=1017

So I thought I'd compile a list of arguments I have, that the beta method tetration is not Kneser's solution. At this point I am more than confident the beta method definitely produces a holomorphic tetration. The code is still suboptimal; I'm busy trying to make a Matrix add on to the existing code to create a grid of Taylor series of sample points which will give good enough precision for large imaginary arguments.

To begin, we initiate fatou.gp and Abel_L.gp

I have coded my superexponential at base e with ; which will work on the real line precisely; and can grab the Taylor series on the real-line precisely. It will glitch for values like but once the imaginary argument is greater than it works fine. For complex arguments near the real line; expand a Taylor series on the real-line and sum it; which is in the code dump. The variable n is the depth of iteration; for this we'll set it to 100; which is large enough for about 100 digit accuracy. The variable v, is a flag as to whether you want to pull out Taylor series or not. The explanation is in the comments of the code.

Sheldon has coded the kneser superexponential at base e with first the initialization and then .

The first thing we'll add is a graph comparing these two solutions on the real line. This is the result of .

You can see immediately that Kneser's solution is going to grow a tad bit faster than the beta solution. And that they still agree on the natural numbers. This difference is less than obvious though.

Here's the beta method tetration over for .

And here's the Kneser tetration over for .

Both are clearly holomorphic; but they have an obvious disagreement on the real-line.

This is my first argument as to why the beta method is not Kneser's.

The second argument is topological in nature. For this we will call Kneser's solution and the beta method

Kneser's Method is similar to the standard iteration of a Schroder function about the fixed points which are the fixed points of with minimal imaginary argument. Which is, we can find a pair of Schroder functions and a pair of theta mappings such that,

Where we have the relation, ; which allows for an analytic extension to which is real-valued.

The beta method is vastly different. To begin we solve the equation for such that,

This produces a collection of tetration functions,

with period with many many branchcuts/singularities. But regardless; this tetration is holomorphic on with . Which means it's holomorphic almost everywhere. Because of its periodicity we can think of 's domain topologically as an almost cylinder.

This means,

Now we can normalize these tetrations; so that the singularities appear when approaches the boundary of this cylinder. Therefore; we get something like this, for . Where the singularities occur on the boundary of the cylinder, but within the strip everything is normal and nice and looks like tetration.

The manner in which we construct is to move these singularities to the points at . Think, we are stretching the interior of the cylinder to be the upper and lower half planes; and putting the boundaries at infinity. This is done by using an implicit function which we insert into the limiting construction. I chose for simplicity; but any similar mapping will work.

Now, the reason this matters; is that, theoretically when we take,

we are technically approaching the boundary of the cylinder. And on this boundary we have all of the singularities of . So we should expect (I haven't been able to prove this satisfactorily yet):

Or at least, that,

Whereas,

This would instantly show that the beta method produces a vastly different tetration than Kneser's method.

The third argument I'm bringing to the table is the obvious one.

Nowhere in my construction do I need to compute a theta mapping. As this is by far the most crucial ingredient to Kneser's construction (and Sheldon's fatou.gp); it would be absurd to think we can construct it without said theta mapping. It would be, surprising, to say the least. In fact, it would bypass a lot of the finesse of Kneser's construction; or even Kouznetsov's approach. Something I highly doubt is possible.

The beta method makes zero mention of the fixed points . It is constructed entirely from the exponential function's behaviour at infinity. There is no data, no Schroder function, no asymptotics, which include the values . I think it would be quite surprising and quite incredible if this were Kneser's; which is why I further doubt it is.

In conclusion; I believe the beta method produces a novel tetration. And it has divergence at ; which is drastically different than Kneser. I'm still working on constructing a proof; but I am definitely getting there. I need an out of the box thought though, to complete the argument.

Regards, James

ALL OF SHELDON'S CODE IS DRAWN FROM fatou.gp

https://github.com/JmsNxn92/Recursive_Tetration_PARI

https://math.eretrandre.org/tetrationfor...p?tid=1017

So I thought I'd compile a list of arguments I have, that the beta method tetration is not Kneser's solution. At this point I am more than confident the beta method definitely produces a holomorphic tetration. The code is still suboptimal; I'm busy trying to make a Matrix add on to the existing code to create a grid of Taylor series of sample points which will give good enough precision for large imaginary arguments.

To begin, we initiate fatou.gp and Abel_L.gp

I have coded my superexponential at base e with ; which will work on the real line precisely; and can grab the Taylor series on the real-line precisely. It will glitch for values like but once the imaginary argument is greater than it works fine. For complex arguments near the real line; expand a Taylor series on the real-line and sum it; which is in the code dump. The variable n is the depth of iteration; for this we'll set it to 100; which is large enough for about 100 digit accuracy. The variable v, is a flag as to whether you want to pull out Taylor series or not. The explanation is in the comments of the code.

Sheldon has coded the kneser superexponential at base e with first the initialization and then .

The first thing we'll add is a graph comparing these two solutions on the real line. This is the result of .

You can see immediately that Kneser's solution is going to grow a tad bit faster than the beta solution. And that they still agree on the natural numbers. This difference is less than obvious though.

Here's the beta method tetration over for .

And here's the Kneser tetration over for .

Both are clearly holomorphic; but they have an obvious disagreement on the real-line.

This is my first argument as to why the beta method is not Kneser's.

The second argument is topological in nature. For this we will call Kneser's solution and the beta method

Kneser's Method is similar to the standard iteration of a Schroder function about the fixed points which are the fixed points of with minimal imaginary argument. Which is, we can find a pair of Schroder functions and a pair of theta mappings such that,

Where we have the relation, ; which allows for an analytic extension to which is real-valued.

The beta method is vastly different. To begin we solve the equation for such that,

This produces a collection of tetration functions,

with period with many many branchcuts/singularities. But regardless; this tetration is holomorphic on with . Which means it's holomorphic almost everywhere. Because of its periodicity we can think of 's domain topologically as an almost cylinder.

This means,

Now we can normalize these tetrations; so that the singularities appear when approaches the boundary of this cylinder. Therefore; we get something like this, for . Where the singularities occur on the boundary of the cylinder, but within the strip everything is normal and nice and looks like tetration.

The manner in which we construct is to move these singularities to the points at . Think, we are stretching the interior of the cylinder to be the upper and lower half planes; and putting the boundaries at infinity. This is done by using an implicit function which we insert into the limiting construction. I chose for simplicity; but any similar mapping will work.

Now, the reason this matters; is that, theoretically when we take,

we are technically approaching the boundary of the cylinder. And on this boundary we have all of the singularities of . So we should expect (I haven't been able to prove this satisfactorily yet):

Or at least, that,

Whereas,

This would instantly show that the beta method produces a vastly different tetration than Kneser's method.

The third argument I'm bringing to the table is the obvious one.

Nowhere in my construction do I need to compute a theta mapping. As this is by far the most crucial ingredient to Kneser's construction (and Sheldon's fatou.gp); it would be absurd to think we can construct it without said theta mapping. It would be, surprising, to say the least. In fact, it would bypass a lot of the finesse of Kneser's construction; or even Kouznetsov's approach. Something I highly doubt is possible.

The beta method makes zero mention of the fixed points . It is constructed entirely from the exponential function's behaviour at infinity. There is no data, no Schroder function, no asymptotics, which include the values . I think it would be quite surprising and quite incredible if this were Kneser's; which is why I further doubt it is.

In conclusion; I believe the beta method produces a novel tetration. And it has divergence at ; which is drastically different than Kneser. I'm still working on constructing a proof; but I am definitely getting there. I need an out of the box thought though, to complete the argument.

Regards, James