Proof of `Reachability can be asymmetric even on a happy graph`
groundedproofs/Lax330177Proofs/Basic.lean · lax-330177
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Give the undirected edge 1–2 time 0 and the edge 0–1 time 1. Each edge has one label and each snapshot contains just one edge, so the graph is happy. From 2 to 0 the chain uses times 0 then 1, valid in both modes. From 0 to 2 the only possible path requires those times in decreasing order.