TheoremBase

The infimum of a set bounded below is the negative of the supremum of its negatives; the Archimedean property follows by applying the supremum hypothesis to the image of the natural numbers; density comes from scaling the gap by a large natural number and choosing a least natural number above a shifted point; every element is then the supremum of the rationals below it by density.

Proof

Preliminaries. By hypothesis, rr is an ordered field; so rr is a set, ++ and ⋅\cdot are binary operations on it, and ≤\le is a total order on rr, by Fields §field and Ordered Fields §ordered-field. Hence Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order and Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders apply with a=ra=r, and Rules of Arithmetic and Order in an Ordered Field applies to rr, with 0r0_{r}, 1r1_{r} in place of 00, 11. Negatives, differences, reciprocals and quotients in rr are as in Negatives, Differences, Reciprocals and Quotients §negative and Negatives, Differences, Reciprocals and Quotients §reciprocal. Rearrangements in rr that use only associativity, commutativity, distributivity, z+0r=zz+0_{r}=z, z⋅1r=zz\cdot1_{r}=z (all from Commutative Rings §ring), z+(−z)=0rz+(-z)=0_{r} (Negatives, Differences, Reciprocals and Quotients §negative) and z⋅z−1=1rz\cdot z^{-1}=1_{r} for z≠0rz\neq0_{r} (Negatives, Differences, Reciprocals and Quotients §reciprocal) are called ring rearrangements below.

Mixed transitivity. For a,b,c∈ra,b,c\in r, if a<ba<b and b≤cb\le c, or a≤ba\le b and b<cb<c, then a<ca<c: by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §weak-strict the weak inequality is an equality, which gives a<ca<c at once, or strict, and then Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-transitive gives a<ca<c.

Facts about κ\kappa. By The Canonical Embedding of the Rational Numbers into an Ordered Field §embedding, κ\kappa is the map of The Rational Numbers Embed in Exactly One Way into Every Ordered Field §unique, so for all u,v∈Qu,v\in\mathbb{Q}: κ(1)=1r\kappa(1)=1_{r} and κ(u+v)=κ(u)+κ(v)\kappa(u+v)=\kappa(u)+\kappa(v) by The Rational Numbers Embed in Exactly One Way into Every Ordered Field §unique; u<vu<v if and only if κ(u)<κ(v)\kappa(u)<\kappa(v) by The Rational Numbers Embed in Exactly One Way into Every Ordered Field §order; κ(0)=0r\kappa(0)=0_{r} by The Rational Numbers Embed in Exactly One Way into Every Ordered Field §zero; κ(u−v)=κ(u)−κ(v)\kappa(u-v)=\kappa(u)-\kappa(v) by The Rational Numbers Embed in Exactly One Way into Every Ordered Field §negative; and, if v≠0v\neq0, κ(u/v)=κ(u)/κ(v)\kappa(u/v)=\kappa(u)/\kappa(v) with κ(v)≠0r\kappa(v)\neq0_{r} by The Rational Numbers Embed in Exactly One Way into Every Ordered Field §reciprocal. For n∈Nn\in\mathbb{N}, κ(n)\kappa(n) means κ(j(ι(n)))\kappa(j(\iota(n))), by The Integers and the Rational Numbers, with the Natural Numbers and the Integers Identified with Subsets of the Rationals §identification; this is defined since j(ι(n))∈Qj(\iota(n))\in\mathbb{Q}. By The Natural Numbers and the Integers inside the Rational Numbers §naturals, j(ι(1))=1Qj(\iota(1))=1_{\mathbb{Q}}, j(ι(n+1))=j(ι(n))+j(ι(1))j(\iota(n+1))=j(\iota(n))+j(\iota(1)) and 0Q<j(ι(n))0_{\mathbb{Q}}<j(\iota(n)), where n+1∈Nn+1\in\mathbb{N} by The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion §background. With the facts above this gives, for every n∈Nn\in\mathbb{N}:

κ(1)=1r,κ(n+1)=κ(n)+1r,0r<κ(n),j(ι(n))≠0Q,\kappa(1)=1_{r},\qquad\kappa(n+1)=\kappa(n)+1_{r},\qquad0_{r}<\kappa(n),\qquad j(\iota(n))\neq0_{\mathbb{Q}},

the last by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-characterization applied in Q\mathbb{Q}, whose order is a total order by The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §ordered-field. These are the facts (K).

Clause Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema §infimum. Let ss be a nonempty subset of rr that is bounded below, and fix a lower bound b∈rb\in r of ss (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounded) and an element v0∈sv_{0}\in s. Let

t={z∈r:∃v (v∈s∧z=−v)},t=\{z\in r:\exists v\,(v\in s\wedge z=-v)\},

formed by class abstraction from a formula quantifying over sets only, in which −v-v is used only for v∈s⊆rv\in s\subseteq r, where it is defined; tt is a subclass of the set rr, hence a set 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. It is nonempty, since −v0∈t-v_{0}\in t. It is bounded above by −b-b: if z∈tz\in t, say z=−vz=-v with v∈sv\in s, then b≤vb\le v, so −v≤−b-v\le-b by Rules of Arithmetic and Order in an Ordered Field §order-negative. By the hypothesis on rr, tt has a supremum mm, the least element of Ub⁡(t)\operatorname{Ub}(t) (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum). We show that −m-m is the greatest element of Lb⁡(s)\operatorname{Lb}(s), i.e. an infimum of ss by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum.

First, −m∈Lb⁡(s)-m\in\operatorname{Lb}(s): for v∈sv\in s we have −v∈t-v\in t, so −v≤m-v\le m, hence −m≤−(−v)=v-m\le-(-v)=v by Rules of Arithmetic and Order in an Ordered Field §order-negative and Rules of Arithmetic and Order in an Ordered Field §signs. Second, let c∈Lb⁡(s)c\in\operatorname{Lb}(s). Then −c∈Ub⁡(t)-c\in\operatorname{Ub}(t): for z∈tz\in t, z=−vz=-v with v∈sv\in s, so c≤vc\le v and z=−v≤−cz=-v\le-c by Rules of Arithmetic and Order in an Ordered Field §order-negative. As mm is the least element of Ub⁡(t)\operatorname{Ub}(t), m≤−cm\le-c, hence c=−(−c)≤−mc=-(-c)\le-m by Rules of Arithmetic and Order in an Ordered Field §order-negative and Rules of Arithmetic and Order in an Ordered Field §signs. So −m-m is the greatest element of Lb⁡(s)\operatorname{Lb}(s).

Clause 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. Suppose, for a contradiction, that x<κ(n)x<\kappa(n) fails for every n∈Nn\in\mathbb{N}. Then κ(n)≤x\kappa(n)\le x for every n∈Nn\in\mathbb{N} by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation. Let

K={z∈r:∃n (n∈N∧z=κ(n))},K=\{z\in r:\exists n\,(n\in\mathbb{N}\wedge z=\kappa(n))\},

formed from a formula quantifying over sets only, with κ(n)=κ(j(ι(n)))\kappa(n)=\kappa(j(\iota(n))) defined for n∈Nn\in\mathbb{N}; KK is a subclass of rr, hence a set 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. It is nonempty, as κ(1)∈K\kappa(1)\in K (1∈N1\in\mathbb{N} by The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion §background), and xx is an upper bound of it. By the hypothesis on rr it has a supremum mm, the least element of Ub⁡(K)\operatorname{Ub}(K).

From 0r<1r0_{r}<1_{r} (Rules of Arithmetic and Order in an Ordered Field §squares), adding m−1rm-1_{r} by Rules of Arithmetic and Order in an Ordered Field §order-sum and using ring rearrangements, m−1r<mm-1_{r}<m. Hence m≤m−1rm\le m-1_{r} fails by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, so m−1r∉Ub⁡(K)m-1_{r}\notin\operatorname{Ub}(K), since otherwise m≤m−1rm\le m-1_{r} as mm is least in Ub⁡(K)\operatorname{Ub}(K). So there is z∈Kz\in K for which z≤m−1rz\le m-1_{r} fails; fix one and fix n∈Nn\in\mathbb{N} with z=κ(n)z=\kappa(n). Then m−1r<κ(n)m-1_{r}<\kappa(n) by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, and adding 1r1_{r} by Rules of Arithmetic and Order in an Ordered Field §order-sum, m<κ(n)+1r=κ(n+1)m<\kappa(n)+1_{r}=\kappa(n+1) by (K). But n+1∈Nn+1\in\mathbb{N}, so κ(n+1)∈K\kappa(n+1)\in K and κ(n+1)≤m\kappa(n+1)\le m, which by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation contradicts m<κ(n+1)m<\kappa(n+1). Hence some n∈Nn\in\mathbb{N} has x<κ(n)x<\kappa(n). Since x∈rx\in r was arbitrary, this holds for every element of rr; it is used below for elements other than xx.

Clause 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. Let x<yx<y. The choices are made in the following order.

Step 1: the gap. Let d=y−xd=y-x. By Rules of Arithmetic and Order in an Ordered Field §order-sum, adding −x-x to x<yx<y gives 0r<d0_{r}<d. So d≠0rd\neq0_{r} (Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-characterization), d−1d^{-1} is defined, and 0r<d−10_{r}<d^{-1} by Rules of Arithmetic and Order in an Ordered Field §positive-reciprocal.

Step 2: the scale. By clause 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 applied to d−1d^{-1}, fix m∈Nm\in\mathbb{N} with d−1<κ(m)d^{-1}<\kappa(m), and put M=κ(m)M=\kappa(m); 0r<M0_{r}<M by (K). Multiplying by dd, with 0r<d0_{r}<d, by Rules of Arithmetic and Order in an Ordered Field §order-product, 1r=d−1⋅d<M⋅d1_{r}=d^{-1}\cdot d<M\cdot d. By ring rearrangements and Rules of Arithmetic and Order in an Ordered Field §signs, M⋅d=M⋅y−M⋅xM\cdot d=M\cdot y-M\cdot x, and adding M⋅xM\cdot x by Rules of Arithmetic and Order in an Ordered Field §order-sum,

M⋅x+1r<M⋅y.M\cdot x+1_{r}<M\cdot y.

Step 3: the shift. By clause 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 applied to −(M⋅x)-(M\cdot x), fix p∈Np\in\mathbb{N} with −(M⋅x)<κ(p)-(M\cdot x)<\kappa(p), and put w=M⋅x+κ(p)w=M\cdot x+\kappa(p). Adding M⋅xM\cdot x by Rules of Arithmetic and Order in an Ordered Field §order-sum, 0r<w0_{r}<w.

Step 4: the least natural number above ww. Let A={k∈N:w<κ(k)}A=\{k\in\mathbb{N}:w<\kappa(k)\}, formed from a formula quantifying over sets only; it is a subclass of the set N\mathbb{N}, hence a set 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, and nonempty by clause 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 applied to ww. By Arithmetic and Order of the Natural Numbers §well-order, fix k∈Ak\in A with k≤vk\le v for every v∈Av\in A. Then w<κ(k)w<\kappa(k), and we claim κ(k)≤w+1r\kappa(k)\le w+1_{r}. If k=1k=1, then κ(k)=1r=0r+1r≤w+1r\kappa(k)=1_{r}=0_{r}+1_{r}\le w+1_{r} by (K), 0r≤w0_{r}\le w (from 0r<w0_{r}<w by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §weak-strict) and Rules of Arithmetic and Order in an Ordered Field §order-sum (with reflexivity of ≤\le for the second summand). If k≠1k\neq1, fix e∈Ne\in\mathbb{N} with k=e+1k=e+1 by Arithmetic and Order of the Natural Numbers §predecessor. Then e<ke<k by Arithmetic and Order of the Natural Numbers §successor, so k≤ek\le e fails by Arithmetic and Order of the Natural Numbers §trichotomy and Arithmetic and Order of the Natural Numbers §partial-order; hence e∉Ae\notin A, i.e. w<κ(e)w<\kappa(e) fails, so κ(e)≤w\kappa(e)\le w by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, and κ(k)=κ(e)+1r≤w+1r\kappa(k)=\kappa(e)+1_{r}\le w+1_{r} by (K) and Rules of Arithmetic and Order in an Ordered Field §order-sum. In both cases

w<κ(k)≤w+1r.w<\kappa(k)\le w+1_{r}.

Step 5: the rational number. Since j(ι(m))≠0Qj(\iota(m))\neq0_{\mathbb{Q}} by (K), let u=(j(ι(k))−j(ι(p)))/j(ι(m))∈Qu=(j(\iota(k))-j(\iota(p)))/j(\iota(m))\in\mathbb{Q}, i.e. u=(k−p)/mu=(k-p)/m read in Q\mathbb{Q}. By the facts about κ\kappa, κ(u)=(κ(k)−κ(p))/M\kappa(u)=(\kappa(k)-\kappa(p))/M; as M≠0rM\neq0_{r} (from 0r<M0_{r}<M by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-characterization), ring rearrangements give κ(u)⋅M=κ(k)−κ(p)\kappa(u)\cdot M=\kappa(k)-\kappa(p). Adding −κ(p)-\kappa(p) to the display of Step 4 by Rules of Arithmetic and Order in an Ordered Field §order-sum, and using w−κ(p)=M⋅xw-\kappa(p)=M\cdot x (ring rearrangements), we get

M⋅x<κ(u)⋅M≤M⋅x+1r.M\cdot x<\kappa(u)\cdot M\le M\cdot x+1_{r}.

With Step 2 and mixed transitivity, κ(u)⋅M<M⋅y\kappa(u)\cdot M<M\cdot y. Since 0r<M0_{r}<M, Rules of Arithmetic and Order in an Ordered Field §order-product and commutativity turn x⋅M<κ(u)⋅Mx\cdot M<\kappa(u)\cdot M and κ(u)⋅M<y⋅M\kappa(u)\cdot M<y\cdot M into x<κ(u)x<\kappa(u) and κ(u)<y\kappa(u)<y. So u∈Qu\in\mathbb{Q} satisfies x<κ(u)<yx<\kappa(u)<y.

Clause 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. Let L={z∈r:∃u (u∈Q∧z=κ(u)∧z<x)}L=\{z\in r:\exists u\,(u\in\mathbb{Q}\wedge z=\kappa(u)\wedge z<x)\}, a subset of rr 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. We show that xx is the least element of Ub⁡(L)\operatorname{Ub}(L), i.e. the supremum of LL by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum.

x∈Ub⁡(L)x\in\operatorname{Ub}(L): every z∈Lz\in L has z<xz<x, hence z≤xz\le x by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §weak-strict.

xx is least in Ub⁡(L)\operatorname{Ub}(L): let b∈Ub⁡(L)b\in\operatorname{Ub}(L) and suppose x≤bx\le b fails. Then b<xb<x by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, and by clause 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 fix u∈Qu\in\mathbb{Q} with b<κ(u)<xb<\kappa(u)<x. Then κ(u)∈L\kappa(u)\in L, so κ(u)≤b\kappa(u)\le b, contradicting b<κ(u)b<\kappa(u) by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation. Hence x≤bx\le b, and xx is the supremum of LL.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…