Cover of Interval By Closed Intervals is not Pairwise Disjoint

From ProofWiki
Jump to navigation Jump to search



Theorem

Let $\closedint a b$ be a closed interval in $\R$.



Let $\JJ$ be a set of two or more closed intervals contained in $\closedint a b$ such that $\ds \bigcup \JJ = \closedint a b$.

Then the intervals in $\JJ$ are not pairwise disjoint.


Proof

Aiming for a contradiction, suppose that the intervals of $\JJ$ are pairwise disjoint.

Let $I = \closedint p q$ be the unique interval of $\JJ$ such that $a \in I$.

Let $J = \closedint r s$ be the unique interval of $\JJ$ containing the least real number not in $I$.

These choices are possible since $\JJ$ has at least two elements, and they are supposed disjoint.

If $q = r$ then $I \cap J \ne \O$, a contradiction.

If $r < q$ then $I \cap J \ne \O$, a contradiction.

If $r > q$ then there is some real number with $q < \alpha < r$.

Therefore $\alpha \notin I$.

Since $J$ contains the least real number not in $I$ it follows that there is $\beta \in J$ with $\beta < \alpha$.

But we also have that $\alpha < r \le \beta$ for all $\beta \in J$, a contradiction.

This exhausts all the possibilities, and we conclude that the intervals of $\JJ$ are not pairwise disjoint.

$\blacksquare$