Papers › Chain Bounding, the leanest proof of Zorn's lemma, and an illustration of computerized...
Chain Bounding, the leanest proof of Zorn's lemma, and an illustration of computerized proof formalization
Guillermo L. Incatasciato, Pedro Sánchez Terraf
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest ones that we are aware of. As a by-product, we show that for every poset P and function f from the powerset of P into P, there exists a maximal well-ordered chain whose family of initial segments is appropriately closed under f. We also provide an introduction to the process of "computer formalization" of mathematical proofs by using *proofs assistants*. As an illustration, we verify our main results with the Lean proof assistant.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections