← All Papers · proof_complexity

Empirical Proof Complexity of a Lean 4 Formalization of Birch-Swinnerton-Dyer

Dr. Tamás Nagy Short Draft proof_complexity Lean-Verified
Mathematics verified. Core theorems are machine-checked in Lean 4. Prose and presentation may not have been human-reviewed.
View in Graph BibTeX

Summary

We record empirical complexity measurements for the current Lean 4 formalization of the Birch-Swinnerton-Dyer conjecture and its surrounding theory.
Length
1,688 words
Status
Sketch
Target
(internal research sketch)

Browse all proof_complexity papers →