Tetration

From Citizendium
Revision as of 23:13, 29 October 2008 by imported>Dmitrii Kouznetsov (→‎Asymptotic behavior of tetration)
Jump to navigation Jump to search
Fig.1. Tetration for , , , and versus .

This article is currently under construction. While, use article from wikipedia http://en.wikipedia.org/wiki/Tetration

Tetration is fastly growing mathematical function, which was introduced in XX century and suggested for representation of huge numbers in mathematics of computation. However, up to year 2008, this function is not considered as elementary function, it is not implemented in programming languages and it is not used for the internal representation of data, at least in the commercial software.

Definiton

For real , Tetration on the base is function of complex variable, which is holomorphic at least in the range , bounded in the range , and satisfies conditions

at least within range .


Etymology

Creation of word tetration is attributed to Englidh mathematician Reuben Louis Goodstein [1] [2]. This name indicates, that this operation is fourth (id est, tetra) in the hierarchy of operations after summation, multiplication, and exponentiation. In principle, one can define "pentation", "sexation", "septation" in the simlar manner, although tetration, perhaps, already has growth fast enough for the requests of XXI century.

Real values of the arguments

Examples of behavior of this function at the real axis are shown in figure 1 for values , , , and for . It has logarithmic singularity at , and it is monotonously increasing function.

At tetration approaches its limiting value as , and .

Fast growth

At tetration grows faster than any exponential function. For this reason the tetration is suggested for the representation of huge numbers in mathematics of computation. A number, that cannot be stored as floating point, could be represented as for some standard value of (for example, or ) and relatively moderate value of . The analytic properties of tetration could be used for the implementation of arithmetic operations with huge numbers without to convert them to the floating point representation.

Integer values of the argument

For integer , tetration can be interpreted as iterated exponential:

and so on; then, the argument of tetration can be interpreted as number of exponentiations of unity. From definition it follows, that

and

Relation with the Ackermann function

At base , tetration is related to the Ackermann function:

where Ackermann function is defined for the non-negative integer values of its arguments with equations

Asymptotic behavior of tetration

The analytic extension of tetration grows fast along the real axis of the complex -plane, at least for some values of base . However, it cannot grow infinitely in the direction of imaginary axis. The exponential convergence of discrete interation of logarithm corresponds to the exponential asymptotic behavior

(12)

where

(13) ,

and are fixed complex numbers, and is eigenvalue of logarithm, solution of equation

(14) .
FIg.2. Graphic solution of equation for (two real solutions, and ), (one real solution ) (no real solutions).

Solutions of equation (14) are called fixed points of logarithm.

Fixed points of logarithm

Three examples of graphical solution of equation (14) are shown in figure 2 for , , and .

The black line shows function in the plane. The colored curves show function for cases (red), (green), and (blue).

At , there exist 2 solutions, and .

At there exist one solution .

and , there are no real solutions.

In general,

  • at there are two real solutions
  • at , there is one soluition, and
  • at there esist two solutions, but they are complex.

In particular, at , the solutions are
and
.

At , the solutions are
and
.

At , the solutions are
and
.

Few hundred straightforward iterations of equation (14) are sufficient to get the error smaller than the last decimal digit in the approximations above.

FIg.3. parameters of asymptotic of tetration versus logarithm of the base

The solutions and of equation (14) are plotted in figure 3 versus with thin black lines. Let , and only at , the equality takes place.


The thin black solid curve at represents the real part of the solutions and of (14); the thin black dashed curve represents the two options for the imaginary part; the two solutions are complex conjugaitons of each other. Requirement of definition of tetration determine the asymptotic of the solution. Parameter tetermines periodicity of quasi-periodicity of tetration. The two solutions for <\math>Q</math>are shown in figure 3 with green lines.

At both solutons for <\math>Q</math> are real. The negative corresponds to tetration, decaying to the asymptotic value in the direction of real axis; positive </math>Q</math> corresponds to the solution growing along the real axis. At the real axix, such a solution remains larger than unity; this does not allow to satisfy confition . Therefore, only one negative corresponds to the asymptotic behavior of tetration.

At , both options for are mutually complex conjugate. The real part is shown thif thick green line; one option of the imaginary part is shown with dashed line.

Possibilities for the period (or quasi-period) are shown in Figure 3 with fotted lines. At , only "negative" period forresponds to tetration. At , the periodicity can be achieved only asymptotically; and is quasi-period. The real part of quasi-period is markes with black dotted line; one of two options tor the imaginary part is marked with pink dotted line.

Generally, at , tetration is periodic; the period is pure imaginary.

At , tetration is not periodic, and no exponential asymptotic exist.

, tetration is quasi–periodic, the quasi-period in the upper complex half-plane is conjugate to that in the lower complex half-plane. The larger is base , the shorter is quasi-period. As the quasi-periods are complex conjugated, the quasi-periodicity takes place away from the real axis.

Evaluation of tetration

Fig.4. Tetration at the complex -plane. .

As the asymptoric of tetration is crutually depend of base in ficinity of value , the evaluation procidure is different foe the cases , , and , and should be considered intependently.

Case

At , the period is imaginary. Period with smallest modulus corresponds to the solution that is unity at the origen of coordinates. For , function is shown in figure 4 with levels of constant real part and levels of constant imaginary part. Levels and levels aew shown with thick lines. Intermediate levels are shown with thin lines. There are branch points at ; the cut lines are . For this value of base, the period

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle T=\frac{2\pi}{\ln^2(2)}\approx −17.1431481793548471041794 ~\mathrm{i}} .

The solution follows asymptotic at large values of real part of the argument, exponentially approaching the limiting value. In particular, for , this limiting value is 2.

The trace of the solution along the real axis corresponds to the red dotted curve in Figure 1. Other solution of the recursive equaiton () do not satisfy criteria formulated in the definition of tetration.

Case

Case

Existence and uniqueness of tetration

If you plan to contribute here, look at draft at User:Dmitrii Kouznetsov/Analytic Tetration.

Inverse of tetration

Iterated exponential and

Especially interesting, and in particular, for the qualitative breakthrough, is the case of iteration of natural exponential, id est, . Existence of the fractional iteration, and, in particular, existence of operation was demonstrated in 1950 by H.Kneser. [3]. However, that time, there was no computer facility for the evlauation of such an exotic function that ; perhaps, just absence of an apropriate plotter did not allow Kneser to plot the distribution of fractal exponential function in the complex plane for various values of .

See also

References

  1. "TETRATION, a term for repeated exponentiation, was introduced by Reuben Louis Goodstein". Earliest Known Uses of Some of the Words of Mathematics, http://members.aol.com/jeff570/t.html
  2. R.L.Goodstein (1947). "Transfinite ordinals in recursive number theory". Journal of Symbolic Logic 12.
  3. Kneser

Free online sources