2023-04-10 17:33:22 +00:00
|
|
|
\documentclass{article}
|
2023-04-10 22:25:32 +00:00
|
|
|
\usepackage[shortlabels]{enumitem}
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\input{../../common/preamble}
|
|
|
|
|
|
|
|
\begin{document}
|
|
|
|
|
|
|
|
\begin{xtheorem}{I.27}
|
|
|
|
|
2023-04-10 22:25:32 +00:00
|
|
|
Every nonempty set $S$ that is bounded below has a greatest lower bound; that
|
|
|
|
is, there is a real number $L$ such that $L = \inf{S}$.
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\end{xtheorem}
|
|
|
|
|
|
|
|
\begin{proof}
|
|
|
|
|
2023-04-10 22:25:32 +00:00
|
|
|
\href{Chapter_I_3.lean}{Apostol.Chapter_I_3.Real.exists_isGLB}
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\end{proof}
|
|
|
|
|
|
|
|
\begin{xtheorem}{I.29}
|
|
|
|
|
2023-04-10 22:25:32 +00:00
|
|
|
For every real $x$ there exists a positive integer $n$ such that $n > x$.
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\end{xtheorem}
|
|
|
|
|
|
|
|
\begin{proof}
|
|
|
|
|
2023-04-10 22:25:32 +00:00
|
|
|
\href{Chapter_I_3.lean}{Apostol.Chapter_I_3.Real.exists_pnat_geq_self}
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\end{proof}
|
|
|
|
|
|
|
|
\begin{xtheorem}{I.30}[Archimedean Property of the Reals]
|
|
|
|
|
2023-04-10 22:25:32 +00:00
|
|
|
If $x > 0$ and if $y$ is an arbitrary real number, there exists a positive
|
|
|
|
integer $n$ such that $nx > y$.
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\end{xtheorem}
|
|
|
|
|
|
|
|
\begin{proof}
|
|
|
|
|
2023-04-10 22:25:32 +00:00
|
|
|
\href{Chapter_I_3.lean}{Apostol.Chapter_I_3.Real.exists_pnat_mul_self_geq_of_pos}
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\end{proof}
|
|
|
|
|
|
|
|
\begin{xtheorem}{I.31}
|
|
|
|
|
2023-04-10 22:25:32 +00:00
|
|
|
If three real numbers $a$, $x$, and $y$ satisfy the inequalities
|
|
|
|
$$a \leq x \leq a + \frac{y}{n}$$
|
|
|
|
for every integer $n \geq 1$, then $x = a$.
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\end{xtheorem}
|
|
|
|
|
|
|
|
\begin{proof}
|
|
|
|
|
2023-04-10 22:25:32 +00:00
|
|
|
\href{Chapter_I_3.lean}{Apostol.Chapter_I_3.Real.forall_pnat_leq_self_leq_frac_imp_eq}
|
|
|
|
|
|
|
|
\end{proof}
|
|
|
|
|
|
|
|
\begin{xtheorem}{I.32}
|
|
|
|
|
|
|
|
Let $h$ be a given positive number and let $S$ be a set of real numbers.
|
|
|
|
\begin{enumerate}[(a)]
|
|
|
|
\item If $S$ has a supremum, then for some $x$ in $S$ we have
|
|
|
|
$$x > \sup{S} - h.$$
|
|
|
|
\item If $S$ has an infimum, then for some $x$ in $S$ we have
|
|
|
|
$$x < \inf{S} + h.$$
|
|
|
|
\end{enumerate}
|
|
|
|
|
|
|
|
\end{xtheorem}
|
|
|
|
|
|
|
|
\begin{proof}
|
|
|
|
|
|
|
|
\ % Force space prior to *Proof.*
|
|
|
|
|
|
|
|
\begin{enumerate}[(a)]
|
|
|
|
\item \href{Chapter_I_3.lean}{Apostol.Chapter_I_3.Real.arb_close_to_sup}
|
|
|
|
\item \href{Chapter_I_3.lean}{Apostol.Chapter_I_3.Real.arb_close_to_inf}
|
|
|
|
\end{enumerate}
|
2023-04-10 17:33:22 +00:00
|
|
|
|
|
|
|
\end{proof}
|
|
|
|
|
|
|
|
\end{document}
|