Summary

This document outlines a formal proof of the existence of prime numbers and the properties of factorials using the Lean proof assistant. It establishes that every number greater than 1 has a prime factor and demonstrates the infinitude of prime numbers. Specifically, it proves that for any number *n*, *n* + 1 has a prime factor greater than *n* by leveraging the factorial function and its divisibility properties. The team utilizes Lean to rigorously verify their Cedar project's Rust code against a formal Lean proof, utilizing Lean's runtime for continuous testing.

Title

Lean Programming Language

Description

Lean is an open-source programming language and proof assistant that enables correct, maintainable, and formally verified code.

Keywords

lean, grind, leans, mathematics, prime, verification, theorem, factorial, community, language, proof, cedar, code, complex, intro, proofs, systems

NS Lookup

A 75.2.60.5

Dates

Created 2026-03-09

Updated 2026-03-09

Summarized 2026-03-13