From 1ffce21968d0e26e517dade04bfcd81ec0453656 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:42 +0100 Subject: [PATCH 1/4] cuts.tex: non-emptiness, not an upper bound, gives a member of S The empty family is bounded above; the member comes from the hypothesis that S is non-empty. Ledger: OLI-CUTS-SUPREMUM-NONEMPTY-PREMISE Co-Authored-By: Claude Opus 5.5 --- content/sets-functions-relations/arithmetization/cuts.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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 From ed454ee7d3eecc841eeb3d35a042a881b80e4c4f Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:42 +0100 Subject: [PATCH 2/4] cauchy.tex: positivity compares the class with 0_Real, not 0_Rat [f] is a real (a class); the real zero is the class of the zero sequence defined just above. Ledger: OLI-CAUCHY-POSITIVITY-REAL-ZERO Co-Authored-By: Claude Opus 5.5 --- content/sets-functions-relations/arithmetization/cauchy.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/sets-functions-relations/arithmetization/cauchy.tex b/content/sets-functions-relations/arithmetization/cauchy.tex index 811246a6..a623790a 100644 --- a/content/sets-functions-relations/arithmetization/cauchy.tex +++ b/content/sets-functions-relations/arithmetization/cauchy.tex @@ -147,7 +147,7 @@ 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 +\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 From 832aa2bad408df12810c0378acb496272d9ae44a Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:42 +0100 Subject: [PATCH 3/4] cauchy.tex: 'we define a notion of order' Doubled 'we'. (Kept in this bundle because it is on the line next to the 0_Real fix.) Ledger: OLI-CAUCHY-DUPLICATED-WE Co-Authored-By: Claude Opus 5.5 --- content/sets-functions-relations/arithmetization/cauchy.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/sets-functions-relations/arithmetization/cauchy.tex b/content/sets-functions-relations/arithmetization/cauchy.tex index a623790a..bf5082b2 100644 --- a/content/sets-functions-relations/arithmetization/cauchy.tex +++ b/content/sets-functions-relations/arithmetization/cauchy.tex @@ -146,7 +146,7 @@ $(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 +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 From 99fe7e2dae6e92ebeccf06d8bbdcd41235e2bc6b Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:42 +0100 Subject: [PATCH 4/4] cauchy.tex: the ordered field is the set of classes, not the raw Cauchy sequences (1,0,0,...) is a non-zero Cauchy sequence with no multiplicative inverse; its class is 0. Ledger: OLI-CAUCHY-FIELD-QUOTIENT-CLASSES Co-Authored-By: Claude Opus 5.5 --- content/sets-functions-relations/arithmetization/cauchy.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/content/sets-functions-relations/arithmetization/cauchy.tex b/content/sets-functions-relations/arithmetization/cauchy.tex index bf5082b2..e3644fe1 100644 --- a/content/sets-functions-relations/arithmetization/cauchy.tex +++ b/content/sets-functions-relations/arithmetization/cauchy.tex @@ -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