A Lean 4 Framework for the Radii Polynomial Method
Fengyang Wang, Konstantin Mischaikow, Marcio Gameiro
math.DS
Oct 1, 2026 · v3
TL;DR
Formalizes the radii polynomial theorem, weighted coefficient algebras, and operator estimates in Lean 4 with Mathlib and LeanCert, certifying concrete numerical zeros.
Abstract
Understanding nonlinear dynamics is central to many fields of study, yet most nonlinear systems are beyond the reach of closed-form solutions. Numerical simulation is then used to reveal dynamical structures before their existence can be established. This alone, however, leaves the validity of the computed solution unanswered. Rigorous numerical methods address this gap by combining computation with explicit analytic estimates. Among them, the radii polynomial approach, a Newton–Kantorovich type argument, turns a numerical approximation into a proof of existence and uniqueness of a true solution near that approximation. In previous practice, the verification of these inequalities relies on interval-arithmetic libraries and hand-derived algebraic bounds. In this paper, we present a framework for the radii polynomial method in the Lean 4, which turns numerical certificates into fully type-checked theorems about the true solution. A central challenge in this process is to manage the complexity of the formalization. Our approach begins with a family of problems and their common structure. The spaces in which the analysis takes place are developed through universal properties in suitable categories, with extension properties that characterize maps by their action on generators. These properties guide the design of a reusable interface such that problem-specific arguments concentrate on the numerical data and the algebraic bounds that distinguish one equation from another. We formalize a general radii polynomial theorem, develop weighted coefficient algebras and reusable operator estimates, connect finite computational checks to the hypotheses of the theorem, and establish the realization theorems that transport certified coefficient space zeros to analytic solutions of the original equations.
Problem
Computer-assisted proofs via the radii polynomial (Newton–Kantorovich type) method usually rely on interval-arithmetic libraries and hand-derived bounds. The analytic estimates and the numerical checks are not themselves machine-checked.
Approach
A general radii polynomial theorem for maps from a Banach space to a normed space is formalized in Lean 4 on top of Mathlib. Weighted ℓ¹ coefficient spaces are built through universal properties, with bounded-linear and algebra-homomorphism lifts and Taylor evaluation. Reusable operator estimates are developed, and finite rational checks are connected to the theorem's hypotheses. These checks are discharged either by kernel `decide` or by LeanCert interval arithmetic with native evaluation. Realization theorems carry certified coefficient zeros back to analytic solutions of the original equations.
Results
The pipeline runs from rational data to type-checked solutions for four examples: a finite-dimensional zero, a polynomial zero, a scalar Taylor initial value problem, and a Lorenz-system Taylor initial value problem. The main theorems rely only on Lean's standard axioms plus explicitly reported auxiliary axioms from native evaluation.