A Lean 4 formalization (using Mathlib) of the following result.
Theorem. The real roots of reliability polynomials of connected simple graphs are dense in $[-1, 0]$.
This is a formalization of item 2 of the main theorem of the paper:
P. Buys, Density of reliability roots of simple graphs in the unit disk, (2026). arXiv:2604.07541
Let
The main theorem is located in ReliabilityRoots/MainTheorem.lean:
theorem reliabilityRoots_dense_in_Icc :
Icc (-1 : ℝ) 0 ⊆ closure {q : ℝ | ∃ (V : Type) (_ : Fintype V) (_ : DecidableEq V)
(G : SimpleGraph V), G.Connected ∧ G.reliabilityFun q = 0}The definition of reliabilityFun and the main theorem statement were carefully checked by the author. The rest of the formalization was auto-formalized with Claude Code.
| File | Contents |
|---|---|
Defs.lean |
Definitions of reliabilityFun, splitRelFun, and reliabilityRootSet
|
BlockAlgebra.lean |
Algebraic identity for cycle and path compositions of blocks |
CycleGadget.lean |
Cycle-substitution graph |
LimCompleteGraph.lean |
Asymptotic limits: |
ReliabilityProof.lean |
Core density argument via IVT applied to |
MainTheorem.lean |
Clean theorem statement |
- Formalize item 1 of the main theorem: complex reliability roots of simple graphs are dense in the closed unit disk. The main obstacle is formalizing Rouché's theorem.
Requires Lean 4 (v4.28.0) and Mathlib (v4.28.0). To build:
lake exe cache get # download precompiled Mathlib
lake build