The Network Structure of Mathlib
Not on the map. Why?
Abstract (arXiv)
The ongoing development of Lean 4's Mathlib has produced a macroscopic structural complexity that interweaves logical, mathematical, and infrastructural dependencies. We present a network analysis of this library, extracting its dependency structure into a multilayer graph of 308,129 declarations, 8.4 million edges, and 7,563 modules. By introducing graph decompositions that isolate explicit edges from those synthesized by the compiler or driven by proofs, we quantify the structural properties of formalized mathematics. Our analysis reveals three findings. First, taxonomies designed by humans diverge from logical structures, exhibiting a 50.9% coupling across namespaces. Second, developers utilize a median of 1.6% of the imported scope. Third, formalization compresses semantic hierarchies, with network centrality capturing language infrastructure rather than mathematical relevance.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Apr 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026When Does Structured Knowledge Help Neural Theorem Proving?28 Sep 2026
- 2026Beyond Correctness: Toward Automated Novelty Verification with Lean 42 Aug 2026
- 2026PriorProof: A Point-in-Time Measure of Technique Novelty for Formal Proofs18 Jul 2026
- 2026Formalizing Mathematics at Scale28 May 2026