Book 2A

© 2026 NeckPinch · www.neckpinch.com · All rights reserved.

Course 2Book 2A: Numbers, Limits and the IntegralChapter 3

Integers and Rationals

Building ℤ and ℚ as quotients of pairs, checking operations are well defined, and finding the gaps in ℚ.

27 min read · Updated Oct 2, 2026

Read with Tao, Analysis I, chapter "Integers and rationals" (the integers, the rationals, absolute value and exponentiation, gaps in the rational numbers).

In this chapter · 6 sections
  1. 3.1Why build the integers at all
  2. 3.2The integers as formal differences
  3. 3.2.1Arithmetic, and checking it is well defined
  4. 3.3The rationals as formal quotients
  5. 3.3.1Order and absolute value
  6. 3.4Between any two rationals, another
  7. 3.5A hole in the rationals
  8. 3.6Exercises

The natural numbers can be added and multiplied, but not always subtracted: 3−53 - 5 has no answer in N\mathbb{N}. Adding a missing answer is a pattern that runs right through mathematics, and this chapter does it twice. First we add the answers to subtractions, which gives the integers Z\mathbb{Z}. Then we add the answers to divisions, which gives the rationals Q\mathbb{Q}. Both times the tool is the one from 2A.2 Sets, Functions and Equivalence: take pairs of numbers you already have, declare when two pairs should count as the same, and pass to the quotient.

The rationals look complete: between any two of them there is another, and they can be added, subtracted, multiplied and divided freely. Yet they have holes. The chapter ends by finding one, at 2\sqrt 2. Filling those holes is the job of the next chapter, and the reason analysis exists.

By the end of this chapter you will be able to:

  • construct Z\mathbb{Z} and Q\mathbb{Q} as quotients, and prove that their operations are well defined;
  • explain why every familiar law of arithmetic for Z\mathbb{Z} and Q\mathbb{Q} now follows from the laws for N\mathbb{N};
  • work with order, absolute value and distance on Q\mathbb{Q}, including the triangle inequality;
  • prove that 2\sqrt 2 is irrational, and explain what that says about Q\mathbb{Q}.

Why build the integers at all

Negative numbers are older than any axiom. The Indian mathematician Brahmagupta stated rules for calculating with them in 628 CE, thinking of positive numbers as fortunes and negative numbers as debts. European mathematics resisted them for many centuries more.1 Even in the 17th century, some European mathematicians called negative solutions of equations "false" or "absurd". Today every bank statement, thermometer and altimeter uses them without comment. The question here is not whether negative numbers make sense. It is how to define them so that their laws (why is (−1)(−1)=1(-1)(-1) = 1?) become theorems, proved from what we already have, rather than rules to be memorised.

The obvious approach is to take N\mathbb{N} and add a new symbol −n-n for each positive nn. That can be made to work, but every definition and proof then splits into cases: positive plus positive, positive plus negative with the positive one larger, and so on. The construction below avoids all the cases by a single idea.

The integers as formal differences

An integer is going to be "what you get by subtracting one natural number from another". Since we can't subtract yet, we record the subtraction as a pair, and write it a—ba \mathbin{—} b (read "aa minus bb", but at this stage just a pair of naturals). Different pairs can describe the same intended number: 3—53 \mathbin{—} 5 and 10—1210 \mathbin{—} 12 should both be "−2-2". When should two pairs be the same? We'd like a−b=c−da - b = c - d, which, moving terms across, means a+d=c+ba + d = c + b, and that involves only addition of naturals.

Definition 3.1 Integers

An integer is an expression a—ba \mathbin{—} b where aa and bb are natural numbers. Two integers are equal, a—b=c—da \mathbin{—} b = c \mathbin{—} d, exactly when a+d=c+ba + d = c + b. Formally, the integers are the quotient of N×N\mathbb{N} \times \mathbb{N} by this equivalence relation, and we write Z\mathbb{Z} for the set of integers.

Figure 3.1. Each integer is a whole diagonal of pairs of naturals. The pairs (0,2)(0,2), (1,3)(1,3), (3,5)(3,5) and so on are all the integer −2-2.

Before this definition can be trusted, we must check that "==" really is an equivalence relation, because equality has to be reflexive, symmetric and transitive (2A.2 Sets, Functions and Equivalence).

Lemma 3.2 This is an equivalence relation

The relation a—b∼c—da \mathbin{—} b \sim c \mathbin{—} d if a+d=c+ba + d = c + b is reflexive, symmetric and transitive.

Proof. Reflexive: a+b=a+ba + b = a + b. Symmetric: a+d=c+ba + d = c + b gives c+b=a+dc + b = a + d. Transitive: suppose a+d=c+ba + d = c + b and c+f=e+dc + f = e + d. Adding these equations, a+d+c+f=c+b+e+da + d + c + f = c + b + e + d. Cancelling c+dc + d from both sides (the cancellation law of 2A.1 The Natural Numbers) leaves a+f=e+ba + f = e + b, which says a—b∼e—fa \mathbin{—} b \sim e \mathbin{—} f.

The proof of transitivity used cancellation, which in turn rested on Axiom 1.4 of 2A.1 The Natural Numbers. The axioms keep doing work long after they've been stated.

Arithmetic, and checking it is well defined

The definitions of the operations come from what we want: (a−b)+(c−d)=(a+c)−(b+d)(a - b) + (c - d) = (a + c) - (b + d) and (a−b)(c−d)=(ac+bd)−(ad+bc)(a - b)(c - d) = (ac + bd) - (ad + bc).

Definition 3.3 Operations on integers
(a—b)+(c—d):=(a+c)—(b+d),(a—b)×(c—d):=(ac+bd)—(ad+bc),(a \mathbin{—} b) + (c \mathbin{—} d) := (a + c) \mathbin{—} (b + d), \qquad (a \mathbin{—} b) \times (c \mathbin{—} d) := (ac + bd) \mathbin{—} (ad + bc),
−(a—b):=b—a.-(a \mathbin{—} b) := b \mathbin{—} a.

These are formulas in terms of representatives, so each one must be checked to be well defined: the answer must not depend on which pair we chose for each integer (2A.2 Sets, Functions and Equivalence). Here is the check for addition. The others are similar (Exercise 3.18).

Lemma 3.4 Addition is well defined

If a—b=a′—b′a \mathbin{—} b = a' \mathbin{—} b', then (a—b)+(c—d)=(a′—b′)+(c—d)(a \mathbin{—} b) + (c \mathbin{—} d) = (a' \mathbin{—} b') + (c \mathbin{—} d). (By symmetry the same holds when the second integer is replaced by an equal one.)

Proof. We are given a+b′=a′+ba + b' = a' + b, and must show (a+c)—(b+d)=(a′+c)—(b′+d)(a + c) \mathbin{—} (b + d) = (a' + c) \mathbin{—} (b' + d), that is, (a+c)+(b′+d)=(a′+c)+(b+d)(a + c) + (b' + d) = (a' + c) + (b + d). Rearranging (associativity and commutativity of addition in N\mathbb{N}), the left side is (a+b′)+(c+d)(a + b') + (c + d) and the right side is (a′+b)+(c+d)(a' + b) + (c + d), and these are equal because a+b′=a′+ba + b' = a' + b.

The naturals sit inside the integers. The natural number nn is identified with the integer n—0n \mathbin{—} 0. This is consistent with the operations: (n—0)+(m—0)=(n+m)—0(n \mathbin{—} 0) + (m \mathbin{—} 0) = (n + m) \mathbin{—} 0 and (n—0)×(m—0)=nm—0(n \mathbin{—} 0) \times (m \mathbin{—} 0) = nm \mathbin{—} 0. We may therefore write nn for n—0n \mathbin{—} 0, −n-n for 0—n0 \mathbin{—} n, and x−yx - y for x+(−y)x + (-y). Once this is done, the formal symbol —\mathbin{—} has served its purpose: a—ba \mathbin{—} b really is a−ba - b.

Lemma 3.5 Trichotomy for integers

Every integer xx is exactly one of: a positive natural number nn; zero; or −n-n for a positive natural number nn.

Proof. Write x=a—bx = a \mathbin{—} b. By trichotomy in N\mathbb{N} (2A.1 The Natural Numbers), exactly one of a>ba > b, a=ba = b, a<ba < b holds. If a>ba > b, then a=b+na = b + n with nn positive, and x=(b+n)—b=n—0=nx = (b + n) \mathbin{—} b = n \mathbin{—} 0 = n. If a=ba = b, then x=0x = 0. If a<ba < b, then b=a+nb = a + n with nn positive, and x=0—n=−nx = 0 \mathbin{—} n = -n. These cases are mutually exclusive by 2A.1 The Natural Numbers's trichotomy, and the representation does not depend on the chosen pair, by Lemma 3.2.

So the quotient construction gives back exactly the picture everyone has of the integers, without our ever having to define them by cases.

Proposition 3.6 The integers form a commutative ring

For all integers x,y,zx, y, z: addition and multiplication are commutative and associative; x+0=xx + 0 = x and x×1=xx \times 1 = x; x+(−x)=0x + (-x) = 0; and multiplication distributes over addition, x(y+z)=xy+xzx(y + z) = xy + xz.

Each law is proved by writing xx, yy, zz as formal differences and using the corresponding laws in N\mathbb{N}. For example, (a—b)+(b—a)=(a+b)—(b+a)=0(a \mathbin{—} b) + (b \mathbin{—} a) = (a + b) \mathbin{—} (b + a) = 0, because (a+b)+0=0+(b+a)(a + b) + 0 = 0 + (b + a). In particular, (−1)(−1)=(0—1)(0—1)=(0+1)—(0+0)=1(-1)(-1) = (0 \mathbin{—} 1)(0 \mathbin{—} 1) = (0 + 1) \mathbin{—} (0 + 0) = 1. The sign rule that schoolchildren memorise is a two-line computation.

Proposition 3.7 No zero divisors; cancellation

If xy=0xy = 0 then x=0x = 0 or y=0y = 0. Consequently, if xz=yzxz = yz and z≠0z \neq 0, then x=yx = y.

The first statement follows from Lemma 3.5 and the corresponding fact for N\mathbb{N} (2A.1 The Natural Numbers), by checking signs. The second follows from the first applied to (x−y)z=0(x - y)z = 0.

Order. For integers, n≥mn \geq m means n−mn - m is a natural number, and n>mn > m means n−mn - m is a positive natural number. The order laws of 2A.1 The Natural Numbers carry over, with one important change: multiplying by a negative number reverses an inequality. If a>ba > b and c<0c < 0 then ac<bcac < bc (Exercise 3.19).

The rationals as formal quotients

Now do the same for division. A rational number should be "aa divided by bb", with b≠0b \neq 0, recorded as a formal quotient a/ ⁣ ⁣/ba /\!\!/ b. When should a/ ⁣ ⁣/ba /\!\!/ b and c/ ⁣ ⁣/dc /\!\!/ d be equal? We'd like a/b=c/da/b = c/d, which means ad=cbad = cb, an equation in the integers alone.

Definition 3.8 Rationals

A rational number is an expression a/ ⁣ ⁣/ba /\!\!/ b with a,ba, b integers and b≠0b \neq 0. Two rationals are equal, a/ ⁣ ⁣/b=c/ ⁣ ⁣/da /\!\!/ b = c /\!\!/ d, exactly when ad=cbad = cb. The set of rationals is written Q\mathbb{Q}: the quotient of Z×(Z∖{0})\mathbb{Z} \times (\mathbb{Z} \setminus \{0\}) by this equivalence relation.

Figure 3.2. Each rational is a whole line through the origin. The pairs (2,1)(2,1), (4,2)(4,2) and (6,3)(6,3) (denominator, numerator) all lie on the line of slope 12\tfrac12, so 1/ ⁣ ⁣/2=2/ ⁣ ⁣/4=3/ ⁣ ⁣/61/\!\!/2 = 2/\!\!/4 = 3/\!\!/6.

Showing this is an equivalence relation needs one more ingredient than for the integers. Transitivity requires cancelling a nonzero factor: from ad=cbad = cb and cf=edcf = ed we get adf=cbf=ebdadf = cbf = ebd, so (af−eb)d=0(af - eb)d = 0, and since d≠0d \neq 0, Proposition 3.7 gives af=ebaf = eb.

Definition 3.9 Operations on rationals
ab+cd:=ad+bcbd,ab×cd:=acbd,−ab:=−ab,\frac{a}{b} + \frac{c}{d} := \frac{ad + bc}{bd}, \qquad \frac{a}{b} \times \frac{c}{d} := \frac{ac}{bd}, \qquad -\frac{a}{b} := \frac{-a}{b},

and, if a≠0a \neq 0, the reciprocal (a/b)−1:=b/a(a/b)^{-1} := b/a.

(Here and from now on we write ab\tfrac{a}{b} or a/ba/b for a/ ⁣ ⁣/ba /\!\!/ b.) The denominators bdbd are nonzero by Proposition 3.7.

Each of these is well defined. For multiplication: if a/b=a′/b′a/b = a'/b', that is, ab′=a′bab' = a'b, then (ac)(b′d)=(a′c)(bd)(ac)(b'd) = (a'c)(bd) (multiply both sides by cdcd and rearrange), which says acbd=a′cb′d\tfrac{ac}{bd} = \tfrac{a'c}{b'd}. The integer nn is identified with n/1n/1, and the operations agree with those of Z\mathbb{Z}.

Proposition 3.10 The rationals form a field

The rationals satisfy all the laws of Proposition 3.6, and in addition every nonzero rational xx has a reciprocal: x⋅x−1=1x \cdot x^{-1} = 1.

A set with an addition and multiplication satisfying these laws is called a field. The integers are not a field, because 22 has no integer reciprocal; the rationals are. We can now define division, x/y:=x×y−1x / y := x \times y^{-1} for y≠0y \neq 0, and powers with integer exponents, x−n:=(xn)−1x^{-n} := (x^n)^{-1}, with the usual laws (Exercise 3.21).

In the world In use Exact fractions in a computer

Floating-point numbers (the subject of 2A.4 The Real Numbers) can't represent 13\tfrac13 exactly, so programs that need exact answers, such as computer algebra systems, exact geometry and some financial calculations, use rationals instead. They store a fraction exactly as this chapter defines it: a pair of integers. To make equality easy to test, they keep one canonical representative of each class, with the numerator and denominator reduced to lowest terms and the denominator positive. Python's standard fractions.Fraction type does exactly this, so Fraction(2, 4) and Fraction(1, 2) are stored identically. Choosing a canonical representative for each equivalence class is a recurring trick: it turns a quotient back into a set of concrete objects.

Order and absolute value

Definition 3.11 Positive rationals; order

A rational xx is positive if x=a/bx = a/b for some positive integers a,ba, b, and negative if −x-x is positive. For rationals, x>yx > y means x−yx - y is positive.

Every rational is exactly one of positive, zero or negative, by the integer version of trichotomy. With this order Q\mathbb{Q} is an ordered field: sums and products of positive rationals are positive, and order is compatible with addition and with multiplication by positive numbers.

Definition 3.12 Absolute value and distance

The absolute value of a rational xx is ∣x∣=x|x| = x if x≥0x \geq 0 and ∣x∣=−x|x| = -x if x<0x < 0. The distance between xx and yy is d(x,y)=∣x−y∣d(x, y) = |x - y|.

Proposition 3.13 Properties of absolute value

For all rationals x,y,zx, y, z:

  1. ∣x∣≥0|x| \geq 0, with ∣x∣=0|x| = 0 exactly when x=0x = 0;
  2. ∣xy∣=∣x∣ ∣y∣|xy| = |x|\,|y|;
  3. (Triangle inequality) ∣x+y∣≤∣x∣+∣y∣|x + y| \leq |x| + |y|, and hence d(x,z)≤d(x,y)+d(y,z)d(x, z) \leq d(x, y) + d(y, z);
  4. ∣x∣≤y|x| \leq y if and only if −y≤x≤y-y \leq x \leq y.

Proof (Triangle inequality). By (4), −∣x∣≤x≤∣x∣-|x| \leq x \leq |x| and −∣y∣≤y≤∣y∣-|y| \leq y \leq |y|. Adding, −(∣x∣+∣y∣)≤x+y≤∣x∣+∣y∣-(|x| + |y|) \leq x + y \leq |x| + |y|, which by (4) again says ∣x+y∣≤∣x∣+∣y∣|x + y| \leq |x| + |y|. Applying this to x−yx - y and y−zy - z, whose sum is x−zx - z, gives the statement about distances.

The triangle inequality is the most-used inequality in analysis. Every argument of the form "these two things are close because each is close to a third" is an application of it, and in 2B.1 Metric Spaces it becomes the defining property of a distance.

Definition 3.14 ε-closeness

Let ε>0\varepsilon > 0 be rational. Two rationals xx and yy are ε\varepsilon-close if d(x,y)≤εd(x, y) \leq \varepsilon.

This is a deliberately modest notion: it is about a single tolerance ε\varepsilon, not about limits. But the next chapter builds the real numbers entirely out of statements of the form "for every ε>0\varepsilon > 0, eventually, things are ε\varepsilon-close". Two facts are worth having in hand: if xx is ε\varepsilon-close to yy and yy is δ\delta-close to zz, then xx is (ε+δ)(\varepsilon + \delta)-close to zz (triangle inequality); and if x,yx, y are ε\varepsilon-close then xz,yzxz, yz are ε∣z∣\varepsilon|z|-close.

Between any two rationals, another

The integers are spread out, one unit apart. The rationals are not: they crowd together everywhere. The first step is to show that the integers at least reach everywhere.

Proposition 3.15 Archimedean property and the integer part

For every rational xx there is a unique integer nn with n≤x<n+1n \leq x < n + 1. In particular, for every rational xx there is a natural number larger than xx.

Proof. Existence for x=a/bx = a/b with b>0b > 0: by Euclidean division in N\mathbb{N} (2A.1 The Natural Numbers), extended to integers aa in Exercise 3.20, write a=nb+ra = nb + r with 0≤r<b0 \leq r < b. Then x=n+r/bx = n + r/b with 0≤r/b<10 \leq r/b < 1. Uniqueness: if n≤x<n+1n \leq x < n + 1 and m≤x<m+1m \leq x < m + 1, then ∣n−m∣<1|n - m| < 1, and the only integer with absolute value less than 11 is 00.

Proposition 3.16 The rationals are dense

If x<yx < y are rationals, then there is a rational zz with x<z<yx < z < y.

Proof. Take z=(x+y)/2z = (x + y)/2. Then z−x=(y−x)/2>0z - x = (y - x)/2 > 0 and y−z=(y−x)/2>0y - z = (y - x)/2 > 0.

Applying Proposition 3.16 again and again, there are infinitely many rationals between any two. A picture of the rationals between 00 and 11 suggests a continuum with no room left over.

Figure 3.3. Every fraction between 00 and 11 with denominator at most 1212, the taller ticks for smaller denominators. The rationals are dense: between any two there are infinitely many more. Yet, as the next section shows, the line still has holes.

A hole in the rationals

The square on a unit length has a diagonal of length dd with d2=12+12=2d^2 = 1^2 + 1^2 = 2, by Pythagoras. Is that length a rational number?

Theorem 3.17 2\sqrt 2 is irrational

There is no rational number xx with x2=2x^2 = 2.

Proof (By infinite descent). Suppose x2=2x^2 = 2 for some rational xx. Replacing xx by −x-x if necessary, x>0x > 0, so x=p/qx = p/q with pp and qq positive natural numbers. Then p2=2q2p^2 = 2q^2. So p2p^2 is even, and therefore pp is even, since the square of an odd number is odd ((2k+1)2=2(2k2+2k)+1(2k+1)^2 = 2(2k^2 + 2k) + 1). Write p=2p′p = 2p'. Then 4p′2=2q24p'^2 = 2q^2, so q2=2p′2q^2 = 2p'^2, and by the same argument qq is even, q=2q′q = 2q'. Now x=p/q=p′/q′x = p/q = p'/q', with 0<q′<q0 < q' < q.

We started from one representation x=p/qx = p/q with positive natural numbers and produced another with a strictly smaller denominator. Repeating forever would give an infinite strictly decreasing sequence of natural numbers q>q′>q′′>⋯q > q' > q'' > \cdots, which is impossible by the well-ordering principle of 2A.1 The Natural Numbers. So no such xx exists.

The proof uses exactly the descent form of well-ordering from 2A.1 The Natural Numbers. A shorter version takes qq to be the smallest possible denominator at the start, and reaches a contradiction in one step.

Figure 3.4. The diagonal of the unit square has length 2\sqrt 2, which is not rational. Rationals get as close to it as you like (32\tfrac32, 1712\tfrac{17}{12}, 577408\tfrac{577}{408}, …, from the divide-and-average method of 2A.4 The Real Numbers), but none lands on it.

So the rationals, though dense, are full of holes. There are rationals whose squares are as close to 22 as you please, from both sides, but none whose square is 22. Calculus needs every such gap filled. The intermediate value theorem (2A.9 Continuous Functions) would be false over Q\mathbb{Q}: the function x2−2x^2 - 2 is negative at 11 and positive at 22, yet has no rational zero. Filling the gaps is the construction of the real numbers.

In the world Data Why no tuning is perfect: the Pythagorean comma

The same kind of argument, about prime factors, explains a fact every musician lives with. Two notes a perfect fifth apart have frequencies in the ratio 3/23/2, and an octave is a ratio of 22. Twelve fifths are meant to span the same range as seven octaves, so you would hope (3/2)12=27(3/2)^{12} = 2^7, which means 312=2193^{12} = 2^{19}. That is impossible: 3123^{12} is odd and 2192^{19} is even. The actual ratio is

(3/2)1227=312219=531441524288≈1.01364,\frac{(3/2)^{12}}{2^7} = \frac{3^{12}}{2^{19}} = \frac{531441}{524288} \approx 1.01364,

about 23.46 cents, roughly a quarter of a semitone. This is the Pythagorean comma. Going round the circle of fifths from C doesn't return exactly to C. Equal temperament, the tuning of most modern keyboards, hides the comma by making every fifth very slightly narrow, by one twelfth of the comma (about 2 cents), so the circle closes.

Figure 3.5. Stacking perfect fifths (×32\times\tfrac32) and folding back into one octave, drawn as one turn of a circle. After twelve fifths you land just past the start: the gap is the Pythagorean comma. It can't be zero, because no power of 33 is a power of 22.
Where this goes Where this goes

Two ideas from this chapter run far ahead. The first is the quotient construction with a well-definedness check, which builds the reals next (2A.4 The Real Numbers) and much later the spaces on which Ricci flow acts (11A.3 Short-Time Existence and Uniqueness). The second is the triangle inequality. It defines a metric space in 2B.1 Metric Spaces, and in Riemannian geometry (9A.3 Geodesics and the Exponential Map) the distance between two points of a curved space is defined as the length of the shortest path between them, a definition chosen precisely so that the triangle inequality holds.

Recall Where we stand

From the natural numbers we have built the integers, a commutative ring with no zero divisors, and the rationals, an ordered field with an absolute value satisfying the triangle inequality. The rationals are dense but have gaps: x2=2x^2 = 2 has no rational solution. 2A.4 The Real Numbers fills the gaps and builds the real numbers.

Exercises

Exercise 3.18 Multiplication is well defined

Show that integer multiplication (Definition 3.3) is well defined: if a—b=a′—b′a \mathbin{—} b = a' \mathbin{—} b', then (a—b)(c—d)=(a′—b′)(c—d)(a \mathbin{—} b)(c \mathbin{—} d) = (a' \mathbin{—} b')(c \mathbin{—} d).

Hint

You are given a+b′=a′+ba + b' = a' + b. Multiply by cc and by dd, and add the results in the right combination.

Solution

We need (ac+bd)+(a′d+b′c)=(a′c+b′d)+(ad+bc)(ac + bd) + (a'd + b'c) = (a'c + b'd) + (ad + bc). Multiplying a+b′=a′+ba + b' = a' + b by cc gives ac+b′c=a′c+bcac + b'c = a'c + bc, and multiplying by dd (with the sides swapped) gives a′d+bd=ad+b′da'd + bd = ad + b'd. Adding these two equations gives exactly the required identity.

Exercise 3.19 Multiplying by a negative

Prove that if a>ba > b and c<0c < 0 are integers, then ac<bcac < bc. Where does the proof use Lemma 3.5?

Exercise 3.20 Euclidean division for integers

Extend Euclidean division to all integers: for every integer aa and positive integer bb there are unique integers nn and rr with a=nb+ra = nb + r and 0≤r<b0 \leq r < b. Then compute the integer part of −7/3-7/3.

Solution

For a≥0a \geq 0 this is 2A.1 The Natural Numbers. For a<0a < 0, divide −a-a: −a=mb+s-a = mb + s with 0≤s<b0 \leq s < b. If s=0s = 0 take n=−mn = -m, r=0r = 0. Otherwise a=−mb−s=(−m−1)b+(b−s)a = -mb - s = (-m - 1)b + (b - s), with 0<b−s<b0 < b - s < b. Uniqueness is as in 2A.1 The Natural Numbers. For −7/3-7/3: −7=(−3)⋅3+2-7 = (-3)\cdot 3 + 2, so the integer part is −3-3, not −2-2.

Exercise 3.21 Powers with integer exponents

Prove that xmxn=xm+nx^m x^n = x^{m + n} for every nonzero rational xx and all integers m,nm, n, using the definition x−n=(xn)−1x^{-n} = (x^n)^{-1} for natural nn. Then show that if 0<x<y0 < x < y and nn is a positive integer, then xn<ynx^n < y^n, but x−n>y−nx^{-n} > y^{-n}.

Exercise 3.22 The reverse triangle inequality

Prove that ∣∣x∣−∣y∣∣≤∣x−y∣\big||x| - |y|\big| \leq |x - y| for all rationals x,yx, y. Interpret it as a statement about distances to 00.

Solution

By the triangle inequality, ∣x∣=∣(x−y)+y∣≤∣x−y∣+∣y∣|x| = |(x - y) + y| \leq |x - y| + |y|, so ∣x∣−∣y∣≤∣x−y∣|x| - |y| \leq |x - y|. Swapping xx and yy, ∣y∣−∣x∣≤∣x−y∣|y| - |x| \leq |x - y|. Together these say ∣∣x∣−∣y∣∣≤∣x−y∣\big||x| - |y|\big| \leq |x - y|. In words: two points that are close have nearly equal distances from 00.

Exercise 3.23 Other square roots

Prove that 3\sqrt 3 is irrational, and more generally that if nn is a natural number that is not a perfect square, then n\sqrt n is irrational. Why does the descent argument fail for n=4n = 4?

Hint

For general nn, use unique factorisation: in p2=nq2p^2 = nq^2, each prime appears to an even power on the left. Or use the well-ordering principle directly: take the smallest qq with qnq\sqrt n an integer pp, and consider q′=p−⌊n⌋qq' = p - \lfloor\sqrt n\rfloor q.

Exercise 3.24 Rationals between rationals with small denominators

Find the rational with the smallest positive denominator lying strictly between 38\tfrac{3}{8} and 25\tfrac{2}{5}. (Look at Figure 3.3: rationals with small denominators are spread out, so the answer has a larger denominator than you might expect.)

Solution

Any rational strictly between them has denominator at least 1313. With denominator 1313, the candidates near 0.380.38–0.40.4 are 513≈0.3846\tfrac{5}{13} \approx 0.3846, which works, since 0.375<0.3846<0.40.375 < 0.3846 < 0.4. Checking denominators 11 to 1212 shows none works: for example 38=0.375\tfrac{3}{8} = 0.375 and 25=0.4\tfrac{2}{5} = 0.4 are adjacent among fractions with denominators up to 88, and the next fraction to appear between them is the mediant 3+28+5=513\tfrac{3 + 2}{8 + 5} = \tfrac{5}{13}.

Exercise 3.25 Rehearsal: closeness is not transitive, but it adds up

Show that if xx is ε\varepsilon-close to yy and yy is ε\varepsilon-close to zz, then xx need not be ε\varepsilon-close to zz, but is always 2ε2\varepsilon-close to it. Compare with the "similar enough" relation in 2A.2 Sets, Functions and Equivalence. Much of analysis consists of carefully tracking how such small errors add up. In 2A.4 The Real Numbers they are made to vanish in the limit; in Ricci flow, a "ε\varepsilon-neck" (12B.2 The Structure of κ-Solutions) is a region that is ε\varepsilon-close to a model cylinder, and the proofs keep track of how the $\varepsilon$s accumulate.

© 2026 NeckPinch (www.neckpinch.com). All content in the guidebook (text, mathematics, figures and exercises) is protected by copyright. All rights reserved. No part may be copied, republished or redistributed without written permission.