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

Proof of `Stable factorization of algebraic branch words`

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

Equip the unary sort with its checked associative composition. Apply the finite semigroup factorization while recording the graph vertex at each cut.