TheoremBase

Each identity between cuts is proved by double inclusion and extensionality from the arithmetic and order of the rationals; the inverse law rests on an Archimedean step giving, for each positive rational v, an element a of the cut with a+v outside it, and the supremum of a bounded nonempty set of cuts is its union.

Proof

Throughout, for x,y∈Cx,y\in C the sum of The Real Numbers §operations is x+y=x⊕yx+y=x\oplus y, and 0R=0∗0_{\mathbb{R}}=0^{*} by The Real Numbers §constants; we write ⊕\oplus for the sum of cuts, so that ++ always denotes the sum of rational numbers. Sums, negatives and the cuts u∗u^{*} lie in CC by Construction of the Dedekind Cuts: They Form a Set Totally Ordered by Inclusion, Closed under Sums, Negatives and Products of Nonnegative Cuts §sum, Construction of the Dedekind Cuts: They Form a Set Totally Ordered by Inclusion, Closed under Sums, Negatives and Products of Nonnegative Cuts §negative and Construction of the Dedekind Cuts: They Form a Set Totally Ordered by Inclusion, Closed under Sums, Negatives and Products of Nonnegative Cuts §rational. Equalities of cuts are proved by showing that the two classes have the same elements and applying Axiom of Extensionality for Classes; inclusions are as in Subclasses and Subsets §subclass. For x,y∈Cx,y\in C we have x≤Cyx\le_{C}y if and only if x⊆yx\subseteq y, by the definition of ≤C\le_{C} in Construction of the Dedekind Cuts: They Form a Set Totally Ordered by Inclusion, Closed under Sums, Negatives and Products of Nonnegative Cuts.

Rules used in Q\mathbb{Q}. By The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §ordered-field, ≤\le is a total order on Q\mathbb{Q} with strict relation <<, and Q\mathbb{Q} is an ordered field, hence a field and a commutative ring (Ordered Fields §ordered-field, Fields §field); so the identities of Commutative Rings §ring (associativity and commutativity of ++ and ⋅\cdot, w+0=ww+0=w, w⋅1=ww\cdot1=w, distributivity) hold in Q\mathbb{Q}, together with w+(−w)=0w+(-w)=0. We call these the ring identities. Sign rules come from Rules of Arithmetic and Order in an Ordered Field §signs; irreflexivity, transitivity and the weak/strict comparison of << from Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-irreflexive, Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-transitive and Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §weak-strict. We record three consequences of Rules of Arithmetic and Order in an Ordered Field §order-sum, which gives a<ba<b if and only if a+c<b+ca+c<b+c. Let a,b,e∈Qa,b,e\in\mathbb{Q}.

(R1) a<ba<b if and only if a−b<0a-b<0, and if and only if 0<b−a0<b-a: add −b-b, respectively −a-a, and use the ring identities.

(R2) If 0<e0<e, then a−e<aa-e<a: add a−ea-e to 0<e0<e and use the ring identities. In particular −e<0-e<0.

(R3) If 0<e0<e and d=e/(1+1)d=e/(1+1), then 0<d0<d and d+d=ed+d=e. Indeed 0<1+10<1+1 by Rules of Arithmetic and Order in an Ordered Field §midpoint, so 1+1≠01+1\neq0 (Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-characterization) and (1+1)−1(1+1)^{-1} exists (Negatives, Differences, Reciprocals and Quotients §reciprocal); Rules of Arithmetic and Order in an Ordered Field §midpoint applied to 0<e0<e gives 0<(0+e)/(1+1)=d0<(0+e)/(1+1)=d; and d+d=d⋅1+d⋅1=d⋅(1+1)=e⋅((1+1)−1⋅(1+1))=e⋅1=ed+d=d\cdot1+d\cdot1=d\cdot(1+1)=e\cdot((1+1)^{-1}\cdot(1+1))=e\cdot1=e by the ring identities.

Two facts about a cut. Let x∈Cx\in C. Then x⊆Qx\subseteq\mathbb{Q}, xx has an element, and some q∈Qq\in\mathbb{Q} satisfies q∉xq\notin x (otherwise xx and Q\mathbb{Q} would have the same elements and x=Qx=\mathbb{Q} by Axiom of Extensionality for Classes).

(F1) If p∈xp\in x, q∈Qq\in\mathbb{Q} and q∉xq\notin x, then p<qp<q. Indeed, otherwise q≤pq\le p by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, so q<pq<p or q=pq=p; the first gives q∈xq\in x by downward closure, and the second gives q∈xq\in x directly, a contradiction either way.

(F2) If v∈Qv\in\mathbb{Q} and 0<v0<v, then there is a∈xa\in x with a+v∉xa+v\notin x. Proof: first choose p0∈xp_{0}\in x, then q0∈Qq_{0}\in\mathbb{Q} with q0∉xq_{0}\notin x. Since 0<v0<v, v≠0v\neq0 and v−1v^{-1} exists. By The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §archimedean, applied to (q0−p0)/v(q_{0}-p_{0})/v, choose l∈Nl\in\mathbb{N} with (q0−p0)/v<l(q_{0}-p_{0})/v<l, natural numbers being read as rational numbers as in The Integers and the Rational Numbers, with the Natural Numbers and the Integers Identified with Subsets of the Rationals §identification. By Rules of Arithmetic and Order in an Ordered Field §order-product, multiplying by vv, and the ring identities, q0−p0<l⋅vq_{0}-p_{0}<l\cdot v; adding p0p_{0} (Rules of Arithmetic and Order in an Ordered Field §order-sum) gives q0<p0+l⋅vq_{0}<p_{0}+l\cdot v. Hence p0+l⋅v∉xp_{0}+l\cdot v\notin x, since otherwise q0∈xq_{0}\in x by downward closure. Let

S={n∈N:p0+n⋅v∉x},S=\{n\in\mathbb{N}:p_{0}+n\cdot v\notin x\},

formed by restricted class abstraction from a formula quantifying over sets only, with parameters p0p_{0}, vv and xx; 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 l∈Sl\in S. By Arithmetic and Order of the Natural Numbers §well-order, choose m∈Sm\in S with m≤nm\le n for every n∈Sn\in S. If m=1m=1, put a=p0a=p_{0}: then a∈xa\in x, and a+v=p0+1⋅v∉xa+v=p_{0}+1\cdot v\notin x, using that 1∈N1\in\mathbb{N} is read as 1Q1_{\mathbb{Q}} (The Natural Numbers and the Integers inside the Rational Numbers §naturals). If m≠1m\neq1, choose by Arithmetic and Order of the Natural Numbers §predecessor some d∈Nd\in\mathbb{N} with m=d+1m=d+1. Then d<md<m by Arithmetic and Order of the Natural Numbers §successor, so d∉Sd\notin S: otherwise m≤dm\le d, so m<dm<d or m=dm=d by Arithmetic and Order of the Natural Numbers §partial-order; with d<md<m, the first gives m<mm<m by the transitivity of << in Arithmetic and Order of the Natural Numbers §partial-order, and the second gives d<dd<d, each contradicting Arithmetic and Order of the Natural Numbers §trichotomy. Put a=p0+d⋅va=p_{0}+d\cdot v; then a∈xa\in x, and since d+1d+1 read in Q\mathbb{Q} is the sum of dd and 11 read in Q\mathbb{Q} (The Natural Numbers and the Integers inside the Rational Numbers §naturals), the ring identities give a+v=p0+(d+1)⋅v=p0+m⋅v∉xa+v=p_{0}+(d+1)\cdot v=p_{0}+m\cdot v\notin x.

Proof of lem:dedekind-cut-addition-order-nbg-2026a#group. Let x,y,z∈Cx,y,z\in C.

Associativity. Let w∈(x⊕y)⊕zw\in(x\oplus y)\oplus z. Then w=c+rw=c+r with c∈x⊕yc\in x\oplus y and r∈zr\in z, and c=p+qc=p+q with p∈xp\in x and q∈yq\in y; so w=(p+q)+r=p+(q+r)w=(p+q)+r=p+(q+r) by the ring identities, where q+r∈y⊕zq+r\in y\oplus z, hence w∈x⊕(y⊕z)w\in x\oplus(y\oplus z). Symmetrically, if w=p+c′w=p+c' with p∈xp\in x and c′=q+rc'=q+r for some q∈yq\in y and r∈zr\in z, then w=(p+q)+r∈(x⊕y)⊕zw=(p+q)+r\in(x\oplus y)\oplus z. So (x⊕y)⊕z=x⊕(y⊕z)(x\oplus y)\oplus z=x\oplus(y\oplus z).

Commutativity. If w=p+qw=p+q with p∈xp\in x and q∈yq\in y, then w=q+p∈y⊕xw=q+p\in y\oplus x; exchanging the roles of xx and yy gives the reverse inclusion, so x⊕y=y⊕xx\oplus y=y\oplus x.

Identity. Let w∈x⊕0∗w\in x\oplus0^{*}, say w=p+qw=p+q with p∈xp\in x and q<0q<0. By Rules of Arithmetic and Order in an Ordered Field §order-sum and the ring identities, q+p<0+pq+p<0+p, that is w<pw<p, so w∈xw\in x by downward closure. Conversely let u∈xu\in x, and choose u′∈xu'\in x with u<u′u<u' (as xx has no greatest element). Put q=u−u′q=u-u'; then q<0q<0 by (R1), so q∈0∗q\in0^{*}, and u′+q=u′+(u+(−u′))=u+(u′+(−u′))=uu'+q=u'+(u+(-u'))=u+(u'+(-u'))=u by the ring identities; so u∈x⊕0∗u\in x\oplus0^{*}. Hence x⊕0∗=xx\oplus0^{*}=x.

Inverse. Let w∈x⊕⊖xw\in x\oplus\ominus x, say w=p+qw=p+q with p∈xp\in x and q∈⊖xq\in\ominus x, and choose v∈Qv\in\mathbb{Q} with 0<v0<v and −q−v∉x-q-v\notin x. By (F1), p<−q−vp<-q-v; adding qq (Rules of Arithmetic and Order in an Ordered Field §order-sum) and using the ring identities, p+q<−vp+q<-v. As −v<0-v<0 by (R2), w<0w<0 by transitivity, so w∈0∗w\in0^{*}. Conversely let t∈0∗t\in0^{*}, so t<0t<0, and 0<−t0<-t by (R1). Let v=(−t)/(1+1)v=(-t)/(1+1); by (R3), 0<v0<v and v+v=−tv+v=-t. By (F2), choose a∈xa\in x with a+v∉xa+v\notin x, and put q=−((a+v)+v)q=-((a+v)+v). Then −q−v=((a+v)+v)+(−v)=a+v-q-v=((a+v)+v)+(-v)=a+v by Rules of Arithmetic and Order in an Ordered Field §signs and the ring identities, and this is not in xx; since 0<v0<v, q∈⊖xq\in\ominus x. Moreover, by Rules of Arithmetic and Order in an Ordered Field §signs and the ring identities,

a+q=a+((−a)+(−(v+v)))=−(v+v)=−(−t)=t,a+q=a+\bigl((-a)+(-(v+v))\bigr)=-(v+v)=-(-t)=t,

so t∈x⊕⊖xt\in x\oplus\ominus x. Hence x⊕⊖x=0∗=0Rx\oplus\ominus x=0^{*}=0_{\mathbb{R}}.

Proof of lem:dedekind-cut-addition-order-nbg-2026a#order. Let x≤Cyx\le_{C}y, so x⊆yx\subseteq y. If w∈x⊕zw\in x\oplus z, then w=p+rw=p+r with p∈xp\in x and r∈zr\in z; as p∈yp\in y, w∈y⊕zw\in y\oplus z. So x⊕z⊆y⊕zx\oplus z\subseteq y\oplus z, and since both lie in CC, x⊕z≤Cy⊕zx\oplus z\le_{C}y\oplus z.

Proof of lem:dedekind-cut-addition-order-nbg-2026a#complete. The set CC (Construction of the Dedekind Cuts: They Form a Set Totally Ordered by Inclusion, Closed under Sums, Negatives and Products of Nonnegative Cuts §set) is totally ordered by ≤C\le_{C} (Construction of the Dedekind Cuts: They Form a Set Totally Ordered by Inclusion, Closed under Sums, Negatives and Products of Nonnegative Cuts §order), so Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order applies to ss. Choose an upper bound b∈Cb\in C of ss (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounded, Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounds), so w⊆bw\subseteq b for every w∈sw\in s; then choose w0∈sw_{0}\in s, which exists since ss is not the empty set. The union U=⋃sU=\bigcup s is a set by The Union Set and the Power Set of a Set §union (with 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 §union), and u∈Uu\in U if and only if u∈wu\in w for some w∈sw\in s. We check that U∈CU\in C.

U⊆bU\subseteq b: if u∈w∈su\in w\in s, then u∈bu\in b as w⊆bw\subseteq b. Hence U⊆QU\subseteq\mathbb{Q}, so U∈P(Q)U\in\mathcal{P}(\mathbb{Q}) by The Union Set and the Power Set of a Set §power. U≠∅U\neq\emptyset: w0∈Cw_{0}\in C has an element, which lies in UU. U≠QU\neq\mathbb{Q}: some q∈Qq\in\mathbb{Q} satisfies q∉bq\notin b, and then q∉Uq\notin U. Downward closure: if v∈Qv\in\mathbb{Q}, u∈Uu\in U and v<uv<u, choose w∈sw\in s with u∈wu\in w; as w∈Cw\in C, v∈wv\in w, so v∈Uv\in U. No greatest element: if u∈Uu\in U, choose w∈sw\in s with u∈wu\in w, then v∈wv\in w with u<vu<v; so v∈Uv\in U. Hence U∈CU\in C.

For every w∈sw\in s, w⊆Uw\subseteq U, so w≤CUw\le_{C}U; thus U∈Ub⁡(s)U\in\operatorname{Ub}(s). If b′∈Ub⁡(s)b'\in\operatorname{Ub}(s), then w⊆b′w\subseteq b' for every w∈sw\in s, so every element of UU lies in b′b', that is U≤Cb′U\le_{C}b'. So UU is a least element of Ub⁡(s)\operatorname{Ub}(s), which is the supremum of ss by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum.

Proof of lem:dedekind-cut-addition-order-nbg-2026a#rational-sum. Let u,v∈Qu,v\in\mathbb{Q}. If w∈u∗⊕v∗w\in u^{*}\oplus v^{*}, say w=p+qw=p+q with p<up<u and q<vq<v, then by Rules of Arithmetic and Order in an Ordered Field §order-sum and the ring identities p+q<u+qp+q<u+q and u+q<u+vu+q<u+v, so w<u+vw<u+v by transitivity and w∈(u+v)∗w\in(u+v)^{*}. Conversely let w∈(u+v)∗w\in(u+v)^{*}, so w<u+vw<u+v, and 0<(u+v)−w0<(u+v)-w by (R1). Let d=((u+v)−w)/(1+1)d=((u+v)-w)/(1+1); by (R3), 0<d0<d and d+d=(u+v)−wd+d=(u+v)-w. By (R2), u−d<uu-d<u and v−d<vv-d<v, so u−d∈u∗u-d\in u^{*} and v−d∈v∗v-d\in v^{*}, and by Rules of Arithmetic and Order in an Ordered Field §signs and the ring identities

(u−d)+(v−d)=(u+v)−(d+d)=(u+v)−((u+v)−w)=w.(u-d)+(v-d)=(u+v)-(d+d)=(u+v)-((u+v)-w)=w.

So w∈u∗⊕v∗w\in u^{*}\oplus v^{*}. Hence (u+v)∗=u∗⊕v∗(u+v)^{*}=u^{*}\oplus v^{*}, which is u∗+v∗u^{*}+v^{*}.

Proof of lem:dedekind-cut-addition-order-nbg-2026a#rational-order. Let u,v∈Qu,v\in\mathbb{Q}. If u≤vu\le v and w∈u∗w\in u^{*}, then w<uw<u, and u<vu<v or u=vu=v; so w<vw<v, by transitivity in the first case and directly in the second. Hence u∗⊆v∗u^{*}\subseteq v^{*}, that is u∗≤Cv∗u^{*}\le_{C}v^{*}. If u≤vu\le v fails, then v<uv<u by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, so v∈u∗v\in u^{*}, while v∉v∗v\notin v^{*} by irreflexivity; hence u∗⊈v∗u^{*}\not\subseteq v^{*} and u∗≤Cv∗u^{*}\le_{C}v^{*} fails. So u≤vu\le v if and only if u∗≤Cv∗u^{*}\le_{C}v^{*}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…