# Tetration

Not to be confused with titration.
Complex plot of the holomorphic tetration ${\displaystyle {}^{z}e}$, with hue representing the function argument and brightness representing magnitude
${\displaystyle {}^{n}x}$, for n = 1, 2, 3 ..., showing convergence to the infinitely iterated exponential between the two dots

In mathematics, tetration (or hyper-4) is the next hyperoperation after exponentiation, and is defined as iterated exponentiation. The word was coined by Reuben Louis Goodstein, from tetra- (four) and iteration. Tetration is used for the notation of very large numbers. The notation ${\displaystyle {^{n}a}}$ means ${\displaystyle {a^{a^{\cdot ^{\cdot ^{a}}}}}}$, the application of exponentiation ${\displaystyle n}$ times.

Shown here are the first four hyperoperations, with tetration as the fourth (and succession, the unary operation denoted ${\displaystyle a'=a+1}$ taking ${\displaystyle a}$ and yielding the number after ${\displaystyle a}$, as the 0th):

${\displaystyle a+n=a+\underbrace {1+1+\cdots +1} _{n}}$
n copies of 1 added to a.
2. Multiplication
${\displaystyle a\times n=\underbrace {a+a+\cdots +a} _{n}}$
n copies of a combined by addition.
3. Exponentiation
${\displaystyle a^{n}=\underbrace {a\times a\times \cdots \times a} _{n}}$
n copies of a combined by multiplication.
4. Tetration
${\displaystyle {^{n}a}=\underbrace {a^{a^{\cdot ^{\cdot ^{a}}}}} _{n}}$
n copies of a combined by exponentiation, right-to-left.

The above example is read as "the nth tetration of a". Each operation is defined by iterating the previous one (the next operation in the sequence is pentation). Tetration is neither an elementary function nor an elementary recursive function.[1]

Here, succession ${\displaystyle (a'=a+1)}$ is the most basic operation; addition ${\displaystyle (a+n)}$ is a primary operation, though for natural numbers it can be thought of as a chained succession of n successors of a; multiplication (${\displaystyle an}$) is also a primary operation, though for natural numbers it can be thought of as a chained addition involving n numbers a; and exponentiation (${\displaystyle a^{n}}$) can be thought of as a chained multiplication involving n numbers a. Analogously, tetration (${\displaystyle ^{n}a}$) can be thought of as a chained power involving n numbers a. The parameter a may be called the base-parameter in the following, while the parameter n in the following may be called the height-parameter (which is integral in the first approach but may be generalized to fractional, real and complex heights, see below).

## Definition

For any positive real ${\displaystyle a>0}$ and non-negative integer ${\displaystyle n\geq 0}$, we define ${\displaystyle \,\!{^{n}a}}$ by:

${\displaystyle {^{n}a}:={\begin{cases}1&{\text{if }}n=0\\a^{\left[^{(n-1)}a\right]}&{\text{if }}n>0\end{cases}}}$

## Iterated powers vs. iterated exponentials

As we can see from the definition, when evaluating tetration expressed as an "exponentiation tower", the exponentiation is done at the deepest level first (in the notation, at the highest level). For example:

${\displaystyle \,\!\ ^{4}2=2^{2^{2^{2}}}=2^{\left[2^{\left(2^{2}\right)}\right]}=2^{\left(2^{4}\right)}=2^{16}=65,\!536}$

Note that exponentiation is not associative, so evaluating the expression in the other order will lead to a different answer:

${\displaystyle \,\!2^{2^{2^{2}}}\neq \left[{\left(2^{2}\right)}^{2}\right]^{2}=2^{2\cdot 2\cdot 2}=256}$

Exponential towers must be evaluated from top to bottom (or right to left). Computer programmers refer to this choice as right-associative.

When a and 10 are coprime, we can compute the last m decimal digits of ${\displaystyle \,\!\ ^{n}a}$ using Euler's theorem.

## 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[5] is occasionally used, in the form "the power tower of order n" for ${\displaystyle {\ \atop {\ }}{{\underbrace {a^{a^{\cdot ^{\cdot ^{a}}}}} } \atop n}}$. This is a misnomer, however, because tetration cannot be expressed with iterated power functions (see above), since it is an iterated exponential function.

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:

Form Terminology
${\displaystyle a^{a^{\cdot ^{\cdot ^{a^{a}}}}}}$ Tetration
${\displaystyle a^{a^{\cdot ^{\cdot ^{a^{x}}}}}}$ Iterated exponentials
${\displaystyle a_{1}^{a_{2}^{\cdot ^{\cdot ^{a_{n}}}}}}$ Nested exponentials (also towers)
${\displaystyle a_{1}^{a_{2}^{a_{3}^{\cdot ^{\cdot ^{\cdot }}}}}}$ Infinite exponentials (also towers)

In the first two expressions a is the base, and the number of times a appears is the height (add one for x). In the third expression, n 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 (also known as hyper-4; some of them can be used as well for hyper-5, hyper-6, and higher hyperoperations).

Name Form Description
Standard notation ${\displaystyle \,{}^{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 ${\displaystyle a{\uparrow \uparrow }n}$ Allows extension by putting more arrows, or, even more powerfully, an indexed arrow.
Conway chained arrow notation ${\displaystyle a\rightarrow n\rightarrow 2}$ Allows extension by increasing the number 2 (equivalent with the extensions above), but also, even more powerfully, by extending the chain
Ackermann function ${\displaystyle {}^{n}2=\operatorname {A} (4,n-3)+3}$ Allows the special case ${\displaystyle a=2}$ to be written in terms of the Ackermann function.
Iterated exponential notation ${\displaystyle {}^{n}a=\exp _{a}^{n}(1)}$ Allows simple extension to iterated exponentials from initial values other than 1.
Hooshmand notations[6] ${\displaystyle \operatorname {uxp} _{a}n}$
${\displaystyle a^{\frac {n}{}}}$
Hyperoperation notations ${\displaystyle a[4]n}$
${\displaystyle H_{4}(a,n)}$
Allows extension by increasing the number 4; this gives the family of hyperoperations
Text notation a^^n Since the up-arrow is used identically to the caret (^), tetration may be written as (^^); convenient for ASCII.
Bowers' array notation {a,b,2}

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

${\displaystyle \exp _{a}^{n}(x)=a^{a^{\cdot ^{\cdot ^{a^{x}}}}}}$ with n "a"s.

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

Name Form Description
Standard notation ${\displaystyle \exp _{a}^{n}(x)}$ Euler coined the notation ${\displaystyle \exp _{a}(x)=a^{x}}$, and iteration notation ${\displaystyle f^{n}(x)}$ has been around about as long.
Knuth's up-arrow notation ${\displaystyle (a{\uparrow })^{n}(x)}$ Allows for super-powers and super-exponential function by increasing the number of arrows; used in the article on large numbers.
Ioannis Galidakis' notation ${\displaystyle \,{}^{n}(a,x)}$ Allows for large expressions in the base.[7]
Text notation exp_a^n(x) Based on standard notation; convenient for ASCII.
J Notation x^^:(n-1)x Repeats the exponentiation. See J (programming language)[8]

## Examples

In the following table, most values are too large to write in scientific notation, so iterated exponential notation is employed to express them in base 10. The values containing a decimal point are approximate.

${\displaystyle x}$ ${\displaystyle {}^{2}x}$ ${\displaystyle {}^{3}x}$ ${\displaystyle {}^{4}x}$ ${\displaystyle {}^{5}x}$
1 1 1 1 1
2 4 16 65,536 2.00353 × 1019,728
3 27 7,625,597,484,987 ${\displaystyle \exp _{10}^{3}(1.09902)}$ (3.6 × 1012 digits) ${\displaystyle \exp _{10}^{4}(1.09902)}$
4 256 1.34078 × 10154 ${\displaystyle \exp _{10}^{3}(2.18726)}$ (8.1 × 10153 digits) ${\displaystyle \exp _{10}^{4}(2.18726)}$
5 3,125 1.91101 × 102,184 ${\displaystyle \exp _{10}^{3}(3.33928)}$ (1.3 × 102,184 digits) ${\displaystyle \exp _{10}^{4}(3.33928)}$
6 46,656 2.65912 × 1036,305 ${\displaystyle \exp _{10}^{3}(4.55997)}$ (2.1 × 1036,305 digits) ${\displaystyle \exp _{10}^{4}(4.55997)}$
7 823,543 3.75982 × 10695,974 ${\displaystyle \exp _{10}^{3}(5.84259)}$ (3.2 × 10695,974 digits) ${\displaystyle \exp _{10}^{4}(5.84259)}$
8 16,777,216 6.01452 × 1015,151,335 ${\displaystyle \exp _{10}^{3}(7.18045)}$ (5.4 × 1015,151,335 digits) ${\displaystyle \exp _{10}^{4}(7.18045)}$
9 387,420,489 ${\displaystyle \exp _{10}^{2}(8.56784)}$ (3.7 × 108 digits) ${\displaystyle \exp _{10}^{3}(8.56784)}$ (4.1 × 10369,693,099 digits) ${\displaystyle \exp _{10}^{4}(8.56784)}$
10 10,000,000,000 1010,000,000,000 ${\displaystyle \exp _{10}^{3}(10)}$ (1010,000,000,000 digits) ${\displaystyle \exp _{10}^{4}(10)}$

## Extensions

Tetration can be extended to define ${\displaystyle {^{n}0}}$ and other domains as well.

### Extension of domain for bases

#### Extension to base zero

The exponential ${\displaystyle 0^{0}}$ is not consistently defined. Thus, the tetrations ${\displaystyle \,{^{n}0}}$ are not clearly defined by the formula given earlier. However, ${\displaystyle \lim _{x\rightarrow 0}{}^{n}x}$ is well defined, and exists:

${\displaystyle \lim _{x\rightarrow 0}{}^{n}x={\begin{cases}1,&n{\text{ even}}\\0,&n{\text{ odd}}\end{cases}}}$

Thus we could consistently define ${\displaystyle {}^{n}0=\lim _{x\rightarrow 0}{}^{n}x}$. This is equivalent to defining ${\displaystyle 0^{0}=1}$.

Under this extension, ${\displaystyle {}^{0}0=1}$, so the rule ${\displaystyle {^{0}a}=1}$ from the original definition still holds.

#### Extension to complex bases

Tetration by period
Tetration by escape

Since complex numbers can be raised to powers, tetration can be applied to bases of the form ${\displaystyle \scriptstyle z\;=\;a+bi}$, where ${\displaystyle \scriptstyle i^{2}\;=\;-1}$. For example, ${\displaystyle \scriptstyle {}^{n}z}$ where ${\displaystyle \scriptstyle z\;=\;i}$, tetration is achieved by using the principal branch of the natural logarithm, and using Euler's formula we get the relation:

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

This suggests a recursive definition for ${\displaystyle \scriptstyle {}^{(n+1)}i\;=\;a'+b'i}$ given any ${\displaystyle \scriptstyle {}^{n}i\;=\;a+bi}$:

{\displaystyle {\begin{aligned}a'&=e^{-{\frac {1}{2}}{\pi b}}\cos {\frac {\pi a}{2}}\\b'&=e^{-{\frac {1}{2}}{\pi b}}\sin {\frac {\pi a}{2}}\end{aligned}}}

The following approximate values can be derived:

${\displaystyle {\begin{array}{l|l}{}^{n}i&{\text{Approximate Value}}\\\hline {}^{1}i=i&i\\{}^{2}i=i^{\left({}^{1}i\right)}&0.2079\\{}^{3}i=i^{\left({}^{2}i\right)}&0.9472+0.3208i\\{}^{4}i=i^{\left({}^{3}i\right)}&0.0501+0.6021i\\{}^{5}i=i^{\left({}^{4}i\right)}&0.3872+0.0305i\\{}^{6}i=i^{\left({}^{5}i\right)}&0.7823+0.5446i\\{}^{7}i=i^{\left({}^{6}i\right)}&0.1426+0.4005i\\{}^{8}i=i^{\left({}^{7}i\right)}&0.5198+0.1184i\\{}^{9}i=i^{\left({}^{8}i\right)}&0.5686+0.6051i\end{array}}}$

Solving the inverse relation as in the previous section, yields the expected ${\displaystyle \scriptstyle \,{}^{0}i\;=\;1}$ and ${\displaystyle \scriptstyle \,{}^{(-1)}i\;=\;0}$, with negative values of n giving infinite results on the imaginary axis. Plotted in the complex plane, the entire sequence spirals to the limit ${\displaystyle 0.4383+0.3606i}$, which could be interpreted as the value where n 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 (iteration) "heights"

#### Extension to infinite heights

${\displaystyle \textstyle \lim _{n\rightarrow \infty }{}^{n}x}$ of the infinitely iterated exponential converges for the bases ${\displaystyle \textstyle (e^{-1})^{e}\leq x\leq e^{e^{-1}})}$
The function ${\displaystyle \left|{\frac {\mathrm {W} (-\ln {z})}{-\ln {z}}}\right|}$ on the complex plane, showing the real-valued infinitely iterated exponential function (black curve)

Tetration can be extended to infinite heights[9] (n in ${\displaystyle {}^{n}a}$). This is because for bases within a certain interval, tetration converges to a finite value as the height tends to infinity. For example, ${\displaystyle {\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{\cdot ^{\cdot ^{\cdot }}}}}}$ 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:

{\displaystyle {\begin{aligned}{\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{1.414}}}}}&\approx {\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{1.63}}}}\\&\approx {\sqrt {2}}^{{\sqrt {2}}^{{\sqrt {2}}^{1.76}}}\\&\approx {\sqrt {2}}^{{\sqrt {2}}^{1.84}}\\&\approx {\sqrt {2}}^{1.89}\\&\approx 1.93\end{aligned}}}

In general, the infinitely iterated exponential ${\displaystyle x^{x^{\cdot ^{\cdot ^{\cdot }}}}}$, defined as the limit of ${\displaystyle {}^{n}x}$ as n goes to infinity, converges for ee ≤ x ≤ e1/e, 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 y = xy. Thus, x = y1/y. The limit defining the infinite tetration of x fails to converge for x > e1/e because the maximum of y1/y is e1/e.

This may be extended to complex numbers z with the definition:

${\displaystyle {}^{\infty }z=z^{z^{\cdot ^{\cdot ^{\cdot }}}}={\frac {\mathrm {W} (-\ln {z})}{-\ln {z}}}~,}$

where W represents Lambert's W function.

As the limit y = x (if existent, i.e. for ee < x < e1/e) must satisfy xy = y we see that x ↦ y = x is (the lower branch of) the inverse function of y ↦ x = y1/y.

#### (Limited) extension to negative heights

In order to preserve the original rule:

${\displaystyle {^{(k+1)}a}=a^{({^{k}a})}}$

for negative values of ${\displaystyle k}$ we must use the recursive relation:

${\displaystyle {^{k}a}=\log _{a}\left({^{(k+1)}a}\right)}$

Thus:

${\displaystyle {}^{(-1)}a=\log _{a}\left({}^{0}a\right)=\log _{a}1=0}$

However smaller negative values cannot be well defined in this way because

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

which is not well defined.

Note further that for ${\displaystyle n=1}$ any definition of ${\displaystyle \,\!{^{(-1)}1}}$ is consistent with the rule because

${\displaystyle {^{0}1}=1=1^{n}}$ for any ${\displaystyle \,\!n={^{(-1)}1}}$.

#### Extension to 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 ${\displaystyle n}$. Various approaches are mentioned below.

In general the problem is finding, for any real a > 0, a super-exponential function ${\displaystyle \,f(x)={}^{x}a}$ over real x > −2 that satisfies

• ${\displaystyle \,{}^{(-1)}a=0}$
• ${\displaystyle \,{}^{0}a=1}$
• ${\displaystyle \,{}^{x}a=a^{\left({}^{(x-1)}a\right)}{\text{ for all real }}x>-1.}$
• A fourth requirement that is usually one of:
• A continuity requirement (usually just that ${\displaystyle {}^{x}a}$ is continuous in both variables for ${\displaystyle x>0}$).
• A differentiability requirement (can be once, twice, k times, or infinitely differentiable in x).
• A regularity requirement (implying twice differentiable in x) that:
${\displaystyle \left({\frac {d^{2}}{dx^{2}}}f(x)>0\right)}$ for all ${\displaystyle 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 ${\displaystyle \,{}^{x}a}$ is defined for an interval of length one, the whole function easily follows for all x > −2.

##### Linear approximation for the extension to real heights
${\displaystyle \,{}^{x}e}$ using linear approximation.

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

${\displaystyle {}^{x}a\approx {\begin{cases}\log _{a}(^{x+1}a)&x\leq -1\\1+x&-1

hence:

${\displaystyle {\begin{array}{l|l}{\text{Approximation}}&{\text{Domain}}\\\hline {}^{x}a\approx x+1&{\text{for }}-1

and so on. However, it is only piecewise differentiable; at integer values of x the derivative is multiplied by ${\displaystyle \ln {a}}$. It is continuously differentiable for ${\displaystyle x>-2}$ if and only if ${\displaystyle a=e}$.

Examples: ${\displaystyle {}^{\pi /2}e\approx 5.868...,{}^{-4.3}0.5\approx 4.03335...}$

A main theorem in Hooshmand's paper[6] states: Let ${\displaystyle 0. If ${\displaystyle f:(-2,+\infty )\rightarrow \mathbb {R} }$ is continuous and satisfies the conditions:

• ${\displaystyle f(x)=a^{f(x-1)}\;\;{\text{for all}}\;\;x>-1,\;f(0)=1,}$
• ${\displaystyle f}$ is differentiable on ${\displaystyle (-1,0),}$
• ${\displaystyle f^{\prime }}$ is a nondecreasing or nonincreasing function on ${\displaystyle (-1,0),}$
• ${\displaystyle f^{\prime }(0^{+})=(\ln a)f^{\prime }(0^{-}){\text{ or }}f^{\prime }(-1^{+})=f^{\prime }(0^{-}).}$

then ${\displaystyle f}$ is uniquely determined through the equation

${\displaystyle f(x)=\exp _{a}^{[x]}\left(a^{(x)}\right)=\exp _{a}^{[x+1]}((x))\quad {\text{for all}}\;\;x>-2,}$

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

The proof is that the second through fourth conditions trivially imply that f is a linear function on [−1, 0].

The linear approximation to natural tetration function ${\displaystyle {}^{x}e}$ 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 ${\displaystyle f:(-2,+\infty )\rightarrow \mathbb {R} }$ is a continuous function that satisfies:

• ${\displaystyle f(x)=e^{f(x-1)}\;\;{\text{for all}}\;\;x>-1,\;f(0)=1,}$
• ${\displaystyle f}$ is convex on ${\displaystyle (-1,0),}$
• ${\displaystyle f^{\prime }(0^{-})\leq f^{\prime }(0^{+}).}$

then ${\displaystyle f={\text{uxp}}}$. [Here ${\displaystyle f={\text{uxp}}}$ 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 ${\displaystyle f^{\prime }(-1^{+})=f^{\prime }(0^{+}),}$ and then the convexity condition implies that ${\displaystyle f}$ is linear on (−1, 0).

Therefore, the linear approximation to natural tetration is the only solution of the equation ${\displaystyle f(x)=e^{f(x-1)}\;\;(x>-1)}$ and ${\displaystyle f(0)=1}$ which is convex on ${\displaystyle (-1,+\infty )}$. All other sufficiently-differentiable solutions must have an inflection point on the interval (−1, 0).

##### Higher order approximations for the extension to real heights

A quadratic approximation (to the differentiability requirement) is given by:

${\displaystyle {}^{x}a\approx {\begin{cases}\log _{a}({}^{x+1}a)&x\leq -1\\1+{\frac {2\ln(a)}{1\;+\;\ln(a)}}x-{\frac {1\;-\;\ln(a)}{1\;+\;\ln(a)}}x^{2}&-1

which is differentiable for all ${\displaystyle x>0}$, but not twice differentiable. If ${\displaystyle a=e}$ this is the same as the linear approximation.

Note that this function does not satisfy condition that tetration "cancels out" (for example as in raising to power: ${\displaystyle (a^{1/n})^{n}=a}$), because it is calculated top-down (as explained in section Iterated powers above) namely:

${\displaystyle {}^{n}({}^{1/n}a)=\underbrace {({}^{1/n}a)^{({}^{1/n}a)^{\cdot ^{\cdot ^{\cdot ^{\cdot ^{({}^{1/n}a)}}}}}}} _{n}\neq a}$.

A cubic approximation and a method for generalizing to approximations of degree n are given at.[11]

#### Extension to complex heights

Drawing of the analytic extension ${\displaystyle f=F(x+{\rm {i}}y)}$ of tetration to the complex plane. Levels ${\displaystyle |f|=1,e^{\pm 1},e^{\pm 2},\ldots }$ and levels ${\displaystyle \arg(f)=0,\pm 1,\pm 2,\ldots }$ are shown with thick curves.

There is a conjecture[12] that there exists a unique function F which is a solution of the equation F(z+1)=exp(F(z)) and satisfies the additional conditions that F(0)=1 and F(z) approaches the fixed points of the logarithm (roughly 0.318 ± 1.337i) as z approaches ±i∞ and that F is holomorphic in the whole complex z-plane, except the part of the real axis at z≤−2. This function is shown in the figure at right. The complex double precision approximation of this function is available online.[citation needed]

The requirement of the tetration being holomorphic is important for its uniqueness. Many functions ${\displaystyle S}$ can be constructed as

${\displaystyle S(z)=F\!\left(~z~+\sum _{n=1}^{\infty }\sin(2\pi nz)~\alpha _{n}+\sum _{n=1}^{\infty }{\Big (}1-\cos(2\pi nz){\Big )}~\beta _{n}\right)}$

where ${\displaystyle \alpha }$ and ${\displaystyle \beta }$ are real sequences which decay fast enough to provide the convergence of the series, at least at moderate values of ${\displaystyle \Im (z)}$.

The function S satisfies the tetration equations S(z+1)=exp(S(z)), S(0)=1, and if αn and βn 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 S 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.

## Open questions

• It is not known whether there is a positive integer n for which nπ or ne is an integer. In particular, it is not known whether 4π is an integer.
• It is not known whether nq is an integer for any positive integer n and positive non-integer rational q.[13] Particularly, it is not known whether the positive root of the equation 4x = 2 is a rational number.

## 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.

### Super-root

The super-root is the inverse operation of tetration with respect to the base: if ${\displaystyle ^{n}y=x}$, then y is an nth super root of x. For example,

${\displaystyle ^{4}2=2^{2^{2^{2}}}=65,536}$

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

${\displaystyle ^{3}3=3^{3^{3}}=7,625,597,484,987}$

so 3 is the 3rd super-root (or super cube root) of 7,625,597,484,987.

#### Square super-root

The graph y = ${\displaystyle {\sqrt {x}}_{s}}$.

The 2nd-order super-root, square super-root, or super square root has two equivalent notations, ${\displaystyle \mathrm {ssrt} (x)}$ and ${\displaystyle {\sqrt {x}}_{s}}$. It is the inverse of ${\displaystyle ^{2}x=x^{x}}$ and can be represented with the Lambert W function:[14]

${\displaystyle \mathrm {ssrt} (x)=e^{W(\mathrm {ln} (x))}={\frac {\mathrm {ln} (x)}{W(\mathrm {ln} (x))}}}$

The function also illustrates the reflective nature of the root and logarithm functions as the equation below only holds true when ${\displaystyle y=\mathrm {ssrt} (x)}$:

${\displaystyle {\sqrt[{y}]{x}}=\log _{y}x}$

Like square roots, the square super-root of x may not have a single solution. Unlike square roots, determining the number of square super-roots of x may be difficult. In general, if ${\displaystyle e^{-1/e}, then x has two positive square super-roots between 0 and 1; and if ${\displaystyle x>1}$, then x has one positive square super-root greater than 1. If x is positive and less than ${\displaystyle e^{-1/e}}$ it doesn't have any real square super-roots, but the formula given above yields countably infinitely many complex ones for any finite x not equal to 1.[14] The function has been used to determine the size of data clusters.[15]

#### Other super-roots

For each integer n > 2, the function nx is defined and increasing for x ≥ 1, and n1 = 1, so that the nth super-root of x, ${\displaystyle {\sqrt[{n}]{x}}_{s}}$, exists for x ≥ 1.

However, if the linear approximation above is used, then ${\displaystyle ^{y}x=y+1}$ if −1 < y ≤ 0, so ${\displaystyle ^{y}{\sqrt {y+1}}_{s}}$ cannot exist.

Other super-roots are expressible under the same basis[clarification needed] used with normal roots: super cube roots, the function[dubious ] that produces y when ${\displaystyle x=y^{y^{y}}}$, can be expressed as ${\displaystyle {\sqrt[{3}]{x}}_{s}}$; the 4th super-root can be expressed as ${\displaystyle {\sqrt[{4}]{x}}_{s}}$; and it can therefore be said that the nth super-root is ${\displaystyle {\sqrt[{n}]{x}}_{s}}$. Note that ${\displaystyle {\sqrt[{n}]{x}}_{s}}$ may not be uniquely defined, because there may be more than one nth root. For example, x has a single (real) super-root if n is odd, and up to two if n is even.[citation needed]

The super-root can be extended to ${\displaystyle n=\infty }$, and this shows a link to the mathematical constant e as it is only well-defined if 1/exe (see extension of tetration to infinite heights). Note that ${\displaystyle x={^{\infty }y}=y^{\left[^{\infty }y\right]}=y^{x},}$ and thus that ${\displaystyle y=x^{1/x}}$. Therefore, when it is well defined, ${\displaystyle {\sqrt[{\infty }]{x}}_{s}=x^{1/x}}$ and thus it is an elementary function. For example, ${\displaystyle {\sqrt[{\infty }]{2}}_{s}=2^{1/2}={\sqrt {2}}}$.

It follows from the Gelfond–Schneider theorem that super-root ${\displaystyle {\sqrt {n}}_{s}}$ for any positive integer n is either integer or transcendental, and ${\displaystyle {\sqrt[{3}]{n}}_{s}}$ is either integer or irrational.[13] But it is still an open question whether irrational super-roots are transcendental in the latter case.

### Super-logarithm

Main article: Super-logarithm

Once a continuous increasing (in x) definition of tetration, xa, is selected, the corresponding super-logarithm sloga x is defined for all real numbers x, and a > 1.

The function sloga x satisfies:

${\displaystyle {\begin{array}{lcl}\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&>&-2\end{array}}}$

## References

1. ^ It is easy to prove that for every elementary function f, there is a constant c s.t. ${\displaystyle f(x)\leq \underbrace {2^{2^{\cdot ^{\cdot ^{x}}}}} _{c}}$. We can show (by using diagonal argument and above fact) that ${\displaystyle (c,x)\mapsto \underbrace {2^{2^{\cdot ^{\cdot ^{x}}}}} _{c}}$ is non-elementary, and so is tetration.
2. ^ R. L. Goodstein (1947). "Transfinite ordinals in recursive number theory". Journal of Symbolic Logic 12 (4): 123–129. doi:10.2307/2266486. JSTOR 2266486.
3. ^ N. Bromer (1987). "Superexponentiation". Mathematics Magazine 60 (3): 169–174. JSTOR 2689566.
4. ^ J. F. MacDonnell (1989). "Somecritical points of the hyperpower function ${\displaystyle x^{x^{\dots }}}$". International Journal of Mathematical Education 20 (2): 297–305. doi:10.1080/0020739890200210. MR 994348.
5. ^
6. ^ a b M. H. Hooshmand, (2006). "Ultra power and ultra exponential functions". Integral Transforms and Special Functions 17 (8): 549–558. doi:10.1080/10652460500422247.
7. ^ Ioannis Galidakis. On Extending hyper4 and Knuth’s Up-arrow Notation to the Reals.
8. ^ "Power Verb". J Vocabulary. J Software. Retrieved 28 October 2011.
9. ^ "Climbing the ladder of hyper operators: tetration". George Daccache. January 5, 2015. Retrieved 18 February 2016.
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. ^
12. ^ D. Kouznetsov (July 2009). "Solution of ${\displaystyle F(z+1)=\exp(F(z))}$ in complex ${\displaystyle z}$-plane" (PDF). Mathematics of Computation 78 (267): 1647–1670. doi:10.1090/S0025-5718-09-02188-7.
13. ^ a b Marshall, Ash J., and Tan, Yiren, "A rational number of the form aa with a irrational", Mathematical Gazette 96, March 2012, pp. 106-109.
14. ^ a b Corless, R. M.; Gonnet, G. H.; Hare, D. E. G.; Jeffrey, D. J.; Knuth, D. E. (1996). "On the Lambert W function" . Advances in Computational Mathematics 5: 333. doi:10.1007/BF02124750.
15. ^ BOSTON UNIVERSITY COLLEGE OF ENGINEERING – EFFICIENT SELF-ORGANIZATION OF LARGE WIRELESS SENSOR NETWORKS