While this submission is a draft, it cannot be used by other submissions.

Proper graphs have the same reachability graph in both modes

Lax330177.ProperReachGraphs · concepts/Lax330177/ProperReachGraphs.lean · lax-330177

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

    On a proper temporal graph, strict and nonstrict traversal yield the same static reachability graph on the original vertices.

    Read the proof.

    Concept map
    5 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax330177.ReachabilityGraph
    2
    3/-!
    4---
    5title: Proper graphs have the same reachability graph in both modes
    6type: lemma
    7---
    8On a proper temporal graph, strict and nonstrict traversal yield the same static
    9reachability graph on the original vertices.
    10
    11[Read the proof.](Lax330177Proofs.Observations.proper_graphs.html)
    12-/
    13namespace Lax330177.ProperReachGraphs
    14open Lax330177.Representations Lax330177.Settings Lax330177.ReachabilityGraph
    15
    16axiom proper_graphs {n : ℕ} (G : Graph n) (d : Direction) (h : IsProper d G) :
    17 reachabilityGraph G .strict = reachabilityGraph G .nonstrict
    18
    19end Lax330177.ProperReachGraphs
    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…