A machine-checked proof provides a structured justification that a proposition follows from accepted definitions and assumptions. A proof assistant or kernel checks each step rather than trusting the author, a generated explanation or the system that constructed the proof.
AI can search for lemmas, tactics and proof structures, but acceptance depends on the independent checker. This separates creative proof construction from the smaller trusted component responsible for deciding whether the result is valid.
ELI5
A machine-checked proof is a mathematical argument written in a precise form that a small verification program can test step by step. Acceptance depends on the checker confirming the logic, not on how convincing the explanation sounds.
For example, an AI system can search for a proof that a program always returns a nonnegative result. The proof counts only after the checker verifies that every step follows from the stated definitions and assumptions.
Can AI generate a machine-checked proof?
Yes. An AI system can construct a candidate proof, but a separate proof checker must validate the resulting proof term before it is accepted.
What does a machine-checked proof guarantee?
It guarantees that the stated theorem follows from the encoded assumptions and rules accepted by the checker, not that the specification matches every real-world intention.

