Proof of `Stable factorization with recurrent vertices`
groundedproofs/Lax369799Proofs/SemigroupFactorization.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
Adjoin an identity to use monoid factorization. Its nonempty blocks lie in the original semigroup. Thin the cuts to a recurrent vertex; stability and idempotence are preserved when consecutive blocks are grouped.