Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids
Martin Dvorak

TL;DR
This thesis in Lean 4 formalizes theorems in optimization, matroid theory, and grammars, emphasizing code readability, trustworthiness, and philosophical notions of beauty in mathematical formalization.
Contribution
It develops understandable, verifiable libraries in Lean 4 for diverse mathematical areas, integrating philosophical perspectives on beauty and truth into formal verification.
Findings
Formalized key theorems in optimization, matroids, and grammars.
Created readable and trustworthy Lean 4 libraries for mathematical theories.
Integrated philosophical insights into the formalization process.
Abstract
This thesis documents a voyage towards truth and beauty via formal verification of theorems. To this end, we develop libraries in Lean 4 that present definitions and results from diverse areas of MathematiCS (i.e., Mathematics and Computer Science). The aim is to create code that is understandable, believable, useful, and elegant. The code should stand for itself as much as possible without a need for documentation; however, this text redundantly documents our code artifacts and provides additional context that isn't present in the code. This thesis is written for readers who know Lean 4 but are not familiar with any of the topics presented. We manifest truth and beauty in three formalized areas of MathematiCS (optimization theory, matroid theory, and the theory of grammars). In the pursuit of truth, we focus on identifying the trusted code in each project and presenting it faithfully.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Computability, Logic, AI Algorithms · Spreadsheets and End-User Computing
