True or False
Let be the set of all sequences , where each entry is either 0 or 1.
Then is countable.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The set S has the same size as the interval [ 0 , 1 ] , which is uncountable. We get an intuition for why they are the same size when you represent each x ∈ [ 0 , 1 ] in binary and consider the mapping f : S → [ 0 , 1 ] by { a 1 , a 2 , a 3 , … } ↦ 0 . a 1 a 2 a 3 … 2 (the subscript denoting binary digit notation), which is almost a bijection. I say "almost" because some distinct sequences like { 0 , 1 , 1 , 1 , … } and { 1 , 0 , 0 , 0 , … } map to the same number in binary; namely 0 . 1 2 which has the alternative representation 0 . 0 1 1 1 … 2 . Nonetheless, the spirit of this argument can be made formal since there are only countably many of these points.