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.
Throughout, for the sum of The Real Numbers §operations is , and by The Real Numbers §constants; we write for the sum of cuts, so that always denotes the sum of rational numbers. Sums, negatives and the cuts lie in 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 we have if and only if , by the definition of 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 . By The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §ordered-field, is a total order on with strict relation , and 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 , , , distributivity) hold in , together with . 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 if and only if . Let .
(R1) if and only if , and if and only if : add , respectively , and use the ring identities.
(R2) If , then : add to and use the ring identities. In particular .
(R3) If and , then and . Indeed by Rules of Arithmetic and Order in an Ordered Field §midpoint, so (Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-characterization) and exists (Negatives, Differences, Reciprocals and Quotients §reciprocal); Rules of Arithmetic and Order in an Ordered Field §midpoint applied to gives ; and by the ring identities.
Two facts about a cut. Let . Then , has an element, and some satisfies (otherwise and would have the same elements and by Axiom of Extensionality for Classes).
(F1) If , and , then . Indeed, otherwise by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, so or ; the first gives by downward closure, and the second gives directly, a contradiction either way.
(F2) If and , then there is with . Proof: first choose , then with . Since , and exists. By The Rational Numbers Form an Archimedean Ordered Field Containing the Integers §archimedean, applied to , choose with , 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 , and the ring identities, ; adding (Rules of Arithmetic and Order in an Ordered Field §order-sum) gives . Hence , since otherwise by downward closure. Let
formed by restricted class abstraction from a formula quantifying over sets only, with parameters , and ; it is a subclass of the set , 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 . By Arithmetic and Order of the Natural Numbers §well-order, choose with for every . If , put : then , and , using that is read as (The Natural Numbers and the Integers inside the Rational Numbers §naturals). If , choose by Arithmetic and Order of the Natural Numbers §predecessor some with . Then by Arithmetic and Order of the Natural Numbers §successor, so : otherwise , so or by Arithmetic and Order of the Natural Numbers §partial-order; with , the first gives by the transitivity of in Arithmetic and Order of the Natural Numbers §partial-order, and the second gives , each contradicting Arithmetic and Order of the Natural Numbers §trichotomy. Put ; then , and since read in is the sum of and read in (The Natural Numbers and the Integers inside the Rational Numbers §naturals), the ring identities give .
Proof of lem:dedekind-cut-addition-order-nbg-2026a#group. Let .
Associativity. Let . Then with and , and with and ; so by the ring identities, where , hence . Symmetrically, if with and for some and , then . So .
Commutativity. If with and , then ; exchanging the roles of and gives the reverse inclusion, so .
Identity. Let , say with and . By Rules of Arithmetic and Order in an Ordered Field §order-sum and the ring identities, , that is , so by downward closure. Conversely let , and choose with (as has no greatest element). Put ; then by (R1), so , and by the ring identities; so . Hence .
Inverse. Let , say with and , and choose with and . By (F1), ; adding (Rules of Arithmetic and Order in an Ordered Field §order-sum) and using the ring identities, . As by (R2), by transitivity, so . Conversely let , so , and by (R1). Let ; by (R3), and . By (F2), choose with , and put . Then by Rules of Arithmetic and Order in an Ordered Field §signs and the ring identities, and this is not in ; since , . Moreover, by Rules of Arithmetic and Order in an Ordered Field §signs and the ring identities,
so . Hence .
Proof of lem:dedekind-cut-addition-order-nbg-2026a#order. Let , so . If , then with and ; as , . So , and since both lie in , .
Proof of lem:dedekind-cut-addition-order-nbg-2026a#complete. The set (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 (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 . Choose an upper bound of (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 for every ; then choose , which exists since is not the empty set. The union 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 if and only if for some . We check that .
: if , then as . Hence , so by The Union Set and the Power Set of a Set §power. : has an element, which lies in . : some satisfies , and then . Downward closure: if , and , choose with ; as , , so . No greatest element: if , choose with , then with ; so . Hence .
For every , , so ; thus . If , then for every , so every element of lies in , that is . So is a least element of , which is the supremum of 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 . If , say with and , then by Rules of Arithmetic and Order in an Ordered Field §order-sum and the ring identities and , so by transitivity and . Conversely let , so , and by (R1). Let ; by (R3), and . By (R2), and , so and , and by Rules of Arithmetic and Order in an Ordered Field §signs and the ring identities
So . Hence , which is .
Proof of lem:dedekind-cut-addition-order-nbg-2026a#rational-order. Let . If and , then , and or ; so , by transitivity in the first case and directly in the second. Hence , that is . If fails, then by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation, so , while by irreflexivity; hence and fails. So if and only if .
Loading…