Tetration

In mathematics, tetration (or hyper-4) is an operation based on iterated, or repeated, exponentiation. There is no standard notation for tetration, though Knuth's up arrow notation $\uparrow \uparrow$ and the left-exponent $^b$ are common.

Under the definition as repeated exponentiation, $$ means $$, 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 ". For example, 2 tetrated to 4 (or the fourth tetration of 2) is $=2^=2^=2^=65536$.

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
: $:= \begin 1 &\textn=0, \\ a^ &\textn>0, \end$
allowing for the holomorphic extension of tetration to non-natural numbers such as real, complex, and ordinal numbers, which was proved in 2017.

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.

#Addition $a + n = a + \underbrace_n$ copies of 1 added to combined by succession.
#Multiplication $a \times n = \underbrace_n$ copies of combined by addition.
#Exponentiation $a^n = \underbrace_n$ copies of combined by multiplication.
#Tetration $= \underbrace_n$ copies of combined by exponentiation, right-to-left.

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

Succession, $a_ = 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 \times 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 ($^a$) as a chained power involving $n$ numbers $a$. Each of the operations above are defined by iterating the previous one;Neyrinck, Mark
An Investigation of Arithmetic Operations.
Retrieved 9 January 2019. 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 $\,\!$ recursively as:
: $:= \begin 1 &\textn=0 \\ a^ &\textn>0 \end$
The recursive definition is equivalent to repeated exponentiation for natural heights; however, this definition allows for extensions to the other heights such as $^a$, $^a$, and $^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'' (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. It was used earlier by Ed Nelson in his book Predicative Arithmetic, Princeton University Press, 1986.
* The term ''hyperpower'' 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 $$. 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:

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.

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

: $\exp_a^n(x) = a^$ with s.

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

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. Usually, the limit that can be calculated in a numerical calculation program such as Wolfram Alpha is 3↑↑4, and the number of digits up to 3↑↑5 can be expressed.

Remark: If does not differ from 10 by orders of magnitude, then for all $k \ge3,~ ^mx =\exp_^k z,~z>1 ~\Rightarrow~^x = \exp_^ z' \textz' \approx z$. For example, $z - z' < 1.5\cdot 10^ \text 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 $$, complex functions such as $^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 $\,$ are not clearly defined by the formula given earlier. However, $\lim_ ^x$ is well defined, and exists:
:$\lim_ ^x = \begin 1, & n \text \\ 0, & n \text \end$

Thus we could consistently define $^0 = \lim_ ^x$. This is analogous to defining $0^0 = 1$.

Under this extension, $^0 = 1$, so the rule $= 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^ = e^ = e^ \left(\cos + i \sin\right)$

This suggests a recursive definition for given any :
: \begin
a' &= e^ \cos \\ pt 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 $^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^$ 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 \sqrt^ &\approx \sqrt^ \\ &\approx \sqrt^ \\ &\approx \sqrt^ \\ &\approx \sqrt^ \\ &\approx 1.93 \end$

In general, the infinitely iterated exponential $x^\!\!$, defined as the limit of $^x$ as goes to infinity, converges for , roughly the interval from 0.066 to 1.44, a result shown by Leonhard Euler. 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:
: $^z = z^ = \frac ~,$
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,
: $= a^,$

to prove $^a$:
: $^a = \log_a \left(^a\right);$

Substituting −1 for gives
: $^a = \log_ \left(^0 a\right) = \log_a 1 = 0$.

Smaller negative values cannot be well defined in this way. Substituting −2 for in the same equation gives
: $^a = \log_ \left( ^a \right) = \log_a 0 = -\infty$

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

For $n = 1$, any definition of $\,\!$ is consistent with the rule because
: $= 1 = 1^n$ for any $\,\! n =$.

Linear approximation for real heights

A linear approximation (solution to the continuity requirement, approximation to the differentiability requirement) is given by:
: $^a \approx \begin \log_a\left(^a\right) & x \le -1 \\ 1 + x & -1 < x \le 0 \\ a^ & 0 < x \end$

hence:

and so on. However, it is only piecewise differentiable; at integer values of , the derivative is multiplied by $\ln$. It is continuously differentiable for $x > -2$ if and only if $a = e$. For example, using these methods $^\frace \approx 5.868...$ and $^0.5 \approx 4.03335...$

A main theorem in Hooshmand's paper states: Let $0 < a \neq 1$. If $f:(-2, +\infty)\rightarrow \mathbb$ is continuous and satisfies the conditions:

* $f(x) = a^ \;\; \text \;\; 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) \text f^\prime \left(-1^+\right) = f^\prime \left(0^-\right).$

then $f$ is uniquely determined through the equation
: $f(x) = \exp^_a \left(a^\right) = \exp^_a((x)) \quad \text \; \; x > -2,$

where (x) = x - /math> denotes the fractional part of and $\exp^_a$ is the /math>-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, +\infty)\rightarrow \mathbb$ is a continuous function that satisfies:

* $f(x) = e^ \;\; \text \;\; x > -1, \; f(0) = 1,$
* $f$ is convex on ,
* $f^\prime \left(0^-\right) \leq f^\prime \left(0^+\right).$

then $f = \text$. ere $f = \text$ 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^ \;\; (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:
: $^a \approx \begin \log_a\left(^a\right) & x \le -1 \\ 1 + \fracx - \fracx^2 & -1 < x \le 0 \\ a^ & x >0 \end$

which is differentiable for all $x > 0$, but not twice differentiable. For example, $^\frac2 \approx 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^\frac\right)^n = a$. Namely,
: $^n\left(^\frac a\right) = \underbrace_n \neq 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.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".

Complex heights

In 2017, it was proved that there exists a unique function $F$ satisfying
$F(z + 1) = \exp\bigl(F(z)\bigr)$ (equivalently $F(z+1) = b^$ when $b=e$), with the auxiliary conditions
$F(0) = 1$, and
$F(z) \to \xi_$ (the attracting/repelling fixed points of the logarithm, roughly $0.318 \pm 1.337\,\mathrm$) as $z \to \pm i\infty$. Moreover, $F$ is holomorphic on all of $\mathbb$ except for the cut along the real axis at $z \le -2$. This construction was first conjectured by Kouznetsov (2009) and rigorously carried out by Kneser in 1950. Paulsen & Cowgill’s proof extends Kneser’s original construction to any base $b>e^\approx1.445$, and subsequent work showed how to allow $b \in \mathbb$ with $, b, >e^$.

In May 2025, Vey gave a unified, holomorphic extension for arbitrary complex bases $b\in \mathbb\setminus\$ and complex heights $z\in\mathbb$ by means of Schröder’s equation. In particular, one constructs a linearizing coordinate near the attracting (or repelling) fixed point of the map $f(w)=b^w$, and then patches together two analytic expansions (one around each fixed point) to produce a single function $F_(z)$ that satisfies
$F_(z+1)=b^$ and $F_(0)=1$ on all of $\mathbb$. The key step is to define
$\displaystyle \Phi_(w)=\lim_\;s^\Bigl(f^(w)-\alpha\Bigr),$
where $\alpha$ is a fixed point of $f(w)=b^w$, $s = f'(\alpha)$, and $f^$ denotes $n$-fold iteration. One then solves Schröder’s functional equation
$\Phi_\bigl(b^\bigr)\;=\;s\;\Phi_(w)$
locally (for $w$ near $\alpha$), extends both branches holomorphically, and glues them so that there is no monodromy except the known cut-lines. Vey also provides explicit series for the coefficients $a_^$ in the local Schröder expansion:
$\Phi_(w) = \sum_^ a_^\,(w-\alpha)^,$
and gives rigorous bounds proving factorial convergence of $a_^$.

Using Kneser’s (and Vey’s) tetration, example values include
$^e \approx 5.82366\ldots$,
$^2 \approx 1.45878\ldots$, and
$^e \approx 1.64635\ldots$.

The requirement that tetration be holomorphic on all of $\mathbb$ (except for the known cuts) is essential for uniqueness. If one relaxes holomorphicity, there are infinitely many real‐analytic “solutions” obtained by pre‐ or post‐composing with almost‐periodic perturbations. For example, for any fast‐decaying real sequences $\$ and $\$, one can set

S(z)
=
F_\Bigl(\,
z
+\sum_^\sin(2\pi n\,z)\,\alpha_
+\sum_^\bigl - \cos(2\pi n\,z)\bigr,\beta_
\Bigr),

which still satisfies $S(z+1)=b^$ and $S(0)=1$, but has additional singularities creeping in from the imaginary direction.

function ComplexTetration(b, z):
# 1) Find attracting fixed point alpha of w ↦ b^w
α ← the unique solution of α = b^α near the real line
# 2) Compute multiplier s = b^α · ln(b)
s ← b**α * log(b)
# 3) Solve Schröder’s equation coefficients around α:
# Φ_b(w) = ∑_^∞ a_n · (w − α)^n, Φ_b(b^w) = s · Φ_b(w)
← SolveLinearSystemSchroeder(b, α, s)
# 4) Define inverse φ_b⁻¹ via the local power series around 0
φ_inv(u) = α + ∑_^∞ c_n · u^n # (coefficients c_n from series inversion)
# 5) Put F_b(z) = φ_b⁻¹(s^(-z) · Φ_b(1))
return φ_inv( s^(−z) * ∑_^∞ a_n · (1 − α)^n )

Ordinal tetration

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

Non-elementary recursiveness

Tetration (restricted to $\mathbb^2$) is not an elementary recursive function. One can prove by induction that for every elementary recursive function , there is a constant such that
: $f(x) \leq \underbrace_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 $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 s or \sqrt s).

For example,
: $^4 2 = 2^ = 65536$

so 2 is the 4th super-root of 65,536 \left(\sqrt s =2\right).

Square super-root

The ''2nd-order super-root'', ''square super-root'', or ''super square root'' has two equivalent notations, $\mathrm(x)$ and $\sqrt_s$. It is the inverse of $^2 x = x^x$ and can be represented with the Lambert W function:

: $\mathrm(x)=\exp(W(\ln x))=\frac$ or
: $\sqrt_s=e^$

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

: \sqrt = \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^, then has two positive square super-roots between 0 and 1 calculated using formulas:$\sqrt_s=\left\$; and if $x > 1$, then has one positive square super-root greater than 1 calculated using formulas: $\sqrt_s=e^$. If is positive and less than $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.

At $x = 1$:

Other super-roots

One of the simpler and faster formulas for a third-degree super-root is the recursive formula. If $y = x^$ then one can use:
* $x_0 = 1$
* $x_ = \exp(W(W(x_n\ln y)))$

For each integer , the function is defined and increasing for , and , so that the th super-root of , \sqrt s, exists for .

However, if the linear approximation above is used, then $^y x = y + 1$ if , so $^y \sqrt_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 s; the "4th super-root" can be expressed as \sqrt s; and the "th super-root" is \sqrt s. Note that \sqrt 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 = = y^ = y^x,$ and thus that $y = x^$. Therefore, when it is well defined, \sqrt inftys = x^ and, unlike normal tetration, is an elementary function. For example, \sqrt inftys = 2^ = \sqrt.

It follows from the Gelfond–Schneider theorem that super-root $\sqrt_s$ for any positive integer is either integer or transcendental, and \sqrt s is either integer or irrational. It is still an open question whether irrational super-roots are transcendental in the latter case.

Super-logarithm

Once a continuous increasing (in ) definition of tetration, , is selected, the corresponding super-logarithm $\operatorname_ax$ or $\log^4_ax$ is defined for all real numbers , and .

The function satisfies:
: $\begin \operatorname_a &= x \\ \operatorname_a a^x &= 1 + \operatorname_a x \\ \operatorname_a x &= 1 + \operatorname_a \log_a x \\ \operatorname_a x &\geq -2 \end$

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 an integer $n \ge 4$ for which is an integer, because we could not calculate precisely enough the numbers of digits after the decimal points of $\pi$. It is similar for for $n \ge 5$, as we are not aware of any other methods besides some direct computation. In fact, since $\log_(e) \cdot ^e = 1656520.36764$, then $^e > 2\cdot 10^$. Given $^\pi < 1.35\cdot 10^ \ll 10^$ and $\pi < e^2$, then $^\pi < ^e$ for $n \ge 5$. It is believed that is not an integer for any positive integer , due to the algebraic independence of $e, ^e, ^e, \dots$, given Schanuel's conjecture.
* It is not known whether is rational for any positive integer and positive non-integer rational .Marshall, Ash J., and Tan, Yiren, "A rational number of the form with irrational", Mathematical Gazette 96, March 2012, pp. 106–109.
/ref> For example, it is not known whether the positive root of the equation is a rational number.
* It is not known whether or (defined using Kneser's extension) are rationals or not.

Applications

For each graph ''H'' on ''h'' vertices and each , define
:$D=2\uparrow\uparrow5h^4\log(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.Jacob Fox
A new proof of the graph removal lemma
arXiv preprint (2010). arXiv:1006.1300 ath.CO/ref>

See also

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

Notes

References

External Links

* Daniel Geisler,
Tetration
'
* Ioannis Galidakis,

' (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,

' ''(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,

', ''(Definitive list of references to tetration research. Much information on the Lambert W function, Riemann surfaces, and analytic continuation.)''
* Joseph MacDonell,

''.
* Dave L. Renfro,
Web pages for infinitely iterated exponentials
'
*
* Hans Maurer, "Über die Funktion $y=x^$ für ganzzahliges Argument (Abundanzen)." ''Mittheilungen der Mathematische Gesellschaft in Hamburg'' 4, (1901), p. 33–50. ''(Reference to usage of $\$ from Knobel's paper.)''
*

'
* Luca Moroni
''The strange properties of the infinite power tower''
(https://arxiv.org/abs/1908.05559)

Further reading

*

{{Large numbers

Exponentials
Operations on numbers
Large numbers