Generate Lean theorem and lemma skeletons with placeholder proofs.
npx skills add https://github.com/jeffrey-dot-li/lean-homology --skill draft-jeffrey-dot-li
Please help me install this Agent Skill. Skill: draft Source: https://github.com/jeffrey-dot-li/lean-homology/tree/main/.claude/skills/draft Command: npx skills add https://github.com/jeffrey-dot-li/lean-homology --skill draft-jeffrey-dot-li
This Skill helps mathematicians and computer scientists working with formal verification systems like Lean to quickly scaffold the structure of theorems and lemmas, even before the full proofs are developed.
sorry placeholders.Use the draft skill to create a theorem structure for proving the fundamental theorem of calculus.
High-intent search queries and answers about installing and using this skill.
You use `sorry` placeholders when structuring Lean theorems to allow the code to compile before the proofs are finished. This lets you validate the overall theorem structure and type signatures early in the formal verification process.
To scaffold theorem structures in Lean, you can draft declarations using `sorry` placeholders. This allows the overall proof structure to compile successfully while you incrementally develop the actual mathematical proofs for each lemma.
Yes, you can decompose complex Lean proofs into smaller, independently provable lemmas. This interactive decomposition helps manage formal verification projects by breaking down large theorems into structured, compilable sub-goals.
Drafting sorry'd theorems in Lean adheres to Mathlib conventions for naming and documentation. Ensuring your theorem and lemma declarations align with these conventions helps maintain consistency across formal verification projects.
The best way to start a formal verification project in Lean is to draft the main theorem statement and its supporting lemmas with `sorry` proofs. This ensures the entire structure compiles and is ready for incremental proof development.
You use `sorry` placeholders when structuring Lean theorems to allow the code to compile before the proofs are finished. This lets you validate the overall theorem structure and type signatures early in the formal verification process.
AMGrobelnikCompile and verify Lean 4 code with Mathlib integration.
flonatVerify mathematical claims through numerical, symbolic, and formal Lean proofs.
fmhallProvide Lean 4 tactic alternatives for proofs without Mathlib.
jeffrey-dot-liRefactor existing Lean proofs for brevity, clarity, and documentation.