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

Proof of `Periodic branch test for unfold-automata`

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

Take the product of vertices, chosen directions, and word-automaton states. Its transition relation preserves system edges and updates the word state. A periodic witness in this finite product projects to a periodic branch with the same least recurring priority.