Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
the extent of generalization
I may have missed something or watched it go over my head, but I can't find how to find what I want so I'm going to make it unambiguous right here.

Call tetration a 3-tuple (a,b,c) meaning take a to the bth power c times.

I want (i,i,i).

Can anyone please guide me through this?
Hello Matt! Welcome to the Forum!

Well, if I got your thoughts correctly, you are thinking of:
"i" to the "i-yh" power "i" times, with "i" positive integer.
With the adopted priority rules, this means:
1 = 1#1; 2^2 = 2#2; 3^(3^3) = 3#3; 4^(4^(4^4)) = 4#4, and ... so on! Is it so? In this case, I suppose that you were thinking of:
(i,i,i) = i-tower-i = i-penta-2 !!!! Terrifically ... explosive matter. In fact, (1,1,1) = 1; (2,2,2) = 4; (3,3,3) = 3^27 = 7.62559 x 10^12, ... and so on.
Let us try and solve the tetration problems, before those concerning "pentation". However, it is a very interesting ... future dream. Unless you were thinking of "i" as the imaginary unit. In that case, I must drink a good glass of wine, before answering.

All the best.
Thanks GFR -
It's true that I'm refering to the imaginary unit with the is. I think this could also be expressed ack(i,i,3) I'm sure the way to do this is out there, but related papers I've found so far are too difficult for me

for example,
Continuous Iteration of Dynamical Maps
Aldrovandi, R.; Freitas, L. P.

I have a feeling that the Bell matrix approach will work to find (i,i,i) but I have to go very slowly (I'm an undergrad)
Matt D Wrote:I may have missed something or watched it go over my head, but I can't find how to find what I want so I'm going to make it unambiguous right here.

Call tetration a 3-tuple (a,b,c) meaning take a to the bth power c times.

I want (i,i,i).

Can anyone please guide me through this?


do you mean (a^b)^((a^b)^(a^b)...) (c-times repetition)
or (a^b)^b)^b... (c-times repetition)
or (a^b)^c ?

Gottfried Helms, Kassel
Gottfried Wrote:Matt,

do you mean (a^b)^((a^b)^(a^b)...) (c-times repetition)
or (a^b)^b)^b... (c-times repetition)
or (a^b)^c ?


I mean (a^(b^(b^...c "times"...))) with a,b,c complex, but specifically (i^(i^... i "times"...)).
Thanks for your interest,

Dear Matt! I got you!

If you mean (i,i,3), the outcome is rather ... civilized (but, nevertheless, complex):
In fact, (i,i,3) = i^(i^i) = i#3 = i-tower-3 and we may proceed as follows:
i#1 = i;
i#2 = i^(i#1) = i^i = e^(Pi*i*i/2) = e^(-Pi/2) = 0.207879572..;
i#3 = i^0.207879572..= e^(i*0.326536474..) = 0.947158998.. + i . 0.320764449..;
Then: (i,i,3) = 0.947158998.. + i . 0.320764449.. . So far, so good!
On the contrary, if you actually mean:
(i,i,i) = i ^ .... (i^i)[i times] = i-tower-i = i-penta-2, then the problem is "really complicated", instead of simply being only ... complex.
Nevertheless, we are not afraid of anything, since we even found an "infinite tower" with the height equal to the imaginary unit. In fact, we have:
i = e^(Pi*i/2), which is self-explanatory, as far its value is concerned. However, we can write it as: i = (e^(Pi/2))^i = k^i , which defines an infinite tower (i = k#oo), with "base" k=4.810477381.. (real), and with a height equal to ... "i".
I go and drink another one. See you soon!

Matt D Wrote:
Gottfried Wrote:Matt,

do you mean (a^b)^((a^b)^(a^b)...) (c-times repetition)
or (a^b)^b)^b... (c-times repetition)
or (a^b)^c ?


I mean (a^(b^(b^...c "times"...))) with a,b,c complex, but specifically (i^(i^... i "times"...)).
Thanks for your interest,

Hi Matt -

it seems, I can only be of partial help here (if at all).
The matrix method, which I employ, implements the opposite view of things. Let me say it this way:
your definition asks for an operator, which
* assumes a start value v0= a
* applies an operation which makes it v1 = v0^b
* and then repeatedly v_{k+1} = (v_{k})^b, and this (for the integer case of c) repeatedly c-times. Of course, then also the question of fractional or complex iterations occur.

However, my method works differently. It
* assumes a startvalue w0 = b (of your example)
* applies an operation which makes it w1 = a^w0
* and then repeatedly w_{k+1} = a^w_k

So we may say, there is the difference in that
with your idea the same exponent is appended at top of a newly computed base,
with my idea the same base is appended to a newly computed exponent.

I don't have an idea, which (in my favorite view of things) matrix-operator would implement your idea, but -may be- we may find one.

So this way I cannot be of help here for your general question.

But at least for the detail-aspect, of "what is a fractional iteration" or even "what is complex iteration" (indicated by the parameter c) I can add some remarks.

Since I think in terms of a matrix-operator Bs or Ba (where the index s or a indicate the used parameter), which implements the c'th iteration by its matrix-power Bs^c for my method, there is a "canonical" way to implement fractional or complex powers of Bs - just use the matrix-logarithm or the c'th power by eigensystem-decomposition/"diagonalization".

Your actual question seems, with all three parameters identical, to be one-to-one reproducable with my matrix-operator, so I could compute my solution

V({i,i}^^i)~ = V(i)~ * (dV(log(i))*B)^i = V(i)~ * B_i ^i .........// see Andrew Robbins definition-pages for interpreting the {a,x}^^h-notation

by the following Eigensystem-decomposition:

Let W and D be the components (where D is diagonal), such that
B_i = (dV(log(i))*B) = W^-1 * D * W
V({i,i}^^i)~ = V(i)~ * W^-1 * D^i * W
D^i = diag ( d0^i, d1^i, d2^i, .... )
where these entries can be computed by simple scalar complex exponentiation.

But I'm not sure, whether the expected values for our different interpretation of tetration should be equal as well, since they simply define different "processes".

Well - to compute numerical approximations (for my method) one can simply use any eigensystem-solver applied to the matrix B_i , which is parametrized with the base-variable a=i (see my overview articles concerning this in this forum)

In fact, I have computed some examples for complex iteration-parameter c; I have some crude/sketchy graphs, and may upload them, if this is of interest.

The problem is, that the numerical approach by naive use of an EIgensystem-solver (or matrix-logarithm) is unknown in his approximation-quality besides of some "safe" ranges for the parameters. One has - for instance- at least to show, that not only the computed values converge with higher sizes of the used matrix, but also, that the entries of the matrix itself stabilize, if the dimension is increased.

Then the parameters of a problem {a,x}^^h (compare Andrew Robbins' notation-definition here) occur in the matrix equation
V(x)~ * B_a ^h = V(y)~

a -> in the construction of the matrix B_a
h -> in the exponents for the diagonal-matrix D^h of eigenvalues
x -> in the first column of V(x)~
the result {a,x}^^h in the first column of V(y)~
and can be computed by a powerseries in x, where the coefficients of the second column of B_a^h are used
y = {a,x}^^h = sum{k=0,inf} x^k * b_k
where the b_k are the entries of the 2'nd column of B_a^h

Again: this is computable, but to answer your question definitely (or at least as reasonable approximation) one should first find a matrix-operator, which implements your idea as a model for general parameters.

Gottfried Helms, Kassel
It sounds to me like you refer to i-tetra-i, or . in your notation, I think you mean which would actually make which is probably not what you were trying to say.

I have never tried to calculate i-tetra-i before. All of the bases that I've tried have been real-valued, but I'll see what I can do for a complex base. I cannot guarantee any results, but I can see what our methods can do for base i.

Andrew Robbins
Well, given my model of tetration.
Remember, that I doubt that it is reasonable to assume the results of my definition of tetration and yours should be equal, although by the sheer notation with equal parameters the formulae look identical. But it may be instructive anyway.

I just hacked a dimension-32 approximation accroding to the general formula {a,x}^^h given your parameters according to your problem a=I,x=1,h=I.

The first three columns of Bs = dV(log(I)) * B are

To get the (trivial) value of I = {I,1}^^1 the terms of the second column must be summed as powerseries in x with x=1. Here I show the partial sums, which nicely converge to the expected result y=I:

Ok, no obvious error up to here

Now to construct the I'th power of Bs I do numerically an eigendecomposition. The computed eigenvalues are

Note, that these eigenvalues are *not* constant with higher dimesions. They are just constructed from the empirical (truncated wwith dim=32) matrix-operator for base I

Anyway, this reproduces the basic matrixoperator with h=1 perfectly.

Taken to the I'th power (by exponentiating the eigenvalues) Pari/GP gives this matrix as Bs^I (only the finally relevant second column is given here)

The terms used as coefficients for a powerseries in x with x=1 has to be evaluated to get y={I,1}^^I. I approximate this by the partial-sums using Euler-summatiion (order 1.3 suffices)

So the result given here is the last row with

y={I,1}^^I ~ 0.1506... -0.4636...*I

But I don't trust this solution, since in the third column (not documented here) we should have the square, which doesn't appear:
but y^2 = -0.192297283250 + 0.139677528157*I

So, before one could say, y is a reasonable approximation one had to show

a) that the solutions y for values h->I are consistent and continuously approximating the given value

b) the result makes sense if consistent with further algebraic operations.

The remaining problem for my matrix-method is simply the missing hypothese, how to deal with the multivalued logarithms of complex eigenvalues and their complex powers. (Note that it may be interesting to read Jay's recent post, which adresses the analoguous problem when applying his method (I think, it is essentially the same))

Gottfried Helms, Kassel
Just another hack: I applied my analytical description to the problem-definition.

I searched for a fixpoint t for the base-parameter b=I, such that t^(1/t)=b=I

I found:

t= 0.438282936727 + 0.360592471871*I

t^(1/t) = -4.98388377612 E-45 + 1.00000000000*I ~ 0.0 + 1.0*I

is good.
Then u= log(t):
u = log(t) = -0.566417330285 + 0.688453227108*I

Hypothesis: Eigenvalues are consecutive powers of u , beginning at u^0 .
We'll find such powers in the empirical set of eigenvalues with more or less good approximations
.                                   1.00000000000   (u^0)
                  -0.566417336767+0.688453222928*I   (u^1)
                  -0.153139121702-0.779903738266*I   (u^2)
                   0.623667274970+0.336312783860*I   (u^3)
                  -0.584898170382+0.238979921688*I   (u^4)
here approximations become worse:

The full set of eigenvalues, as reported before, but reordered are

The eigenvalues according to my hypothese (still not adapted to the problem of complex values) should be:

Gottfried Helms, Kassel

Possibly Related Threads...
Thread Author Replies Views Last Post
  Superroots and a generalization for the Lambert-W Gottfried 22 37,378 12/30/2015, 09:49 AM
Last Post: andydude

Users browsing this thread: 1 Guest(s)