math-formal-proof
Installation
SKILL.md
Contract
- Input: mathematical statement to prove and target proof assistant.
- Output: verified source + Markdown narrative.
- Side effects: none.
- Dependencies: none.
- Stop condition: proof verified by the assistant's kernel.
- Risk: low.
- Boundary: produces verified proof artifacts; no new external system changes.
Formal Proof Development
Build a proof in a proof assistant — Lean 4, Coq, Isabelle, Agda — that the assistant's kernel can verify, with a literate narrative for publication.
When to use
- A proof needs machine-verifiable rigour.
- A paper's appendix should include a formal proof (increasing trust).
- The researcher is formalising a known result or building a library (e.g.
mathlib).