Prove (0,1) is uncountable.
Suppose (0,1) were countable.
List (0,1) as:
x1=0.a11a12…
x2=0.a21a22…
and so on,
where aij are integers from 0 to 9.
Let bn=3 if ann=4 and bn=4 if ann≠4.
Given 0.b1b2…, there must exist some n where
xn=0.b1b2…bn⋯=an1an2…ann…
Then we would say oh but then bn=ann and this is a contradiction.
This seems to depend on decimal representations being unique, but I do not know how to pick our expansions aij such that we can guarantee that the 0.b1b2… that we construct, is the same as one of the aij in terms of decimal representation.
Answer
Non-unique decimal representations can only occur when the last digits are either 0 or 9. For example, 0.4¯999=0.5¯000.
Choosing 4 and 3 for the diagonal number ensures that the representation is unique.
No comments:
Post a Comment