Integer

An integer is a number that can be represented as either a natural number or its additive inverse. −4, 0, and 1,003 are examples integers. 499.99 is not an integer. Integers are real numbers; they are rational numbers; and they are not fractions or decimals.

A Mathier Definition

Instead of describing the properties of an integer we’ll describe the membership rules for the set \(\mathbb{Z}\). After we’re done, anything that’s been allowed into \(\mathbb{Z}\) counts as an integer.

Start by putting \(0\) and \(1\) into \(\mathbb{Z}\). Now, pick an element of \(\mathbb{Z}\), pick another element of \(\mathbb{Z}\), and add them together (you can pick the same element twice). Is that number in \(\mathbb{Z}\) yet? No?! Well let’s put it in there fast. We can do the same thing as before except instead of adding, we subtract, and if the difference isn’t in \(\mathbb{Z}\) yet, we put it in there. Anything that could be let into \(\mathbb{Z}\) with these procedures is an integer.

This is not an efficient algorithm for building out \(\mathbb{Z}\), but it does show the primary motivation for having integers in the first place. Natural numbers (positive integers) are closed under addition, meaning that if you add any two elements in the set, the sum will be in the set, but natural numbers are not closed under subtraction. Integers are what you get when you expand natural numbers to make a set that is closed under subtraction as well.

Formal construction

Given access to the set \(\mathbb{N}\) of natural numbers, we may construct \(\mathbb{Z}\) as follows. Take the collection of all pairs \((a, b)\) of natural numbers, and take the quotient by the equivalence relation \(\sim\) such that \((a,b) \sim (c,d)\) if and only if \(a+d = b+c\). (The intuition is that the pair \((a,b)\) stands for the integer \(a-b\), and we take the quotient so that any given integer has just one representative.)

Writing \([a,b]\) for the equivalence class of the pair \((a,b)\), we define the ordered ring structure as:

• \([a,b] + [c,d] = [a+c,b+d]\)

• \([a, b] \times [c, d] = [ac+bd, bc+ad]\)

• \([a,b] \leq [c,d]\) if and only if \(a+d \leq b+c\).

This does define the structure of a totally ordered ring (proof).