diff --git a/content/sets-functions-relations/arithmetization/cauchy.tex b/content/sets-functions-relations/arithmetization/cauchy.tex index 811246a6..e3644fe1 100644 --- a/content/sets-functions-relations/arithmetization/cauchy.tex +++ b/content/sets-functions-relations/arithmetization/cauchy.tex @@ -146,8 +146,8 @@ $(f-g)$ and $(f\times g)$ are Cauchy sequences when $f$ and $g$ are; but they are, and we leave this to you. -Finally, we define we a notion of order. Say $\equivrep{f}{}$ is -\emph{positive} iff both $\equivrep{f}{}\neq 0_\Rat$ and $(\exists +Finally, we define a notion of order. Say $\equivrep{f}{}$ is +\emph{positive} iff both $\equivrep{f}{}\neq 0_\Real$ and $(\exists \ell \in \Nat)(\forall n > \ell)0 < f(n)$. Then say $\equivrep{f}{} < \equivrep{g}{}$ iff $\equivrep{(g - f)}{}$ is positive. We have to check that this is well-defined (i.e., that it does not depend upon @@ -159,7 +159,7 @@ But having done this, it is quite easy to show that these yield the right algebraic properties; that is: \begin{thm}\ollabel{thm:cauchyorderedfield} -The Cauchy sequences constitute an ordered field. +The equivalence classes of Cauchy sequences under $\Realequiv$ constitute an ordered field. \end{thm} \begin{proof} @@ -167,7 +167,7 @@ \end{proof} \begin{prob} -Prove that the Cauchy sequences constitute an ordered field. +Prove that the equivalence classes of Cauchy sequences under $\Realequiv$ constitute an ordered field. \end{prob} It is harder to prove that the reals, so constructed, have the diff --git a/content/sets-functions-relations/arithmetization/cuts.tex b/content/sets-functions-relations/arithmetization/cuts.tex index c65ba252..21e714e6 100644 --- a/content/sets-functions-relations/arithmetization/cuts.tex +++ b/content/sets-functions-relations/arithmetization/cuts.tex @@ -61,7 +61,7 @@ %\Setabs{p \in \Rat}{(\exists \alpha \in S)p \in \alpha}$$ We first claim that $\lambda$ is a cut: \begin{enumerate} -\item Since $S$ has an upper bound, at least one cut is in $S$, so +\item Since $S$ is non-empty, at least one cut is in $S$, so $\emptyset \neq \lambda$. Since $S$ is a set of cuts, $\lambda \subseteq \Rat$. Since $S$ has an upper bound, some $p \in \Rat$ is absent from every cut $\alpha \in S$. So $p\notin \lambda$, and hence