Proof of `Evaluation of finite unary branch graphs` (1st statement)
groundedproofs/Lax369799Proofs/UnaryGraphEvaluation.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.
Description
Stable semigroup factorization yields an accepting linked pair from graph evaluation. Conversely, thin an accepting factorization to a recurrent vertex and fold its prefix and loop back to the graph.