Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Proof of `Deciding finite reachability`

groundedproofs/Lax307052Proofs/Reachability.lean · lax-307052

What this proof establishes

lem✓Lax307052.FiniteSearch

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The recursion covers every simple path because N≤2⌈log⁡2N⌉N\leq 2^{\lceil\log_2 N\rceil}.