Introduction

Equivalence Classes

Arithmetic Operations

Properties

Constructing the Integers

Bernd Schroder

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).
2. Throwing in negative numbers (using what integers are)
is harder than it looks.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).
2. Throwing in negative numbers (using what integers are)
is harder than it looks.
2.1 Construction has a lot of case distinctions.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).
2. Throwing in negative numbers (using what integers are)
is harder than it looks.
2.1 Construction has a lot of case distinctions.
2.2 Ancient Greek philosophers avoided negative quantities.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).
2. Throwing in negative numbers (using what integers are)
is harder than it looks.
2.1 Construction has a lot of case distinctions.
2.2 Ancient Greek philosophers avoided negative quantities.
2.3 Some elementary and middle school students struggle with
the concept.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).
2. Throwing in negative numbers (using what integers are)
is harder than it looks.
2.1 Construction has a lot of case distinctions.
2.2 Ancient Greek philosophers avoided negative quantities.
2.3 Some elementary and middle school students struggle with
the concept.

3. So we will focus on what the integers do, that is, we will

focus on formal differences.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).
2. Throwing in negative numbers (using what integers are)
is harder than it looks.
2.1 Construction has a lot of case distinctions.
2.2 Ancient Greek philosophers avoided negative quantities.
2.3 Some elementary and middle school students struggle with
the concept.

3. So we will focus on what the integers do, that is, we will

focus on formal differences.
Motivation for the formal definition of the integers:

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).
2. Throwing in negative numbers (using what integers are)
is harder than it looks.
2.1 Construction has a lot of case distinctions.
2.2 Ancient Greek philosophers avoided negative quantities.
2.3 Some elementary and middle school students struggle with
the concept.

3. So we will focus on what the integers do, that is, we will

focus on formal differences.
Motivation for the formal definition of the integers:
(a b) = (c d)
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

What Do We Want?
1. We know what the integers are (natural numbers,
negative natural numbers and zero) and we know what
they do (they allow subtraction of arbitrary numbers).
2. Throwing in negative numbers (using what integers are)
is harder than it looks.
2.1 Construction has a lot of case distinctions.
2.2 Ancient Greek philosophers avoided negative quantities.
2.3 Some elementary and middle school students struggle with
the concept.

3. So we will focus on what the integers do, that is, we will

focus on formal differences.
Motivation for the formal definition of the integers:
(a b) = (c d) iff a + d = b + c.
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c, which is equivalent to c + b = d + a

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c, which is equivalent to c + b = d + a,
which is equivalent to (c, d) (a, b).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c, which is equivalent to c + b = d + a,
which is equivalent to (c, d) (a, b).
For transitivity, let (a, b), (c, d), (e, f ) N N be so that
(a, b) (c, d) and (c, d) (e, f ).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c, which is equivalent to c + b = d + a,
which is equivalent to (c, d) (a, b).
For transitivity, let (a, b), (c, d), (e, f ) N N be so that
(a, b) (c, d) and (c, d) (e, f ). Then a + d = b + c and
c + f = d + e.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c, which is equivalent to c + b = d + a,
which is equivalent to (c, d) (a, b).
For transitivity, let (a, b), (c, d), (e, f ) N N be so that
(a, b) (c, d) and (c, d) (e, f ). Then a + d = b + c and
c + f = d + e. Adding these equations yields
a + d + c + f = b + c + d + e.
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c, which is equivalent to c + b = d + a,
which is equivalent to (c, d) (a, b).
For transitivity, let (a, b), (c, d), (e, f ) N N be so that
(a, b) (c, d) and (c, d) (e, f ). Then a + d = b + c and
c + f = d + e. Adding these equations yields
a + d + c + f = b + c + d + e. We can cancel c + d to obtain
a+f = b+e
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c, which is equivalent to c + b = d + a,
which is equivalent to (c, d) (a, b).
For transitivity, let (a, b), (c, d), (e, f ) N N be so that
(a, b) (c, d) and (c, d) (e, f ). Then a + d = b + c and
c + f = d + e. Adding these equations yields
a + d + c + f = b + c + d + e. We can cancel c + d to obtain
a + f = b + e, which means that (a, b) (e, f ).
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proposition. The relation on N N defined by (a, b) (c, d)

iff a + d = b + c is an equivalence relation.
Proof. We must prove that is reflexive, symmetric and
transitive.
For reflexivity, note that for all (a, b) N N we have
a + b = b + a, which means that (a, b) (a, b).
For symmetry, let (a, b), (c, d) N N. Then (a, b) (c, d) is
equivalent to a + d = b + c, which is equivalent to c + b = d + a,
which is equivalent to (c, d) (a, b).
For transitivity, let (a, b), (c, d), (e, f ) N N be so that
(a, b) (c, d) and (c, d) (e, f ). Then a + d = b + c and
c + f = d + e. Adding these equations yields
a + d + c + f = b + c + d + e. We can cancel c + d to obtain
a + f = b + e, which means that (a, b) (e, f ).
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition:

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).

Proposition.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence class of (x, y) under .

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d) = ac

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d) = ac ad

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d) = ac ad bc

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d) = ac ad bc + bd

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d) = ac ad bc + bd = (ac + bd) (ad + bc).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d) = ac ad bc + bd = (ac + bd) (ad + bc).
Proposition.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d) = ac ad bc + bd = (ac + bd) (ad + bc).


Proposition. For each (x, y) N N, let (x, y) denote the
equivalence class of (x, y) under .

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Motivation for addition: (a b) + (c d) = (a + c) (b + d).



Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class of (x,
 y) under .Then the operation
(a, b) + (c, d) := (a + c, b + d) is well-defined.
Proof. Exercise.
Motivation for multiplication:
(a b) (c d) = ac ad bc + bd = (ac + bd) (ad + bc).


Proposition. For each (x, y) N N, let (x, y) denote the
equivalence

  class
 of(x, y) under . Then
 the operation
(a, b) (c, d) := (ac + bd, ad + bc) is well-defined.
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proof.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) .

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 )

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c


= a + b0 c + bd + a0 d0 + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0
= a0 c + bc + bd + b0 c0 + a0 d0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0


= a0 c0 + a0 + b d + bc + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0
= a0 c0 + ad + b0 d + bc + b0 c0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0


= a0 c0 + ad + b0 d + bc + b0 c0 = a0 c0 + ad + b0 d + c0 + bc

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0


= a0 c0 + ad + b0 d + bc + b0 c0 = a0 c0 + ad + b0 d + c0 + bc


= a0 c0 + ad + b0 d0 + c + bc

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0


= a0 c0 + ad + b0 d + bc + b0 c0 = a0 c0 + ad + b0 d + c0 + bc


= a0 c0 + ad + b0 d0 + c + bc = a0 c0 + ad + b0 d0 + b0 c + bc

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0


= a0 c0 + ad + b0 d + bc + b0 c0 = a0 c0 + ad + b0 d + c0 + bc


= a0 c0 + ad + b0 d0 + c + bc = a0 c0 + ad + b0 d0 + b0 c + bc
= a0 c0 + b0 d0 + ad + bc + b0 c

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0


= a0 c0 + ad + b0 d + bc + b0 c0 = a0 c0 + ad + b0 d + c0 + bc


= a0 c0 + ad + b0 d0 + c + bc = a0 c0 + ad + b0 d0 + b0 c + bc
= a0 c0 + b0 d0 + ad + bc + b0 c
Hence ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0


= a0 c0 + ad + b0 d + bc + b0 c0 = a0 c0 + ad + b0 d + c0 + bc


= a0 c0 + ad + b0 d0 + c + bc = a0 c0 + ad + b0 d0 + b0 c + bc
= a0 c0 + b0 d0 + ad + bc + b0 c
0 0
0 0
a0 c0 + b0 d0 + ad +bc, that is,
Hence ac + bd + a d +b c0 =
0
(ac + bd, ad + bc) = (a c + b0 d0 , a0 d0 + b0 c0 ) .
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties


 


 

Proof. Let (a, b) = (a0 , b0 ) and let (c, d) = (c0 , d0 ) . We
must prove (ac + bd, ad + bc) = (a0 c0 + b0 d0 , a0 d0 + b0 c0 ) ,
that is, ac + bd + a0 d0 + b0 c0 = a0 c0 + b0 d0 + ad + bc.
ac + bd + a0 d0 + b0 c0 + b0 c




= a + b0 c + bd + a0 d0 + b0 c0 = a0 + b c + bd + a0 d0 + b0 c0


= a0 c + bc + bd + b0 c0 + a0 d0 = a0 c + d0 + bc + bd + b0 c0


= a0 c0 + d + bc + bd + b0 c0 = a0 c0 + a0 d + bc + bd + b0 c0




= a0 c0 + a0 + b d + bc + b0 c0 = a0 c0 + a + b0 d + bc + b0 c0


= a0 c0 + ad + b0 d + bc + b0 c0 = a0 c0 + ad + b0 d + c0 + bc


= a0 c0 + ad + b0 d0 + c + bc = a0 c0 + ad + b0 d0 + b0 c + bc
= a0 c0 + b0 d0 + ad + bc + b0 c
0 0
0 0
a0 c0 + b0 d0 + ad +bc, that is,
Hence ac + bd + a d +b c0 =
0
(ac + bd, ad + bc) = (a c + b0 d0 , a0 d0 + b0 c0 ) .
Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Definition.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Definition. The integers

Zare defined to be the set of

equivalence classes (a, b) of elements of N N under the
equivalence relation .

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Definition. The integers

Zare defined to be the set of

equivalence classes (a, b) of elements of N N under the
equivalence

  relation
 . Addition of
 integers is defined by
(a, b) + (c, d) = (a + c, b + d)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Definition. The integers

Zare defined to be the set of

equivalence classes (a, b) of elements of N N under the
equivalence

  relation
 . Addition of
 integers is defined by
and multiplication
is
(a, b) + (c, d) = (a +c, b +
d)


defined by (a, b) (c, d) = (ac + bd, ad + bc) .

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem. The addition + of integers is associative

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem.
The

 addition + of integers is associative,
0 := (1, 1) is a neutral element with respect to +

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem.
The

 addition + of integers is associative,
0 := (1, 1) is a neutral element with respect
 to +,
 for every
x = (a, b) Z there is an element x := (b, a) so that
x + (x) = (x) + x = 0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem.
The

 addition + of integers is associative,
0 := (1, 1) is a neutral element with respect
 to +,
 for every
x = (a, b) Z there is an element x := (b, a) so that
x + (x) = (x) + x = 0, and + is commutative.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proof (associativity).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) .

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) . Then
(x + y) + z

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) . Then

 
 

(x + y) + z =
(a, b) + (c, d) + (e, f )

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) . Then

 
 

(x + y) + z =
(a, b) + (c, d) + (e, f )

 

= (a + c, b + d) + (e, f )

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) . Then

 
 

(x + y) + z =
(a, b) + (c, d) + (e, f )

 

= (a + c, b + d) + (e, f )
h

i
(a + c) + e, (b + d) + f
=

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) . Then

 
 

(x + y) + z =
(a, b) + (c, d) + (e, f )

 

= (a + c, b + d) + (e, f )
h

i
(a + c) + e, (b + d) + f
=
h

i
=
a + (c + e), b + (d + f )

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) . Then

 
 

(x + y) + z =
(a, b) + (c, d) + (e, f )

 

= (a + c, b + d) + (e, f )
h

i
(a + c) + e, (b + d) + f
=
h

i
=
a + (c + e), b + (d + f )

 

= (a, b) + (c + e, d + f )

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) . Then

 
 

(x + y) + z =
(a, b) + (c, d) + (e, f )

 

= (a + c, b + d) + (e, f )
h

i
(a + c) + e, (b + d) + f
=
h

i
=
a + (c + e), b + (d + f )

 

= (a, b) + (c + e, d + f )

 
 

= (a, b) + (c, d) + (e, f )

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(associativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
,




y = (c, d) , and z = (e, f ) . Then

 
 

(x + y) + z =
(a, b) + (c, d) + (e, f )

 

= (a + c, b + d) + (e, f )
h

i
(a + c) + e, (b + d) + f
=
h

i
=
a + (c + e), b + (d + f )

 

= (a, b) + (c + e, d + f )

 
 

= (a, b) + (c, d) + (e, f )
= x + (y + z).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proof (neutral element).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.
x+0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

 

x + 0 = (a, b) + (1, 1)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

 

x + 0 = (a, b) + (1, 1)


= (a + 1, b + 1)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

 

x + 0 = (a, b) + (1, 1)


= (a + 1, b + 1)


= (a, b)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

 

x + 0 = (a, b) + (1, 1)


= (a + 1, b + 1)


= (a, b)
= x

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

 

x + 0 = (a, b) + (1, 1)


= (a + 1, b + 1)


= (a, b)
= x


= (a, b)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

 

x + 0 = (a, b) + (1, 1)


= (a + 1, b + 1)


= (a, b)
= x


= (a, b)


= (1 + a, 1 + b)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

 

x + 0 = (a, b) + (1, 1)


= (a + 1, b + 1)


= (a, b)
= x


= (a, b)


= (1 + a, 1 + b)

 

= (1, 1) + (a, b)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (neutral element). Let x = (a, b) Z.

 

x + 0 = (a, b) + (1, 1)


= (a + 1, b + 1)


= (a, b)
= x


= (a, b)


= (1 + a, 1 + b)

 

= (1, 1) + (a, b)
= 0 + x.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proof (inverse element).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.
x + (x)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.

 

x + (x) = (a, b) + (b, a)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.

 

x + (x) = (a, b) + (b, a)


= (a + b, b + a)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.

 

x + (x) = (a, b) + (b, a)


= (a + b, b + a)


= (1, 1)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.

 

x + (x) = (a, b) + (b, a)


= (a + b, b + a)


= (1, 1)
= 0

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.

 

x + (x) = (a, b) + (b, a)


= (a + b, b + a)


= (1, 1)
= 0


= (b + a, a + b)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.

 

x + (x) = (a, b) + (b, a)


= (a + b, b + a)


= (1, 1)
= 0


= (b + a, a + b)

 

= (b, a) + (a, b)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof (inverse
element).
Let
x
=
(a,
b)
Z and let


x := (b, a) Z.

 

x + (x) = (a, b) + (b, a)


= (a + b, b + a)


= (1, 1)
= 0


= (b + a, a + b)

 

= (b, a) + (a, b)
= (x) + x.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Proof (commutativity).

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(commutativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
and


y = (c, d) .

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(commutativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
and


y = (c, d) .
x+y

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(commutativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
and


y = (c, d) .

 

x + y = (a, b) + (c, d)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(commutativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
and


y = (c, d) .

 

x + y = (a, b) + (c, d)


= (a + c, b + d)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(commutativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
and


y = (c, d) .

 

x + y = (a, b) + (c, d)


= (a + c, b + d)


= (c + a, d + b)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(commutativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
and


y = (c, d) .

 

x + y = (a, b) + (c, d)


= (a + c, b + d)


= (c + a, d + b)

 

= (c, d) + (a, b)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(commutativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
and


y = (c, d) .

 

x + y = (a, b) + (c, d)


= (a + c, b + d)


= (c + a, d + b)

 

= (c, d) + (a, b)
= y+x

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties



Proof
(commutativity).
Let
x,
y,
z

Z
with
x
=
(a,
b)
and


y = (c, d) .

 

x + y = (a, b) + (c, d)


= (a + c, b + d)


= (c + a, d + b)

 

= (c, d) + (a, b)
= y+x

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem. Multiplication of integers is associative

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem. Multiplication of integers is associative, distributive

over addition

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem. Multiplication of integers is associative,


 distributive
over addition, it has a neutral element 1 := (2, 1)

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem. Multiplication of integers is associative,


 distributive
over addition, it has a neutral element 1 := (2, 1) , and it is
commutative.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science

Introduction

Equivalence Classes

Arithmetic Operations

Properties

Theorem. Multiplication of integers is associative,


 distributive
over addition, it has a neutral element 1 := (2, 1) , and it is
commutative.
Proof. Exercise.

Bernd Schroder
Constructing the Integers

logo1
Louisiana Tech University, College of Engineering and Science