Instead I want to look at the integers in terms of their multiplicative properties and see if additive properties (in particular the standard ordering of the positive integers) can be derived. So begin with a set of prime numbers, given in order 1,2,3,...... with 1 as multiplicative identity and other numbers formed by stringing together primes with multiplications. The question is:

**how might these these composites be ordered? So here is a very incomplete thought.**

We will try to derive an ordering using the symbol “n” to
mean immediate neighbor, so that if B is the immediate neighbor to the right of
A we can write:

A n B

If there is a sequence of zero of more numbers C1,C2,C3, …
such that AnC1nC2nC3……..nB then we write:

A nn B

Note that A n B
implies A nn B and that A nn B nn C implies A nn C, by definition.

We assume the arithmetic
properties of multiplication: presence of identity “1”, associativity,
commutativity. We also assume the
standard ordered sequence or primes 2, 3, 5, 7, 11, etc.

__Simple Axioms__

- The relation ‘n’ and the
relation ‘nn’ are no
__not__reflexive (A n A is false, A nn A is false) - The relation ‘n’ is
__not__transitive (but ‘nn’ is transitive, as noted above) - If A n B then C*A nn C*B (and not C*A n C*B unless C==1)
- [added] Every A has a B such that A n B

__Key Axioms__

- (ISOPERIMETRY) If A n B and C n D where A nn C we must have A*D nn B*C
- (PARSIMONY) Composites occur as early in the sequence as possible without violating (4)

__Assume__

1 nn 2 nn 3 nn 5 etc.

Axiom (4) is like the isoperimetric concept: of all rectangles with the same perimeter, the square is the one with the largest area. Axiom (5) says that composites are packed as closely together as possible; alternatively, that primes are introduced as infrequently as possible.

Partial Theorem

1 n 2 n 3 n 4 n 5 n 6
n 7 n 8 n 9 n 10 n 11 follows from the axioms and the order of the primes.

Theorem (unproved)

The conventional additive order of the (composite) integers
can be derived from these axioms and the order of the primes.

Proof of the partial theorem is something like this: 1 has a
neighbor but it cannot be a composite using just 1, so it must be 2, hence 1 n 2.

Now axiom (5) says we should try to put 2*2 as soon as possible after 2 but that would give us 1 n 2 n 2*2.

Now axiom (5) says we should try to put 2*2 as soon as possible after 2 but that would give us 1 n 2 n 2*2.

Isoperimetry and axiom (4) try to address the way n/(n+1) increases towards 1 as n increases.

ReplyDeleteAnother comment is that multiplication derives from a pre-occupation with rectangular arrangements of pebbles. You could do other shapes with the pebbles and go in still other directions.

ReplyDeleteNot only that, multiplication assumes we can count acts of counting. So counting 1, 2, ..., n as many as m times, give n*m.

DeleteIf you felt like disagreeing, you could ask: how do we guarantee, while counting 'acts of counting' that each one was done in the same way?

Also mention this: if for example the additive order of the composites cannot be derived from the primes, it leads to the question of whether there could be more than one ordering of the composites, using the same primes.

ReplyDeleteI can now get up to 13 with order guaranteed by the isoperimetry requirement. But there is no good reason I can see for 14<15 unless you start analyzing the space between 5 and 7, where 6 screws you up and adds to complexity in a way that might still come under isoperimetry but is beyond ME.

ReplyDeleteI was playing with powers of 2 and 3, wondering if there was any clear way to order them using isoperimetry. But there may be no way to order them in any case. Speculate that the only set of primes that lead to order-able composites is the old familiar infinite set of all primes.

ReplyDeleteBut how cool would it be for there to exist a set of -say- 63 primes whose composites could be ordered and form an abelian group under the "next" operation?

ReplyDeleteIt would be fun - who doesn't like a new number system?