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

Proof of `Regular infinite products of linked pairs`

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

A Büchi automaton guesses a linked pair, accumulates the prefix and successive block products, and marks every reset. Infinitely many resets give a factorization; a factorization supplies an accepting run. Safra determinization and appearance records then give a parity condition.