Aug 10th 2011, 22:41:06
Prove that the set of all dedekind cuts is uncountably infinite.
Its fairly straightforward to prove that the power set of the rational numbers is uncountably infinite. However, the set of all dedekind cuts is a proper subset of the power set of all rational numbers. Not all proper subsets of the power set of all rational numbers are uncountable.
Assume that the definition of real numbers is dependent upon dedekind cuts, therefore you cannot use the uncountability of the real numbers as a proof of the uncountability of the set of all dedekind cuts, as such a proof would be circular logic.
Its fairly straightforward to prove that the power set of the rational numbers is uncountably infinite. However, the set of all dedekind cuts is a proper subset of the power set of all rational numbers. Not all proper subsets of the power set of all rational numbers are uncountable.
Assume that the definition of real numbers is dependent upon dedekind cuts, therefore you cannot use the uncountability of the real numbers as a proof of the uncountability of the set of all dedekind cuts, as such a proof would be circular logic.