|
|
|
|
|
TetrationTetration (also exponential map, hyperpower, power tower, super-exponentiation, and hyper4) is iterated exponentiation, the first hyper operator after exponentiation. The word tetration was coined by Reuben Louis Goodstein. Tetration is used for the notation of very large numbers. Tetration follows exponentiation in the sequence: - addition
- :
- multiplication
- :
- exponentiation
- :
- tetration
- :
where each operation is defined by iterating the previous one. We can think of multiplication () as B instances of A added together, and we can consequently think of exponentiation () as B instances of A multiplied together. So we can go a step further, and think of tetration () 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: -
- is not equal to
Though the latter is a form of iteration also, it is less interesting, since it can be written non-iteratively as . The notations in which it can be written (some of which allow further iteration) include: - Standard notation: — first used by Maurer; Rudy Rucker's book Infinity and the Mind popularized the notation.
- Knuth's up-arrow notation: — allows extension by putting more arrows, or equivalently, an indexed arrow
- Conway chained arrow notation: — allows extension by increasing the number 2 (equivalent with the extensions above), but also, even more powerfully, by extending the chain
- hyper4 notation: = hyper4 (a, b) = hyper (a, 4, b) — allows extension by increasing the number 4; this gives the family of hyper operators
For the Ackermann function we have = A(4, b−3) + 3, i.e. A(4, n) = − 3 The up-arrow is used identically to the caret (^), so that the tetration operator may be written as ^^ in ASCII: a^^b. Examples - = = 1
- = = 4
- = = 27
- = = 256
- = = 3,125
- = = 46,656
- = = 823,543
- = = 16,777,216
- = = 387,420,489
- = = 10,000,000,000
- = = 1
- = = 16
- = = 7,625,597,484,987
- = =
- = = = (over 2,000 digits long)
- = = = (over 35,000 digits long)
- = = 1
- = = 65,536
- = = (over three trillion digits long)
- = = 1
- = = = (nearly 20,000 digits long)
Extension to low values of the second operand Using the relation (which follows from the definition of tetration), one can derive (or define) values for where . This confirms the intuitive definition of as simply being . However, no further values can be derived by further iteration in this fashion, as is undefined. Similarly, since is also undefined (), the derivation above does not hold when . Therefore, must remain an undefined quantity as well. (The figure can safely be defined as 1, however.) Again, is an undefined quantity, so values for cannot be defined directly. However, is well defined, and exists: -
This limit holds for negative , as well. could be defined in terms of this limit, but would conflict with the standard undefinedness of . Complex tetration Since complex numbers can be raised to powers, tetration can be applied to numbers of the form , where i is the square root of −1. For example, where , tetration is achieved by using the principal branch of the natural logarithm, and noting the relation: i(a+bi) = eiπ/2 (a+bi) = e-bπ/2 (cos(aπ/2) + i sin(aπ/2)) . This suggests a recursive definition for given any : a' = e-bπ/2 cos(aπ/2) and b' = e-bπ/2 sin(aπ/2) The following approximate values can be derived, where is ordinary exponentiation (ie. in). - = i
- = = 0.2079
- = = 0.9472+ 0.3208i
- = = 0.0501+ 0.6021i
- = = 0.3872+ 0.0305i
- = = 0.7823+ 0.5446i
- = = 0.1426+ 0.4005i
- = = 0.5198+ 0.1184i
- = = 0.5686+ 0.6051i
Solving the relation yields the expected = 1 and = 0, with negative values of k giving infinite results on the imaginary axis. Plotted in the complex plane, the entire sequence spirals to the limit 0.4383+ 0.3606i, which could be interpreted as the value where k 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. Extension to real numbers Extending x↑↑b to real numbers x>0 is straightforward and gives, for each natural number b, a super-power function f(x) = x↑↑b. (The term super is sometimes replaced by hyper: hyper-power function). As mentioned above, for positive integers b the function tends to 1 for x tending to 0 if b is even, and to 0 if b is odd, while for b=0 and b=−1 the function is constant, with values 1 and 0, respectively. Consider the problem of finding a super-exponential function or hyper-exponential function f(x )=a↑↑x which is an extension to real x>−2 to what was defined above, satisfying (for a>1): - it is monotonically increasing
- it is continuous
When a↑↑x is defined for an interval of length one, the whole function easily follows for all x>−2 A simple solution is given by for |
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|