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

Proof of `Recurring priorities in finite-state runs` (1st 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

The parity condition is exactly evenness of the unique least recurring priority of the word automaton's run.