Correctness of vertex classification

Lax733996.Classification · concepts/Lax733996/Classification.lean · lax-733996

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    3 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    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

    1import Lax733996.Counting
    2
    3/-!
    4---
    5title: Correctness of vertex classification
    6type: lemma
    7---
    8With the correct current count, a vertex has a valid positive or negative
    9classification exactly according to its membership in the next layer.
    10-/
    11
    12namespace Lax733996.Classification
    13
    14open Lax733996.Reachability Counting
    15
    16axiom 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
    20end Lax733996.Classification
    21
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…