Repository navigation
[set theory] limofsize.tex, simp.tex, expotough.tex - #444
KokunoYumeto wants to merge 3 commits into
Conversation
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 <noreply@anthropic.com>
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 <noreply@anthropic.com>
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 <noreply@anthropic.com>
|
@timbutton and these? |
|
On limofsize.tex: Claude has identified a mistake. But the proposed fix cites the Axiom of Choice, which we have not yet really discussed and which is not yet one of our axioms. Moreover, we officially refer to it as Well-Ordering. So I propose this alternative instead: then |
|
On expotough.tex We could make this adjustment, but I am inclined not to make the change suggested. There is no mistake, and the extra pedantry doesn't illuminate the proof. (However, I have a better suggestion, below!) |
|
On simp.tex Claude has identified a missing step. But I would prefer to offer this fix. Replace: \cardfont{a} \cardtimes \cardfont{a}$. \end{proof}\noindent Similarly, with: \cardfont{a} \cardtimes \cardfont{a}$. The case for \cardtimes is similar. \end{proof}\noindent Similarly, At the same time, we can also fix Theorem 15.11 to avoid the problem raised with expotough.tex. Simply change the first line of the statement of the theorem to read thus: If |
|
@timbutton Can I ask about the argument in simp.tex? It currently reads
I have to admit I don't quite get how this works. Is it this: a ≤ a ⊕ b (monotonicity of ⊕) ≤ a ⊕ a (a is the max of a, b) ≤ a ⊗ a (not sure how we know this?) = a (by Lemma card-arithmetic.10). So a ≤ a ⊕ b ≤ a and hence a = a ⊕ b. Then for ⊗ it would be a ≤ a ⊗ b (monotonicity of ⊗) ≤ a ⊗ a (a is the max of a, b) = a (by Lemma card-arithmetic.10). Right? Should we spell out why ⊕ and ⊗ are monotonic and why a ⊕ a ≤ a ⊗ a? |
While translating the Open Logic Project into eighteen languages, the AI checks of the translations kept finding small errors in the English source. We reported them as issues (#432, #433, #435, #436), and you have been integrating them by hand. These pull requests may save you that work: each fix is a separate commit, checked against master
a216aa64. With them,open-logic-completebuilds as on master (no errors, no new undefined references), and the changed proof-theory sections, which that driver does not include, compile on their own as on master. Merge any, all or none; each branch starts from master and merges on its own.limofsize.tex: |τ[A]| ≤ |A| holds given Choice. Replacement yields only a surjection from A, and in ZF an injection back can fail.simp.tex: the proof ofcardplustimesmaxnow also shows a × b = a (a ≤ a × b ≤ a × a = a).expotough.tex: incardexpo2reduct, a may be finite. a × b = b follows from b ≤ a × b ≤ b × b = b, usingcardplustimesmaxonly for b, b.Prepared by AI: the fixes were written by a Claude agent (Claude Opus 5.5 at effort medium), and the mathematical ones were checked by Claude Opus 5.5 at effort max.
🤖 Generated with Claude Code