Tetration

From Free net encyclopedia

Tetration (also exponential map, hyperpower, power tower, super-exponentiation, and hyper4) is iterated exponentiation, the first hyper operator after exponentiation. The portmanteau word tetration was coined by Reuben Louis Goodstein from tetra- (four) and iteration. Tetration is used for the notation of very large numbers. Tetration follows exponentiation in the sequence:

  1. addition
    <math>a+b\,</math>
  2. multiplication
    <math>{{a \times b = } \atop {\ }} {{\underbrace{a + \cdots + a}} \atop b}</math>
  3. exponentiation
    <math>{{a^b = } \atop {\ }} {{\underbrace{a \times \cdots \times a}} \atop b}</math>
  4. tetration
    <math>{\ ^{b}a = \atop {\ }} {{\underbrace{a^{a^{\cdot^{\cdot^{a}}}}}} \atop b}</math>

where each operation is defined by iterating the previous one.

Multiplication (<math>a \times b</math>) can be thought of as B instances of A added together, and consequently exponentiation (<math>a^b</math>) can be thought of as B instances of A multiplied together. So a step further can be taken, and tetration (<math>a \uparrow\uparrow b</math>) can be thought of as B instances of A exponentiated together.

Note that when evaluating multiple-level exponentiation, the exponentiation is done at the deepest level first (in the notation, at the highest level). In other words:

<math>\,\!2^{2^{2^2}} = 2^{\left(2^{\left(2^2\right)}\right)} = 2^{\left(2^4\right)} = 2^{16} = 65,\!536</math>
<math>\,\!2^{2^{2^2}}</math> is not equal to <math>\,\! \left({\left(2^2\right)}^2\right)^2 = 256</math>

Contents

[edit]

Notation

To generalize the first case (tetration) above, a new notation is needed (see below); however, the second case can be written as

<math>\,\! \left(\left(2^2\right)^2\right)^2 = 2^{2 \cdot 2 \cdot 2} = 2^{2^3}</math>

Thus, its general form still uses ordinary exponentiation notation.

The notations in which tetration can be written (some of which allow even higher levels of iteration) include:

  • Standard notation: <math>{}^ba</math> — first used by Maurer; Rudy Rucker's book Infinity and the Mind popularized the notation.
  • Knuth's up-arrow notation: <math>a \uparrow\uparrow b</math> — allows extension by putting more arrows, or equivalently, an indexed arrow
  • Conway chained arrow notation: <math>a \rightarrow b \rightarrow 2</math> — allows extension by increasing the number 2 (equivalent with the extensions above), but also, even more powerfully, by extending the chain
  • hyper4 notation: <math>a^{(4)}b = \operatorname{hyper4}(a, b) = \operatorname{hyper}(a, 4, b)</math> — allows extension by increasing the number 4; this gives the family of hyper operators

For the Ackermann function we have <math>2 \uparrow\uparrow b = \operatorname{A}(4, b - 3) + 3</math>, i.e. <math>\operatorname{A}(4, n) = 2 \uparrow\uparrow (n+3) - 3</math>

The up-arrow is used identically to the caret (^), so that the tetration operator may be written as ^^ in ASCII: a^^b.

[edit]

Examples

  • <math>1 \uparrow\uparrow 2 = 1^1 = 1</math>
  • <math>2 \uparrow\uparrow 2 = 2^2 = 4</math>
  • <math>3 \uparrow\uparrow 2 = 3^3 = 27</math>
  • <math>4 \uparrow\uparrow 2 = 4^4 = 256</math>
  • <math>5 \uparrow\uparrow 2 = 5^5 = 3,125</math>
  • <math>6 \uparrow\uparrow 2 = 6^6 = 46,656</math>
  • <math>7 \uparrow\uparrow 2 = 7^7 = 823,543</math>
  • <math>8 \uparrow\uparrow 2 = 8^8 = 16,777,216</math>
  • <math>9 \uparrow\uparrow 2 = 9^9 = 387,420,489</math>
  • <math>10 \uparrow\uparrow 2 = 10^{10} = 10,000,000,000</math>
  • <math>1 \uparrow\uparrow 3</math> <math>\,\!= 1^{1^1}</math> <math>= 1</math>
  • <math>\,\!2 \uparrow\uparrow 3</math> <math>\,\!= 2^{2^2}</math> <math>= 16</math>
  • <math>\,\!3 \uparrow\uparrow 3</math> <math>\,\!= 3^{3^3}</math> <math>= 7,625,597,484,987</math>
  • <math>\,\!4 \uparrow\uparrow 3</math> <math>\,\!= 4^{4^4}</math> <math>= 4^{256} \approx 1.34078079 \times 10^{154}</math>
  • <math>\,\!5 \uparrow\uparrow 3</math> <math>\,\!= 5^{5^5}</math> <math>= 5^{3125} \approx 1.91 \times 10^{2184}</math> (over 2,000 digits long)
  • <math>\,\!6 \uparrow\uparrow 3</math> <math>\,\!= 6^{6^6}</math> <math>= 6^{46656} \approx 2.66 \times 10^{36305}</math> (over 36,000 digits long)
  • <math>\,\!7 \uparrow\uparrow 3</math> <math>\,\!= 7^{7^7}</math> <math>= 7^{823543} \approx 1.97 \times 10^{402472}</math> (over 400,000 digits long)
  • <math>\,\!1 \uparrow\uparrow 4</math> <math>\,\!= 1^{1^{1^1}}</math> <math>= 1</math>
  • <math>\,\!2 \uparrow\uparrow 4</math> <math>\,\!= 2^{2^{2^2}}</math> <math>= 65,536</math>
  • <math>\,\!3 \uparrow\uparrow 4</math> <math>\,\!= 3^{3^{3^3}}</math> <math>= 3^{7,625,597,484,987} \approx 1.258 \times 10^{3,638,334,640,024}</math> (over three trillion digits long)
  • <math>\,\!1 \uparrow\uparrow 5</math> <math>\,\!= 1^{1^{1^{1^1}}}</math> <math>= 1</math>
  • <math>\,\!2 \uparrow\uparrow 5</math> <math>\,\!= 2^{2^{2^{2^2}}}</math> <math>= 2^{65536} \approx 2.00 \times 10^{19728}</math> (nearly 20,000 digits long)
[edit]

Extension to low values of the second operand

Using the relation <math>n \uparrow\uparrow k = \log_n \left(n \uparrow\uparrow (k+1)\right)</math> (which follows from the definition of tetration), one can derive (or define) values for <math>n \uparrow\uparrow k</math> where <math>k \in \{-1, 0, 1\}</math>.

<math> \begin{matrix} 

 n \uparrow\uparrow 1
   & = &
 \log_n \left(n \uparrow\uparrow 2\right)
   & = &
 \log_{n} \left(n^n\right)
   & = & 
 n \log_{n} n 
   & = & 
 n

\\ 

 n \uparrow\uparrow 0
   & = &
 \log_{n} \left(n \uparrow\uparrow 1\right)
   & = & 
 \log_{n} n
   & & & = &
 1

\\ 

 n \uparrow\uparrow -1
   & = &
 \log_{n} \left(n \uparrow\uparrow 0\right)
   & = &
 \log_{n} 1
   & & & = & 
 0

\end{matrix} </math>

This confirms the intuitive definition of <math>n \uparrow\uparrow 1</math> as simply being <math>n</math>. However, no further values can be derived by further iteration in this fashion, as <math>\log_n 0</math> is undefined.

Similarly, since <math>\log_{1} 1</math> is also undefined (<math>\log_{1} 1 = \begin{matrix}\frac{\log_n 1}{\log_n 1} = \frac{0}{0}\end{matrix}</math>), the derivation above does not hold when <math>n</math> = 1. Therefore, <math>1 \uparrow\uparrow {-1}</math> must remain an undefined quantity as well. (The figure <math>1 \uparrow\uparrow {0}</math> can safely be defined as 1, however.)

Sometimes, <math>0^0</math> is taken to be an undefined quantity. In this case, values for <math>0\uparrow\uparrow{k}</math> cannot be defined directly. However, <math>\lim_{n\rightarrow0} n\uparrow\uparrow{k}</math> is well defined, and exists:

<math>\lim_{n\rightarrow0} n\uparrow\uparrow k = \begin{cases} 1, & k \mbox{ even} \\ 0, & k \mbox{ odd} \end{cases} </math>

This limit holds for negative <math>n</math>, as well. <math>0 \uparrow\uparrow {k}</math> could be defined in terms of this limit and this would agree with a definition of <math>0^0 = 1</math>.

[edit]

Complex tetration

Image:Tetration period.gif

Image:Tetration escape.gif

Since complex numbers can be raised to powers, tetration can be applied to numbers of the form <math>a + bi</math>, where <math>i</math> is the square root of −1. For example, <math>n \uparrow\uparrow k</math> where <math>n=i</math>, tetration is achieved by using the principal branch of the natural logarithm, and noting the relation:

<math>

i^{a+bi} = e^{{i\pi \over 2} (a+bi)} = e^{-{b\pi \over 2}} \left(\cos{a\pi \over 2} + i \sin{a\pi \over 2}\right) </math>

This suggests a recursive definition for <math>i \uparrow\uparrow (k+1) = a'+b'i</math> given any <math>i \uparrow\uparrow k = a+bi</math>:

<math>a' = e^{-{b\pi \over 2}} \cos{a\pi \over 2}</math>
<math>b' = e^{-{b\pi \over 2}} \sin{a\pi \over 2}</math>

The following approximate values can be derived, where <math>i \uparrow n</math> is ordinary exponentiation (i.e. <math>i ^ n</math>).

  • <math>i \uparrow\uparrow 1 = i</math>
  • <math>i \uparrow\uparrow 2 = i \uparrow\left(i \uparrow\uparrow 1\right) \approx 0.2079</math>
  • <math>i \uparrow\uparrow 3 = i \uparrow\left(i \uparrow\uparrow 2\right) \approx 0.9472 + 0.3208i</math>
  • <math>i \uparrow\uparrow 4 = i \uparrow\left(i \uparrow\uparrow 3\right) \approx 0.0501 + 0.6021i</math>
  • <math>i \uparrow\uparrow 5 = i \uparrow\left(i \uparrow\uparrow 4\right) \approx 0.3872 + 0.0305i</math>
  • <math>i \uparrow\uparrow 6 = i \uparrow\left(i \uparrow\uparrow 5\right) \approx 0.7823 + 0.5446i</math>
  • <math>i \uparrow\uparrow 7 = i \uparrow\left(i \uparrow\uparrow 6\right) \approx 0.1426 + 0.4005i</math>
  • <math>i \uparrow\uparrow 8 = i \uparrow\left(i \uparrow\uparrow 7\right) \approx 0.5198 + 0.1184i</math>
  • <math>i \uparrow\uparrow 9 = i \uparrow\left(i \uparrow\uparrow 8\right) \approx 0.5686 + 0.6051i</math>

Solving the relation yields the expected <math>i \uparrow\uparrow 0 = 1</math> and <math>i \uparrow\uparrow -1 = 0</math>, with negative values of <math>k</math> giving infinite results on the imaginary axis. Plotted in the complex plane, the entire sequence spirals to the limit <math>0.4383 + 0.3606i</math>, which could be interpreted as the value where <math>k</math> 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 power tower 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.

[edit]

Extension to real numbers

Image:Tetration large.png

Extending <math>x \uparrow\uparrow b</math> to real numbers <math>x > 0</math> is straightforward and gives, for each natural number <math>b</math>, a super-power function <math>\operatorname{f}(x) = x \uparrow\uparrow b</math>. (The term super is sometimes replaced by hyper: hyper-power function).

As mentioned above, for positive integers <math>b</math> the function tends to 1 for <math>x</math> tending to 0 if <math>b</math> is even, and to 0 if <math>b</math> is odd, while for <math>b = 0</math> and <math>b = -1</math> the function is constant, with values 1 and 0, respectively.

At this time there is no commonly accepted solution to the general problem of extending tetration to the real or complex numbers, although it is an active area of research.

Consider the problem of finding a super-exponential function or hyper-exponential function <math>\operatorname{f}(x) = a \uparrow\uparrow x</math> which is an extension to real <math>x > -2</math> to what was defined above, satisfying (for <math>a > 1</math>):

  • <math>a \uparrow\uparrow(b+1) = a^{\left(a\uparrow \uparrow b\right)}</math>
  • it is monotonically increasing
  • it is continuous

When <math>a \uparrow\uparrow x</math> is defined for an interval of length one, the whole function easily follows for all <math>x > -2</math>

A simple solution is given by <math>a \uparrow\uparrow x = x+1</math> for <math>-1<x<0</math>, hence <math>a \uparrow\uparrow x = a^x</math> for <math>0<x<1</math>, <math>\,\!a \uparrow\uparrow x=a^{a^{(x-1)}}</math> for <math>1<x<2</math>, etc.

However, it is only piecewise differentiable; at integer values of x the derivative is multiplied by <math>\log_n{a}</math>: <math>10 \uparrow\uparrow 0.99 = 9.77</math>, <math>10 \uparrow\uparrow 1 = 10</math>, <math>10 \uparrow\uparrow 1.01 = 10.55</math>.

Other, more complicated solutions may be smoother and/or satisfy additional properties.

A super-exponential function grows even faster than a double-exponential function; for example, if <math>a</math> = 10:

  • <math>\operatorname{f}(-1)=0</math>
  • <math>\operatorname{f}(0)=1</math>
  • <math>\operatorname{f}(1)=10</math>
  • <math>\operatorname{f}(2)=10^{10}</math>
  • <math>\operatorname{f}(2.3)=10^{100}</math> (googol)
  • <math>\,\!\operatorname{f}(3)=10^{10^{10}}</math>
  • <math>\,\!\operatorname{f}(3.3)=10^{10^{100}}</math> (googolplex)
  • It passes <math>\,\!10^{10^x}</math> at <math>x = 2.376</math>: <math>\operatorname{f}(x) \approx 4.83 \times 10^{237}</math>

When defining <math>a \uparrow\uparrow x</math> for every a, another possible requirement could be that <math>a \uparrow\uparrow x</math> is monotonically increasing with a.

The inverse functions are called super-root or hyper-root, and super-logarithm or hyper-logarithm <math>\mathrm{slog}_a</math> defined for all real numbers, also negative numbers.

The function <math>\mathrm{slog}_a</math> satisfies:

<math>\mathrm{slog}_a a^b = 1 + \mathrm{slog}_a b</math>
<math>\mathrm{slog}_a b = 1 + \mathrm{slog}_a \log_a b</math>
<math>\mathrm{slog}_a b > -2</math>

Examples:

  • <math>\mathrm{slog}_{10} -3 = -1 + \mathrm{slog}_{10} 0.001 = -1 + -0.999 = -1.999</math>
  • <math>\mathrm{slog}_{10} 3 = \log_{10} 3 = .477</math>
  • <math>\mathrm{slog}_{10} 10^{6\times 10^{23}} = 1 + \mathrm{slog}_{10} 6\times 10^{23} = 2 + \mathrm{slog}_{10} 23.778 = 3 + \mathrm{slog}_{10} 1.376 = 3 + \log_{10} 1.376 = 3.139</math>
[edit]

Infinitely high power towers

<math>\sqrt{2}^{\sqrt{2}^{\sqrt{2}^{\sqrt{2}^{\sqrt{2}^{\sqrt{2}^{..}}}}}}</math> converges to 2, and can therefore be said to be equal to 2. In general, the infinite power tower <math>x^{x^{x^{..}}}</math> converges for <math>e^{-e} < x < e^{1/e}</math>. For arbitrary real <math>r</math> with <math>0 < r < e</math>, let <math>x = r^{1/r}</math>, then the limit is <math>r</math>. There is no convergence for <math>x > e^{1/e}</math> (max of <math>r^{1/r}</math> is <math>e^{1/e}</math>).

This may be extended to complex numbers <math>z</math> with the definition:

<math> z^{z^{z^{.^{.^{.}}}}} = -\frac{\mathrm{W}(-\ln{z})}{\ln{z}} </math>

where <math>\mathrm{W}(z)</math> represents Lambert's W function.

[edit]

See also

[edit]

External links

[edit]

References

  • R. Knobel. "Exponentials Reiterated." Amer. Math. Monthly 88, (1981), p. 235-252.
  • Hans Maurer. "Über die Funktion <math>y=x^{[x^{[x(\cdots)]}]}</math> für ganzzahliges Argument (Abundanzen)." Mittheilungen der Mathematische Gesellschaft in Hamburg 4, (1901), p. 33-50; reference to usage of <math>\ ^ba</math> from Knobel's paper.
  • Reuben Louis Goodstein. "Transfinite ordinals in recursive number theory." Journal of Symbolic Logic 12, (1947).de:Hyper4
Retrieved from "http://www.netipedia.com/index.php/Tetration"