Tetration Explained

\uparrow \uparrow and the left-exponent ^xb are common.

Under the definition as repeated exponentiation,

{ ^{n} a} means {a ^{a ^{⋅ ^{⋅ ^{a}}}} }, where copies of are iterated via exponentiation, right-to-left, i.e. the application of exponentiation n -1 times. is called the "height" of the function, while is called the "base," analogous to exponentiation. It would be read as "the th tetration of ".

It is the next hyperoperation after exponentiation, but before pentation. The word was coined by Reuben Louis Goodstein from tetra- (four) and iteration.

Tetration is also defined recursively as

{a \uparrow \uparrow n} : = \begin{cases} 1 & if n =0 , \ a ^{a} & if n> 0 , \end{cases} allowing for attempts to extend tetration to non-natural numbers such as real, complex, and ordinal numbers.

The two inverses of tetration are called super-root and super-logarithm, analogous to the nth root and the logarithmic functions. None of the three functions are elementary.

Tetration is used for the notation of very large numbers.

Introduction

The first four hyperoperations are shown here, with tetration being considered the fourth in the series. The unary operation succession, defined as

a' = a + 1 , is considered to be the zeroth operation.

1. Addition $$a\; +\; n\; =\; a\; +\; \backslash underbrace\_n$$ copies of 1 added to combined by succession.
2. Multiplication $$a\; \backslash times\; n\; =\; \backslash underbrace\_n$$ copies of combined by addition.
3. Exponentiation $$a^n\; =\; \backslash underbrace\_n$$ copies of combined by multiplication.
4. Tetration $$=\; \backslash underbrace\_n$$ copies of combined by exponentiation, right-to-left.

Importantly, nested exponents are interpreted from the top down: means and not

Succession,

a _{n+1} = a _{n} + 1 , is the most basic operation; while addition (a + n ) is a primary operation, for addition of natural numbers it can be thought of as a chained succession of n successors of a ; multiplication (a x n ) is also a primary operation, though for natural numbers it can analogously be thought of as a chained addition involving n numbers of a . Exponentiation can be thought of as a chained multiplication involving n numbers of a and tetration (^{n} a ) as a chained power involving n numbers a . Each of the operations above are defined by iterating the previous one;^[1] however, unlike the operations before it, tetration is not an elementary function.

The parameter

a is referred to as the base, while the parameter n may be referred to as the height. In the original definition of tetration, the height parameter must be a natural number; for instance, it would be illogical to say "three raised to itself negative five times" or "four raised to itself one half of a time." However, just as addition, multiplication, and exponentiation can be defined in ways that allow for extensions to real and complex numbers, several attempts have been made to generalize tetration to negative numbers, real numbers, and complex numbers. One such way for doing so is using a recursive definition for tetration; for any positive real a > 0 and non-negative integer n \ge 0 , we can define { ^{n} a} recursively as:{ ^{n} a} : = \begin{cases} 1 & if n =0 \ a ^{\left( ^{(n-1)} a\right)} & if n> 0 \end{cases} The recursive definition is equivalent to repeated exponentiation for natural heights; however, this definition allows for extensions to the other heights such as ^{0} a , ^{-1} a , and ^{i} a as well – many of these extensions are areas of active research.

Terminology

There are many terms for tetration, each of which has some logic behind it, but some have not become commonly used for one reason or another. Here is a comparison of each term with its rationale and counter-rationale.

• The term tetration, introduced by Goodstein in his 1947 paper Transfinite Ordinals in Recursive Number Theory^[2] (generalizing the recursive base-representation used in Goodstein's theorem to use higher operations), has gained dominance. It was also popularized in Rudy Rucker's Infinity and the Mind.
• The term superexponentiation was published by Bromer in his paper Superexponentiation in 1987.^[3] It was used earlier by Ed Nelson in his book Predicative Arithmetic, Princeton University Press, 1986.
• The term hyperpower^[4] is a natural combination of hyper and power, which aptly describes tetration. The problem lies in the meaning of hyper with respect to the hyperoperation sequence. When considering hyperoperations, the term hyper refers to all ranks, and the term super refers to rank 4, or tetration. So under these considerations hyperpower is misleading, since it is only referring to tetration.
• The term power tower is occasionally used, in the form "the power tower of order " for

{ \atop { }} {{\underbrace{a ^{a ^{⋅ ^{⋅ ^{a}}}} }} \atop n}. Exponentiation is easily misconstrued: note that the operation of raising to a power is right-associative (see below). Tetration is iterated exponentiation (call this right-associative operation ^), starting from the top right side of the expression with an instance a^a (call this value c). Exponentiating the next leftward a (call this the 'next base' b), is to work leftward after obtaining the new value b^c. Working to the left, use the next a to the left, as the base b, and evaluate the new b^c. 'Descend down the tower' in turn, with the new value for c on the next downward step.

Owing in part to some shared terminology and similar notational symbolism, tetration is often confused with closely related functions and expressions. Here are a few related terms:

Terminology!scope="col"

Form
Tetration	a ^{a ^{⋅ ^{⋅ ^{a ^{a}}}}}
Iterated exponentials	a ^{a ^{⋅ ^{⋅ ^{a ^{x}}}}}
Nested exponentials (also towers)	a ^{a ^{⋅ ^{⋅ ^{a _{n}}}} _{2}} _{1}
Infinite exponentials (also towers)	a ^{a ^{a ^{⋅ ^{⋅ ^{⋅}}} _{3}} _{2}} _{1}

In the first two expressions is the base, and the number of times appears is the height (add one for). In the third expression, is the height, but each of the bases is different.

Care must be taken when referring to iterated exponentials, as it is common to call expressions of this form iterated exponentiation, which is ambiguous, as this can either mean iterated powers or iterated exponentials.

Notation

There are many different notation styles that can be used to express tetration. Some notations can also be used to describe other hyperoperations, while some are limited to tetration and have no immediate extension.

Name!scope="col"

Form	Description
Rudy Rucker notation	{} ^{n} a	Used by Maurer [1901] and Goodstein [1947]; Rudy Rucker's book Infinity and the Mind popularized the notation.
Knuth's up-arrow notation	\begin{align} a {\uparrow\uparrow} n \\ a {\uparrow} ^{2} n \end{align}	Allows extension by putting more arrows, or, even more powerfully, an indexed arrow.
Conway chained arrow notation	a → n → 2	Allows extension by increasing the number 2 (equivalent with the extensions above), but also, even more powerfully, by extending the chain
Ackermann function	{} ^{n} 2 = \operatorname{A}( 4 , n - 3 ) + 3	Allows the special case a =2 to be written in terms of the Ackermann function.
Iterated exponential notation	\exp ^{n( 1 )} _{a}	Allows simple extension to iterated exponentials from initial values other than 1.
Hooshmand notations^[5]	\begin{align} &\operatorname{uxp} _{a} n \\[ 2 pt] &a ^{(n)/()} \end{align}	Used by M. H. Hooshmand [2006].
Hyperoperation notations	\begin{align} &a [ 4 ] n \\[ 2 pt] &H _{4(a,} n) \end{align}	Allows extension by increasing the number 4; this gives the family of hyperoperations.
Double caret notation		Since the up-arrow is used identically to the caret (^), tetration may be written as (^^); convenient for ASCII.

One notation above uses iterated exponential notation; this is defined in general as follows:

\exp ^{n(x)} _{a} = a ^{a ^{⋅ ^{⋅ ^{a ^{x}}}}} with s.

There are not as many notations for iterated exponentials, but here are a few:

Name!scope="col"

Form	Description
Standard notation	\exp ^{n(x)} _{a}	Euler coined the notation \exp _{a(x)} = a ^{x} , and iteration notation f ^{n(x)} has been around about as long.
Knuth's up-arrow notation	(a{\uparrow} ^{2(x))}	Allows for super-powers and super-exponential function by increasing the number of arrows; used in the article on large numbers.
Text notation		Based on standard notation; convenient for ASCII.
J Notation		Repeats the exponentiation. See J (programming language)^[6]
Infinity barrier notation	a\uparrow\uparrow n	x	Jonathan Bowers coined this,^[7] and it can be extended to higher hyper-operations

Examples

Because of the extremely fast growth of tetration, most values in the following table are too large to write in scientific notation. In these cases, iterated exponential notation is used to express them in base 10. The values containing a decimal point are approximate.

x !scope="col"

{} ^{2} x	{} ^{3} x	{} ^{4} x	{} ^{5} x	{} ^{6} x	{} ^{7} x
1	1	1	1	1	1	1
2	4 (2)	16 (2)	65,536 (2)	2.00353 × 10	\exp ^{3 ( 4 . 29508 )} _{10} (10)	\exp ^{4 ( 4 . 29508 )} _{10} (10)
3	27 (3)	7,625,597,484,987 (3)	\exp ^{3 ( 1 . 09902 )} _{10} (1.25801 × 10 ^[8])	\exp ^{4 ( 1 . 09902 )} _{10}	\exp ^{5 ( 1 . 09902 )} _{10}	\exp ^{6 ( 1 . 09902 )} _{10}
4	256 (4)	1.34078 × 10 (4)	\exp ^{3 ( 2 . 18726 )} _{10} (10)	\exp ^{4 ( 2 . 18726 )} _{10}	\exp ^{5 ( 2 . 18726 )} _{10}	\exp ^{6 ( 2 . 18726 )} _{10}
5	3,125 (5)	1.91101 × 10 (5)	\exp ^{3 ( 3 . 33928 )} _{10} (10)	\exp ^{4 ( 3 . 33928 )} _{10}	\exp ^{5 ( 3 . 33928 )} _{10}	\exp ^{6 ( 3 . 33928 )} _{10}
6	46,656 (6)	2.65912 × 10 (6)	\exp ^{3 ( 4 . 55997 )} _{10} (10)	\exp ^{4 ( 4 . 55997 )} _{10}	\exp ^{5 ( 4 . 55997 )} _{10}	\exp ^{6 ( 4 . 55997 )} _{10}
7	823,543 (7)	3.75982 × 10 (7^823,543)	\exp ^{3 ( 5 . 84259 )} _{10} (3.17742 × 10 digits)	\exp ^{4 ( 5 . 84259 )} _{10}	\exp ^{5 ( 5 . 84259 )} _{10}	\exp ^{6 ( 5 . 84259 )} _{10}
8	16,777,216 (8)	6.01452 × 10	\exp ^{3 ( 7 . 18045 )} _{10} (5.43165 × 10 digits)	\exp ^{4 ( 7 . 18045 )} _{10}	\exp ^{5 ( 7 . 18045 )} _{10}	\exp ^{6 ( 7 . 18045 )} _{10}
9	387,420,489 (9)	4.28125 × 10	\exp ^{3 ( 8 . 56784 )} _{10} (4.08535 × 10 digits)	\exp ^{4 ( 8 . 56784 )} _{10}	\exp ^{5 ( 8 . 56784 )} _{10}	\exp ^{6 ( 8 . 56784 )} _{10}
10	10,000,000,000 (10)	10	\exp ^{3 ( 10 )} _{10} (10 + 1 digits)	\exp ^{4 ( 10 )} _{10}	\exp ^{5 ( 10 )} _{10}	\exp ^{6 ( 10 )} _{10}

Remark: If x does not differ from 10 by orders of magnitude, then for all k \ge 3 ,~ ^{mx} = \exp ^{k} _{10} z,~z> 1 ~ ⇒ ~ ^{m+1} x = \exp ^{k +1} _{10} z' with z' ≈ z . For example, z - z' < 1 . 5 ⋅ 10 ^{-15} for x = 3 = k,~ m = 4 in the above table, and the difference is even smaller for the following rows.

Extensions

Tetration can be extended in two different ways; in the equation

^{na} , both the base and the height can be generalized using the definition and properties of tetration. Although the base and the height can be extended beyond the non-negative integers to different domains, including { ^{n} 0 } , complex functions such as {} ^{n} i , and heights of infinite, the more limited properties of tetration reduce the ability to extend tetration.

Extension of domain for bases

Base zero

The exponential

0 ^{0} is not consistently defined. Thus, the tetrations { ^{n} 0 } are not clearly defined by the formula given earlier. However, \lim _{x → 0} {} ^{n} x is well defined, and exists:^[9] \lim _{x → 0} {} ^{n} x = \begin{cases} 1 , & n even \\ 0 , & n odd \end{cases}

Thus we could consistently define

{} ^{n} 0 = \lim _{x →} {} ^{n} x . This is analogous to defining 0 ^{0} = 1 .

Under this extension,

{} ^{0} 0 = 1 , so the rule { ^{0} a} = 1 from the original definition still holds.

Complex bases

Since complex numbers can be raised to powers, tetration can be applied to bases of the form (where and are real). For example, in with, tetration is achieved by using the principal branch of the natural logarithm; using Euler's formula we get the relation:

i ^{a+bi} = e ^{(1)/({\pi i 2)} (a + bi)} = e ^{- (1)/({\pi b 2)} } \left(\cos + i \sin\right)

This suggests a recursive definition for given any :

\begin{align} a' & = e ^{- (1)/({\pi b 2)} } \cos \\[2pt] b' &= e^ \sin\end

The following approximate values can be derived:

Solving the inverse relation, as in the previous section, yields the expected and, with negative values of giving infinite results on the imaginary axis. Plotted in the complex plane, the entire sequence spirals to the limit, which could be interpreted as the value where is infinite.

Such tetration sequences have been studied since the time of Euler, but are poorly understood due to their chaotic behavior. Most published research historically has focused on the convergence of the infinitely iterated exponential function. Current research has greatly benefited by the advent of powerful computers with fractal and symbolic mathematics software. Much of what is known about tetration comes from general knowledge of complex dynamics and specific research of the exponential map.

Extensions of the domain for different heights

Infinite heights

Tetration can be extended to infinite heights; i.e., for certain and values in

{} ^{n} a , there exists a well defined result for an infinite . This is because for bases within a certain interval, tetration converges to a finite value as the height tends to infinity. For example, \sqrt{ 2 } ^{\sqrt{2} ^{\sqrt{2} ^{⋅ ^{⋅ ^{⋅}}} }} converges to 2, and can therefore be said to be equal to 2. The trend towards 2 can be seen by evaluating a small finite tower:\begin{align} \sqrt{ 2 } ^{\sqrt{2} ^{\sqrt{2} ^{\sqrt{2} ^{\sqrt{2} ^{1.414} }}}} &\approx \sqrt^ \\ &\approx \sqrt^ \\ &\approx \sqrt^ \\ &\approx \sqrt^ \\ &\approx 1.93\end

In general, the infinitely iterated exponential

x ^{x ^{⋅ ^{⋅ ^{⋅}}}} , defined as the limit of {} ^{n} x as goes to infinity, converges for, roughly the interval from 0.066 to 1.44, a result shown by Leonhard Euler.^[10] The limit, should it exist, is a positive real solution of the equation . Thus, . The limit defining the infinite exponential of does not exist when because the maximum of is . The limit also fails to exist when .

This may be extended to complex numbers with the definition:

{} ^{infty} z = z ^{z ^{⋅ ^{⋅ ^{⋅}}}} = (W ( -ln {z)/()}{ -ln {z}}) ~, where represents Lambert's W function.

As the limit (if existent on the positive real line, i.e. for) must satisfy we see that is (the lower branch of) the inverse function of .

Negative heights

We can use the recursive rule for tetration,

{ ^{k+1} a} = a ^{\left({ ^{k} a} \right)},

to prove

{} ^{-1} a :^{k} a = log _{a} \left( ^{k+1} a\right);

Substituting −1 for gives

{} ^{-1} a = log _{a} \left({} ^{0} a\right) = log _{a} 1 = 0 .^[11]

Smaller negative values cannot be well defined in this way. Substituting −2 for in the same equation gives

{} ^{-2} a = log _{a} \left( {} ^{-1} a \right) = log _{a} 0 = -inf ty

which is not well defined. They can, however, sometimes be considered sets.

For

n = 1 , any definition of { ^{-1} 1 } is consistent with the rule because{ ^{0} 1 } = 1 = 1 ^{n} for any n = { ^{-1} 1 } .

Real heights

At this time there is no commonly accepted solution to the general problem of extending tetration to the real or complex values of . There have, however, been multiple approaches towards the issue, and different approaches are outlined below.

In general, the problem is finding — for any real — a super-exponential function

f(x) = {} ^{x} a over real that satisfies{} ^{-1} a = 0 {} ^{0} a = 1 {} ^{x} a = a ^{\left({} ^{x-1} a\right)} for all real x > -1 . ^[12]

To find a more natural extension, one or more extra requirements are usually required. This is usually some collection of the following:

• A continuity requirement (usually just that

{} ^{x} a is continuous in both variables for x > 0 ).

• A differentiability requirement (can be once, twice, times, or infinitely differentiable in).
• A regularity requirement (implying twice differentiable in) that:

\left( (d ^{2})/(dx ^{2}) f(x) > 0 \right) for all x > 0

The fourth requirement differs from author to author, and between approaches. There are two main approaches to extending tetration to real heights; one is based on the regularity requirement, and one is based on the differentiability requirement. These two approaches seem to be so different that they may not be reconciled, as they produce results inconsistent with each other.

When

{} ^{x} a is defined for an interval of length one, the whole function easily follows for all .

Linear approximation for real heights

A linear approximation (solution to the continuity requirement, approximation to the differentiability requirement) is given by:

{} ^{x} a ≈ \begin{cases} log ^{x +1} _{a\left(} a\right) & x \le -1 \\ 1 + x & -1 < x \le 0 \\ a ^{\left( ^{x-1} a\right)} & 0 < x \end{cases}

hence:

Approximation!scope="col"

Domain
$^x\; a\; \backslash approx\; x\; +\; 1$	for
$^x\; a\; \backslash approx\; a^x$	for
$^x\; a\; \backslash approx\; a^$	for

and so on. However, it is only piecewise differentiable; at integer values of the derivative is multiplied by

ln {a} . It is continuously differentiable for x > -2 if and only if a = e . For example, using these methods {} ^{(\pi)/(2)} e ≈ 5 . 868 ... and {} ^{-4.3} 0 . 5 ≈ 4 . 03335 ...

A main theorem in Hooshmand's paper states: Let

0 < a ≠ 1 . If f:( -2 , +inf ty) → R is continuous and satisfies the conditions:f(x) = a ^{f(x-1)} forall x > -1 , f( 0 ) = 1 , f is differentiable on,f ^{\prime} is a nondecreasing or nonincreasing function on,f ^{\prime} \left( 0 ^{+\right)} = ( ln a) f ^{\prime} \left( 0 ^{-\right)} or f ^{\prime} \left( -1 ^{+\right)} = f ^{\prime} \left( 0 ^{-\right).}

then

f is uniquely determined through the equationf(x) = \exp ^{[x]} _{a} \left(a ^{(x)} \right) = \exp ^{[x +1 ]} _{a((x))} forall x > -2 ,

where

(x) = x - [x] denotes the fractional part of and \exp ^{[x]} _{a} is the [x] -iterated function of the function \exp _{a} .

The proof is that the second through fourth conditions trivially imply that is a linear function on .

The linear approximation to natural tetration function

{} ^{xe} is continuously differentiable, but its second derivative does not exist at integer values of its argument. Hooshmand derived another uniqueness theorem for it which states:

If

f: ( -2 , +inf ty) → R is a continuous function that satisfies:f(x) = e ^{f(x-1)} forall x > -1 , f( 0 ) = 1 , f is convex on,f ^{\prime} \left( 0 ^{-\right)} \leq f ^{\prime} \left( 0 ^{+\right).}

then

f = uxp . [Here <math>f = \text{uxp}</math> is Hooshmand's name for the linear approximation to the natural tetration function.]

The proof is much the same as before; the recursion equation ensures that

f ^{\prime} ( -1 ^{+)} = f ^{\prime} ( 0 ^{+),} and then the convexity condition implies that f is linear on .

Therefore, the linear approximation to natural tetration is the only solution of the equation

f(x) = e ^{f(x-1)} (x > -1 ) and f( 0 ) = 1 which is convex on . All other sufficiently-differentiable solutions must have an inflection point on the interval .

Higher order approximations for real heights

Beyond linear approximations, a quadratic approximation (to the differentiability requirement) is given by:

{} ^{x} a ≈ \begin{cases} log ^{x +1} _{a\left({}} a\right) & x \le -1 \\ 1 + (2ln (a))/(1 + ln (a)) x - (1 - ln (a))/(1 + ln (a)) x ^{2} & -1 < x \le 0 \\ a ^{\left({} ^{x-1} a\right)} & x > 0 \end{cases}

which is differentiable for all

x > 0 , but not twice differentiable. For example, {} ^{(1)/(2)} 2 ≈ 1 . 45933 ... If a = e this is the same as the linear approximation.

Because of the way it is calculated, this function does not "cancel out", contrary to exponents, where

\left(a ^{(1)/(n)} \right) ^{n} = a . Namely,{} ^{n\left({}} ^{(1)/(n)} a\right) = \underbrace{ \left({} ^{(1)/(n)} a\right) ^{(1)/(n)} a\right) ^{⋅ ^{⋅ ^{⋅ ^{⋅ ^{\left({} ^{(1)/(n)} a\right)}}}} } } } _{n} ≠ a .

Just as there is a quadratic approximation, cubic approximations and methods for generalizing to approximations of degree also exist, although they are much more unwieldy.^[13]

Complex heights

In 2017, it was proven^[14] that there exists a unique function which is a solution of the equation and satisfies the additional conditions that and approaches the fixed points of the logarithm (roughly) as approaches and that is holomorphic in the whole complex -plane, except the part of the real axis at . This proof confirms a previous conjecture.^[15] The construction of such a function was originally demonstrated by Kneser in 1950.^[16] The complex map of this function is shown in the figure at right. The proof also works for other bases besides e, as long as the base is greater than

e ^{(1)/(e)} ≈ 1 . 445 . Subsequent work extended the construction to all complex bases.^[17]

The requirement of the tetration being holomorphic is important for its uniqueness. Many functions can be constructed as

S(z) = F\left(~z~ + \sum ^{inf ty} _{n =1} \sin( 2 \pi nz)~ \alpha _{n} + \sum ^{inf ty} _{n =1} ( 1 - \cos( 2 \pi nz) ) ~\beta _{n} \right)

where and are real sequences which decay fast enough to provide the convergence of the series, at least at moderate values of .

The function satisfies the tetration equations,, and if and approach 0 fast enough it will be analytic on a neighborhood of the positive real axis. However, if some elements of or are not zero, then function has multitudes of additional singularities and cutlines in the complex plane, due to the exponential growth of sin and cos along the imaginary axis; the smaller the coefficients and are, the further away these singularities are from the real axis.

The extension of tetration into the complex plane is thus essential for the uniqueness; the real-analytic tetration is not unique.

Ordinal tetration

Tetration can be defined for ordinal numbers via transfinite induction. For all and all :$$^0\backslash alpha\; =\; 1$$$$^\backslash beta\backslash alpha\; =\; \backslash sup(\backslash )\backslash ,.$$

Non-elementary recursiveness

Tetration (restricted to

N ^{2} ) is not an elementary recursive function. One can prove by induction that for every elementary recursive function, there is a constant such thatf(x) \leq \underbrace{ 2 ^{2 ^{⋅ ^{⋅ ^{x}}}} }_c.We denote the right hand side by g(c, x) . Suppose on the contrary that tetration is elementary recursive. g(x, x) +1 is also elementary recursive. By the above inequality, there is a constant such that g(x,x) +1 \leq g(c, x) . By letting x = c , we have that g(c,c) + 1 \leq g(c, c) , a contradiction.

Inverse operations

Exponentiation has two inverse operations; roots and logarithms. Analogously, the inverses of tetration are often called the super-root, and the super-logarithm (In fact, all hyperoperations greater than or equal to 3 have analogous inverses); e.g., in the function

{ ^{3}y=x} , the two inverses are the cube super-root of and the super-logarithm base  of .

Super-root

The super-root is the inverse operation of tetration with respect to the base: if

^{n} y = x , then is an th super-root of (\sqrt[n]{x} _{s} or \sqrt[ 4 ]{x} _{s} ).

For example,

^{4} 2 = 2 ^{2 ^{2 ^{2}}} = 65 {,} 536

so 2 is the 4th super-root of 65,536.

Square super-root

The 2nd-order super-root, square super-root, or super square root has two equivalent notations,

ssrt (x) and \sqrt{x} _{s} . It is the inverse of ^{2} x = x ^{x} and can be represented with the Lambert W function:^[18] ssrt (x) = e ^{W(ln} = (ln x)/(W( ln x))

The function also illustrates the reflective nature of the root and logarithm functions as the equation below only holds true when

y = ssrt (x) :\sqrt[y]{x} = log _{y} x

Like square roots, the square super-root of may not have a single solution. Unlike square roots, determining the number of square super-roots of may be difficult. In general, if

e ^{-1/e} <x< 1 , then has two positive square super-roots between 0 and 1; and if x > 1 , then has one positive square super-root greater than 1. If is positive and less than e ^{-1/e} it does not have any real square super-roots, but the formula given above yields countably infinitely many complex ones for any finite not equal to 1. The function has been used to determine the size of data clusters.^[19]

At

x = 1 :

Other super-roots

For each integer, the function is defined and increasing for, and, so that the th super-root of,

\sqrt[n]{x} _{s} , exists for .

One of the simpler and faster formulas for a third-degree super-root is the recursive formula, if:, and next, for example .

However, if the linear approximation above is used, then

^{y} x = y + 1 if, so ^{y} \sqrt{y + 1 } _{s} cannot exist.

In the same way as the square super-root, terminology for other super-roots can be based on the normal roots: "cube super-roots" can be expressed as

\sqrt[ 3 ]{x} _{s} ; the "4th super-root" can be expressed as \sqrt[ 4 ]{x} _{s} ; and the "th super-root" is \sqrt[n]{x} _{s} . Note that \sqrt[n]{x} _{s} may not be uniquely defined, because there may be more than one root. For example, has a single (real) super-root if is odd, and up to two if is even.

Just as with the extension of tetration to infinite heights, the super-root can be extended to, being well-defined if . Note that

x = { ^{infty} y} = y ^{\left[ ^{infty} y\right]} = y ^{x,} and thus that y = x ^{1/x} . Therefore, when it is well defined, \sqrt[ inf ty]{x} _{s} = x ^{1/x} and, unlike normal tetration, is an elementary function. For example, \sqrt[ inf ty]{ 2 } _{s} = 2 ^{1/2} = \sqrt{ 2 } .

It follows from the Gelfond–Schneider theorem that super-root

\sqrt{n} _{s} for any positive integer is either integer or transcendental, and \sqrt[ 3 ]{n} _{s} is either integer or irrational. It is still an open question whether irrational super-roots are transcendental in the latter case.

Super-logarithm

See main article: Super-logarithm. Once a continuous increasing (in) definition of tetration,, is selected, the corresponding super-logarithm

\operatorname{slog} _{ax} or log ^{4} _{ax} is defined for all real numbers, and .

The function satisfies:

\begin{align} \operatorname{slog} _{a} { ^{x} a} & = x \\ \operatorname{slog} _{a} a ^{x} & = 1 + \operatorname{slog} _{a} x \\ \operatorname{slog} _{a} x & = 1 + \operatorname{slog} _{a} log _{a} x \\ \operatorname{slog} _{a} x &\geq -2 \end{align}

Open questions

Other than the problems with the extensions of tetration, there are several open questions concerning tetration, particularly when concerning the relations between number systems such as integers and irrational numbers:

• It is not known whether there is a positive integer for which or is an integer. In particular, it is not known whether either of or is an integer.^[20]
• It is not known whether is rational for any positive integer and positive non-integer rational .^[21] For example, it is not known whether the positive root of the equation is a rational number.
• It is not known whether or are rationals or not.

Applications

For each graph H on h vertices and each, define

D =2 \uparrow\uparrow 5 h ^{4log(1/\varepsilon).} Then each graph G on n vertices with at most copies of H can be made H-free by removing at most edges.^[22]

See also

• Ackermann function
• Big O notation
• Double exponential function
• Hyperoperation
• Iterated logarithm
• Symmetric level-index arithmetic

References

• Daniel Geisler, Tetration
• Ioannis Galidakis, On extending hyper4 to nonintegers (undated, 2006 or earlier) (A simpler, easier to read review of the next reference)
• Ioannis Galidakis, On Extending hyper4 and Knuth's Up-arrow Notation to the Reals (undated, 2006 or earlier).
• Robert Munafo, Extension of the hyper4 function to reals (An informal discussion about extending tetration to the real numbers.)
• Lode Vandevenne, Tetration of the Square Root of Two. (2004). (Attempt to extend tetration to real numbers.)
• Ioannis Galidakis, Mathematics, (Definitive list of references to tetration research. Much information on the Lambert W function, Riemann surfaces, and analytic continuation.)
• Joseph MacDonell, Some Critical Points of the Hyperpower Function .
• Dave L. Renfro, Web pages for infinitely iterated exponentials
• Knobel . R. . 1981 . Exponentials Reiterated . . 88 . 4 . 235–252 . 10.1080/00029890.1981.11995239.
• Hans Maurer, "Über die Funktion

y = x ^{[x ^{[x( … )]} ]} für ganzzahliges Argument (Abundanzen)." Mittheilungen der Mathematische Gesellschaft in Hamburg 4, (1901), p. 33–50. (Reference to usage of { ^{n} a} from Knobel's paper.)

• The Fourth Operation
• Luca Moroni, The strange properties of the infinite power tower (https://arxiv.org/abs/1908.05559)

Notes and References

1. Neyrinck, Mark. An Investigation of Arithmetic Operations. Retrieved 9 January 2019.
2. R. L. Goodstein . Transfinite ordinals in recursive number theory . 2266486 . Journal of Symbolic Logic . 12 . 1947 . 4 . 10.2307/2266486 . 123–129. 1318943 .
3. N. Bromer . Superexponentiation . Mathematics Magazine . 60 . 3 . 1987 . 169–174 . 2689566. 10.1080/0025570X.1987.11977296 .
4. J. F. MacDonnell . Somecritical points of the hyperpower function x ^{x ^{...}} . International Journal of Mathematical Education . 1989 . 20 . 2 . 297–305 . 994348 . 10.1080/0020739890200210.
5. M. H. . Hooshmand . 2006 . Ultra power and ultra exponential functions . . 17 . 8 . 549–558 . 10.1080/10652460500422247 . 120431576.
6. Web site: Power Verb . J Vocabulary . J Software . 28 October 2011.
7. Web site: Spaces . 17 February 2022.
8. DiModica, Thomas. Tetration Values. Retrieved 15 October 2023.
9. Web site: Climbing the ladder of hyper operators: tetration . Stack Exchange Mathematics Blog . math.blogoverflow.com . 2019-07-25.
10. Euler, L. "De serie Lambertina Plurimisque eius insignibus proprietatibus." Acta Acad. Scient. Petropol. 2, 29–51, 1783. Reprinted in Euler, L. Opera Omnia, Series Prima, Vol. 6: Commentationes Algebraicae. Leipzig, Germany: Teubner, pp. 350–369, 1921. (facsimile)
11. Web site: Reihenalgebra: What comes beyond exponentiation? . Müller . M. . 12 December 2018 . 2013-12-02 . https://web.archive.org/web/20131202235053/http://www.mpmueller.net/reihenalgebra.pdf . dead .
12. Web site: 5+ methods for real analytic tetration . Trappmann . Henryk . Kouznetsov . Dmitrii . 28 June 2010 . 5 December 2018.
13. Andrew Robbins. Solving for the Analytic Piecewise Extension of Tetration and the Super-logarithm. The extensions are found in part two of the paper, "Beginning of Results".
14. W. . Paulsen . S. . Cowgill . Solving F(z +1 ) = b ^{F(z)} in the complex plane . Advances in Computational Mathematics . 1–22 . March 2017 . 10.1007/s10444-017-9524-1 . 43 . 9402035.
15. D. . Kouznetsov . Solution of F(z + 1 ) = \exp(F(z)) in complex z -plane . . 78 . 267 . 1647–1670 . July 2009 . 10.1090/S0025-5718-09-02188-7. free .
16. . H. . Kneser . de . Reelle analytische Lösungen der Gleichung \varphi ( \varphi(x) ) = {\rm e} ^{x} und verwandter Funktionalgleichungen . 187 . 56–67 . 1950.
17. W. . Paulsen . Tetration for complex bases . Advances in Computational Mathematics . 243–267 . June 2018 . 10.1007/s10444-018-9615-7 . 45 . 67866004.
18. Corless . R. M. . Gonnet . G. H. . Hare . D. E. G. . Jeffrey . D. J. . Knuth . D. E. . Donald Knuth . or http://www.apmaths.uwo.ca/~djeffrey/Offprints/W-adv-cm.pdf --> On the Lambert W function . Advances in Computational Mathematics . 5 . 333 . 1996 . . 10.1007/BF02124750 . 1809.07369 . 29028411.
19. Krishnam, R. (2004), "Efficient Self-Organization Of Large Wireless Sensor Networks" – Dissertation, BOSTON UNIVERSITY, COLLEGE OF ENGINEERING. pp. 37–40
20. Web site: Bischoff . Manon . A Wild Claim about the Powers of Pi Creates a Transcendental Mystery . Scientific American . 23 April 2024 . https://web.archive.org/web/20240424025038/https://www.scientificamerican.com/article/a-wild-claim-about-the-powers-of-pi-creates-a-transcendental-mystery/ . 24 April 2024 . en . 24 January 2024 . live.
21. http://condor.depaul.edu/mash/atotheamg.pdf Marshall, Ash J., and Tan, Yiren, "A rational number of the form with irrational", Mathematical Gazette 96, March 2012, pp. 106–109.
22. Jacob Fox, A new proof of the graph removal lemma, arXiv preprint (2010). arXiv:1006.1300 [math.CO]