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

Proof of `Word acceptance and evaluation of algebraic runs` (5th statement)

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

Finite branch observations have accepted values. For a regular infinite branch restrict to its reachable orbit, apply graph evaluation, and use the periodic branch test to obtain acceptance on all infinite branches.