## Preliminaries

What is a number? It is just an abstract object that is only defined in relation to other numbers. We will approach this from a graph theory angle. All the possible number objects, in graph theory called vertices, are each connected to all other objects through directed edges shown as arrows in this diagram.

Out of this big mess we will select one single special element at random, shown in yellow here. We will also select sets of directed edges that follow certain rules.

We will call these directed edges **unary open functions**.

Traditionally functions have a defined domain and range. Since the names “mapping” and “transformation” also have special meanings in Mathematics and since the directed edges are most like unary functions we use the term *open function* for them, but it should be clear that they have an open domain; they can be applied to any other object, and that we use their range to define new sets, as explained below.

## Definition

Here, open function *f* changes number object *p* into number object *q* or *q = f(p).*

Such an open function is conceptually similar a unary function, except that functions are defined as a mapping with a domain and a range. We use open functions to define new sets of numbers, and the domain is the set S of number objects already defined. This means we are able to apply any of our unary open functions to any number object in S. The result will either be a number object in S or not in S. In the latter case we can use this new number object to extend S.

We will define all the finite number sets that we need using one single initial number object 0 and two types of open functions, loops and chains.

**Axiom 1. **We select one number object 0.

We denote repeated applications of an open function to an object with a superscript. For open function *f* and all objects *p*:

where *n* is a positive integer indicating the number of repeated applications. This is used as a shorthand notation; instead of saying *f(f(f(p)))* we can use *f ^{3}(p)*.

From all the possible directed edges that connect all the number objects we select two types of open functions, **chains** and **loops**, which conform to certain rules:

Chain:

- keeps generating new objects
- is commutative

Loop of order n:

- forms an n element cycle with any number object other than 0.
- two objects define the loop between them
- one loop per order
- order 2 special case relating inverse chains

A formal definition of each of these rules follows.

An open function *inc* is called a chain if for any object p we have *inc ^{n}(p)*

*≠ inc*for all natural numbers

^{m}(p)*n≠m*and for all objects

*p.*

Shown is a chain called *inc* that is repeatedly applied to a starting number object *s*. We can apply inc as often as we like and we will always get new number objects.

Furthermore we require that chains are commutative, so if *inc _{a}* and

*inc*are different inc chains if

_{b}*a≠b*and

*p*is a number object and

*n*and

*m*are positive integers then

*inc*

_{a}^{n}(inc_{b}^{m}(p))=inc_{b}^{m}(inc_{a}^{n}(p))An open function *rot _{n}* is called a loop of order n (with respect to 0) if

*rot*and for all objects

_{n}(0)=0*p≠0*we have

*rot*if and only if

_{n}^{m}(p) = p*n*divides

*m*.

Chains and loops are both bijective. The **inverse open function** of loop or chain *f(p)* is *f*(p)* such that

*f(f*(p)) = f*(f(p)) = p* for all *p*.

**Axiom 2. **For any number object p≠0 if rot_{n}(p) = rot_{m}(p) then n=m.

This states that two (non zero) objects define the loop* * between them. Here is an example:

In this diagram there is a *rot _{4}* open function in red and the

*rot*open function in blue. The black dotted arrow is not a valid alternative

_{2}*rot*open function because it connects two objects that are already connected by a red arrow.

_{2}**Axiom 3. **For any and n>0 there is only one unique set of n number objects generated by rot_{n}^{m}(p).

What these axioms state is best illustrated with an example. Here we have five objects a,b,c,d and e that are related with order 5 loops.

There are 4 different order 5 loops, shown as solid and dotted, red and blue arrows. They are interchangeable in the sense that there isn’t anything special about one particular one. If we pick one randomly to be called *rot _{5}*, then the other three are

*rot*,

_{5}^{2}*rot*and

_{5}^{3}*rot*.

_{5}^{4}Axiom 3 states that there are no other order 5 loops containing either a,b,c,d or e.

**Axiom 4. **

Let x=inc_{n}^{m}(0) and let y=inc^{*}_{n}^{m}(0) for any positive integer n and m. Then x and y are related by the rot_{2} loop:

This means that rot_{2} is a special loop open function that relates any inc chain to its inverse.

If we look at all the inc back boxes starting from our object zero we get a star shape like this.

For n>0 we relate the nth object on one chain with the nth object of another chain using rot open functions.

**Axiom 5. **For all n>0 there exist n distinct chains inc_{0}, inc_{1},…,inc_{n-1} and a loop rot_{n} of order n such that rot_{y}(inc_{0}^{x}(0))=inc_{y}^{x}(0) for all x>0 and all 0≤y≤n-1.

Some of these rot open functions are shown in the following diagram.

We have now defined the axes of our number system. All the inc chains are only connected at 0 but we can still get new number objects if we apply an inc chain to objects other than 0 on another inc chain.

For n >0 we define **M _{n}** to be set of all objects that can be obtained from 0 by applying the composition of a finite sequence of the open functions inc

_{0}, inc

_{1},…,inc

_{n-1}.

We use the Gaussian integers which is set M_{4} as an example set to illustrate the definition.

The grey objects are on the axes. The open functions shown as light and dark blue arrows can be viewed as the functions +1 and +i.

## Permutability

In the diagram above we don’t need to define which direction is 1 and i, and -1 and -i. 1 and i are interchangeable, as well as 1 and -1, while 1 and -i are not.

From definitions 2 and 3 we know that for x≠0 and a prime order n, rot_{n}^{m}(x) for any m generates exactly n objects.

There are however n-1 loops of order n, namely rot_{n}^{1}, rot_{n}^{2}, … rot_{n}^{n-1}. These loop open functions are completely interchangeable.

We would like to allow a notation that is closer to conventional mathematical notation, but this requires that we randomly pick one chain to be in the 1 direction such that 1 = inc_{0}(0).

For each order *n* we define a **rotational constant of order n** called **r _{n}** such that r

_{1}=1 and r

_{n}=rot

_{n}(1). (“rotational” because they loop, not because they necessarily create a geometric rotation.)

This is just for convenience, so we can use familiar binary operations rather than the unary *rot*. Actually there is no privileged “1” object, the only object we define is “0” in Axiom 1.

## Some lemmas

**Lemma 1. **If rot_{n}^{m} is a loop of order n then rot_{n}^{n-m} is its inverse open function.

Proof: *rot _{n}^{m}(rot_{n}^{n-m}(x))=rot_{n}^{n}(x)=x*

**Lemma 2. **Loops are commutative such that rot_{a}^{b}(rot_{c}^{d}(x))=rot_{c}^{d}(rot_{a}^{b}(x)).

Proof: rot_{a}^{b}(rot_{c}^{d}(x))=rot_{ac}^{b+d}(x)=rot_{c}^{d}(rot_{a}^{b}(x))

**Lemma 3. **Non-prime order loops contain sub-loops for dividing orders.

Proof: from Axiom 3 we get (r_{nm})^{n}=r_{m}and (r_{nm})^{m}=r_{n}

**Lemma 4. **Even ordered loops contain negative rotational constants.

Proof: from Lemma 3 we get (r_{2n})^{n} = -1

Objects *a* and *b* in set *M _{n}* can be generalised like this:

We call the numbers *a _{x}* and

*b*the

_{x}**coordinates**of

*a*and

*b*respectively.

We can define **addition** of *a* and *b*.

*a _{x}* and

*b*are natural numbers.

_{x}**Lemma 5. **Even ordered sets M_{2n} are n dimensional, while the odd ordered sets M_{2n+1} are 2n+1 dimensional.

Proof:

M_{1}=N, M_{2}=Z

From Lemma 4: in an even order M_{2n} there are only n dimensions because of the 2n powers of the rotational constant, half are inverses of each other.

**Lemma 6. **(M_{n},+) is a free abelian group of rank n if n is odd or of rank n/2 if n is even.

Proof: Let L_{n} be the set generated by repeated multiplication of r_{n}. This set contains n elements including 1:

L_{n} is closed under binary multiplication.

There is associativity since:

The identity element is 1.

Each element r_{n}^{a} has an inverse r_{n}^{n-a} since

r_{n}^{a} r_{n}^{n-a} = r_{n}^{n} = 1

Therefore L_{n} is a cyclic group of order n.

Set *M _{n}* is a group of

*L*over

_{n}*N*, where

*n>2*.

**Lemma 7. **The set M_{n} does not depend on the choice of object 0 in Axiom 1 in the sense that sets generated by different objects are isomorphic to each other.

Proof: We pick a new object Q as the origin and we define a mapping from each point p to p+Q in the new coordinate system. Inc open functions remain unchanged in the new coordinate system and we define a new open function qrot such that:

*qrot _{n}(x) = rot_{n}(x-Q)+Q*

Any number *rot _{n}(x)* in the original system maps to number

*rot*in the new coordinate system.

_{n}(x)+Q*rot _{n}(x)+Q = qrot_{n}(x+Q)*

## Neighbourhood and generation

A number p in M_{n} with all non-zero coordinates has n **neighbours in order n**, namely:

In an even ordered, n-dimensional, set M_{2n} half of these are in the direction towards the origin, and half away from it. We call the ones towards the origin **predecessors in order 2n** and the ones away from the origin **successors in order 2n**. The predecessors of p are these:

An odd ordered set M_{2n+1} is 2n+1 dimensional. Each point with all non-zero coordinates has 2n+1 neighbours. All the neighbours are predecessors order 2n+1.

If a number has coordinates that are zero then it has fewer neighbours. Let’s have a look at a diagram depicting the M_{4} set to illustrate this.

The grey numbers on the axes have only one predecessor order 4 each, while the white numbers have two predecessors order 4 each.

We can say that each number is defined by its predecessor(s), recursively until we reach zero. For example the number 3 is defined as 2+1. In effect “3” is shorthand for ((0+1)+1)+1.

The minimum number of inc chains to reach the number from zero is called the **generation**.

Using once again our complex integer grid to illustrate this:

The number inside each circle indicates the generation. Thus generation 1 is defined solely by the initial condition at the origin. Generation 2 is defined by generation 1 and so on. Generation is the distance from the origin and computed by the sum of the coordinates.

## 1.5. General form

In an even order M_{2n} there are only n dimensions because of the 2n powers of the rotational constant, half are inverses of each other.

For 0 < m < 2n-1 we only want the positive (r_{2n})^{m}

The use absolute bars to denote this:

As an example let’s look at order 4. The four powers of r4 are 1,i,-1,-i. We pick the two positive powers by specifying |r_{4}|^{0} and |r_{4}|^{1}.

The general form for a number:

Odd orders *2n+1* have *2n+1* coordinates *a _{k}*.

Even orders 2n have n coordinates.

As a simplification we will use the following notation to stand for the general order n case.