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

Reachability can be asymmetric even on a happy graph

Lax330177.HappyAsymmetry · concepts/Lax330177/HappyAsymmetry.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

    The undirected chain with edge 1–2 at time 0 and edge 0–1 at time 1 is simple and proper. In both modes, 2 reaches 0 while 0 cannot reach 2.

    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.Examples
    2
    3/-!
    4---
    5title: Reachability can be asymmetric even on a happy graph
    6type: lemma
    7---
    8The undirected chain with edge 1–2 at time 0 and edge 0–1 at time 1 is simple and proper. In both modes, 2 reaches 0 while 0 cannot reach 2.
    9
    10[Read the proof.](Lax330177Proofs.Basic.happy_asymmetry.html)
    11-/
    12namespace Lax330177.HappyAsymmetry
    13open Lax330177.Representations
    14open Lax330177.Settings
    15open Lax330177.Paths
    16open Lax330177.Examples
    17
    18axiom happy_asymmetry (m : TraversalMode) : IsHappy .undirected backwardsChain ∧ Reaches backwardsChain m 2 0 ∧ ¬ Reaches backwardsChain m 0 2
    19end Lax330177.HappyAsymmetry
    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…