The Nested Internval Property
For the definitions of an upper bound and the least upper bound of a set, see this.
Discussion:
This is a result that shows that \(\mathbf{R}\) is definitely complete and has no holes because no matter what nested intervals we have, even if we have an infinite number of these nested intervals, their intersection will not be empty. This result is built on top of the axiom of completeness. Why another result? Because it might be more intuitive think about a never ending nested intervals without ever being empty than thinking about always having a least upper bound for bounded sets.
Proof:
We will use the axiom of completeness to produce a single real number \(x\) satisfying \(x \in I_n\) for every \(n \in \mathbf{N}\). For this, consider the set of all the left end points of each of these intervals,
This set is bounded. This is because every \(b_n\) from every interval is an upper bound on \(A\) by definition. Since \(A\) is bounded then by the axiom of completness, \(A\) has a least upper bound. Let this least upper bound be \(x\). So
Now, consider any interval \(I_n = [a_n, b_n]\). We know that \(x\) is an upper bound for \(A\) so we must have,
Moreover, we know that \(b_n\) is an upper bound for \(A\) and so by the definition of the least upper bound, any other bound must be greater than the least upper bound and so
Combining both inequalities, we get
This means that \(x \in I_n\) for any \(n \in \mathbf{N}\). Therefore, \(x \in \bigcap_{n=1}^{\infty} I_n\) and so the intersection is not empty as we wanted to show. \(\blacksquare\)
References: