The proposed Proof Engine Infrastructure assigns clear evidence status to AI-made math outputs and composes only what has been checked.
The work describes a two-level system for mathematical research assisted by AI: an “evidentiary” layer that tracks what evidence supports each claim, and an “inferential” layer that treats proof obligations as a graph with rules for when premises are combined. The framework aims to prevent untrusted AI output from being treated as fully justified simply because it sounds convincing or already exists in some formal form.
Instead of assuming closure in prose, the architecture derives closure from the graph structure. It also distinguishes a positive candidate (plausible and worth further work) from an earned result (checked in a way that licenses use), while requiring reference grounding and a precise link between the checked object and the stated claim.
Key framework rules
The paper introduces Proof Engine Infrastructure, a methodological architecture that:
- Represents mathematical claims with associated supporting artifacts, checking procedures, the scope of those checks, and remaining assumptions.
- Models proof obligations as a typed directed hypergraph, where alternative routes use disjunctive semantics and obligations needing several premises use conjunctive semantics.
- Defines promotion from candidate to earned result as admissible only when reference grounding, machine-checkable evidence, and an exact binding between the checked object and the claim all hold, together with strength preservation, compositional completeness, and dependency preservation.
- Treats proof-engine “closure” as something derived from the graph rather than asserted in text.
- Allows verification technology to vary, with proof assistants providing one verification boundary that is then bound to exact claims, assumptions, and dependencies and composed with other checked evidence.
- Marks failed routes as typed negative evidence without disproving the underlying output claims.
It reports that a kernel-checked Hamilton classification and a mixed-boundary Rado-number study motivate the framework, while emphasizing that the main contribution is the set of invariants for evidentiary status and graph-level closure.
Clear evidence for AI math
The paper focuses on making AI-assisted mathematical research produce outputs with clearer evidence status and safer downstream use. By separating generation, verification, composition, and publication, it aims to reduce the chance that an AI system’s provenance or persuasive wording stands in for mathematical justification, and to manage verification effort when combining different checked pieces of evidence.
// Source
Zenodo (CERN European Organization for Nuclear Research) · 2026 · DOI: 10.5281/zenodo.21672333
Authors: Alex Chengyu Li
Institutions: Oldham Council