Correctness of vertex classification
Lax733996.Classification · concepts/Lax733996/Classification.lean · lax-733996
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
With the correct current count, a vertex has a valid positive or negative classification exactly according to its membership in the next layer.
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 vertex classification |
| 6 | type: lemma |
| 7 | --- |
| 8 | With the correct current count, a vertex has a valid positive or negative |
| 9 | classification exactly according to its membership in the next layer. |
| 10 | -/ |
| 11 | |
| 12 | namespace Lax733996.Classification |
| 13 | |
| 14 | open Lax733996.Reachability Counting |
| 15 | |
| 16 | axiom correct {N : ℕ} (G : Graph N) (a v : Fin N) (k : ℕ) (b : Bool) : |
| 17 | Classify G a k (layer G a k).card v b ↔ |
| 18 | (b = true ↔ v ∈ layer G a (k + 1)) |
| 19 | |
| 20 | end Lax733996.Classification |
| 21 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments