LeanGeo: Formalizing Competitional Geometry problems in Lean

Chendong Song, Zihan Wang, Frederick Pu, Haiming Wang, Xiaohan Lin +3 more
8/20/2025
cs.AI

Official code: project-numina/LeanGeo (43 stars, MIT, last commit 2025-08-26).

Abstract

Geometry problems are a crucial testbed for AI reasoning capabilities. Most existing geometry solving systems cannot express problems within a unified framework, thus are difficult to integrate with other mathematical fields. Besides, since most geometric proofs rely on intuitive diagrams, verifying geometry problems is particularly challenging. To address these gaps, we introduce LeanGeo, a unified formal system for formalizing and solving competition-level geometry problems within the Lean 4 theorem prover. LeanGeo features a comprehensive library of high-level geometric theorems with Lean's foundational logic, enabling rigorous proof verification and seamless integration with Mathlib. We also present LeanGeo-Bench, a formal geometry benchmark in LeanGeo, comprising problems from the International Mathematical Olympiad (IMO) and other advanced sources. Our evaluation demonstrates the capabilities and limitations of state-of-the-art Large Language Models on this benchmark, highlighting the need for further advancements in automated geometric reasoning. We open source the theorem library and the benchmark of LeanGeo at https://github.com/project-numina/LeanGeo/tree/master.

View on arXivView PDF

Code Implementations(1)

MIT

Solving Competition Geometry Problems in Lean

435CSS, TeXJul 8, 20251 years agoMIT

Similar Papers

Cite this paper

@article{song2025leangeo,
  title  = {LeanGeo: Formalizing Competitional Geometry problems in Lean},
  author = {Chendong Song and Zihan Wang and Frederick Pu and Haiming Wang and Xiaohan Lin and Junqi Liu and Jia Li and Zhengying Liu},
  year   = {2025},
  eprint = {2508.14644},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.14644v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.14644.svg)](https://codeofpaper.com/paper/2508.14644)

Discussion