We present a polished version of Borel’s proof based on Cantor’s theory of sets. More specifically, we use transfinite recursion and the fact that any strictly decreasing sequence in a well-ordered set is finite in length.
We present a polished version of Borel’s proof based on Cantor’s theory of sets. More specifically, we use transfinite recursion and the fact that any strictly decreasing sequence in a well-ordered set is finite in length.