2023-08-27

352: Minus Dedekind Cut Of Dedekind Cut Is Really Dedekind Cut

<The previous article in this series | The table of contents of this series | The next article in this series>

A description/proof of that minus Dedekind cut Of Dedekind cut is really Dedekind cut

Topics


About: set

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any Dedekind cut, its minus Dedekind cut is really a Dedekind cut.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Description


For any Dedekind cut r, the minus Dedekind cut, r:={qQ|qq<q and qr}, is really a Dedekind cut.


2: Proof


Let us prove that r and rQ. As rQ, there is a rational number, q1Q, such that q1r. For any q2Q such that q1<q2, q2r. q2r? Is there a q3Q such that q2<q3 and q3=q3r? Yes, as q3 can be taken to be q3=q1. As r, there is a q1Q such that q1r. q1r? For any q2Q such that q1<q2, q2=q2<q1r, so, q2r. So, yes.

If q1r, for any q2Q such that q2<q1, q2r, obviously.

Let us prove that r has no largest element. Let us suppose that r had the largest element, q1. Let us denote the Dedekind cut of q1 by q1~, which would mean that q1~={qQ|q<q1}. q1q1~, because for any q2Q such that q1<q2, q2=q2<q1=q1, so, q2q1~. As q1r, rq1~, because q2r while q2q1~ for a q2. There would be a rational number, q3Q such that rq3~q1~, by the proposition that for any 2 Dedekind cuts, there is a rational Dedekind cut between them. Would be q3r? Would there be q4Q such that q3<q4 and q4=q4r? As rq3~, there would be a q4Q such that q4r and q4q3~, which would mean that q4<q3, so, q3<q4. So, yes. But q3<q1, so, q1<q3, a contradiction against q1's being the largest element.


References


<The previous article in this series | The table of contents of this series | The next article in this series>