91Ó°ÊÓ

An essential part of understanding why a space is separable involves the concept of a countable dense subset. In simple terms, a dense subset in a space is a subset whose closure is equal to the entire space itself. This means that every point in the space can be closely approximated by points from this subset.
A countable dense subset is, naturally, both countable and dense. "Countable" means that the elements of the subset can be listed in a sequence, much like the natural numbers. Anytime you're asked to show that a space is separable, you need to identify such a subset.
When we discuss separable spaces, we often first need to identify what a dense subset is and ensure it’s countable. For instance, the rational numbers play a crucial role in forming dense subsets because they fulfill these criteria, as we'll see in the next sections.
Remember, a dense subset does not have to include every point of the space. It's enough that every point of the space can be approximated closely by the subset's points.

The rational numbers, denoted by \(\mathbb{Q}\), are numbers that can be expressed as the quotient or fraction \( \frac{a}{b} \) where \( a \) and \( b \) are integers, and \( b eq 0 \).
Rational numbers are fundamental in understanding separability because they are a countable set. This quality makes them uniquely useful in constructing other mathematical concepts, such as countable dense subsets.
One remarkable property of the rational numbers is their density in the real numbers \(\mathbb{R}\). This means that between any two real numbers, you can find a rational number. Because they can approximate any real number so closely, they ensure that any space derived from them can be densely populated.

• The rational numbers are countable.
• They form a dense subset in the real numbers \(\mathbb{R}\).
• Essential for showing that \(\mathbb{R}^n\) is separable.

The Cartesian product is a fascinating mathematical concept used to construct sets from two or more others. If you have two sets \( A \) and \( B \), their Cartesian product \( A \times B \) is the set of all possible ordered pairs \( (a, b) \) where \( a \in A \) and \( b \in B \).
This simple idea expands beautifully when applied to a collection of sets. In the context of rational numbers, consider the Cartesian product of multiple copies of \(\mathbb{Q}\). For example, in constructing a separable space \(\mathbb{R}^n\), we take the Cartesian product of \( n \) copies of the rational numbers, \(\mathbb{Q} \times \mathbb{Q} \times ... \times \mathbb{Q}\) \(n\) times, denoted as \(\mathbb{Q}^n\).

• Each \(\mathbb{Q}\) is countable and thus, \(\mathbb{Q}^n\) is countable.
• The product \(\mathbb{Q}^n\) remains dense in \(\mathbb{R}^n\).
• It provides the needed countable dense subset for separability.

Using the Cartesian product, we ensure all necessary points in \(\mathbb{R}^n\) can be approximated using this structured, ordered approach of \(\mathbb{Q}^n\). This guarantees that \(\mathbb{R}^n\) is indeed separable.