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

Proof of `The algebraic condition on infinite branch words` (1st statement)

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

Thin the factorization to a recurrent graph vertex. Nonempty monoid products are still unary values, so thinning preserves the original accepting linked pair.