Pistis: Faithful Formalization of Natural-Language Proofs in Lean
A new arXiv paper (2608.15432) introduces Pistis, an agentic, oracle-guided proof search system that generates formal Lean proofs faithful to natural-language arguments. The authors identify five necessary conditions for a faithful formal proof and propose OrderDecompose, a divide-and-conquer search strategy that preserves faithfulness. This work addresses the challenge of aligning formal proof tactics with human reasoning, aiming to assist mathematicians in formalizing proof sketches and enabling verification of AI-generated arguments. The paper is available on arXiv.
Key facts
- arXiv paper 2608.15432 introduces Pistis, a proof search system.
- Pistis generates formal Lean proofs that satisfy five necessary conditions for faithfulness.
- The core algorithm is named OrderDecompose, a divide-and-conquer search.
- Faithfulness ensures the formal proof reflects the natural-language argument's reasoning.
- The work targets formal verification and automated proof search.
- It aims to assist mathematicians in formalizing proof sketches.
- The paper is announced as new on arXiv.
- The source URL is https://arxiv.org/abs/2608.15432.
Entities
Institutions
- arXiv