Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Chain Bounding, the leanest proof of Zorn's lemma, and an illustration of computerized proof formalization (2404.11638v2)

Published 17 Apr 2024 in math.LO and math.HO

Abstract: 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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com