Skip to content
Home

Tetration: the hyperoperation after exponentiation

Tetration is the fourth hyperoperation: iterated exponentiation. It grows faster than exponentials, has special notation (e.g. a ↑↑ n or ^{n}a), and admits inverse operations and analytic extensions.

Overview

Tetration is the operation obtained by iterating exponentiation the same way multiplication iterates addition and exponentiation iterates multiplication. Informally, the n‑th tetration of a base a — often written ^{n}a or a ↑↑ n — means a raised to the power of a, raised to the power of a, and so on with n copies of a, evaluated right‑to‑left. Tetration is part of the hierarchy known as hyperoperations, immediately succeeding exponentiation.

Image gallery

7 Images

Notation and examples

Common notations include ^{n}a, a ↑↑ n (Knuth's double up‑arrow), and informal terms like "the n‑th tetration of a." Examples illustrate the rapid growth:

  • ^{1}a = a
  • ^{2}a = a^a
  • ^{3}a = a^{(a^a)} (not (a^a)^a)
A small numeric example: ^{3}3 = 3^{(3^3)} = 3^{27} = 7,625,597,484,987, showing how quickly values explode as n increases.

Relationship to other operations

Tetration completes the first four levels of the hyperoperation ladder. A compact way to present the first four operations is:

  1. Addition: repeatedly incrementing a value.
  2. Multiplication: repeated addition.
  3. Exponentiation: repeated multiplication.
  4. Tetration: repeated exponentiation.
Each step increases the operation's growth rate dramatically. For reference see the hyperoperation list linked above (hyperoperations list).

Mathematical properties and extensions

Tetration is right‑associative: an expression with many stacked exponents is evaluated from the top down. Inverse concepts include the "super‑root" (a value x such that ^{n}x = a) and the "super‑logarithm" (often written slog), which generalizes the logarithm to count how many times exponentiation must be applied to reach a value. A notable analytic topic is extending tetration to non‑integer heights (fractional or real n) and to complex bases. Infinite power towers a^{a^{a^{...}}} converge only for a in a limited range; the classical real convergence region is bounded roughly by e^{-e} and e^{1/e}, where the limit y satisfies y = a^y. Beyond real integer heights, constructing continuous or holomorphic extensions of tetration is an active area of research in complex dynamics and functional equations.

History, notation development and uses

The systematic study of the hyperoperation sequence and the name "tetration" emerged in the mid‑20th century as mathematicians formalized operations beyond exponentiation. Practical uses are largely theoretical: tetration provides extreme examples in number theory, combinatorics, and the study of large finite structures, and it motivates research into iteration theory, functional equations, and analytic continuation. Computationally, even small tetration values exceed typical numeric ranges, so work with tetration often proceeds symbolically or with specially designed algorithms.

Distinctions and notable facts

Tetration differs from repeated multiplication or exponentiation in scale and in the need for careful interpretation when extending its domain. Not every integer or real base admits a straightforward infinite tower or an agreed analytic extension; different continuation methods can produce distinct functions off the integers. For introductions and lists that explain related operations in context, see entries on addition and multiplication.

Representation with sequences and infinite power towers

A finite power tower of the form (see also arrow notation)

{\displaystyle {\begin{matrix}x\uparrow \uparrow n&=&\underbrace {x^{x^{{}^{.\,^{.\,^{.\,^{x}}}}}}} \\&&n{\mbox{ Kopien von }}x\end{matrix}}}

where x\in {\mathbb R}^{{\geq 0}}and n\in \mathbb {N} coincides with the n-th member {\displaystyle a_{n}(x)}of the equation given by

a_{{n}}(x):={\begin{cases}x,&{\text{falls }}n=1\\x^{{a_{{n-1}}(x)}},&{\text{falls }}n>1\end{cases}}

recursively defined sequence (a_{{n}}(x))This is called a partial tower sequence and is identified with the infinite power tower (analogous to the notion of infinite series).

If is (a_{{n}}(x))convergent with the limit A(x),then the (infinite) power tower is called convergent with

{\displaystyle x\uparrow \uparrow \infty =x^{x^{{}^{.\,^{.\,^{.\,}}}}}=A(x).}

Already Leonhard Euler has recognized that the power tower

{\displaystyle x\uparrow \uparrow \infty =x^{x^{{}^{.\,^{.\,^{.\,}}}}}\qquad {\text{f}}{\ddot {\text{u}}}{\text{r}}\;x\in \mathbb {R} ^{\geq 0}}

converges exactly when

{\displaystyle 0{,}065988\approx {\frac {1}{e^{e}}}=e^{-e}\leq x\leq e^{\frac {1}{e}}\approx 1{,}444668.}

The function defined by this

{\displaystyle A\colon [e^{-e},e^{\frac {1}{e}}]\to [{\tfrac {1}{e}},e],\quad A(x)=x^{x^{{}^{.\,^{.\,^{.\,}}}}}}

is strictly monotonically increasing and bijective. Its inverse function is given by

{\displaystyle A^{-1}\colon [{\tfrac {1}{e}},e]\to [e^{-e},e^{\frac {1}{e}}],\quad A^{-1}(x)=x^{\frac {1}{x}}}.

See also

  • Lambertian W-function
  • Skewes number
  • Graham number

Related articles

Author

AlegsaOnline.com Tetration: the hyperoperation after exponentiation

URL: https://en.alegsaonline.com/art/97251

Share

Sources