Munkres' General Topology Autoformalized in Isabelle/HOL
Not on the map. Why?
Abstract (arXiv)
We describe an experiment in LLM-assisted autoformalization that produced over 85,000 lines of Isabelle/HOL code covering all 39 sections of Munkres' Topology (general topology, Chapters 2--8), from topological spaces through dimension theory. The LLM-based coding agents (initially ChatGPT 5.2 and then Claude Opus 4.6) used 24 active days for that. The formalization is complete: all 806 formal results are fully proved with zero sorry's. Proved results include the Tychonoff theorem, the Baire category theorem, the Nagata--Smirnov and Smirnov metrization theorems, the Stone--vCech compactification, Ascoli's theorem, the space-filling curve, and others. The methodology is based on a "sorry-first" declarative proof workflow combined with bulk use of sledgehammer - two of Isabelle major strengths. This leads to relatively fast autoformalization progress. We analyze the resulting formalization in detail, analyze the human--LLM interaction patterns from the session log, and briefly compare with related autoformalization efforts in Megalodon, HOL Light, and Naproche. The results indicate that LLM-assisted formalization of standard mathematical textbooks in Isabelle/HOL is quite feasible, cheap and fast, even if some human supervision is useful.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 23 references that are in the map. First posted on arXiv 8 Apr 2026.
Builds on
6 of 23 references.
References · 6
- 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 278
- 2018First Experiments with Neural Translation of Informal to Formal Mathematicscited by 52
- 2026130k Lines of Formal Topology in Two Weeks: Simple and Cheap Autoformalization for Everyone?cited by 16
- 2014Developing Corpus-based Translation Methods between Informal and Formal Mathematics: Project Descriptioncited by 7
- 2025Hammering Higher Order Set Theorycited by 3
- 2021Simple Type Theory is not too Simple: Grothendieck's Schemes without Dependent Typescited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Autoformalization in the Era of Large Language Models: A Survey
- 2024Don't Trust: Verify -- Grounding LLM Quantitative Reasoning with Autoformalization
- 2026Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics
- 2026Multi-agent Autoformalization of Tensor Network Theory
- 2025L-Mosaics and Bounded Join-Semilattices in Isabelle/HOL ↗
- 2026Vibe Coding an LLM-powered Theorem Prover
- 2024Autoformalize Mathematical Statements by Symbolic Equivalence and Semantic Consistency
- 2025A Topological Rewriting of Tarski's Mereogeometry ↗