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 , the minus Dedekind cut, , is really a Dedekind cut.
2: Proof
Let us prove that and . As , there is a rational number, , such that . For any such that , . ? Is there a such that and ? Yes, as can be taken to be . As , there is a such that . ? For any such that , , so, . So, yes.
If , for any such that , , obviously.
Let us prove that has no largest element. Let us suppose that had the largest element, . Let us denote the Dedekind cut of by , which would mean that . , because for any such that , , so, . As , , because while for a . There would be a rational number, such that , by the proposition that for any 2 Dedekind cuts, there is a rational Dedekind cut between them. Would be ? Would there be such that and ? As , there would be a such that and , which would mean that , so, . So, yes. But , so, , a contradiction against '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>