Hyper_operator

Hyper operator

The hyper operators forming the hypern family are related to Knuth's up-arrow notation and Conway chained arrow notation as follows:

$textrm{hyper} n (a, b) = textrm{hyper}(a,n,b) = a uparrow^{n-2} b = a to b to (n-2)$ .

This family of operators was described by Reuben Goodstein , using the notation G(k,a,n) for what would here be written as hyper(a,k,n) or a^(k)n, etc., which is a variant of the Ackermann function. In the 1947 paper, Goodstein introduced the names "tetration", "pentation", "hexation", etc., for the successive operators beyond exponentiation. (More-recent publications refer to this entire family and its variants simply as the Ackermann hierarchy.)

For example, with n = 4 we have hyper4 (tetration, super-exponentiation, power towers, etc.) in terms of an extension of standard operators:

${operatorname{hyper4} (a, b) = operatorname{hyper}(a, 4, b) = a ^ {(4)} b = a uparrowuparrow b = atop { }} !!!!!!!}}}} atop {bmbox{ copies of }a}} !!!!!!!{=ato bto 2 atop { }}$

Derivation of the notation

It can be seen as an answer to the question "what's next in this sequence: summation (+), multiplication (×), exponentiation (^),…?" Noting that

$a + b = 1 + (a + (b - 1))$
$a times b = a + (a times (b - 1))$
$a ^ b = a times (a ^ {(b - 1)})$

recursively define an infix triadic operator (making n=0 correspond to the successor function):

$a ^ {(n)} b=$

 left{

begin{matrix} b+1, & mbox{if }n=0 a, & mbox{if }n=1,b=0 0, & mbox{if }n=2,b=0 1, & mbox{if }nge 3,b=0 a ^ {(n-1)} (a ^ {(n)} (b - 1)) & mbox{if }nge 1,bge 1,age 0 end{matrix}

 right.

then define $operatorname{hypermathit{n}} (a, b) = a ^ {(n)} b$ and $operatorname{hyper}(a, n, b) = a ^ {(n)} b$

This gives:

$operatorname{hyper1} (a, b) = operatorname{hyper}(a, 1, b) = a ^ {(1)} b = a+b$

$operatorname{hyper2} (a, b) = operatorname{hyper}(a, 2, b) = a ^ {(2)} b = ab$

$operatorname{hyper3} (a, b) = operatorname{hyper}(a, 3, b) = a ^ {(3)} b = a^b$

${operatorname{hyper4} (a, b) = operatorname{hyper}(a, 4, b) = a ^ {(4)} b = a uparrowuparrow b = atop { }} !!!!!!!}}}} atop {bmbox{ copies of }a}}$

as further explained in the separate article tetration.

Known aliases for hyper4 include superpower, superdegree, and powerlog; other notation, $operatorname{hyper4}(a,b)={}^{b}a$ .

The family has not been extended from natural numbers to real numbers in general for n>3, due to nonassociativity in the "obvious" methods.

Evaluation from left to right

An alternative for these operators is obtained by evaluation from left to right. Since

$a+b = (a+(b-1))+1$
$atimes b = (atimes (b-1))+a$
$a^b = (a^{(b-1)})times a$

define (with subscripts instead of superscripts) $a_{(n+1)}b = (a_{(n+1)}(b-1))_{(n)}a$ with $a_{(1)}b = a+b$ , $a _ {(2)} 0 = 0$ , and $a _ {(n)} 0 = 1$ for $n>2$

But this suffers a kind of collapse, failing to form the "power tower" traditionally expected of hyper4: $a_{(4)}b = a^{(a^{(b-1)})}$

How can $a^{(n)}b$ be so different from $a_{(n)}b$ for n>3? This is because of a symmetry called associativity that's defined into + and × (see field) but which ^ lacks. It is more apt to say the two (n)s were decreed to be the same for n<4. (On the other hand, one can object that the field operations were defined to mimic what had been "observed in nature" and ask why "nature" suddenly objects to that symmetry…)

The other degrees do not collapse in this way, and so this family has some interest of its own as lower (perhaps lesser or inferior) hyper operators.

For example:

moser = (..(2^^2)^^..2)^^2 (258 numbers 2)

Numeration systems based on hyper operations

Goodstein [1947] used what are here called hyper operators (in other notation) to create systems of numeration for the nonnegative integers. 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 hyper operators, written in the superscript notation defined earlier, 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

b^{(k)}{x_k}^{(k-1)}{x_{k-1}}^{(k-2)} dots {x_2}^{(1)}x_1

where x_k, ..., x₁ are the largest integers satisfying (in turn)

b^{(k)}x_k le n

b^{(k)}{x_k}^{(k-1)}x_{k-1} le n

...

b^{(k)}{x_k}^{(k-1)}{x_{k-1}}^{(k-2)} dots {x_2}^{(1)}x_1 le n

Any x_i 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.

Alternative notations for the underlying operator hierarchy could also be used, in which case the superscript

^{(i)}

simply denotes the i^th operation in the hierarchy. For example, Knuth arrows (together with the usual + and × signs) can be used to denote this same hierarchy as

(+, times, uparrow, uparrowuparrow, uparrowuparrowuparrow, dots)

, and are used freely in the remainder of this section. Unnecessary parentheses can be avoided by giving higher-level operators higher precedence in the order of evaluation; thus,

level-1 representations have the form $b + X$ , with X also of this form;

level-2 representations have the form $b times X + Y$ , with X,Y also of this form;

level-3 representations have the form $b uparrow X times Y + Z$ , with X,Y,Z also of this form;

level-4 representations have the form $b uparrowuparrow X uparrow Y times Z + T$ , with X,Y,Z,T also of this form;

and so on.

The representations can be abbreviated by omitting any instances of $+0, times1, uparrow1, uparrowuparrow1,$ etc.; for example, the level-3 base-2 representation of the number 6 is $2uparrow(2uparrow1times1+0)times1+(2uparrow1times1+0)$ , which abbreviates to $2 uparrow 2 + 2$ .

Examples: The unique base-2 representations of the number 266, at levels 1, 2, 3, 4, and 5 are as follows: