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

Proof of `Small finite models for modal parity acceptance`

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

Merge the input vertices at each word state, transferring the winning strategy by alternating simulation. A positional strategy selects one local transition per winning word state. Keep its required successors and restrict to reachable states; a second simulation proves acceptance.