Evanalysis
3.3Source-backedEstimated reading time: 1 min

3.3 Integers from equivalence classes

Construct the integers from pairs of natural numbers, understand why equivalence classes are needed, and see how the familiar signed numbers reappear.

Note collections

MATH1090: Set theory

Rigorous course notes on logic, sets, and number construction, written in short linked sections with careful proofs and examples.

Chapter 1

Logic

Reasoning tools for statements, connectives, and quantifiers.

Chapter 2

Sets and relations

Basic set language, functions, and relations.

Chapter 4

Order and completeness

Total order, bounds, supremum and infimum, and the completeness gap between Q and R.

The natural numbers are not enough for every algebraic problem. A simple equation such as

1=x+21 = x + 2

has no solution in NN. So if we want subtraction to become possible in a systematic way, we need a larger number system.

The source notes do not introduce negative numbers by intuition alone. Instead, they construct the integers from objects we already understand well, namely pairs of natural numbers.

The guiding idea

A pair (a,b) is meant to represent the formal difference

ab.a-b.

From that viewpoint, different pairs can represent the same intended integer. For example,

(3,1),(5,3),(8,6)(3,1), \quad (5,3), \quad (8,6)

all suggest the same difference, namely 2.

So the integer should not be the ordered pair itself. It should be the whole equivalence class of pairs that encode the same difference.

The relation on N2N^2

Definition

The equivalence relation for the integers

Work in the set N2N^2 of ordered pairs of natural numbers.

Define a relation Z\sim_Z by

(a,b)Z(c,d)a+d=b+c.(a,b) \sim_Z (c,d) \quad \Longleftrightarrow \quad a+d=b+c.

The integers are defined to be the equivalence classes of this relation.

The equation a+d=b+ca+d=b+c is exactly what we would expect if (a,b) and (c,d) are both meant to represent the same formal difference:

ab=cd.a-b=c-d.

Indeed, rearranging this equality gives precisely a+d=b+ca+d=b+c.

Why this relation is the right one

Theorem

The relation really is an equivalence relation

The relation Z\sim_Z on N2N^2 is reflexive, symmetric, and transitive, so it is an equivalence relation.

The proof is not difficult, but it is worth understanding because it explains why quotient constructions work.

Proof

Why Z\sim_Z is an equivalence relation

What an integer now is

Definition

Integers as quotient classes

Let X=N2X=N^2. The set of integers is

Z=X/Z.\mathbf{Z} = X/{\sim_Z}.

For a pair (a,b)N2(a,b) \in N^2, its equivalence class is written

[(a,b)]={(c,d)N2:(c,d)Z(a,b)}.[(a,b)] = \{(c,d)\in N^2 : (c,d)\sim_Z(a,b)\}.

So an integer is not one pair, but an entire class of equivalent pairs.

This construction explains how the familiar numbers reappear:

  • [(0,0)] behaves like 0;
  • [(1,0)] behaves like 1;
  • [(0,1)] behaves like 1-1;
  • more generally, [(n,0)] gives the usual natural number n.

Embedding the natural numbers

The natural numbers are still present inside the integers. They are not lost; they are reinterpreted.

Worked example

How NN sits inside ZZ

Define a map from NN to ZZ by

n[(n,0)].n \longmapsto [(n,0)].

Under this map,

0[(0,0)],1[(1,0)],2[(2,0)].0 \mapsto [(0,0)], \qquad 1 \mapsto [(1,0)], \qquad 2 \mapsto [(2,0)].

So the old natural numbers appear inside the new system as particular equivalence classes.

This is why quotient constructions do not destroy previous number systems. They usually enlarge them while preserving a recognizable copy inside the new one.

Positive, negative, and zero

The source notes emphasize that sign is not attached to one chosen pair, but to the entire class.

  • an integer is positive when it has representatives (a,b) with a>ba>b;
  • it is negative when it has representatives with a<ba<b;
  • it is zero when it has representatives with a=ba=b.

Because these properties must not depend on the chosen representative, one also has to check that sign is well defined on equivalence classes.

Arithmetic on equivalence classes

To turn the quotient set into a number system, we still need operations. Addition is defined by

[(a,b)]+[(c,d)]:=[(a+c,b+d)].[(a,b)] + [(c,d)] := [(a+c,b+d)].

This definition matches the formal-difference intuition:

(ab)+(cd)=(a+c)(b+d).(a-b)+(c-d)=(a+c)-(b+d).

The next step, developed further in the source notes, is to check that such definitions are well defined, meaning they do not depend on the representatives chosen.

A concrete class calculation

Worked example

Recognizing one integer through several representatives

Consider the class [(2,5)].

Since

2+4=5+1,2+4 = 5+1,

we have

(2,5)Z(1,4).(2,5)\sim_Z(1,4).

Likewise,

2+7=5+4,2+7 = 5+4,

so

(2,5)Z(4,7).(2,5)\sim_Z(4,7).

All of these pairs represent the same integer, namely the one we would usually think of as 3-3.

Common mistakes

Common mistake

The integer is not the pair

The pair (a,b) is only a representative. The actual integer is the entire equivalence class [(a,b)].

Common mistake

Different representatives can describe the same number

Pairs such as (3,1) and (5,3) are not different integers. They belong to the same class because they encode the same difference.

Quick checks

Quick check

Are (2,0) and (5,3) equivalent under Z\sim_Z?

Apply the rule a+d=b+ca+d=b+c directly.

Solution

Answer

Quick check

Which class should represent the integer 1-1?

Use the idea that the pair records a formal difference.

Solution

Answer

Quick check

Why do we need equivalence classes instead of just using raw ordered pairs?

Answer in one careful sentence.

Solution

Answer

Exercises

Quick check

Show that [(4,1)]=[(7,4)][(4,1)] = [(7,4)], and decide whether the class is positive, negative, or zero.

Check equivalence first, then interpret the sign from a representative.

Solution

Guided solution

Read this first

This note depends on the language of equivalence relations from 2.2 Functions and relations and continues into 3.4 Rationals and well-defined operations.

Key terms in this unit