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

Proof of `Idempotent factorization of infinite words`

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

Color each increasing pair by its interval product and its left prefix product. Ramsey homogeneity fixes both. Concatenating two homogeneous intervals proves idempotence, and appending one to a prefix proves stability.