Guide constructing well-founded recursion proofs in Lean 4.
npx skills add https://github.com/fmhall/lean-png --skill lean-wf-recursion-fmhall
Please help me install this Agent Skill. Skill: lean-wf-recursion Source: https://github.com/fmhall/lean-png/tree/main/.claude/skills/lean-wf-recursion Command: npx skills add https://github.com/fmhall/lean-png --skill lean-wf-recursion-fmhall
This Skill addresses the challenge of constructing and understanding well-founded recursion proofs in Lean 4, providing a guide for various proof patterns and strategies.
Apply the lean-wf-recursion skill to a Lean 4 function to understand the appropriate unfolding strategy for proving well-founded recursion.
High-intent search queries and answers about installing and using this skill.
Well-founded recursion in Lean 4 is a proof technique that ensures recursive functions terminate by requiring a decreasing measure over a well-founded relation, allowing the compiler to safely accept the function definition.
Converting fuel-based functions to well-founded recursion involves replacing the fuel parameter with a termination measure, using structured templates to transform the function and establish the necessary decreasing proofs.
The best strategies for unfolding well-founded functions involve applying functional induction and selecting appropriate termination measures to break down the recursive structure and simplify the termination proof.
Yes, you need a basic understanding of Lean 4 and well-founded recursion concepts, as this guide focuses on practical application of proof patterns rather than introductory Lean 4 syntax or basic theorem proving.
my04337Plan and pre-validate Lean 4 proof strategies before theorem proving.
parcadeiVerify category axioms and functor properties using Lean 4.
fmhallProvide Lean 4 tactics for simplifying proofs with simp only failures.
kim-emGuide Lean 4 proofs for well-founded recursive functions with induction and termination measures.
