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

Proof of `Evaluation of finite unary branch graphs` (2nd statement)

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

Expand the prefix and loop values into their word chains. Their flattening covers the original graph; reachability makes the covering map globally surjective. Associativity evaluates the two chains before the lasso.