From 498c49f87dad229ff7495200aad9a746e74ebf33 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:43 +0100 Subject: [PATCH 1/3] limofsize.tex: an image is no larger than its domain given Choice Replacement gives a surjection A -> tau[A]; an injection back needs Choice (or a well-order of A); in ZF it can fail. Ledger: OLI-STH-LIMITATION-IMAGE-CARDINALITY, FR-FOLLOWUP-C4876, OLTESTREPLLIM-001, BN-SRC-792, OLPL-492 Co-Authored-By: Claude Opus 5.5 --- content/set-theory/replacement/limofsize.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/set-theory/replacement/limofsize.tex b/content/set-theory/replacement/limofsize.tex index 558bd970..8150f7a2 100644 --- a/content/set-theory/replacement/limofsize.tex +++ b/content/set-theory/replacement/limofsize.tex @@ -15,7 +15,7 @@ set formed by Replacement cannot be any larger than any set from which it was formed. Stated precisely: suppose you form a set $\funimage{\tau}{A} = \Setabs{\tau(x)}{x \in A}$ using Replacement; -then $\cardle{\funimage{\tau}{A}}{A}$; so if the !!{element}s of $A$ +then (given the Axiom of Choice) $\cardle{\funimage{\tau}{A}}{A}$; so if the !!{element}s of $A$ were not too numerous to form a set, their images are not too numerous to form $\funimage{\tau}{A}$. From 5616877dfbd70b57799c3f000fe1fb31ce46c142 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:43 +0100 Subject: [PATCH 2/3] simp.tex: the proof of cardplustimesmax also covers the product The chain shows a + b = a but never mentions a x b. Ledger: OLI-0588-PRODUCT-PROOF-OMISSION Co-Authored-By: Claude Opus 5.5 --- content/set-theory/card-arithmetic/simp.tex | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/content/set-theory/card-arithmetic/simp.tex b/content/set-theory/card-arithmetic/simp.tex index 23d0ca14..308c2442 100644 --- a/content/set-theory/card-arithmetic/simp.tex +++ b/content/set-theory/card-arithmetic/simp.tex @@ -113,7 +113,8 @@ \cardfont{b})$. Then invoking \olref{alphatimesalpha}, $\cardfont{a}\cardtimes\cardfont{a} = \cardfont{a} \leq \cardfont{a} \cardplus \cardfont{b} \leq \cardfont{a} \cardplus \cardfont{a} \leq -\cardfont{a} \cardtimes \cardfont{a}$. \end{proof}\noindent Similarly, +\cardfont{a} \cardtimes \cardfont{a}$, and likewise $\cardfont{a} \leq +\cardfont{a} \cardtimes \cardfont{b} \leq \cardfont{a} \cardtimes \cardfont{a} = \cardfont{a}$. \end{proof}\noindent Similarly, if $\cardfont{a}$ is infinite, an $\cardfont{a}$-sized union of $\leq\cardfont{a}$-sized sets has size $\leq\cardfont{a}$: From 72e421ffdb521a9e0e339d1d508183b9c6440157 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:44 +0100 Subject: [PATCH 3/3] expotough.tex: a x b = b also when a is finite cardplustimesmax needs both factors infinite, but a may be finite (2 <= a). Ledger: OLI-0589-FINITE-BASE-PROOF-CASE Co-Authored-By: Claude Opus 5.5 --- content/set-theory/card-arithmetic/expotough.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/set-theory/card-arithmetic/expotough.tex b/content/set-theory/card-arithmetic/expotough.tex index 3f86df54..7c07c07f 100644 --- a/content/set-theory/card-arithmetic/expotough.tex +++ b/content/set-theory/card-arithmetic/expotough.tex @@ -61,7 +61,7 @@ &= \cardexpo{2}{\cardfont{a} \cardtimes \cardfont{b}} \text{, by \olref{simplecardexpo}} \\ &= \cardexpo{2}{\cardfont{b}} - \text{, by \olref[simp]{cardplustimesmax}} + \text{, as $\cardfont{b} \leq \cardfont{a} \cardtimes \cardfont{b} \leq \cardfont{b} \cardtimes \cardfont{b} = \cardfont{b}$ by \olref[simp]{cardplustimesmax}} \end{align*} \end{proof}