The Integers
It is known that whilst the equation x − 3 = 0 ha a solutions in ℕ, the equation x + 3 = 0 has not. We want to extend the set ℕ in a way to include solutions to equations of the form x + n = 0, n ∈ ℕ. We are led in this way to the intger set ℤ = {...,-3,-2,-1,0,1,2,3...}. To introduce negative intergers we'll use notions already introduced in the previous chapters. We start from the cartesian product ℕ x ℕ, the set of all ordered pairs of natural numbers, with the following relation
(n,m) ρ (n',m') ⇐⇒ n + m' = m + n'
an equivalence relation. Two ordered couples (n,m) and (n',m') of integers are euqal if n + m' = m + n'. The set ℕ x ℕ is partitioned in classes (n,m).
thus the couples (1,0), (2,1), (3,2) on the same diagonal are equivalence classes (1 + 2 = 3 + 0) and represent the same integer 1. As representetive of each class it is possible to choose particular couples, those in which one of the elements is zero. Geometrically, by those couple located on coordinate axis
(0,0)
(1,0), (2,0) (3,0), ..., (n,0)...
(0,1), (0,2) (0,3), ..., (0,n)...
The integers set defined as
ℤ := ℕ x ℕ /ρ
ℤ can be decomposed in the following subsets:
ℤ := ℤ+ ∪ {0} ∪ ℤ−
where
ℤ+ := {(n,0) | n ∈ ℕ, n ≠0},
0 := (0,0),
ℤ− := {(0,n) | n ∈ ℕ, n ≠0}
The elements of ℤ+ are named positive integers, the one of ℤ− negative integers.
The set ℤ is an extension of ℕ, because it contains a subset ℤ+ ∪ {0} that corresponds to ℕ through the injective map from ℕ to ℤ that maps to every natural integer n, the class (n,0)|. In the set ℤ is possible to define two operations: addition and multiplication in the following way:
(n,m) + (n',m') := (n+n',m+m')
(n,m) ⋅ (n',m') := (nn' + mm', n'm+nm')
Remarks
These are well-defined operations (see exercise 2): even though they are defined by representatives of classes, they do not depend on which representative is chosen.
From now on we'll indicate the elements of ℤ in the following way:
(n,0) := n, (0,0) := 0, (0,n) := −n
ℤ with respect to the two operations of addition and multiplication just defined, has the following properties:
a + b = b + a, ∀a,b ∈ ℤ (commutative property of addition)
a ⋅ b = b ⋅ a, ∀ a,b ∈ ℤ (commutative property of multiplication))
(a + b) + c = a + (b + c), ∀a,b,c ∈ ℤ (addition is associative)
(a ⋅ b) ⋅ c = a ⋅ (b ⋅ c), ∀a,b,c ∈ ℤ, (multiplication is associative)
there exists a unique element 0 ∈ ℤ such that a + 0 = 0 + a, ∀a ∈ ℤ (existence of the additive identity)
∀a ∈ ℤ there exists a unique element −a, such that a + (−a) = (−a) + a = 0 (existence of the inverse)
there exists in ℤ a unique element, 1, such that a ⋅ 1 = 1 ⋅ a, ∀a ∈ ℤ (existence of the multiplicative identity)
a ⋅ (b + c) = a ⋅ b + a ⋅ c, (a + b) ⋅ c = a ⋅ c + b ⋅ c, ∀a,b,c ∈ ℤ (Multiplication is distributive with respect to addition)
We anticipate that a set endowed with two binary operations satisfying the axioms above is defiend as commutative ring with unit. Thus ℤ(+, ⋅) is an example of commutative ring with unit; The ring E of all even integers is not a commutative ring with unit, in fact it does not contain a unit.
Lemma 2.1.1. Let a, b be elements of ℤ. Then
a ⋅ 0 = 0 ⋅ a = 0;
(−a) ⋅ b = −(a ⋅ b);
(−a) ⋅ (−b) = ab.
Proof
It results 0 + (a ⋅ 0) = a ⋅ 0 = a ⋅ (0 + 0) = a ⋅ 0 + a ⋅ 0, thus a ⋅ 0 = 0.
0 = 0 ⋅ b = (a + (a)) ⋅ b = a ⋅ b + (−a) ⋅ b, thus (−a) ⋅ b = −(a ⋅ b).
(−a) ⋅ (−b) = per (ii) = −(a(−b)) = −(−(ab)) = ab.□
Proposition 2.1.2. Let a and b two integers. Then ab = 0 if and only if a = 0 or b = 0.
Proof. Note that if a and b are both positive or both negatives, their product is always postive or negative (if they are both positives, rembember the definition of product in ℕ, if they are both negatives consider the (iii) in the above proposition). If instead a > 0 and b < 0, then −b is positive, thus a(−b) = −ab is positive, and ab is negative. Thus if ab = 0 necessarily either a or b must be null. The inverse is obviuos from the lemma above property (i). □
Definition 2.1.3. The absolute value of an integer a is defined as the positive number:
Note that −b ≤ a ≤ b for a,b integers (or real) is equivalent to |a| ≤ b.
Let a,b ∈ ℤ, the following relations hold:
|a| + |b| > |a + b|; |a| ⋅ |b| = |a ⋅ b|