Lean (proof assistant)

Lean

Paradigm	Functional programming, Imperative programming
Developer	Lean FRO
First appeared	2013; 11 years ago (2013)
Stable release	4.6.1 / 4 March 2024; 36 days ago (2024-03-04)
Preview release	4.7.0-rc2 / 5 March 2024; 35 days ago (2024-03-05)
Typing discipline	Static, strong, inferred
Implementation language	Lean , C++
OS	Cross-platform
License	Apache License 2.0
Website	lean-lang.org
Influenced by
ML Coq Haskell

Lean is a proof assistant and programming language. It is based on the calculus of constructions with inductive types. It is an open-source project hosted on GitHub. It was principally developed by Leonardo de Moura while employed by Microsoft Research and now Amazon Web Services, and has had significant contributions from other coauthors and collaborators during its history. Development is currently supported by the non-profit Lean Focused Research Organization (FRO).

History[edit]

Lean was initially launched by Leonardo de Moura at Microsoft Research in 2013.^[1] The initial versions of the language, later known as Lean 1 and 2, were experimental and contained features such as support for homotopy type theory – based foundations that were later dropped.

Lean 3 (first released Jan 20, 2017) was the first moderately stable version of Lean. It was implemented primarily in C++ with some features written in Lean itself. After version 3.4.2 Lean 3 was officially end-of-lifed while development of Lean 4 began. In this interim period members of the Lean community developed and released unofficial versions up to 3.51.1.

In 2021, Lean 4 was released which was a reimplementation of the Lean theorem prover capable of producing C code which is then compiled, enabling the development of efficient domain-specific automation.^[2] Lean 4 also contains a macro system and improved typeclass synthesis and memory management procedures over the previous version. Another benefit compared to Lean 3 is the ability to avoid touching C++ code in order to modify the frontend and other key parts of the core system, as they are now all implemented in Lean and available to the end user to be overridden as needed.^{[citation needed]}

Lean 4 is not backwards-compatible with Lean 3.^[3]

In 2023, the Lean FRO was formed, with the goals of improving the language's scalability and usability, and implementing proof automation.^[4]

Overview[edit]

Libraries[edit]

The official lean package includes a standard library std4, which implements common data structures that may be used for both mathematical research and more conventional software development.^[5]

In 2017, a community-maintained project to develop a Lean library mathlib began, with the goal to digitize as much of pure mathematics as possible in one large cohesive library, up to research level mathematics.^[6][7] As of November 2023, mathlib had formalized over 127,000 theorems and 70,000 definitions in Lean.^[8]

Editors integration[edit]

Lean integrates with:^[9]

• Visual Studio Code
• Neovim
• Emacs

Interfacing is done via a client-extension and Language Server Protocol server.

It has native support for Unicode symbols, which can be typed using LaTeX-like sequences, such as "\times" for "×". Lean can also be compiled to JavaScript and accessed in a web browser and has extensive support for meta-programming.

Examples (Lean 4)[edit]

The natural numbers can be defined as an inductive type. This definition is based on the Peano axioms and states that every natural number is either zero or the successor of some other natural number.

inductive Nat : Type | zero : Nat | succ : Nat → Nat 

Addition of natural numbers can be defined recursively, using pattern matching.

def Nat.add : Nat → Nat → Nat | n, Nat.zero   => n                      -- n + 0 = n   | n, Nat.succ m => Nat.succ (Nat.add n m) -- n + succ(m) = succ(n + m) 

This is a simple proof in Lean using tactic mode:

theorem and_swap (p q : Prop) : p ∧ q → q ∧ p := by   intro h            -- assume p ∧ q with proof h, the goal is q ∧ p   apply And.intro    -- the goal is split into two subgoals, one is q and the other is p   · exact h.right    -- the first subgoal is exactly the right part of h : p ∧ q   · exact h.left     -- the second subgoal is exactly the left part of h : p ∧ q 

This same proof in term mode:

theorem and_swap (p q : Prop) : p ∧ q → q ∧ p :=     fun ⟨hp, hq⟩ => ⟨hq, hp⟩ 

Usage[edit]

Mathematics[edit]

Lean has gotten attention from mathematicians Thomas Hales^[10] and Kevin Buzzard.^[11] Hales is using it for his project, Formal Abstracts.^[12] Buzzard uses it for the Xena project.^[13] One of the Xena Project's goals is to rewrite every theorem and proof in the undergraduate math curriculum of Imperial College London in Lean.

In 2021, a team of researchers used Lean to verify the correctness of a proof by Peter Scholze in the area of condensed mathematics. The project garnered substantial attention for formalizing a result at the cutting edge of mathematical research.^[14] In 2023, Terence Tao used Lean to formalize a proof of the Polynomial Freiman-Ruzsa (PFR) conjecture, a result published by Tao and collaborators in the same year.^[15]

Artificial intelligence[edit]

In 2022, OpenAI created a neural network-based theorem prover for lean, which used a language model to generate proofs of various high-school-level olympiad problems.^[16]

Later that year, Meta AI created an AI model that has solved 10 International Mathematical Olympiad problems; this model is available for public use with the Lean environment.^[17]

See also[edit]

• Dependent type
• List of proof assistants
• mimalloc
• Type theory
• Focused Research Organization

References[edit]

External links[edit]

• Lean Website
• Lean Community Website
• Lean FRO
• The Natural Number Game- An interactive tutorial to learn lean