Proof of `Ultimately periodic witnesses in finite parity graphs` (2nd statement)
groundedproofs/Lax369799Proofs/PeriodicPaths.lean · lax-369799
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
Choose two equal states of least recurring priority after all lower priorities have disappeared. Retain the prefix and repeat the intervening nonempty segment. Its minimum priority recurs and no lower one recurs.