TheoremBase

The map is built in three stages: by recursion on the natural numbers, then through the quotients defining the integers and the rationals. The consequences of the three defining properties and the order property are derived from it, and uniqueness follows because any such map is forced on naturals, then on integers, then on fractions.

Proof

Conventions. By Ordered Fields §ordered-field and Fields §field, rr is a set and a field, so 0r≠1r0_{r}\neq1_{r}, and rr is a commutative ring. Computations in rr use the laws of Commutative Rings §ring, w+(−w)=0rw+(-w)=0_{r} from Negatives, Differences, Reciprocals and Quotients §negative, w⋅w−1=1rw\cdot w^{-1}=1_{r} for w≠0rw\neq0_{r} from Negatives, Differences, Reciprocals and Quotients §reciprocal, and the rules of Rules of Arithmetic and Order in an Ordered Field cited below. These rules also hold in Q\mathbb{Q}, which is an ordered field by The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §ordered-field. Classes of natural numbers used for induction are formed by class abstraction, as Sets and Maps: Ordinary Notation §set-builder prescribes, and induction is Arithmetic and Order of the Natural Numbers §induction. We use Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-transitive in rr (a total, hence partial, order), which we call (T).

Step 1: the natural numbers. Since w+1r∈rw+1_{r}\in r for w∈rw\in r, Maps and Relations Given by Formulas §binary gives a map g:N×r→rg:\mathbb{N}\times r\to r with g((n,w))=w+1rg((n,w))=w+1_{r}. By Recursion on the Natural Numbers Starting at One §recursion, with a=ra=r and c=1rc=1_{r}, there is a map ψ:N→r\psi:\mathbb{N}\to r with ψ(1)=1r\psi(1)=1_{r} and ψ(n+1)=ψ(n)+1r\psi(n+1)=\psi(n)+1_{r} for every n∈Nn\in\mathbb{N}. Let m,n∈Nm,n\in\mathbb{N}.

(1a) ψ(m+n)=ψ(m)+ψ(n)\psi(m+n)=\psi(m)+\psi(n). Fix mm and induct on nn. For n=1n=1 this is the recursion. If it holds for nn, then by Arithmetic and Order of the Natural Numbers §associative, ψ(m+(n+1))=ψ((m+n)+1)=ψ(m+n)+1r=ψ(m)+(ψ(n)+1r)=ψ(m)+ψ(n+1).\psi(m+(n+1))=\psi((m+n)+1)=\psi(m+n)+1_{r}=\psi(m)+(\psi(n)+1_{r})=\psi(m)+\psi(n+1).

(1b) ψ(mn)=ψ(m)ψ(n)\psi(mn)=\psi(m)\psi(n). Fix mm and induct on nn. For n=1n=1, ψ(m⋅1)=ψ(m)=ψ(m)⋅1r\psi(m\cdot1)=\psi(m)=\psi(m)\cdot1_{r} by Arithmetic and Order of the Natural Numbers §one. If it holds for nn, then by Arithmetic and Order of the Natural Numbers §distributive, Arithmetic and Order of the Natural Numbers §one and (1a), ψ(m(n+1))=ψ(mn+m)=ψ(m)ψ(n)+ψ(m)⋅1r=ψ(m)(ψ(n)+1r)=ψ(m)ψ(n+1).\psi(m(n+1))=\psi(mn+m)=\psi(m)\psi(n)+\psi(m)\cdot1_{r}=\psi(m)(\psi(n)+1_{r})=\psi(m)\psi(n+1).

(1c) 0r<ψ(n)0_{r}<\psi(n). In particular ψ(n)≠0r\psi(n)\neq0_{r}, so ψ(n)−1∈r\psi(n)^{-1}\in r exists. For n=1n=1, 0r<1r0_{r}<1_{r} by Rules of Arithmetic and Order in an Ordered Field §squares. If 0r<ψ(n)0_{r}<\psi(n), then 1r=0r+1r<ψ(n)+1r=ψ(n+1)1_{r}=0_{r}+1_{r}<\psi(n)+1_{r}=\psi(n+1) by Rules of Arithmetic and Order in an Ordered Field §order-sum, and 0r<1r<ψ(n+1)0_{r}<1_{r}<\psi(n+1) gives 0r<ψ(n+1)0_{r}<\psi(n+1) by (T).

Step 2: the integers. By The Integers §integers, Z=P/∼\mathbb{Z}=P/{\sim} with P=N×NP=\mathbb{N}\times\mathbb{N}, where ∼\sim is the equivalence relation of Construction of the Integers: Pairs of Natural Numbers up to Equal Differences, with Sum, Product, Negation and Order §equivalence and [a,b][a,b] is the class of (a,b)(a,b). By Equivalence Classes Partition the Set: Cover, Disjointness and Representatives; the Quotient Is a Set and the Canonical Projection Is a Surjection §projection, [a,b]=π∼((a,b))[a,b]=\pi_{\sim}((a,b)). By Maps and Relations Given by Formulas §binary there is a map F:P→rF:P\to r with F((a,b))=ψ(a)−ψ(b)F((a,b))=\psi(a)-\psi(b). Suppose (a,b)∼(c,d)(a,b)\sim(c,d), that is, a+d=b+ca+d=b+c. Then ψ(a)+ψ(d)=ψ(b)+ψ(c)\psi(a)+\psi(d)=\psi(b)+\psi(c) by (1a). Adding (−ψ(b))+(−ψ(d))(-\psi(b))+(-\psi(d)) to both sides gives ψ(a)−ψ(b)=ψ(c)−ψ(d)\psi(a)-\psi(b)=\psi(c)-\psi(d). By A Map Constant on Equivalence Classes Factors Uniquely through the Quotient §factorization there is a map χ:Z→r\chi:\mathbb{Z}\to r with χ∘π∼=F\chi\circ\pi_{\sim}=F. By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition this gives:

(2a) χ([a,b])=ψ(a)−ψ(b)\chi([a,b])=\psi(a)-\psi(b) for all a,b∈Na,b\in\mathbb{N}.

(2b) χ(x+y)=χ(x)+χ(y)\chi(x+y)=\chi(x)+\chi(y) and χ(xy)=χ(x)χ(y)\chi(xy)=\chi(x)\chi(y) for all x,y∈Zx,y\in\mathbb{Z}. By Construction of the Integers: Pairs of Natural Numbers up to Equal Differences, with Sum, Product, Negation and Order §equal, we may write x=[a,b]x=[a,b] and y=[c,d]y=[c,d] with a,b,c,d∈Na,b,c,d\in\mathbb{N}. Then Construction of the Integers: Pairs of Natural Numbers up to Equal Differences, with Sum, Product, Negation and Order §operations gives x+y=[a+c,b+d]x+y=[a+c,b+d] and xy=[ac+bd,ad+bc]xy=[ac+bd,ad+bc]. Hence, by (2a), (1a), (1b) and Rules of Arithmetic and Order in an Ordered Field §signs, χ(x+y)=(ψ(a)+ψ(c))−(ψ(b)+ψ(d))=(ψ(a)−ψ(b))+(ψ(c)−ψ(d))=χ(x)+χ(y),\chi(x+y)=(\psi(a)+\psi(c))-(\psi(b)+\psi(d))=(\psi(a)-\psi(b))+(\psi(c)-\psi(d))=\chi(x)+\chi(y), χ(xy)=(ψ(a)ψ(c)+ψ(b)ψ(d))−(ψ(a)ψ(d)+ψ(b)ψ(c))=(ψ(a)−ψ(b))(ψ(c)−ψ(d))=χ(x)χ(y).\chi(xy)=(\psi(a)\psi(c)+\psi(b)\psi(d))-(\psi(a)\psi(d)+\psi(b)\psi(c))=(\psi(a)-\psi(b))(\psi(c)-\psi(d))=\chi(x)\chi(y). The middle equality of the second line comes from expanding the right side by distributivity, using (−w)z=−(wz)(-w)z=-(wz) and (−w)(−z)=wz(-w)(-z)=wz from the same rule.

(2c) χ(ι(n))=ψ(n)\chi(\iota(n))=\psi(n) for n∈Nn\in\mathbb{N}. By The Integers §embedding, ι(n)=[n+1,1]\iota(n)=[n+1,1], so χ(ι(n))=ψ(n+1)−ψ(1)=(ψ(n)+1r)−1r=ψ(n)\chi(\iota(n))=\psi(n+1)-\psi(1)=(\psi(n)+1_{r})-1_{r}=\psi(n). Since ι(1)=1Z\iota(1)=1_{\mathbb{Z}} by The Integers Form an Ordered Ring Containing the Natural Numbers as Its Positive Elements §embedding, in particular χ(1Z)=1r\chi(1_{\mathbb{Z}})=1_{r}.

Step 3: existence. By The Rational Numbers §rationals, Q=Q/≈\mathbb{Q}=Q/{\approx} with Q=Z×NQ=\mathbb{Z}\times\mathbb{N}, where ≈\approx is the equivalence relation of Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order §equivalence. By Equivalence Classes Partition the Set: Cover, Disjointness and Representatives; the Quotient Is a Set and the Canonical Projection Is a Surjection §projection, [x,m]=π≈((x,m))[x,m]=\pi_{\approx}((x,m)). By (1c), χ(x)ψ(m)−1∈r\chi(x)\psi(m)^{-1}\in r, so Maps and Relations Given by Formulas §binary gives a map F′:Q→rF':Q\to r with F′((x,m))=χ(x)ψ(m)−1F'((x,m))=\chi(x)\psi(m)^{-1}. Suppose (x,m)≈(y,n)(x,m)\approx(y,n), that is, x ι(n)=y ι(m)x\,\iota(n)=y\,\iota(m). Then (2b) and (2c) give χ(x)ψ(n)=χ(x ι(n))=χ(y ι(m))=χ(y)ψ(m)\chi(x)\psi(n)=\chi(x\,\iota(n))=\chi(y\,\iota(m))=\chi(y)\psi(m). Multiplying by ψ(m)−1ψ(n)−1\psi(m)^{-1}\psi(n)^{-1} gives χ(x)ψ(m)−1=χ(y)ψ(n)−1\chi(x)\psi(m)^{-1}=\chi(y)\psi(n)^{-1}. By A Map Constant on Equivalence Classes Factors Uniquely through the Quotient §factorization and Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition there is a map φ:Q→r\varphi:\mathbb{Q}\to r with:

(3a) φ([x,m])=χ(x)ψ(m)−1\varphi([x,m])=\chi(x)\psi(m)^{-1} for all x∈Zx\in\mathbb{Z} and m∈Nm\in\mathbb{N}.

By Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order §equal, every u∈Qu\in\mathbb{Q} is some [x,m][x,m]. Let u=[x,m]u=[x,m] and v=[y,n]v=[y,n]. By Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order §operations, u+v=[x ι(n)+y ι(m),mn]u+v=[x\,\iota(n)+y\,\iota(m),mn] and uv=[xy,mn]uv=[xy,mn]. By (1b) and Rules of Arithmetic and Order in an Ordered Field §reciprocals, ψ(mn)−1=ψ(m)−1ψ(n)−1\psi(mn)^{-1}=\psi(m)^{-1}\psi(n)^{-1}. Hence, by (3a), (2b) and (2c), φ(u+v)=(χ(x)ψ(n)+χ(y)ψ(m)) ψ(m)−1ψ(n)−1=χ(x)ψ(m)−1+χ(y)ψ(n)−1=φ(u)+φ(v),\varphi(u+v)=(\chi(x)\psi(n)+\chi(y)\psi(m))\,\psi(m)^{-1}\psi(n)^{-1}=\chi(x)\psi(m)^{-1}+\chi(y)\psi(n)^{-1}=\varphi(u)+\varphi(v), φ(uv)=χ(x)χ(y) ψ(m)−1ψ(n)−1=φ(u)φ(v).\varphi(uv)=\chi(x)\chi(y)\,\psi(m)^{-1}\psi(n)^{-1}=\varphi(u)\varphi(v). By The Rational Numbers §constants, 1=1Q=[1Z,1]1=1_{\mathbb{Q}}=[1_{\mathbb{Z}},1], so by (2c), φ(1)=χ(1Z)ψ(1)−1=1r⋅1r−1=1r\varphi(1)=\chi(1_{\mathbb{Z}})\psi(1)^{-1}=1_{r}\cdot1_{r}^{-1}=1_{r}. Thus φ\varphi has the three properties in The Rational Numbers Embed in Exactly One Way into Every Ordered Field §unique. That it is the only such map is shown in Step 6.

Step 4: consequences of the three properties. Let θ:Q→r\theta:\mathbb{Q}\to r be any map with θ(1)=1r\theta(1)=1_{r}, θ(u+v)=θ(u)+θ(v)\theta(u+v)=\theta(u)+\theta(v) and θ(uv)=θ(u)θ(v)\theta(uv)=\theta(u)\theta(v) for all u,v∈Qu,v\in\mathbb{Q}. Let u,v∈Qu,v\in\mathbb{Q}.

(4a) θ(0)=0r\theta(0)=0_{r}. Since 0+0=00+0=0, we have θ(0)=θ(0)+θ(0)\theta(0)=\theta(0)+\theta(0). Adding −θ(0)-\theta(0) to both sides gives 0r=θ(0)0_{r}=\theta(0).

(4b) θ(−u)=−θ(u)\theta(-u)=-\theta(u) and θ(u−v)=θ(u)−θ(v)\theta(u-v)=\theta(u)-\theta(v). Since u+(−u)=0u+(-u)=0 by Negatives, Differences, Reciprocals and Quotients §negative, (4a) gives θ(u)+θ(−u)=θ(0)=0r\theta(u)+\theta(-u)=\theta(0)=0_{r}. So θ(−u)=−θ(u)\theta(-u)=-\theta(u), by the uniqueness in Additive and Multiplicative Inverses Are Unique §negative. Then θ(u−v)=θ(u+(−v))=θ(u)+(−θ(v))=θ(u)−θ(v)\theta(u-v)=\theta(u+(-v))=\theta(u)+(-\theta(v))=\theta(u)-\theta(v).

(4c) If u≠0u\neq0, then θ(u)≠0r\theta(u)\neq0_{r}, θ(u−1)=θ(u)−1\theta(u^{-1})=\theta(u)^{-1} and θ(v/u)=θ(v)/θ(u)\theta(v/u)=\theta(v)/\theta(u). Since u⋅u−1=1u\cdot u^{-1}=1 by Negatives, Differences, Reciprocals and Quotients §reciprocal, θ(u)θ(u−1)=θ(1)=1r\theta(u)\theta(u^{-1})=\theta(1)=1_{r}. If θ(u)=0r\theta(u)=0_{r}, this would give 1r=0r⋅θ(u−1)=0r1_{r}=0_{r}\cdot\theta(u^{-1})=0_{r} by Rules of Arithmetic and Order in an Ordered Field §zero, which is impossible. So θ(u)≠0r\theta(u)\neq0_{r}, and θ(u−1)=θ(u)−1\theta(u^{-1})=\theta(u)^{-1} by the uniqueness in Additive and Multiplicative Inverses Are Unique §reciprocal. Hence θ(v/u)=θ(v⋅u−1)=θ(v)θ(u)−1=θ(v)/θ(u)\theta(v/u)=\theta(v\cdot u^{-1})=\theta(v)\theta(u)^{-1}=\theta(v)/\theta(u).

Taking θ=φ\theta=\varphi, (4a), (4b) and (4c) prove The Rational Numbers Embed in Exactly One Way into Every Ordered Field §zero, The Rational Numbers Embed in Exactly One Way into Every Ordered Field §negative and The Rational Numbers Embed in Exactly One Way into Every Ordered Field §reciprocal.

Step 5: order. Let u,v∈Qu,v\in\mathbb{Q}. By The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §ordered-field, ≤\le is total on Q\mathbb{Q} and << is its strict relation. So exactly one of u<vu<v, u=vu=v and v<uv<u holds, by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §trichotomy.

(5a) If 0<u0<u, then 0r<φ(u)0_{r}<\varphi(u). Write u=[x,m]u=[x,m]. By The Rational Numbers §constants, 0=[0Z,1]0=[0_{\mathbb{Z}},1]. By Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order §operations, 0≤u0\le u holds if and only if 0Z ι(m)≤x ι(1)0_{\mathbb{Z}}\,\iota(m)\le x\,\iota(1), that is, if and only if 0Z≤x0_{\mathbb{Z}}\le x. Here 0Z ι(m)=0Z0_{\mathbb{Z}}\,\iota(m)=0_{\mathbb{Z}} by The Integers Form an Ordered Ring Containing the Natural Numbers as Its Positive Elements §negation, and x ι(1)=x⋅1Z=xx\,\iota(1)=x\cdot1_{\mathbb{Z}}=x by The Integers Form an Ordered Ring Containing the Natural Numbers as Its Positive Elements §embedding and The Integers Form an Ordered Ring Containing the Natural Numbers as Its Positive Elements §ring. Likewise, Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order §equal shows that u=0u=0 if and only if x=0Zx=0_{\mathbb{Z}}. Hence 0<u0<u gives 0Z≤x0_{\mathbb{Z}}\le x and x≠0Zx\neq0_{\mathbb{Z}}, that is, 0Z<x0_{\mathbb{Z}}<x by The Integers §operations. So x=ι(n)x=\iota(n) for some n∈Nn\in\mathbb{N} by The Integers Form an Ordered Ring Containing the Natural Numbers as Its Positive Elements §positive, and φ(u)=ψ(n)ψ(m)−1\varphi(u)=\psi(n)\psi(m)^{-1} by (3a) and (2c). By (1c) and Rules of Arithmetic and Order in an Ordered Field §positive-reciprocal, 0r<ψ(m)−10_{r}<\psi(m)^{-1}. Applying Rules of Arithmetic and Order in an Ordered Field §order-product with z=ψ(m)−1z=\psi(m)^{-1} to 0r<ψ(n)0_{r}<\psi(n), and using Rules of Arithmetic and Order in an Ordered Field §zero, gives 0r=0r⋅z<ψ(n)z=φ(u)0_{r}=0_{r}\cdot z<\psi(n)z=\varphi(u).

(5b) Proof of The Rational Numbers Embed in Exactly One Way into Every Ordered Field §order. Let u<vu<v. By Rules of Arithmetic and Order in an Ordered Field §order-sum in Q\mathbb{Q}, 0=u+(−u)<v+(−u)=v−u0=u+(-u)<v+(-u)=v-u. Then by (5a) and (4b), 0r<φ(v−u)=φ(v)−φ(u)0_{r}<\varphi(v-u)=\varphi(v)-\varphi(u). By Rules of Arithmetic and Order in an Ordered Field §order-sum in rr, φ(u)=0r+φ(u)<(φ(v)−φ(u))+φ(u)=φ(v)\varphi(u)=0_{r}+\varphi(u)<(\varphi(v)-\varphi(u))+\varphi(u)=\varphi(v). Conversely, let φ(u)<φ(v)\varphi(u)<\varphi(v). If u=vu=v, then φ(u)=φ(v)\varphi(u)=\varphi(v). If v<uv<u, then φ(v)<φ(u)\varphi(v)<\varphi(u) by the first part, so φ(u)=φ(v)\varphi(u)=\varphi(v) by antisymmetry. Both contradict φ(u)<φ(v)\varphi(u)<\varphi(v), so u<vu<v.

(5c) Proof of The Rational Numbers Embed in Exactly One Way into Every Ordered Field §homomorphism. Let u≤vu\le v. Then u<vu<v or u=vu=v by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §weak-strict, so (5b) gives φ(u)<φ(v)\varphi(u)<\varphi(v) or φ(u)=φ(v)\varphi(u)=\varphi(v), and in either case φ(u)≤φ(v)\varphi(u)\le\varphi(v). Since Q\mathbb{Q} is an ordered field by The Integers and the Rational Numbers, with the Natural Numbers and the Integers Identified with Subsets of the Rationals §rationals, Step 3 and this monotonicity show that φ\varphi is a homomorphism of ordered fields from Q\mathbb{Q} to rr, as defined in Homomorphisms and Isomorphisms of Ordered Fields §homomorphism.

(5d) Proof of The Rational Numbers Embed in Exactly One Way into Every Ordered Field §injective. Let u≠vu\neq v. Then u<vu<v or v<uv<u, so by (5b), φ(u)<φ(v)\varphi(u)<\varphi(v) or φ(v)<φ(u)\varphi(v)<\varphi(u). Either way φ(u)≠φ(v)\varphi(u)\neq\varphi(v), as Injective, Surjective and Bijective Functions between Classes §injective requires.

(5e) Proof of The Rational Numbers Embed in Exactly One Way into Every Ordered Field §absolute, using Absolute Value in an Ordered Field §absolute-value in Q\mathbb{Q} and in rr. If 0≤u0\le u, then ∣u∣=u|u|=u, and 0r=φ(0)≤φ(u)0_{r}=\varphi(0)\le\varphi(u) by (4a) and (5c). So ∣φ(u)∣=φ(u)=φ(∣u∣)|\varphi(u)|=\varphi(u)=\varphi(|u|). Otherwise, u<0u<0 by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, and ∣u∣=−u|u|=-u. By (5b) and (4a), φ(u)<φ(0)=0r\varphi(u)<\varphi(0)=0_{r}, so 0r≤φ(u)0_{r}\le\varphi(u) fails, since it would give φ(u)=0r\varphi(u)=0_{r} by antisymmetry. Hence ∣φ(u)∣=−φ(u)=φ(−u)=φ(∣u∣)|\varphi(u)|=-\varphi(u)=\varphi(-u)=\varphi(|u|) by (4b).

Step 6: uniqueness. Let θ:Q→r\theta:\mathbb{Q}\to r be a map with the three properties of The Rational Numbers Embed in Exactly One Way into Every Ordered Field §unique. Step 4 applies to θ\theta.

(6a) θ(j(ι(n)))=ψ(n)\theta(j(\iota(n)))=\psi(n) for all n∈Nn\in\mathbb{N}, by induction on nn. By The Natural Numbers and the Integers inside the Rational Numbers §naturals, j(ι(1))=1Qj(\iota(1))=1_{\mathbb{Q}}, so θ(j(ι(1)))=1r=ψ(1)\theta(j(\iota(1)))=1_{r}=\psi(1). Again by The Natural Numbers and the Integers inside the Rational Numbers §naturals, j(ι(n+1))=j(ι(n))+j(ι(1))=j(ι(n))+1Qj(\iota(n+1))=j(\iota(n))+j(\iota(1))=j(\iota(n))+1_{\mathbb{Q}}. So if the claim holds for nn, then θ(j(ι(n+1)))=ψ(n)+1r=ψ(n+1)\theta(j(\iota(n+1)))=\psi(n)+1_{r}=\psi(n+1).

(6b) θ(j(x))=χ(x)\theta(j(x))=\chi(x) for all x∈Zx\in\mathbb{Z}. Write x=[a,b]x=[a,b]. Then x=ι(a)−ι(b)=ι(a)+(−ι(b))x=\iota(a)-\iota(b)=\iota(a)+(-\iota(b)), by The Integers Form an Ordered Ring Containing the Natural Numbers as Its Positive Elements §difference and The Integers §operations. By The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §embedding, j(x)=j(ι(a))+(−j(ι(b)))j(x)=j(\iota(a))+(-j(\iota(b))). Here the negation of Q\mathbb{Q} is the negative, by The Natural Numbers and the Integers inside the Rational Numbers §negation. Hence by (6a), (4b) and (2a), θ(j(x))=ψ(a)−ψ(b)=χ(x)\theta(j(x))=\psi(a)-\psi(b)=\chi(x).

(6c) θ=φ\theta=\varphi. Let u∈Qu\in\mathbb{Q} and write u=[x,m]u=[x,m]. By The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §fraction, u⋅j(ι(m))=j(x)u\cdot j(\iota(m))=j(x), so (6a) and (6b) give θ(u)ψ(m)=χ(x)\theta(u)\psi(m)=\chi(x). Multiplying by ψ(m)−1\psi(m)^{-1} and using (3a) gives θ(u)=χ(x)ψ(m)−1=φ(u)\theta(u)=\chi(x)\psi(m)^{-1}=\varphi(u). Both maps have domain Q\mathbb{Q}, so θ=φ\theta=\varphi by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §equality. Together with Step 3, this proves The Rational Numbers Embed in Exactly One Way into Every Ordered Field §unique.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…