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

Proof of `Properness does not imply simplicity`

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

Description

Let the single undirected edge between 0 and 1 appear at times 0 and 1. Each snapshot contains just that edge, so the graph is proper. Its two labels violate simplicity. In the directed interpretation, every two-step traversal returns to its starting vertex, so properness also holds there.