TheoremBase

Every homomorphism fixes the rationals, so two homomorphisms that differ at some point are separated by a rational there, which is impossible. The homomorphism r to s is built as x mapped to the supremum of the images of the rationals below x, and composing it with the map built the other way gives the identity, so it is an isomorphism.

Proof

Conventions. Throughout, cc, pp and qq each stand for one of the ordered fields rr and ss of the statement; pp and qq may be the same field. We use the hypothesis of the statement in the form (S): for c∈{r,s}c\in\{r,s\}, every subset of cc other than the empty set that is bounded above has a supremum. By (S), the hypotheses of Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema hold with cc in place of rr, so its clauses may be applied in cc. Each of them is an ordered field, hence a set with a total order, and 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 §numbers. In each of these fields << is the strict relation of its order, and negatives, differences, reciprocals and quotients are as in Negatives, Differences, Reciprocals and Quotients §negative and Negatives, Differences, Reciprocals and Quotients §reciprocal. Following the reading convention of Homomorphisms and Isomorphisms of Ordered Fields: operations and orders applied to xx and yy (elements of pp) are those of pp; those applied to aa, bb, zz (elements of qq, or in Step 0 of cc), to values of κq\kappa_{q} (in Step 0 of κc\kappa_{c}) and to values of maps into qq are those of qq (in Step 0 of cc); and those applied to uu, vv, ww (rational numbers) are those of Q\mathbb{Q}. The rules of Rules of Arithmetic and Order in an Ordered Field are used in each of these ordered fields, and sums and products are rearranged by the laws of a commutative ring without further comment, and t⋅t−1=1ct\cdot t^{-1}=1_{c} for t∈ct\in c with t≠0ct\neq0_{c} by Negatives, Differences, Reciprocals and Quotients §reciprocal.

(T) Total orders. In each of these fields: if a≤ba\le b and b<zb<z, or a<ba<b and b≤zb\le z, then a<za<z, by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §weak-strict and Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-transitive; a≤ba\le b fails if and only if b<ab<a, by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation; and exactly one of a<ba<b, a=ba=b, b<ab<a holds, by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §trichotomy.

(K) The canonical embeddings. By The Canonical Embedding of the Rational Numbers into an Ordered Field §embedding, κc\kappa_{c} is the map of The Rational Numbers Embed in Exactly One Way into Every Ordered Field §unique, so κc(1)=1c\kappa_{c}(1)=1_{c}, κc(u+v)=κc(u)+κc(v)\kappa_{c}(u+v)=\kappa_{c}(u)+\kappa_{c}(v) and κc(u⋅v)=κc(u)⋅κc(v)\kappa_{c}(u\cdot v)=\kappa_{c}(u)\cdot\kappa_{c}(v) for all u,v∈Qu,v\in\mathbb{Q}. By The Rational Numbers Embed in Exactly One Way into Every Ordered Field §order, u<vu<v if and only if κc(u)<κc(v)\kappa_{c}(u)<\kappa_{c}(v); with κc(0)=0c\kappa_{c}(0)=0_{c} from The Rational Numbers Embed in Exactly One Way into Every Ordered Field §zero, 0<u0<u if and only if 0c<κc(u)0_{c}<\kappa_{c}(u). By The Rational Numbers Embed in Exactly One Way into Every Ordered Field §negative, κc(−u)=−κc(u)\kappa_{c}(-u)=-\kappa_{c}(u) and κc(u−v)=κc(u)−κc(v)\kappa_{c}(u-v)=\kappa_{c}(u)-\kappa_{c}(v); by The Rational Numbers Embed in Exactly One Way into Every Ordered Field §reciprocal, if u≠0u\neq0 then κc(u)≠0c\kappa_{c}(u)\neq0_{c} and κc(v/u)=κc(v)/κc(u)\kappa_{c}(v/u)=\kappa_{c}(v)/\kappa_{c}(u).

Step 0: four facts in cc. Let a,b∈ca,b\in c.

(0a) a<ba<b if and only if −b<−a-b<-a. Indeed a≤ba\le b if and only if −b≤−a-b\le-a by Rules of Arithmetic and Order in an Ordered Field §order-negative, and a=ba=b if and only if −b=−a-b=-a because −(−a)=a-(-a)=a and −(−b)=b-(-b)=b by Rules of Arithmetic and Order in an Ordered Field §signs; combine with Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-characterization.

(0b) For w∈Qw\in\mathbb{Q}: κc(w)<a+b\kappa_{c}(w)<a+b if and only if there are u,v∈Qu,v\in\mathbb{Q} with u+v=wu+v=w, κc(u)<a\kappa_{c}(u)<a and κc(v)<b\kappa_{c}(v)<b. Suppose κc(w)<a+b\kappa_{c}(w)<a+b. Adding −b-b (Rules of Arithmetic and Order in an Ordered Field §order-sum) gives κc(w)−b<a\kappa_{c}(w)-b<a. By Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §density in cc there is u∈Qu\in\mathbb{Q} with κc(w)−b<κc(u)<a\kappa_{c}(w)-b<\kappa_{c}(u)<a. Put v=w−uv=w-u, so u+v=wu+v=w and, by (K), κc(v)=κc(w)−κc(u)\kappa_{c}(v)=\kappa_{c}(w)-\kappa_{c}(u). Adding b−κc(u)b-\kappa_{c}(u) to both sides of κc(w)−b<κc(u)\kappa_{c}(w)-b<\kappa_{c}(u) (Rules of Arithmetic and Order in an Ordered Field §order-sum) gives κc(w)−κc(u)<b\kappa_{c}(w)-\kappa_{c}(u)<b, that is κc(v)<b\kappa_{c}(v)<b. Conversely, given such u,vu,v, Rules of Arithmetic and Order in an Ordered Field §order-sum gives κc(u)+κc(v)<a+κc(v)\kappa_{c}(u)+\kappa_{c}(v)<a+\kappa_{c}(v) and a+κc(v)<a+ba+\kappa_{c}(v)<a+b, so κc(w)=κc(u)+κc(v)<a+b\kappa_{c}(w)=\kappa_{c}(u)+\kappa_{c}(v)<a+b by (K) and (T).

(0c) Suppose 0c<a0_{c}<a and 0c<b0_{c}<b, and let w∈Qw\in\mathbb{Q} with 0<w0<w. Then κc(w)<a⋅b\kappa_{c}(w)<a\cdot b if and only if there are u,v∈Qu,v\in\mathbb{Q} with 0<u0<u, 0<v0<v, u⋅v=wu\cdot v=w, κc(u)<a\kappa_{c}(u)<a and κc(v)<b\kappa_{c}(v)<b. Suppose κc(w)<a⋅b\kappa_{c}(w)<a\cdot b. As 0c<b0_{c}<b, b≠0cb\neq0_{c} and 0c<b−10_{c}<b^{-1} by Rules of Arithmetic and Order in an Ordered Field §positive-reciprocal, so multiplying by b−1b^{-1} (Rules of Arithmetic and Order in an Ordered Field §order-product) gives κc(w)⋅b−1<a\kappa_{c}(w)\cdot b^{-1}<a. By Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §density in cc there is u∈Qu\in\mathbb{Q} with κc(w)⋅b−1<κc(u)<a\kappa_{c}(w)\cdot b^{-1}<\kappa_{c}(u)<a. Since 0c<κc(w)0_{c}<\kappa_{c}(w) by (K), multiplying by b−1b^{-1} and using 0c⋅b−1=0c0_{c}\cdot b^{-1}=0_{c} (Rules of Arithmetic and Order in an Ordered Field §order-product, Rules of Arithmetic and Order in an Ordered Field §zero) gives 0c<κc(w)⋅b−10_{c}<\kappa_{c}(w)\cdot b^{-1}, so 0c<κc(u)0_{c}<\kappa_{c}(u) by (T) and 0<u0<u by (K); in particular u≠0u\neq0 and 0c<κc(u)−10_{c}<\kappa_{c}(u)^{-1} by Rules of Arithmetic and Order in an Ordered Field §positive-reciprocal. Put v=w/uv=w/u, so u⋅v=wu\cdot v=w and κc(v)=κc(w)⋅κc(u)−1\kappa_{c}(v)=\kappa_{c}(w)\cdot\kappa_{c}(u)^{-1} by (K). Multiplying κc(w)⋅b−1<κc(u)\kappa_{c}(w)\cdot b^{-1}<\kappa_{c}(u) by bb and then by κc(u)−1\kappa_{c}(u)^{-1} (Rules of Arithmetic and Order in an Ordered Field §order-product) gives κc(w)<κc(u)⋅b\kappa_{c}(w)<\kappa_{c}(u)\cdot b and then κc(v)<b\kappa_{c}(v)<b. Multiplying 0c<κc(w)0_{c}<\kappa_{c}(w) by κc(u)−1\kappa_{c}(u)^{-1} gives 0c<κc(v)0_{c}<\kappa_{c}(v), so 0<v0<v by (K). Conversely, given such u,vu,v, 0c<κc(v)0_{c}<\kappa_{c}(v) by (K), and Rules of Arithmetic and Order in an Ordered Field §order-product gives κc(u)⋅κc(v)<a⋅κc(v)\kappa_{c}(u)\cdot\kappa_{c}(v)<a\cdot\kappa_{c}(v) (multiplying by κc(v)\kappa_{c}(v)) and κc(v)⋅a<b⋅a\kappa_{c}(v)\cdot a<b\cdot a (multiplying by aa), so κc(w)=κc(u)⋅κc(v)<a⋅b\kappa_{c}(w)=\kappa_{c}(u)\cdot\kappa_{c}(v)<a\cdot b by (K) and (T).

(0d) If a≠ba\neq b, there is w∈Qw\in\mathbb{Q} such that exactly one of κc(w)<a\kappa_{c}(w)<a and κc(w)<b\kappa_{c}(w)<b holds; if moreover 0c≤a0_{c}\le a and 0c≤b0_{c}\le b, there is such a ww with 0<w0<w. By (T), a<ba<b or b<ab<a; the claim is symmetric in aa and bb, so let a<ba<b. By Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §density in cc there is w∈Qw\in\mathbb{Q} with a<κc(w)<ba<\kappa_{c}(w)<b. Then κc(w)<b\kappa_{c}(w)<b holds and κc(w)<a\kappa_{c}(w)<a fails by (T). If 0c≤a0_{c}\le a, then 0c<κc(w)0_{c}<\kappa_{c}(w) by (T), so 0<w0<w by (K).

Step 1: every homomorphism fixes the rationals. Let h:p→qh:p\to q be a homomorphism of ordered fields. By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition, h∘κp:Q→qh\circ\kappa_{p}:\mathbb{Q}\to q is a map with (h∘κp)(u)=h(κp(u))(h\circ\kappa_{p})(u)=h(\kappa_{p}(u)) for every u∈Qu\in\mathbb{Q}. By (K) for pp and Homomorphisms and Isomorphisms of Ordered Fields §homomorphism, h(κp(1))=h(1p)=1qh(\kappa_{p}(1))=h(1_{p})=1_{q}, h(κp(u+v))=h(κp(u)+κp(v))=h(κp(u))+h(κp(v))h(\kappa_{p}(u+v))=h(\kappa_{p}(u)+\kappa_{p}(v))=h(\kappa_{p}(u))+h(\kappa_{p}(v)) and likewise h(κp(u⋅v))=h(κp(u))⋅h(κp(v))h(\kappa_{p}(u\cdot v))=h(\kappa_{p}(u))\cdot h(\kappa_{p}(v)) for all u,v∈Qu,v\in\mathbb{Q}. By (K) for qq, κq:Q→q\kappa_{q}:\mathbb{Q}\to q has the same three properties. By the uniqueness in The Rational Numbers Embed in Exactly One Way into Every Ordered Field §unique, applied to the ordered field qq, h∘κp=κqh\circ\kappa_{p}=\kappa_{q}; hence h(κp(u))=κq(u)h(\kappa_{p}(u))=\kappa_{q}(u) for every u∈Qu\in\mathbb{Q}.

Step 2: there is at most one homomorphism p→qp\to q. Let h,h′:p→qh,h':p\to q be homomorphisms of ordered fields and suppose h(x)≠h′(x)h(x)\neq h'(x) for some x∈px\in p. By (T) and the symmetry of the roles of hh and h′h', let h(x)<h′(x)h(x)<h'(x). By Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §density in qq there is u∈Qu\in\mathbb{Q} with h(x)<κq(u)<h′(x)h(x)<\kappa_{q}(u)<h'(x). The order of pp is total, so κp(u)≤x\kappa_{p}(u)\le x or x≤κp(u)x\le\kappa_{p}(u). In the first case Homomorphisms and Isomorphisms of Ordered Fields §homomorphism and Step 1 give κq(u)=h(κp(u))≤h(x)\kappa_{q}(u)=h(\kappa_{p}(u))\le h(x), contradicting h(x)<κq(u)h(x)<\kappa_{q}(u) by (T). In the second case they give h′(x)≤h′(κp(u))=κq(u)h'(x)\le h'(\kappa_{p}(u))=\kappa_{q}(u), contradicting κq(u)<h′(x)\kappa_{q}(u)<h'(x) by (T). Hence h(x)=h′(x)h(x)=h'(x) for every x∈px\in p; both maps have domain pp by Functions, Values of a Function, and Functions from One Class to Another §map, so h=h′h=h' by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §equality.

Step 3: construction of a map h:p→qh:p\to q. For x∈px\in p let

L(x)={z∈q:∃u (u∈Q∧z=κq(u)∧κp(u)<x)},L(x)=\{z\in q:\exists u\,(u\in\mathbb{Q}\wedge z=\kappa_{q}(u)\wedge\kappa_{p}(u)<x)\},

formed by restricted class abstraction with the parameters qq, Q\mathbb{Q}, κp\kappa_{p}, κq\kappa_{q}, xx and the strict relation of pp; its formula quantifies over sets only, the values κp(u)\kappa_{p}(u) and κq(u)\kappa_{q}(u) being defined set symbols used at u∈Qu\in\mathbb{Q}. It is a subclass of the set qq, hence a subset of qq by Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper §subclass.

(3a) L(x)L(x) is nonempty and bounded above. By Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §archimedean in pp, applied to −x-x, there is v∈Qv\in\mathbb{Q} (a natural number read as a rational number by The Integers and the Rational Numbers, with the Natural Numbers and the Integers Identified with Subsets of the Rationals §identification) with −x<κp(v)-x<\kappa_{p}(v); by (0a) and −(−x)=x-(-x)=x (Rules of Arithmetic and Order in an Ordered Field §signs), −κp(v)<x-\kappa_{p}(v)<x, and −κp(v)=κp(−v)-\kappa_{p}(v)=\kappa_{p}(-v) by (K), so κq(−v)∈L(x)\kappa_{q}(-v)\in L(x). Next, by Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §archimedean in pp there is v′∈Qv'\in\mathbb{Q} with x<κp(v′)x<\kappa_{p}(v'). We show more generally: if u′∈Qu'\in\mathbb{Q} and x≤κp(u′)x\le\kappa_{p}(u'), then κq(u′)\kappa_{q}(u') is an upper bound of L(x)L(x). Let z∈L(x)z\in L(x), so z=κq(u)z=\kappa_{q}(u) for some u∈Qu\in\mathbb{Q} with κp(u)<x\kappa_{p}(u)<x. Then κp(u)<κp(u′)\kappa_{p}(u)<\kappa_{p}(u') by (T), so u<u′u<u' and κq(u)<κq(u′)\kappa_{q}(u)<\kappa_{q}(u') by (K), and z≤κq(u′)z\le\kappa_{q}(u') by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §weak-strict. With u′=v′u'=v' this shows that L(x)L(x) is bounded above.

By (3a) and (S) for qq, L(x)L(x) has a supremum sup⁡L(x)\sup L(x), an element of Ub⁡(L(x))⊆q\operatorname{Ub}(L(x))\subseteq q, for every x∈px\in p. So sup⁡L(x)\sup L(x) is a defined set symbol used properly at every x∈px\in p, and by Maps and Relations Given by Formulas §map there is exactly one map h:p→qh:p\to q with h(x)=sup⁡L(x)h(x)=\sup L(x) for every x∈px\in p. Fix this hh.

(3b) Let x∈px\in p and u∈Qu\in\mathbb{Q}. (F1) If κp(u)<x\kappa_{p}(u)<x, then κq(u)≤h(x)\kappa_{q}(u)\le h(x): indeed κq(u)∈L(x)\kappa_{q}(u)\in L(x), and h(x)∈Ub⁡(L(x))h(x)\in\operatorname{Ub}(L(x)) by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum and Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounds. (F2) If x≤κp(u)x\le\kappa_{p}(u), then h(x)≤κq(u)h(x)\le\kappa_{q}(u): indeed κq(u)∈Ub⁡(L(x))\kappa_{q}(u)\in\operatorname{Ub}(L(x)) by (3a), and h(x)h(x) is the least element of Ub⁡(L(x))\operatorname{Ub}(L(x)) by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum.

(3c) h(κp(v))=κq(v)h(\kappa_{p}(v))=\kappa_{q}(v) for every v∈Qv\in\mathbb{Q}. By (F2) with x=κp(v)x=\kappa_{p}(v) and u=vu=v, h(κp(v))≤κq(v)h(\kappa_{p}(v))\le\kappa_{q}(v). By Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §rational-supremum in qq, κq(v)\kappa_{q}(v) is the supremum of the subset D={z∈q:∃u (u∈Q∧z=κq(u)∧z<κq(v))}D=\{z\in q:\exists u\,(u\in\mathbb{Q}\wedge z=\kappa_{q}(u)\wedge z<\kappa_{q}(v))\} of qq. If z∈Dz\in D, then z=κq(u)z=\kappa_{q}(u) with κq(u)<κq(v)\kappa_{q}(u)<\kappa_{q}(v), so u<vu<v and κp(u)<κp(v)\kappa_{p}(u)<\kappa_{p}(v) by (K), and z≤h(κp(v))z\le h(\kappa_{p}(v)) by (F1). Thus h(κp(v))∈Ub⁡(D)h(\kappa_{p}(v))\in\operatorname{Ub}(D), so κq(v)≤h(κp(v))\kappa_{q}(v)\le h(\kappa_{p}(v)) by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum. Antisymmetry of the order of qq (Partial and Total Orders on a Set and the Associated Strict Relation §partial) gives the equality.

(3d) For all x,y∈px,y\in p: x<yx<y if and only if h(x)<h(y)h(x)<h(y), and x≤yx\le y if and only if h(x)≤h(y)h(x)\le h(y). Let x<yx<y. By Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §density in pp, first choose u∈Qu\in\mathbb{Q} with x<κp(u)<yx<\kappa_{p}(u)<y, then v∈Qv\in\mathbb{Q} with κp(u)<κp(v)<y\kappa_{p}(u)<\kappa_{p}(v)<y. By (F2) (as x≤κp(u)x\le\kappa_{p}(u)), h(x)≤κq(u)h(x)\le\kappa_{q}(u); by (K), u<vu<v and κq(u)<κq(v)\kappa_{q}(u)<\kappa_{q}(v); by (F1), κq(v)≤h(y)\kappa_{q}(v)\le h(y). Hence h(x)<h(y)h(x)<h(y) by (T). Conversely, if x<yx<y fails, then y<xy<x or y=xy=x by (T), so h(y)<h(x)h(y)<h(x) or h(y)=h(x)h(y)=h(x), and h(x)<h(y)h(x)<h(y) fails by (T). For the second equivalence: if x≤yx\le y, then x<yx<y or x=yx=y by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §weak-strict, so h(x)≤h(y)h(x)\le h(y); if x≤yx\le y fails, then y<xy<x by (T), so h(y)<h(x)h(y)<h(x) and h(x)≤h(y)h(x)\le h(y) fails by (T).

(3e) For all x∈px\in p and u∈Qu\in\mathbb{Q}: κp(u)<x\kappa_{p}(u)<x if and only if κq(u)<h(x)\kappa_{q}(u)<h(x). By (3d), κp(u)<x\kappa_{p}(u)<x if and only if h(κp(u))<h(x)h(\kappa_{p}(u))<h(x), and h(κp(u))=κq(u)h(\kappa_{p}(u))=\kappa_{q}(u) by (3c).

Step 4: hh is a homomorphism of ordered fields. By (K) and (3c), h(1p)=h(κp(1))=κq(1)=1qh(1_{p})=h(\kappa_{p}(1))=\kappa_{q}(1)=1_{q}, and h(0p)=h(κp(0))=κq(0)=0qh(0_{p})=h(\kappa_{p}(0))=\kappa_{q}(0)=0_{q} by The Rational Numbers Embed in Exactly One Way into Every Ordered Field §zero. Monotonicity is (3d). Let x,y∈px,y\in p.

(4a) Sums. For every w∈Qw\in\mathbb{Q}, the following are equivalent: κq(w)<h(x+y)\kappa_{q}(w)<h(x+y); κp(w)<x+y\kappa_{p}(w)<x+y (by (3e)); there are u,v∈Qu,v\in\mathbb{Q} with u+v=wu+v=w, κp(u)<x\kappa_{p}(u)<x and κp(v)<y\kappa_{p}(v)<y (by (0b) with c=pc=p); there are u,v∈Qu,v\in\mathbb{Q} with u+v=wu+v=w, κq(u)<h(x)\kappa_{q}(u)<h(x) and κq(v)<h(y)\kappa_{q}(v)<h(y) (by (3e) for each of uu and vv); κq(w)<h(x)+h(y)\kappa_{q}(w)<h(x)+h(y) (by (0b) with c=qc=q). Hence no w∈Qw\in\mathbb{Q} satisfies exactly one of κq(w)<h(x+y)\kappa_{q}(w)<h(x+y) and κq(w)<h(x)+h(y)\kappa_{q}(w)<h(x)+h(y), and h(x+y)=h(x)+h(y)h(x+y)=h(x)+h(y) by (0d) with c=qc=q. In particular h(x)+h(−x)=h(x+(−x))=h(0p)=0qh(x)+h(-x)=h(x+(-x))=h(0_{p})=0_{q}, so h(−x)=−h(x)h(-x)=-h(x) by the uniqueness in Negatives, Differences, Reciprocals and Quotients §negative.

(4b) Products of positive elements. Let 0p<x0_{p}<x and 0p<y0_{p}<y. Multiplying 0p<x0_{p}<x by yy (Rules of Arithmetic and Order in an Ordered Field §order-product, Rules of Arithmetic and Order in an Ordered Field §zero) gives 0p<x⋅y0_{p}<x\cdot y. By (3d) and h(0p)=0qh(0_{p})=0_{q}, 0q<h(x)0_{q}<h(x), 0q<h(y)0_{q}<h(y) and 0q<h(x⋅y)0_{q}<h(x\cdot y), and likewise 0q<h(x)⋅h(y)0_{q}<h(x)\cdot h(y). For every w∈Qw\in\mathbb{Q} with 0<w0<w, the following are equivalent: κq(w)<h(x⋅y)\kappa_{q}(w)<h(x\cdot y); κp(w)<x⋅y\kappa_{p}(w)<x\cdot y (by (3e)); there are u,v∈Qu,v\in\mathbb{Q} with 0<u0<u, 0<v0<v, u⋅v=wu\cdot v=w, κp(u)<x\kappa_{p}(u)<x and κp(v)<y\kappa_{p}(v)<y (by (0c) with c=pc=p); the same with κq(u)<h(x)\kappa_{q}(u)<h(x) and κq(v)<h(y)\kappa_{q}(v)<h(y) (by (3e)); κq(w)<h(x)⋅h(y)\kappa_{q}(w)<h(x)\cdot h(y) (by (0c) with c=qc=q, using 0q<h(x)0_{q}<h(x) and 0q<h(y)0_{q}<h(y)). Since 0q≤h(x⋅y)0_{q}\le h(x\cdot y) and 0q≤h(x)⋅h(y)0_{q}\le h(x)\cdot h(y), (0d) with c=qc=q gives h(x⋅y)=h(x)⋅h(y)h(x\cdot y)=h(x)\cdot h(y).

(4c) Products in general. If x=0px=0_{p} or y=0py=0_{p}, then x⋅y=0px\cdot y=0_{p} and h(x)⋅h(y)=0qh(x)\cdot h(y)=0_{q} by Rules of Arithmetic and Order in an Ordered Field §zero, as h(0p)=0qh(0_{p})=0_{q}; so h(x⋅y)=h(x)⋅h(y)h(x\cdot y)=h(x)\cdot h(y). Otherwise each of xx, yy is positive or negative by (T), and an element tt of pp with t<0pt<0_{p} satisfies 0p<−t0_{p}<-t by (0a), as −0p=0p-0_{p}=0_{p} by the uniqueness in Negatives, Differences, Reciprocals and Quotients §negative, since 0p+0p=0p0_{p}+0_{p}=0_{p}. If 0p<x0_{p}<x and 0p<y0_{p}<y, then h(x⋅y)=h(x)⋅h(y)h(x\cdot y)=h(x)\cdot h(y) is (4b). The remaining cases are treated as follows. If x<0p<yx<0_{p}<y, then x⋅y=−((−x)⋅y)x\cdot y=-((-x)\cdot y) by Rules of Arithmetic and Order in an Ordered Field §signs twice, so by (4a), (4b) and Rules of Arithmetic and Order in an Ordered Field §signs in qq, h(x⋅y)=−h((−x)⋅y)=−(h(−x)⋅h(y))=−((−h(x))⋅h(y))=−(−(h(x)⋅h(y)))=h(x)⋅h(y)h(x\cdot y)=-h((-x)\cdot y)=-(h(-x)\cdot h(y))=-((-h(x))\cdot h(y))=-(-(h(x)\cdot h(y)))=h(x)\cdot h(y). The case y<0p<xy<0_{p}<x follows by commutativity. If x<0px<0_{p} and y<0py<0_{p}, then x⋅y=(−x)⋅(−y)x\cdot y=(-x)\cdot(-y) by Rules of Arithmetic and Order in an Ordered Field §signs, so h(x⋅y)=h(−x)⋅h(−y)=(−h(x))⋅(−h(y))=h(x)⋅h(y)h(x\cdot y)=h(-x)\cdot h(-y)=(-h(x))\cdot(-h(y))=h(x)\cdot h(y). Together with (4a), (3d) and h(1p)=1qh(1_{p})=1_{q}, hh is a homomorphism of ordered fields.

Step 5: conclusion. Apply Steps 3 and 4 with (p,q)=(r,s)(p,q)=(r,s) to obtain a homomorphism of ordered fields f:r→sf:r\to s, and with (p,q)=(s,r)(p,q)=(s,r) to obtain a homomorphism of ordered fields g:s→rg:s\to r.

Clause Ordered Fields in Which Every Nonempty Set Bounded Above Has a Supremum Are Unique up to Unique Isomorphism §unique: ff exists, and by Step 2 with (p,q)=(r,s)(p,q)=(r,s) every homomorphism of ordered fields r→sr\to s equals ff.

Clause Ordered Fields in Which Every Nonempty Set Bounded Above Has a Supremum Are Unique up to Unique Isomorphism §rationals: by Step 1 with (p,q)=(r,s)(p,q)=(r,s), f(κr(u))=κs(u)f(\kappa_{r}(u))=\kappa_{s}(u) for every u∈Qu\in\mathbb{Q}.

Clause Ordered Fields in Which Every Nonempty Set Bounded Above Has a Supremum Are Unique up to Unique Isomorphism §isomorphism: by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §composition, g∘f:r→rg\circ f:r\to r is a map with (g∘f)(x)=g(f(x))(g\circ f)(x)=g(f(x)). It is a homomorphism of ordered fields: g(f(1r))=g(1s)=1rg(f(1_{r}))=g(1_{s})=1_{r}, g(f(x+y))=g(f(x)+f(y))=g(f(x))+g(f(y))g(f(x+y))=g(f(x)+f(y))=g(f(x))+g(f(y)), likewise for products, and x≤yx\le y implies f(x)≤f(y)f(x)\le f(y), which implies g(f(x))≤g(f(y))g(f(x))\le g(f(y)). By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §identity, idr:r→r\mathrm{id}_{r}:r\to r is a map with idr(x)=x\mathrm{id}_{r}(x)=x, which is a homomorphism of ordered fields, since idr(1r)=1r\mathrm{id}_{r}(1_{r})=1_{r}, idr(x+y)=x+y=idr(x)+idr(y)\mathrm{id}_{r}(x+y)=x+y=\mathrm{id}_{r}(x)+\mathrm{id}_{r}(y), likewise for products, and x≤yx\le y implies idr(x)≤idr(y)\mathrm{id}_{r}(x)\le\mathrm{id}_{r}(y). By Step 2 with p=q=rp=q=r, g∘f=idrg\circ f=\mathrm{id}_{r}; in the same way, with the roles of rr and ss exchanged and Step 2 applied with p=q=sp=q=s, f∘g=idsf\circ g=\mathrm{id}_{s}. By Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction §inverse-criterion, ff is bijective. Finally, for x,y∈rx,y\in r, f(x)≤f(y)f(x)\le f(y) implies x≤yx\le y by (3d) with (p,q)=(r,s)(p,q)=(r,s). Hence ff is an isomorphism of ordered fields.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…