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

Proof of `Recurring priorities in finite-state runs` (3rd statement)

groundedproofs/Lax369799Proofs/WordParity.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.

Read the Lean proof on GitHub

Description

Discard the finitely many occurrences of smaller priorities. Among the infinitely many occurrences of the least recurring priority, some state recurs infinitely often. Choose two occurrences after the given bound.