Correctness of nonreachability certificates

Lax733996.Nonreachability · concepts/Lax733996/Nonreachability.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

    A valid sequence of counts and a final census omitting the target exist exactly when the target is unreachable from the source.

    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 nonreachability certificates
    6type: lemma
    7---
    8A valid sequence of counts and a final census omitting the target exist
    9exactly when the target is unreachable from the source.
    10-/
    11
    12namespace Lax733996.Nonreachability
    13
    14open Lax733996.Reachability Counting
    15
    16axiom correct {N : ℕ} (G : Graph N) (a b : Fin N) :
    17 NonreachCertificate G a b ↔ ¬ Reachable G a b
    18
    19end Lax733996.Nonreachability
    20
    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…