Olympiad Maths Prep

Track / Stage 7 / 155 of 300 #1555 of 2000

Problem 1555

National olympiad second round; IMO P1/P4
Geometry Difficulty 7.3 Prove it

Show that any two intervals A,BRA, B\subseteq \mathbb R of positive lengths can be countably disected into each other, that is, they can be written as countable unions A=A1A2A=A_1\cup A_2\cup\ldots\, and B=B1B2B=B_1\cup B_2\cup\ldots\, of pairwise disjoint sets, where AiA_i and BiB_i are congruent for every iNi\in \mathbb N [Gy. Szabo]

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

To show that any two intervals A,BR A, B \subseteq \mathbb{R} of positive lengths can be countably dissected into each other, we need to demonstrate that they can be written as countable unions A=A1A2 A = A_1 \cup A_2 \cup \ldots and B=B1B2 B = B_1 \cup B_2 \cup \ldots of pairwise disjoint sets, where Ai A_i and Bi B_i are congruent for every iN i \in \mathbb{N} .

1. **Case 1: Open Intervals A=(a,b) A = (a, b) and B=(a,b) B = (a', b') **

- Define a0=a a_0 = a and recursively define an+1=an+b2 a_{n+1} = \frac{a_n + b}{2} . This creates a sequence of nested intervals:
A=nω(an,an+1]{b} A = \bigcup_{n \in \omega} (a_n, a_{n+1}] \setminus \{b\}
- Similarly, define a0=a a'_0 = a' and recursively define an+1=an+b2 a'_{n+1} = \frac{a'_n + b'}{2} :
B=nω(an,an+1]{b} B = \bigcup_{n \in \omega} (a'_n, a'_{n+1}] \setminus \{b'\}
- Note that bnω(an,an+1] b \notin \bigcup_{n \in \omega} (a_n, a_{n+1}] and bnω(an,an+1] b' \notin \bigcup_{n \in \omega} (a'_n, a'_{n+1}] .

- Define I(n)=(an,an+1] I(n) = (a_n, a_{n+1}] and I(n)=(an,an+1] I'(n) = (a'_n, a'_{n+1}] . Each I(n) I(n) is congruent to I(n) I'(n) because they are intervals of the same length.

2. Case 2: Other Types of Intervals

- For intervals that include boundary points, such as A=[a,b] A = [a, b] , A=[a,b) A = [a, b) , or A=(a,b] A = (a, b] , we can include the boundary points in the first interval I(1) I(1) and proceed similarly to Case 1.

- For example, if A=[a,b] A = [a, b] , we can write:
A={a}nω(an,an+1]{b} A = \{a\} \cup \bigcup_{n \in \omega} (a_n, a_{n+1}] \cup \{b\}
- Similarly, for B B , include the boundary points in I(1) I'(1) .

3. Ensuring Pairwise Disjoint Sets

- It is important to show that m,n \forall m, n , I(m)I(n)=    mn I(m) \cap I(n) = \emptyset \iff m \neq n . This ensures that the sets Ai A_i and Bi B_i are pairwise disjoint.

4. Cardinality Consideration

- Any nonempty subinterval of R \mathbb{R} has the cardinality of the continuum. This can be shown using the Schröder-Bernstein theorem, which states that if there exist injective functions f:AB f: A \to B and g:BA g: B \to A , then there exists a bijection between A A and B B .

By following these steps, we can construct the required subsets A1,A2, A_1, A_2, \ldots of A A and B1,B2, B_1, B_2, \ldots of B B such that Ai A_i and Bi B_i are congruent for every iN i \in \mathbb{N} .

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.