lean-fuel-induction

Fuel independence for Lean 4 recursive functions is proven by verifying that execution does not depend on input size. This Skill automates that verification process to ensure correctness regardless of input scale.

Proving loop invariants in Lean 4 requires establishing patterns and lemmas for recursive functions. This Skill provides automated patterns to verify these invariants, streamlining the proof process for recursive operations.

Yes, you can verify stateful operations like BitReader in Lean 4. This Skill assists in proving invariants for stateful types, ensuring state transitions within recursive functions maintain correctness.

Yes, understanding well-founded recursion is a prerequisite. This Skill requires existing Lean 4 proof capabilities and knowledge of well-founded recursion to effectively automate proof verification for complex recursive operations.

Lean 4 recursive proofs often fail on larger inputs due to missing fuel independence. This Skill analyzes your proof to verify fuel independence, ensuring the recursive function terminates and remains correct independent of input size.

Automated proof verification handles complex stateful operations better by systematically checking fuel independence and loop invariants. This approach reduces manual effort and ensures proof correctness across varying input scales compared to manual lemma construction.