TheoremBase

Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order

Pairs (x, m) of an integer and a natural number, thought of as x/m, with (x, m) ≈ (y, n) when x·n = y·m, form an equivalence relation; on the classes [x, m] there are unique sum, product, negation and order given by the usual formulas.

Statement

In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let Z\mathbb{Z}, its operations and order, and ι\iota be as in The Integers §integers, The Integers §operations and The Integers §embedding. Let Q=Z×NQ=\mathbb{Z}\times\mathbb{N} and let ≈\approx be the relation on QQ with (x,m)≈(y,n)(x,m)\approx(y,n) if and only if x ι(n)=y ι(m)x\,\iota(n)=y\,\iota(m), for all x,y∈Zx,y\in\mathbb{Z} and m,n∈Nm,n\in\mathbb{N}, given by Maps and Relations Given by Formulas §relation.

≈\approx is an equivalence relation on QQ. Write Q/≈Q/{\approx} for the quotient and [x,m][x,m] for the class of (x,m)(x,m).

Q/≈Q/{\approx} is a set whose elements are exactly the classes [x,m][x,m] with x∈Zx\in\mathbb{Z} and m∈Nm\in\mathbb{N}, and for all x,y∈Zx,y\in\mathbb{Z} and m,n∈Nm,n\in\mathbb{N}, [x,m]=[y,n][x,m]=[y,n] if and only if x ι(n)=y ι(m)x\,\iota(n)=y\,\iota(m).

There are unique binary operations ++ and ⋅\cdot on Q/≈Q/{\approx}, a unique map u↦−uu\mapsto-u from Q/≈Q/{\approx} to itself and a unique relation ≤\le on Q/≈Q/{\approx} such that, for all x,y∈Zx,y\in\mathbb{Z} and m,n∈Nm,n\in\mathbb{N},

[x,m]+[y,n]=[x ι(n)+y ι(m),mn],[x,m]⋅[y,n]=[xy,mn],−[x,m]=[−x,m],[x,m]≤[y,n]  ⟺  x ι(n)≤y ι(m).[x,m]+[y,n]=[x\,\iota(n)+y\,\iota(m),mn],\quad[x,m]\cdot[y,n]=[xy,mn],\quad-[x,m]=[-x,m],\quad[x,m]\le[y,n]\iff x\,\iota(n)\le y\,\iota(m).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…