Under the definition as repeated exponentiation, the notation means , where n copies of a are iterated via exponentiation, right-to-left, I.e. the application of exponentiation times. n is called the "height" of the function, while a is called the "base," analogous to exponentiation. It would be read as "the nth tetration of a".
The two inverses of tetration are called the super-root and the super-logarithm, analogous to the nth root and the logarithmic functions. None of the three functions are
elementary.
The first four
hyperoperations are shown here, with tetration being considered the fourth in the series. The
unary operationsuccession, defined as , is considered to be the zeroth operation.
n copies of a combined by exponentiation, right-to-left.[1]
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 . This is a misnomer, however, because tetration cannot be expressed with iterated power functions (see above), since it is an iterated exponential function.
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
iteratedpowers 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.
Allows the special case to be written in terms of the Ackermann function.
Properties
Tetration has several properties that are similar to exponentiation, as well as properties that are specific to the operation and are lost or gained from exponentiation. Because exponentiation does not
commute, the product and power rules do not have an analogue with tetration; the statements and are not necessarily true for all cases.[6]
Direction of evaluation
When evaluating tetration expressed as an "exponentiation tower", the exponentiation is done at the deepest level first (in the notation, at the apex).[1] For example:
This order is important because exponentiation is not
associative, and evaluating the expression in the opposite
order will lead to a different answer:
Evaluating the expression the left to right is considered less interesting; evaluating left to right, any expression can be simplified to be .[7] Because of this, the towers must be evaluated from right to left (or top to bottom). Computer programmers refer to this choice as
right-associative.
Non-elementary recursiveness
Tetration (restricted to ) is not an
elementary recursive function. One can prove by induction that for every elementary recursive function f, there is a constant c such that
We denote the right hand side by . Suppose on the contrary that tetration is elementary recursive. is also elementary recursive. By the above inequality, there is a constant c such that . By letting , we have that , 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 , the two inverses are the cube super-root of y and the super logarithm base y of x.
Super-root
"Super-root" redirects here. For the directory supported by some Unixes, see
super-root (computing).
The super-root is the inverse operation of tetration with respect to the base: if , then y is an nth super root of x ( or ).
For example,
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, and . It is the inverse of and can be represented with the
Lambert W function:[8]
The function also illustrates the reflective nature of the root and logarithm functions as the equation below only holds true when :
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 , then x has two positive square super-roots between 0 and 1; and if , then x has one positive square super-root greater than 1. If x is positive and less than 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.[8] The function has been used to determine the size of
data clusters.[9]
^R. L. Goodstein (1947). "Transfinite ordinals in recursive number theory". Journal of Symbolic Logic. 12 (4): 123–129.
doi:
10.2307/2266486.
JSTOR2266486.
Ioannis Galidakis, Mathematics, (Definitive list of references to tetration research. Lots of information on the Lambert W function, Riemann surfaces, and analytic continuation.)
Hans Maurer, "Über die Funktion für ganzzahliges Argument (Abundanzen)." Mittheilungen der Mathematische Gesellschaft in Hamburg4, (1901), p. 33–50. (Reference to usage of from Knobel's paper.)
Galidakis, Ioannis and Weisstein, Eric W.
"Power Tower". MathWorld. Retrieved 5 July 2019.{{
cite web}}: CS1 maint: multiple names: authors list (
link)