Correctness of nonreachability certificates
Lax733996.Nonreachability · concepts/Lax733996/Nonreachability.lean · lax-733996
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
A valid sequence of counts and a final census omitting the target exist exactly when the target is unreachable from the source.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
In the paper
- page 2 of this submission's paper
Lean source view on GitHub
| 1 | import Lax733996.Counting |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Correctness of nonreachability certificates |
| 6 | type: lemma |
| 7 | --- |
| 8 | A valid sequence of counts and a final census omitting the target exist |
| 9 | exactly when the target is unreachable from the source. |
| 10 | -/ |
| 11 | |
| 12 | namespace Lax733996.Nonreachability |
| 13 | |
| 14 | open Lax733996.Reachability Counting |
| 15 | |
| 16 | axiom correct {N : ℕ} (G : Graph N) (a b : Fin N) : |
| 17 | NonreachCertificate G a b ↔ ¬ Reachable G a b |
| 18 | |
| 19 | end Lax733996.Nonreachability |
| 20 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments