Bonus Question [5 Points] MTH302A Let Xn : n<ω be a sequence of uncountable sets. Show…
- User
Bonus Question [5 Points] MTH302A Let Xn : n<ω be a sequence of uncountable sets. Show that there exists Yn : n < ω such that (a) For every n < ω, Yn is uncountable and Yn ⊆ Xn. (b) For every m < n < ω, Yn ∩Ym =∅. Solution. Using transfinite recursion, construct xα,n : n < ω and α < ω1 as follows. (a) Each x0,n ∈ Xn and x0,n’s are pairwise distinct. (b) Suppose α < ω1 andxβ,n hasbeenchosen for every β < α andn < ω. PutW = {xβ,n : β < α and n < ω}. Choose xα,n ∈ Xn\W such that whenever m= n, xα,n= xα,m. This can be done because W is countable while each Xn is uncountable. Put Yn = {xα,n : α < ω1}. It is clear that Yn’s are pairwise disjoint uncountable subsets of Xn’s. explain with example in latex
- Assistant
Certainly! Let's delve into the problem and its solution with a concrete example, all presented using LaTeX for clarity.
Problem Statement
Bonus Question [5 Points] MTH302A
Let ( X_n ) for ( n < \omega ) be a sequence of uncountable sets. Show that there exists ( Y_n ) for ( n < \omega ) such that: \begin{enumerate}[(a)] \item For every ( n < \omega ), ( Y_n ) is uncountable and ( Y_n \subseteq X_n ). \item For every ( m < n < \omega ), ( Y_n \cap Y_m = \emptyset ). \end{enumerate}
Solution
We aim to construct uncountable, pairwise disjoint subsets ( Y_n \subseteq X_n ) for each ( n < \omega ). Here's how we can achieve this using transfinite recursion.
Step-by-Step Construction
-
Initialization:
- For each ( n < \omega ), start by selecting an element ( x_{0,n} \in X_n ).
- Ensure that the selected elements ( x_{0,n} ) are distinct for different ( n ).
-
Transfinite Recursion:
- Assume that for all ( \beta < \alpha ) and ( n < \omega ), elements ( x_{\beta,n} ) have been chosen such that they are distinct across different ( n ) and ( \beta ).
- Define ( W = { x_{\beta,n} : \beta < \alpha, n < \omega } ), which is countable since it's a countable union of countable sets.
- For each ( n < \omega ), select ( x_{\alpha,n} \in X_n \setminus W ). This is possible because each ( X_n ) is uncountable, and removing a countable set from an uncountable set leaves it uncountable.
- Ensure that for any fixed ( n ), the elements ( x_{\alpha,n} ) are distinct across different ( \alpha ).
-
Defining ( Y_n ):
- For each ( n < \omega ), let ( Y_n = { x_{\alpha,n} : \alpha < \omega_1 } ).
- Each ( Y_n ) is uncountable since it is indexed by ( \omega_1 ), the first uncountable ordinal.
- The sets ( Y_n ) are pairwise disjoint because for ( m \neq n ), ( Y_m ) and ( Y_n ) consist of elements from different ( X_m ) and ( X_n ), respectively.
Concrete Example
Consider the following concrete example to illustrate the construction:
- Let each ( X_n = \mathbb{R} ), the set of real numbers, which is uncountable.
- We aim to construct disjoint uncountable subsets ( Y_n \subseteq \mathbb{R} ) for each ( n < \omega ).
Construction:
-
Initialization:
- For ( n = 0, 1, 2, \ldots ), select distinct real numbers ( x_{0,n} ) such that ( x_{0,n} \neq x_{0,m} ) for ( n \neq m ).
-
Recursive Step:
- At each successor step ( \alpha + 1 ), choose ( x_{\alpha+1,n} \in \mathbb{R} \setminus W ), where ( W = { x_{\beta,n} : \beta \leq \alpha, n < \omega } ).
- At limit ordinals ( \lambda ), ensure that selections continue to avoid ( W_\lambda = \bigcup_{\beta < \lambda} { x_{\beta,n} : n < \omega } ).
-
Defining ( Y_n ):
- For each ( n ), ( Y_n = { x_{\alpha,n} : \alpha < \omega_1 } ).
- Each ( Y_n ) is uncountable and ( Y_m \cap Y_n = \emptyset ) for ( m \neq n ).
By following this construction, we ensure that each ( Y_n ) is an uncountable subset of ( X_n = \mathbb{R} ), and all ( Y_n ) are pairwise disjoint.
Conclusion
Using transfinite recursion, we've successfully constructed uncountable, pairwise disjoint subsets ( Y_n ) from each uncountable set ( X_n ). This method leverages the uncountability of each ( X_n ) and the properties of transfinite sequences to guarantee the existence of such subsets.
-