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

Proof of `A proper graph can have a walk with equal departure times`

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.

Read the Lean proof on GitHub

In the paper

  • page 2 of this submission's paper

Description

Use a graph on two vertices with one undirected edge. It is proper because there is no second edge incident to either endpoint. A walk can cross that edge and immediately cross it back at the same timestamp. Its two equal departure times satisfy the nonstrict rule and violate the strict rule.