Induction

You will learn

Why bounded is not a proof, and how induction closes the gap -- or reports it cannot.

Bounded means bounded: k cycles checked is all k proves. To close the gap you need induction -- assume the invariant held up to cycle k, show it holds at k+1 -- and induction is honest in a way BMC is not: it can fail, and a failed induction is a finding, not an embarrassment. The widget is what an un-discharged obligation looks like when nobody looks: 12 Lean files, 15,553 lines and 4 sorry, reached by no build root -- nothing compiles them, so the proofs they contain have never been checked. An obligation no root reaches is not discharged; it is parked.

Open the interactive lesson →