9.5.1. Set S with Recurring 1s

Let S denote the real numbers consisting of only 1s. These include decimal numbers that repeat the digit 1 infinitely. For example: 0.111..., 1.1, 1.11, etc.

In this chunk, we introduce Set S, which consists of real numbers that have 1s in their decimal representation. This includes numbers like 0.111..., which means the 1 repeats infinitely, and numbers such as 1.1, 1.11, and so forth. The key here is to understand that these numbers are not just arbitrary but are defined by their structure — they contain only the digit 1.

Think of Set S like a special club where only numbers made up of the digit 1 are allowed to enter. Just like a club might have specific membership criteria, this set specifies that only numbers with recurring 1s can be included. Imagine counting 1, then 1.1 (the first member of the club), 1.11 (the second member), and so on, creating a long chain of numbers that all share the same characteristic.

Set S can be viewed as the union of several countable sets. For instance, let S1 include all numbers with recurring 1s after the decimal point: 0.111..., followed by 0.1, 0.11, 0.111, and so forth.

Here we show how to build upon Set S. Starting with Set S1, we list numbers that have 1s following the decimal, making it countable. The numbers 0.1, 0.11, 0.111 form S1, where I emphasize that each entry can be counted clearly. We can keep adding elements like this, each becoming another member in the family of Set S, ultimately demonstrating that Set S is built from these individual, countably infinite sets.

Imagine you are planting flowers in a garden. Each type of flower represents the decimal representations in Set S. Some are growing alone (like 0.1), while others (like 1.1) create clusters with a certain number of flowers (1s). Each time you plant a new type of flower, you're expanding your garden, similar to how we build Set S by adding numbers with more 1s.

In S, various subsets can be formed such as S2, S3... where 'i' specifies how many 1s are before the decimal point. For example, S1 = {0.1, 0.11, ...}, S2 = {1.1, 1.11, ...}, and so forth.

This chunk elaborates on how we can segment Set S into multiple subsets. Each subset S_i is defined by how many 1s are before the decimal place. The digits captured in S_i help in understanding that we are still within the realms of countable sets. Each subset continues to be countable because we can still list the members methodically.

Consider a book series that has a set number of volumes. Each volume can be thought of as a subset, such that the first volume has the first editions (like 0.1), the second has a bit more (1.1), and you keep gathering them to create one complete series, analogous to how we compile the recurrences of 1 from multiple related instances.

Thus, by taking the union of several countable sets S1, S2, S3..., we conclude that Set S is countably infinite.

In this final chunk, we summarize that since Set S can be constructed via the union of multiple countable sets and each subset is countable, it ultimately concludes that Set S itself must be countably infinite. This is significant because it ties back to our fundamental understanding of countability in mathematics.

Think of a library that has books lending information about various topics, but each topic is detailed in different volumes. As you combine all these volumes into one section of the library (the union), you find that even though many books are inside, the whole collection can still be explored easily, leading to the realization that your section remains manageable and countable.

--