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

Proof of `Testing infinite runs on finite branch graphs` (1st statement)

groundedproofs/Lax369799Proofs/RegularBranchWords.lean · lax-369799

What this proof establishes

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

A finite functional graph has an ultimately periodic orbit. The branch's vertices and directions are functions of that orbit.