FORMALIZING MATHEMATICS IN LEAN
Date of Award
2021
Document Type
Thesis
Degree Name
Bachelors
Department
Natural Sciences
First Advisor
Lepinski, Matthew
Area of Concentration
Mathematics
Abstract
In this thesis we introduce readers to Lean, an interactive proof assistant that allows one to formalize mathematical results on a computer as programs in a functional programming language. These results can therefore be formally verified, leaving no ambiguity to their correctness. The underlying type theory of Lean, the Calculus of Constructions with inductive types (CIC), will be explored, followed by some basic examples of the language. This will lead into a series of proofs of properties of dihedral groups, namely the sizes of their centers and their various automorphism groups.
Recommended Citation
Griffin, Alexander, "FORMALIZING MATHEMATICS IN LEAN" (2021). Theses & ETDs. 6067.
https://digitalcommons.ncf.edu/theses_etds/6067