Automate induction proofs for natural numbers with Lean 4 verification.
npx skills add https://github.com/0bserver07/bourbaki --skill proof-by-induction
Please help me install this Agent Skill. Skill: proof-by-induction Source: https://github.com/0bserver07/bourbaki/tree/main/src/skills/proof-by-induction Command: npx skills add https://github.com/0bserver07/bourbaki --skill proof-by-induction
This skill automates the construction and verification of induction proofs for statements about natural numbers, reducing manual effort and minimizing errors.
Provide a concrete statement to prove by induction, and I will generate a Lean-based proof plan including base-case and inductive-step reasoning.
High-intent search queries and answers about installing and using this skill.
Automating induction proofs for natural numbers requires providing a precise statement P(n), a base case, and an inductive step to generate a structured proof outline. This skill formulates and verifies both the base case and inductive step automatically, reducing manual effort and minimizing errors.
Yes, Lean 4 proof integration verifies induction proofs for mathematical theorems, sequences, and properties expressed in P(n). The skill produces Lean theorem naming and a structured outline for machine-checked formal verification of your natural number statements.
Generating a Lean-based induction proof requires a concrete statement to prove by induction, specifically a precise statement P(n), a base case, and an inductive step. The skill then produces the corresponding Lean theorem naming and structured outline.
Automated induction proof generation applies specifically to statements about natural numbers expressed in P(n), covering mathematical theorems, sequences, and properties. It requires a precise statement, base case, and inductive step to produce verifiable Lean proofs.
Natural number induction proofs fail verification in Lean when the base case or inductive step lacks precise formulation. This skill automates base-case formulation and inductive-step construction to minimize manual errors and ensure formal verification passes.
Structuring base cases and inductive steps for formal proofs requires a precise statement P(n) and clear separation of base-case formulation and inductive-step construction. This skill automates both stages and integrates Lean 4 for machine-checked validation.
0bserver07Prove natural number statements by assuming P(k) for all k less than n.
nicholls-incConvert signed-off informal verification specs into type-checked Lean 4 stubs.
rainoftimeDevelop interactive proofs and formalize mathematical theories in Coq.
bnebProve natural number properties using weak and strong induction in Lean 4.
