This is a summary of properties of tetration.
tetrated to the
is represented by
or
. The functions
and
denote logarithm and exponentiation to base
, respectively.
is the result of applying the function
to 1
times in succession. So
, for example, is equal to
, for integer
.
The symbol
denotes the binomial coefficient, equal to
.
is the degree
Bernoulli polynomial of x, while
without an argument is the
th Bernoulli number, equal to
.
1. Newton method. It can be derived from the Newton polynomial interpolation formula or from the partial iteration theorem.
This method works for any positive base
.
2. Lagrange method. It can be derived from the Lagrange polynomial interpolation formula.
This method works for positive real bases
.
3. Rational interpolation method
This method works for positive real bases
.
4. Regular iteration method. It is derived using the technique of regular iteration at the fixed point of the exponential function.
Here the W function is the product logarithm or Lambert W function, which is defined by
. The expression
is the principal fixed point of the function
.
This method works for real bases
.
5. Matrix power method. One can use Carleman matrices to find the iterates[1].
This method works for real bases
.
6. Cauchy integral iteration method: A method developed by Dmitriy Kouznetsov [2].
One should apply the Cauchy integral formula to the loop around the rectangle from
to
, where
is the integer part of
, and
is substantially larger than the real or imaginary parts of
. The value of the integrands along the imaginary-axis edges of this rectangle can be determined from their value along the imaginary line through
, while the value along the real-axis edges of the rectangle can be estimated under the assumption that the function tends to the two (complex) fixed points of
at infinite imaginary values.
To obtain the value of the function along the imaginary line through
, we start with a guess value for this function, and recursively correct it using the Cauchy formula.
This method works for real bases
.
7. Intuitive iteration method (formerly called "natural" method, or matrix inverse method). A method first developed by Peter Walker, then rediscovered by Andrew Robbins, which uses matrices to solve the Abel functional equation for exponentials:

applying the Carleman matrix to both sides, and simplifying the matrices a bit, we are left with the matrix equation:
![{\displaystyle (C[b^{x}]^{T}-I)D[\alpha ]=D[1]\,}](/media/api/rest_v1/media/math/render/svg/acc1b82d4bef0f79841babe60f9d15e2a53e53a2)
where C is a Carleman matrix, and D is a Taylor coefficient column vector. Since this equation is linear, we can solve for the Taylor coefficients of the Abel function
making
invertible (by truncating the first column and last row). This truncation is called the Abel matrix:
![{\displaystyle A[b^{x}]=J(C[b^{x}]^{T}-I)K\,}](/media/api/rest_v1/media/math/render/svg/1477fbf91e0ba1f2a240ebc4daf7949ec892f89c)
where J is the identity matrix without the last row, and K is the identity matrix without the first column. The importance of the Abel matrix is that it is often invertible, in which case we can solve for the Taylor coefficients of
as
.
To summarize, the super-logarithm is the Abel function of exponentials, so the Taylor coefficients of the super-logarithm can be found in the first column of the inverse of the Abel matrix.
This method works for real bases
.
Functional and differential equations
[edit]
1. Main functional equation
2. Main functional equation for inverse function
3. Differential-difference equation
Superexponential with fixed base b is periodic[3] with period

Values in fixed points and asymptotic properties
[edit]






Differentiation rules
[edit]
1. Differentiating tetration with fixed height


Generalized,

2. Differentiating tetration with fixed base

Generalized,


Approximation methods
[edit]
In light of the main equation above, it suffices to define an approximation function on an interval of unit length.
- Linear approximation: On the interval [-1, 0], we have
. This approximation is continuous everywhere, but generally not differentiable at integers.
- Quadratic approximation: On the interval [-1, 0], we have
. This approximation is continuously differentiable everywhere, but its second derivative is discontinuous at each integer.
- Shifted linear approximation: Developed by Jay D. Fox at [1]. On some interval [c, c+1], we have
. The value c is chosen so that the approximation gives
; if
, this means setting
, while if
, it means setting
. This approximation is continuously differentiable everywhere, but its second derivative is discontinuous at c+n for any integer n. It is only defined for
.
If
all three of the above approximations are equivalent.
Approximation
|
|
|
Linear: for
|
3.162776601...
|
0.301029995...
|
Quadratic: for
|
2.5199768...
|
|
Shifted Linear: for
|
2.50181...
|
0.377936...
|