Another counting problem

Calculus Level 4

True or False

Let S S be the set of all sequences { a 1 , a 2 , , a n , } \{a_1, a_2, \cdots , a_n, \cdots\} , where each entry a i a_i is either 0 or 1.

Then S S is countable.

False True

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.

1 solution

Jason Martin
Nov 13, 2017

The set S S has the same size as the interval [ 0 , 1 ] [0,1] , which is uncountable. We get an intuition for why they are the same size when you represent each x [ 0 , 1 ] x \in [0,1] in binary and consider the mapping f : S [ 0 , 1 ] f:S \rightarrow [0,1] by { a 1 , a 2 , a 3 , } 0. a 1 a 2 a 3 2 \{a_1, a_2, a_3, \ldots \} \mapsto 0.a_1a_2a_3\ldots _2 (the subscript denoting binary digit notation), which is almost a bijection. I say "almost" because some distinct sequences like { 0 , 1 , 1 , 1 , } \{0,1,1,1,\ldots \} and { 1 , 0 , 0 , 0 , } \{1,0,0,0,\ldots \} map to the same number in binary; namely 0. 1 2 0.1_2 which has the alternative representation 0.0111 2 0.0111\ldots _2 . Nonetheless, the spirit of this argument can be made formal since there are only countably many of these points.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...