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

Proof of `Proper graphs have the same reachability graph in both modes`

groundedproofs/Lax330177Proofs/Observations.lean · lax-330177

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Both graphs omit diagonal arcs. For distinct vertices, their adjacency agrees because strict and nonstrict paths give the same reachability on a proper graph.