Knuth's up-arrow notation
In mathematics, Knuth's up-arrow notation is a method of notation for very large integers, introduced by Donald Knuth in 1976. It is closely related to the Ackermann function and especially to the hyperoperation sequence. The idea is based on the fact that multiplication can be viewed as iterated addition and exponentiation as iterated multiplication. Continuing in this manner leads to iterated exponentiation (tetration) and to the remainder of the hyperoperation sequence, which is commonly denoted using Knuth arrow notation.
- 1 Introduction
- 2 Notation
- 3 Generalizations
- 4 Definition
- 5 Tables of values
- 6 Numeration systems based on the hyperoperation sequence
- 7 See also
- 8 References
- 9 External links
Exponentiation for a natural power is defined as iterated multiplication, which Knuth denoted by a single up-arrow:
Here and below evaluation is to take place from right to left, as Knuth's arrow operators (just like exponentiation) are defined to be right-associative.
According to this definition,
This already leads to some fairly large numbers, but Knuth extended the notation. He went on to define a “triple arrow” operator for iterated application of the “double arrow” operator (also known as pentation):
followed by a 'quadruple arrow' operator (also known as hexation):
and so on. The general rule is that an -arrow operator expands into a right-associative series of ()-arrow operators. Symbolically,
The notation is commonly used to denote with n arrows.
In expressions such as , the notation for exponentiation is usually to write the exponent as a superscript to the base number . But many environments — such as programming languages and plain-text e-mail — do not support superscript typesetting. People have adopted the linear notation for such environments; the up-arrow suggests 'raising to the power of'. If the character set doesn't contain an up arrow, the caret ^ is used instead.
The superscript notation doesn't lend itself well to generalization, which explains why Knuth chose to work from the inline notation instead.
is a shorter alternative notation for n uparrows. Thus .
Writing out up-arrow notation in terms of powers
Attempting to write using the familiar superscript notation gives a power tower.
- For example:
If b is a variable (or is too large), the power tower might be written using dots and a note indicating the height of the tower.
Continuing with this notation, could be written with a stack of such power towers, each describing the size of the one above it.
Again, if b is a variable or is too large, the stack might be written using dots and a note indicating its height.
Furthermore, might be written using several columns of such stacks of power towers, each column describing the number of power towers in the stack to its left:
And more generally:
This might be carried out indefinitely to represent as iterated exponentiation of iterated exponentiation for any a, n and b (although it clearly becomes rather cumbersome).
The tetration notation allows us to make these diagrams slightly simpler while still employing a geometric representation (we could call these tetration towers).
Finally, as an example, the fourth Ackermann number could be represented as:
Some numbers are so large that multiple arrows of Knuth's up-arrow notation become too cumbersome; then an n-arrow operator is useful (and also for descriptions with a variable number of arrows), or equivalently, hyper operators.
Some numbers are so large that even that notation is not sufficient. Graham's number is an example. The Conway chained arrow notation can then be used: a chain of three elements is equivalent with the other notations, but a chain of four or more is even more powerful.
It is generally suggested that Knuth's arrow should be used for smaller magnitude numbers, and the chained arrow or hyper operators for larger ones.
The up-arrow notation is formally defined by
for all integers with .
All up-arrow operators (including normal exponentiation, ) are right associative, i.e. evaluation is to take place from right to left in an expression that contains two or more such operators. For example, , not ; for example
There is good reason for the choice of this right-to-left order of evaluation. If we used left-to-right evaluation, then would equal , so that would not be an essentially new operation. Right associativity is also natural because we can rewrite the iterated arrow expression that appears in the expansion of as , so that all the s appear as left operands of arrow operators. This is significant since the arrow operators are not commutative.
Writing for the bth functional power of the function we have .
The definition could be extrapolated one step, starting with if n = 0, because exponentiation is repeated multiplication starting with 1. Extrapolating one step more, writing multiplication as repeated addition, is not as straightforward because multiplication is repeated addition starting with 0 instead of 1. "Extrapolating" again one step more, writing addition of n as repeated addition of 1, requires starting with the number a. Compare the definition of the hyper operator, where the starting values for addition and multiplication are also separately specified.
Tables of values
Computing can be restated in terms of an infinite table. We place the numbers in the top row, and fill the left column with values 2. To determine a number in the table, take the number immediately to the left, then look up the required number in the previous row, at the position given by the number just taken.
The table is the same as that of the Ackermann function, except for a shift in and , and an addition of 3 to all values.
We place the numbers in the top row, and fill the left column with values 3. To determine a number in the table, take the number immediately to the left, then look up the required number in the previous row, at the position given by the number just taken.
We place the numbers in the top row, and fill the left column with values 10. To determine a number in the table, take the number immediately to the left, then look up the required number in the previous row, at the position given by the number just taken.
Note that for 2 ≤ n ≤ 9 the numerical order of the numbers is the lexicographical order with m as the most significant number, so for the numbers of these 8 columns the numerical order is simply line-by-line. The same applies for the numbers in the 97 columns with 3 ≤ n ≤ 99, and if we start from m = 1 even for 3 ≤ n ≤ 9,999,999,999.
Numeration systems based on the hyperoperation sequence
R. L. Goodstein, with a system of notation different from Knuth arrows, used the sequence of hyperoperators here denoted by to create systems of numeration for the nonnegative integers. Letting superscripts denote the respective hyperoperators , the so-called complete hereditary representation of integer n, at level k and base b, can be expressed as follows using only the first k hyperoperators and using as digits only 0, 1, ..., b-1:
- For 0 ≤ n ≤ b-1, n is represented simply by the corresponding digit.
- For n > b-1, the representation of n is found recursively, first representing n in the form
- where xk, ..., x1 are the largest integers satisfying (in turn)
- Any xi exceeding b-1 is then re-expressed in the same manner, and so on, repeating this procedure until the resulting form contains only the digits 0, 1, ..., b-1.
The remainder of this section will use , rather than superscripts, to denote the hyperoperators.
Unnecessary parentheses can be avoided by giving higher-level operators higher precedence in the order of evaluation; thus,
level-1 representations have the form , with X also of this form;
level-2 representations have the form , with X,Y also of this form;
level-3 representations have the form , with X,Y,Z also of this form;
level-4 representations have the form , with X,Y,Z,T also of this form;
and so on.
The representations can be abbreviated by omitting any instances of etc.; for example, the level-3 base-2 representation of the number 6 is , which abbreviates to .
Examples: The unique base-2 representations of the number 266, at levels 1, 2, 3, 4, and 5 are as follows:
- Knuth, Donald E. (1976). "Mathematics and Computer Science: Coping with Finiteness". Science 194 (4271): 1235–1242. doi:10.1126/science.194.4271.1235. PMID 17797067.
- Goodstein, R. L. (1947). "Transfinite ordinals in recursive number theory". Journal of Symbolic Logic 12 (4): 123–129. doi:10.2307/2266486. JSTOR 2266486.