Proof of `Recurrent cuts in a linked-pair factorization`
groundedproofs/Lax369799Proofs/LinkedPairFactorizations.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
Absorb earlier blocks into each prefix, combine blocks by idempotence, and thin to a recurrent vertex using the infinite pigeonhole principle.