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

Proof of `The algebraic condition on infinite branch words` (2nd 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

Adjoin an identity to the finite unary semigroup. Nonempty interval products still lie in the unary sort, so the linked-pair omega language is exactly the language recognized by the finite-monoid construction.