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

Proof of `Realizing winning clone-automaton strategies`

groundedproofs/Lax369799Proofs/CloneGameRun.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 finite strategy graph records the word state and input vertex. Uniform duplication realizes each marking while covering all input successors. Trimming preserves the run and the bisimulation projection. Finite branches use final states; infinite branches follow the winning strategy and therefore satisfy the word parity condition.