Hey, everyone!

I thought I'd make a post explaining why the beta-method is non-zero in the upper half plane. I know that this may still be confusing, tommy seems unconvinced (and I don't blame him)--as the math is a little difficult. The important equivalence to remember is that, if a tetration has essential singularities, it'll have zeroes. And the beta-method has no essential singularities (if it has singularities they will be logarithmic), and we can show from that that there are no zeroes.

First of all, Tommy is absolutely correct; if you have a holomorphic tetration on some domain, it cannot necessarily be extended ad infinitum to the left by taking logarithms. It will probably fail--especially in the neighborhood of the real line. The perfect example of this is actually within the steps we take to construct the beta-method.

First of all, the function,

Where there will be at least one branch cut. Now, when and we restrict , then the only branch cut that happens is at which follows the real line. This is because, within this strip there are no essential singularities; but at we have a bunch of essential singularities at integer lengths. Here is where you will find zeroes too.

Now it's important to remember that acts on for all ; but in the real case, this acts on the strip perfectly; where this operation is "in parallel" so to say, with the shape of the cylinder. If I take , then the strip without essential singularities will be slanted by the period . But it has to have a period of order and it must still allow to act on --so things can get a little whacky. Which means, we're getting a grid of essential singularities at different "slants" (so to speak); and this causes zeroes.

To explain why the zeroes are happening is pretty straight forward. At an essential singularity, the tetration function attains the value INFINITELY often, and so, the logarithms (so to speak) have no choice but to make one of the 's map to zero. This is to mean, if we have an accumulation of 's near a point than the log of this will force a zero to happen somewhere in there, and then a branch cut once you apply log again. This is why in a lot of my slanted graphs you have zeroes and branch cuts popping out of the wood work. The essential singularities do not line up with the mapping ; and so an otherwise normal point, may be pulling back from a neighborhood of an essential singularity, and then it must hit a zero, and then a branch cut, all while being periodic. Chaos ensues.

Now, I want to bring the original proof I have that the beta method is non zero into this discussion. But I may have underworded it. I got very excited because I knew this couldn't have any essential singularities, and had to behave nice. But I probably wrote it too fast, because the other parts of my paper were so much harder to justify, and I started playing a little fast and loose. So I appreciate tommy's questioning. I'll get to my original argument later, which honestly, is just a worse worded version of this post.

So instead, I'll go slower and work on the sort of keystone lemma which holds everything together:

Lemma 1: Suppose is a holomorphic function with , and . Suppose, using the principal branch of the logarithm,

Then,

This lemma is basically saying that if a tetration function has a branch cut, and that branch cut is parallel to the real line, then the tetration must be real valued along the real line. This lemma really hides a lot of the legwork of why the beta-method is holomorphic in the upper half plane, and has no zeroes/branch cuts. And the key is that we can apply the principal branch of the logarithm and make sure the beta method has it's branch cut along the real line. We essentially choose this branch cut. But once you've made this choice, it implies that which can't happen with the beta method, unless we're on the real line. So, in the upper half plane, it doesn't happen--by contradiction there are no zeroes.

This is a very nuanced argument. So, I think it's safe to say, it's up in the air a bit. We should justify this more. And so, I'll justify it more. To do so, I'll continue with the toy model of and which counts for all .

The key to remember, is that in the above lemma, we have assumed that each is isolated. This happens for in the strip (at least compactly). But for we do not get that each is isolated on the fundamental strip . So the above lemma doesn't apply, because, there are an accumulation of singularities, which is caused by the askew essential singularities, not in parallel with .

This is to say, a zero is happening because and but is not holomorphic on .... there's a singularity in there. We don't have this problem with the beta method. Only the periodic cases. With this, I'll restate my original proof.

The beta-method, first of all, only maps the real line to the real line, and no where in the upper half plane does it map while b is constant. So we get the benefit of but on an unbounded domain. Further. There are absolutely no essential singularities in the original sector we prove convergence of the beta method.

The function,

where for some . In this sector, we have no essential singularities. In fact, it looks similarly to the case , excepting we're in a sector rather than a strip. And we can pull back for the same reasons we can pull back when . We will not get a cluster of 1s to throw off the logarithm. And we'll have no path parallel to in which we have a singularity.

The first fact to note is that in this sector, if for then . This is because if it is, then as we increase t it stays real valued, but this asymptotically approaches which is only real valued for (it may hit real values, but it cannot stay real valued on a line parallel to ).

So now if then we know that for . If we assume that then we can apply our lemma on and . This will be the principle branch of the logarithm, and the branch cut can be made horizontal to --use the implicit function theorem. But then, this implies that which is a contradiction. So that, .

Now, it's important to remember this argument fails near an essential singularity, because we can find a 1 arbitrarily close to the singularity; and we can't apply this argument on the sequence of 1's to make sure each logarithm is non-zero. The word isn't quite "isolated 1", but it's something close to it. We cannot find a holomorphic logarithm for each 1--hence a break down, and a zero. And then, pulling back again, a logarithmic singularity coupled with a branch cut.

And we can see this in our lemma. It is dependent on being holomorphic on ; this doesn't happen necessarily; unless the push forward has no singularities. If we have a slanted grid, with a bunch of singularities; the pull back under the mapping gets arbitrarily close to a singularity. And eventually but .

Here is two graphs explaining the difference. Here is over and :

You can see the zeroes appearing almost arbitrary. But it's because somewhere forward we're getting arbitrarily close to an essential singularity. Remember that this function has a slant of the form (this is the period, so the almost cylinder of holomorphy is slanted as this period).

Conversely, looking at when when and ,

There are no zeroes in the strip. But we're getting closer and closer to zero near the essential singularities--because the above argument begins to fail. But it can only actually attain zero at , by some pullback near an essential singularity.

This argument is very subtle. But the proof is sound. The essential trick is Lemma 1; and the fact we have a lot of control on how the branch cut will look--we can always make it parallel with the real line. Which is just an elementary application of the implicit function theorem. This is an argument that is tailored specifically for tetration too--it has little generality to other functions.

Any comments, questions for clarification, are greatly appreciated.

Regards, James

Just for fun here is the graph of which has a plethora of zeroes, because somewhere down the line of applying we have a singularity. For and --see the zeroes which come from pullbacks in neighborhoods of singularities.

Notice the prominent zero, has a branch cut between it and 1; has a singularity inbetween. Hence lemma 1 is unapplicable, hence a zero is possible. As to overexplain, heres a better graphic:

The only way a zero arises, is if we have this break of infinity==in this case just a branch cut; but still a singularity/discontinuity at least. If we don't have this break of infinity; lemma 1 applies and there is no zero. And remember that:

Where we're pulling back in the neighborhood of an essential singularity....

I'm just trying to explain the subtleties of when you can use Lemma 1 and when you can't....

I thought I'd make a post explaining why the beta-method is non-zero in the upper half plane. I know that this may still be confusing, tommy seems unconvinced (and I don't blame him)--as the math is a little difficult. The important equivalence to remember is that, if a tetration has essential singularities, it'll have zeroes. And the beta-method has no essential singularities (if it has singularities they will be logarithmic), and we can show from that that there are no zeroes.

First of all, Tommy is absolutely correct; if you have a holomorphic tetration on some domain, it cannot necessarily be extended ad infinitum to the left by taking logarithms. It will probably fail--especially in the neighborhood of the real line. The perfect example of this is actually within the steps we take to construct the beta-method.

First of all, the function,

Where there will be at least one branch cut. Now, when and we restrict , then the only branch cut that happens is at which follows the real line. This is because, within this strip there are no essential singularities; but at we have a bunch of essential singularities at integer lengths. Here is where you will find zeroes too.

Now it's important to remember that acts on for all ; but in the real case, this acts on the strip perfectly; where this operation is "in parallel" so to say, with the shape of the cylinder. If I take , then the strip without essential singularities will be slanted by the period . But it has to have a period of order and it must still allow to act on --so things can get a little whacky. Which means, we're getting a grid of essential singularities at different "slants" (so to speak); and this causes zeroes.

To explain why the zeroes are happening is pretty straight forward. At an essential singularity, the tetration function attains the value INFINITELY often, and so, the logarithms (so to speak) have no choice but to make one of the 's map to zero. This is to mean, if we have an accumulation of 's near a point than the log of this will force a zero to happen somewhere in there, and then a branch cut once you apply log again. This is why in a lot of my slanted graphs you have zeroes and branch cuts popping out of the wood work. The essential singularities do not line up with the mapping ; and so an otherwise normal point, may be pulling back from a neighborhood of an essential singularity, and then it must hit a zero, and then a branch cut, all while being periodic. Chaos ensues.

Now, I want to bring the original proof I have that the beta method is non zero into this discussion. But I may have underworded it. I got very excited because I knew this couldn't have any essential singularities, and had to behave nice. But I probably wrote it too fast, because the other parts of my paper were so much harder to justify, and I started playing a little fast and loose. So I appreciate tommy's questioning. I'll get to my original argument later, which honestly, is just a worse worded version of this post.

So instead, I'll go slower and work on the sort of keystone lemma which holds everything together:

Lemma 1: Suppose is a holomorphic function with , and . Suppose, using the principal branch of the logarithm,

Then,

This lemma is basically saying that if a tetration function has a branch cut, and that branch cut is parallel to the real line, then the tetration must be real valued along the real line. This lemma really hides a lot of the legwork of why the beta-method is holomorphic in the upper half plane, and has no zeroes/branch cuts. And the key is that we can apply the principal branch of the logarithm and make sure the beta method has it's branch cut along the real line. We essentially choose this branch cut. But once you've made this choice, it implies that which can't happen with the beta method, unless we're on the real line. So, in the upper half plane, it doesn't happen--by contradiction there are no zeroes.

This is a very nuanced argument. So, I think it's safe to say, it's up in the air a bit. We should justify this more. And so, I'll justify it more. To do so, I'll continue with the toy model of and which counts for all .

The key to remember, is that in the above lemma, we have assumed that each is isolated. This happens for in the strip (at least compactly). But for we do not get that each is isolated on the fundamental strip . So the above lemma doesn't apply, because, there are an accumulation of singularities, which is caused by the askew essential singularities, not in parallel with .

This is to say, a zero is happening because and but is not holomorphic on .... there's a singularity in there. We don't have this problem with the beta method. Only the periodic cases. With this, I'll restate my original proof.

The beta-method, first of all, only maps the real line to the real line, and no where in the upper half plane does it map while b is constant. So we get the benefit of but on an unbounded domain. Further. There are absolutely no essential singularities in the original sector we prove convergence of the beta method.

The function,

where for some . In this sector, we have no essential singularities. In fact, it looks similarly to the case , excepting we're in a sector rather than a strip. And we can pull back for the same reasons we can pull back when . We will not get a cluster of 1s to throw off the logarithm. And we'll have no path parallel to in which we have a singularity.

The first fact to note is that in this sector, if for then . This is because if it is, then as we increase t it stays real valued, but this asymptotically approaches which is only real valued for (it may hit real values, but it cannot stay real valued on a line parallel to ).

So now if then we know that for . If we assume that then we can apply our lemma on and . This will be the principle branch of the logarithm, and the branch cut can be made horizontal to --use the implicit function theorem. But then, this implies that which is a contradiction. So that, .

Now, it's important to remember this argument fails near an essential singularity, because we can find a 1 arbitrarily close to the singularity; and we can't apply this argument on the sequence of 1's to make sure each logarithm is non-zero. The word isn't quite "isolated 1", but it's something close to it. We cannot find a holomorphic logarithm for each 1--hence a break down, and a zero. And then, pulling back again, a logarithmic singularity coupled with a branch cut.

And we can see this in our lemma. It is dependent on being holomorphic on ; this doesn't happen necessarily; unless the push forward has no singularities. If we have a slanted grid, with a bunch of singularities; the pull back under the mapping gets arbitrarily close to a singularity. And eventually but .

Here is two graphs explaining the difference. Here is over and :

You can see the zeroes appearing almost arbitrary. But it's because somewhere forward we're getting arbitrarily close to an essential singularity. Remember that this function has a slant of the form (this is the period, so the almost cylinder of holomorphy is slanted as this period).

Conversely, looking at when when and ,

There are no zeroes in the strip. But we're getting closer and closer to zero near the essential singularities--because the above argument begins to fail. But it can only actually attain zero at , by some pullback near an essential singularity.

This argument is very subtle. But the proof is sound. The essential trick is Lemma 1; and the fact we have a lot of control on how the branch cut will look--we can always make it parallel with the real line. Which is just an elementary application of the implicit function theorem. This is an argument that is tailored specifically for tetration too--it has little generality to other functions.

Any comments, questions for clarification, are greatly appreciated.

Regards, James

Just for fun here is the graph of which has a plethora of zeroes, because somewhere down the line of applying we have a singularity. For and --see the zeroes which come from pullbacks in neighborhoods of singularities.

Notice the prominent zero, has a branch cut between it and 1; has a singularity inbetween. Hence lemma 1 is unapplicable, hence a zero is possible. As to overexplain, heres a better graphic:

The only way a zero arises, is if we have this break of infinity==in this case just a branch cut; but still a singularity/discontinuity at least. If we don't have this break of infinity; lemma 1 applies and there is no zero. And remember that:

Where we're pulling back in the neighborhood of an essential singularity....

I'm just trying to explain the subtleties of when you can use Lemma 1 and when you can't....