Tetration Forum

Full Version: The (forgotten) left hyper operations
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
When one starts considering tetration then one usually has the choice between chosing
or .

Usually people always prefer the first right bracketed law, because the left bracketed law is too simple:

, assuming .

However as I described here it is more appropriate to assume getting the even more simple


Though this is a trivial start, it does not remain trivial when considering left pentation:

For example ,

So there is no reason to neglect the left hyper operation sequence by being too trivial! But before proceding something about extension of the left tetration to the reals.

There is one quite obvious way for an extension:
We can describe it by where . Then we even have the desired .

Now has the fixed point 1 and this is the only analytic fixed point there. So of course we consider regular iteration at this fixed point which indeed yields (without proof) so .

We do similar for left pentation, let then . Now has again a fixed point at 1 and we can apply regular iteration there.

where .

We can show by induction that for and that for . To obtain real values we maybe must assume that and defined only on for . I think it also can be shown that 1 is the only real fixed point of , .

So the situation here is quite similar to the one of balanced tetration.
Some pictures of left tetration
red, green, yellow, blue corresponds to x[4']0, x[4']1, x[4']2, x[4']3
and left pentation
red, green, yellow, blue corresponds to x[5']0, x[5']1, x[5']2, x[5']3

The conjecture of course is that
, .
I was wondering why left and balanced are not being talked about here too much since they obviously give different results when iterated. There is also a possibility to make a mix of them as well on a way, changing bracketing in the middle of sequences, or any place, or changing it continuously.

Probably(?) the problem is that there is fast multiplying of different results and not satisfactoy simple way to describe the various infinite trees or paths arising.

My intuitive guess is that there either already exists in mathematics way to describe relations between different values obtained by different bracketing,(trees? tree generating series?) or , if not, especially in continuous extension of iterations, such has to be found, which is probably as very difficult task. But You know that I am not so good in details, so excuse me for having such general views.