143
Views
0
CrossRef citations to date
0
Altmetric
Articles

Dedekind Cuts, Moving Markers, and the Uncountability of ℝ

ORCID Icon
Pages 286-292 | Received 19 Jul 2022, Accepted 19 Apr 2023, Published online: 22 Apr 2024
 

Summary

We give short proofs that is uncountable directly from the definition of as the set of Dedekind cuts of .

MSC:

Disclosure statement

No potential conflict of interest was reported by the author(s).

Notes

1 Another common way to define is as a set of equivalence classes of Cauchy sequences of rationals. The paper by Wenner [Citation5] gives a natural proof that this set of equivalence classes is uncountable.

2 In fact, some real numbers have two such representations, for example 0.500000=0.499999; the choice of 7 and 8 in the construction of y avoids any problems associated with this non-uniqueness. Petkovšek [Citation6] and Starbird and Starbird [Citation7] have shown that this is unavoidable.

Additional information

Notes on contributors

David A. Ross

David A. Ross (MR Author ID: 232420) received his Ph.D. from the University of Wisconsin, Madison, and is a professor of mathematics at the University of Hawai‘i at Mānoa. He is interested in most areas of mathematics, but has also published in philosophy, computer science, and zoology. His most enduring legacy will probably be the eponymous ‘droplet technique’ for reducing static in coffee grinding.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.