Show that any two intervals of positive lengths can be countably disected into each other, that is, they can be written as countable unions and of pairwise disjoint sets, where and are congruent for every [Gy. Szabo]
Problem 1555
Official solution
To show that any two intervals of positive lengths can be countably dissected into each other, we need to demonstrate that they can be written as countable unions and of pairwise disjoint sets, where and are congruent for every .
1. **Case 1: Open Intervals and **
- Define and recursively define . This creates a sequence of nested intervals:
- Similarly, define and recursively define :
- Note that and .
- Define and . Each is congruent to because they are intervals of the same length.
2. Case 2: Other Types of Intervals
- For intervals that include boundary points, such as , , or , we can include the boundary points in the first interval and proceed similarly to Case 1.
- For example, if , we can write:
- Similarly, for , include the boundary points in .
3. Ensuring Pairwise Disjoint Sets
- It is important to show that , . This ensures that the sets and are pairwise disjoint.
4. Cardinality Consideration
- Any nonempty subinterval of has the cardinality of the continuum. This can be shown using the Schröder-Bernstein theorem, which states that if there exist injective functions and , then there exists a bijection between and .
By following these steps, we can construct the required subsets of and of such that and are congruent for every .