Let $ (I_t)_{t \in T} $ be an indexed family of intervals of $\mathbb{R}$ that are closed, bounded and mutually non-disjoints.
Prove that: $$\bigcap_{t\in T} \space I_t \neq \varnothing $$
What happens if we replaced the open intervals with disks of $\mathbb{R}^2.$
- The indexed family being mutually non-disjoint means for every couples $ i,j \in T$
We have: $I_i \cap I_j \neq \emptyset \implies \bigcap_{t \in T} I_t \neq \varnothing$.
Which I am not if it is this simple.
- By the definition of a disk: $ D(o,r) = \{ x \in \mathbb{R}^2 | \space d(o,x) \leq r \}$. If we replace the closed bounded intervals by closed bounded disks, the intersection will be the desk with the smallest radius. The smaller the radius gets, the more the disk gets closer to the center $o$.
$$ \bigcap_{t \in T} D_t = \lim_{r \to 0} D_t(o,r) = o$$. Which I am not sure of. Is it correct?
For 1. the solution is not this simple. Here is a sketch for a solution.
First, fix $t_0\in T$ and define $I = I_{t_0}$.
Suppose for a contradiction that $\bigcap_{t\in T} I_t$ is empty. Then $$ \bigcup_{t\in T} I_t^\complement = \left(\bigcap_{t\in T} I_t\right)^\complement = \mathbb{R} $$ In particular, $\{I^\complement_t\}_{t\in T}$ is a open cover for the compact set $I$. Then there exists a finite sub-cover of $I$. That is, there exists a finite set $S\subseteq T$ such that $$ \bigcup_{t\in S} I_t^\complement \supseteq I $$ It then follows that $$ I\setminus\bigcup_{t\in S}I_t^\complement =I\cap\left(\bigcup_{t\in S}I_t^\complement\right)^\complement = \bigcap_{t\in S} I\cap I_t = \emptyset $$ Using the fact that $S$ is finite, you can deduce that this is a contradiction (show that the finite intersection of sets $I_t$ cannot be empty).
For part 2, you can proceed similarly to show that if $D_t$ are mutually non-disjoint closed bounded disks then $$ \bigcap_{t\in T}D_t \neq\emptyset $$
EDIT: To show that the finite intersection of mutually non-disjoint closed, bounded intervals is non-empty, we proceed by induction. The base case is clear. Now, suppose $$[a_1, b_1], \dots, [a_n, b_n], [a_{n+1}, b_{n+1}] \in \{I_t\}_{t\in T}$$ By the induction hypothesis, $$ \bigcap_{i=1}^n [a_i, b_i] $$ is non-empty. Furthermore, notice that $$ \bigcap_{i=1}^n [a_i, b_i] = [a,b] $$ where $a = \max a_i$ and $b = \min b_i$. Now, since $$ [a_{n+1}, b_{n+1}]\cap [a_i, b_i] \neq \emptyset $$ for all $i=1,\dots, n$, we must have $a_{n+1} \leq b_i$ and $b_{n+1} \geq a_i$ for all $i = 1, \dots, n$. Ergo, $$ \bigcap_{i=1}^{n+1} [a_i, b_i] = [a,b]\cap[a_{n+1}, b_{n+1}] = [\max\{a, a_{n+1}\}, \max\{b, b_{n+1}\}] \neq \emptyset $$