vars.io

Integer Construction


The integers may be defined as the set of all natural pairs N×Nℕ × ℕ, and may be denoted as Z.

Equality

The proposition of whether two integers (a1,b1),(a2,b2)(a_1, b_1), (a_2, b_2) are equal can be rewritten as an equality statement on two naturals.

(a1,b1)=(a2,b2):=a1+b2=a2+b1 (a_1, b_1) = (a_2, b_2) := a_1 + b_2 = a_2 + b_1

Order

(a1,b1)<(a2,b2):=a1+b2<a2+b1 (a_1, b_1) < (a_2, b_2) := a_1 + b_2 < a_2 + b_1

Addition

Let (a1,b1),(a2,b2)(a_1, b_1), (a_2, b_2) be natural pairs. Then integer addition is defined as entry-wise natural addition.

(a1,b1)+(a2,b2):=(a1+a2,b1+b2) (a_1, b_1) + (a_2, b_2) := (a_1 + a_2, \, b_1 + b_2)

Negation

(a,b):=(b,a) -(a, b) := (b, a)

Multiplication

Let (a1,b1),(a2,b2)(a_1, b_1), (a_2, b_2) be natural pairs. Then integer multiplication is defined:

(a1,b1)×(a2,b2):=(a1a2+b1b2,a1b2+a2b1) (a_1, b_1) × (a_2, b_2) := (a_1 a_2 + b_1 b_2, \, a_1 b_2 + a_2 b_1)

Integers as a Group

The integers qualifies as a group under addition and also as a commutative ring under both addition and multiplication.

Integer Addition is Well Defined

A function is well defined when expressions which are considered the same object are treated identically. For the integers under addition, we would want to know that [0,0][0, 0] is treated as the same object as [1,1][1, 1].

Let a,a,b,b,x,yNa, a', b, b', x, y ∈ ℕ.

[a,b]=[a,b]?[a,b]+[x,y]=[a,b]+[x,y] [a, b] = [a', b'] \stackrel{?}{⟶} [a, b] + [x, y] = [a', b'] + [x, y]
[a+x,b+y]=[a+x,b+y [a + x, b + y] = [a' + x, b' + y
a+b+x+y=a+b+x+y a + b' + x + y = a' + b + x + y
a+b=a+b a + b' = a' + b

But the truth of our original assumption [a,b]=[a,b][a, b] = [a', b'] rests on whether a+b=a+ba + b' = a' + b, and thus addition is well defined. This proof can be repeated for the commutative case.

Integer Multiplication is Well Defined

[a,b]=[a,b]?[a,b]×[x,y]=[a,b]×[x,y] [a, b] = [a', b'] \stackrel{?}{⟶} [a, b] × [x, y] = [a', b'] × [x, y]
[ax+by,ay+bx]=[ax+by,ay+bx] [ax + by, ay + bx] = [a'x + b'y, a'y + b'x]

By the equality of the integers.

ax+by+ay+bx=ay+bx+ax+by ax + by + a'y + b'x = ay + bx + a'x + b'y
x(a+b)+y(a+b)=x(a+b)+y(a+b) x(a + b') + y(a' + b) = x(a' + b) + y(a + b')

But we have already assumed that [a,b]=[a,b][a, b] = [a', b']. This proof can be repeated for the commutative case.

Subset of Integers isomorphic to Naturals

Integers of the form [n,0][n, 0] are isomorphic to naturals of the form nn. Consider that integers in this form are closed under addition and multiplication:

[n,0]+[m,0]=[n+m,0] [n, 0] + [m, 0] = [n + m, 0]
[n,0]×[m,0]=[n×m,0] [n, 0] × [m, 0] = [n × m, 0]

And that two integers in this form are only equal when:

[n,0]=[m,0]n=m [n, 0] = [m, 0] ⟶ n = m

Trichotomy of the Integers

If xx is an integer, then only one of the three possibilities may be true:

  1. x=0x = 0.
  2. xx is equivalent to a positive natural.
  3. xx is equivalent to a negative natural.

First we will describe what we consider to be a “negative” natural. We have accepted that integers of the form [n,0][n, 0] are isomorphic to the naturals under addition. Then by the definition of integer negation, a negative natural will take the form of:

[n,0]=[0,n] -[n, 0] = [0, n]

Secondly, since we already accept that xx is an integer, then xx may take on the form of a natural pair [a,b][a, b]. Then by the trichotomy of the naturals we know that only one of three possibilities may occur at any time:

  1. a=ba = b
  2. a<ba < b
  3. a>ba > b

In the event of a=ba = b we can show that such integers are always equivalent to the natural 00.

a=b?[a,b]=[0,0] a = b \stackrel{?}{⟶} [a, b] = [0, 0]
a+0=b+0 a + 0 = b + 0

In the event of a>ba > b, then by the definition of strict natural order:

a>ba=b+(n+ ⁣+) a > b ⟶ a = b + (n{+\!+})
[a,b]=[n+ ⁣+,0] [a, b] = [n{+\!+}, 0]

In the event of a<ba < b we have by definition of strict natural order:

a<ba+(n+ ⁣+)=b a < b ⟶ a + (n{+\!+}) = b
[a,b]=[0,n+ ⁣+] [a, b] = [0, n{+\!+}]

Integers cannot reciprocate 00

We want to see if the integers have any zero divisors.

[a×b=0][a=0][b=0] [a × b = 0] ⟶ [a = 0] ∨ [b = 0]