Automated Tactics for Polynomial Reasoning in Lean 4

2026-04-15

AI Summary

This work addresses the limitation in Lean 4 that its native multivariate polynomials employ a non-computable representation, hindering efficient execution of symbolic computations such as Gröbner basis algorithms and thus impeding large-scale algebraic reasoning. To overcome this, the authors propose a certificate-based hybrid verification framework that integrates a computable polynomial representation, leverages external computer algebra systems (e.g., SageMath, SymPy) to compute Gröbner bases, and formally verifies their correctness within Lean 4. This approach enables, for the first time, practical automated handling of large-scale polynomial problems in Lean 4, supporting essential reasoning tasks including remainder verification, ideal membership testing, and ideal equality. The method substantially enhances both the efficiency and practicality of formalized algebraic reasoning in proof assistants.

Technology Category

• Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for heterogeneous, signed, attributed, multi-relational, temporal, higher-order, and annotated Web-related graphs
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

Applying Gröbner basis theory to concrete problems in Lean 4 remains difficult since the current formalization of multivariate polynomials is based on a non-computable representation and is therefore not suitable for efficient symbolic computation. As a result, computing Gröbner bases directly inside Lean is impractical for realistic examples. To address this issue, we propose a certificate-based approach that combines external computer algebra systems, such as SageMath or SymPy, with formal verification in Lean 4. Our approach uses a computable representation of multivariate polynomials in Lean to import and verify externally generated Gröbner basis computations. The external solver carries out the main algebraic computations, while the returned results are verified inside Lean. Based on this method, we develop automated tactics that transfer polynomial data between Lean and the external system and certify the returned results. These tactics support tasks such as remainder verification, Gröbner basis checking, ideal equality, and ideal or radical membership. This work provides a practical way to integrate external symbolic computation into Lean 4 while preserving the reliability of formal proof.

Problem

• Gröbner basis
• polynomial reasoning
• formal verification
• symbolic computation
• Lean 4

Innovation

• Gröbner basis
• certificate-based verification
• Lean 4
• symbolic computation
• automated tactics