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

Proof of `Explicit state and priority bounds for word determinization`

groundedproofs/Lax369799Proofs/QuantitativeDeterminization.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 bounded Safra position is encoded by a padded vector of optional slots. Labels and marks then bound the Muller state type explicitly. Appearance records multiply this by the number of rankings, and the parity conversion uses at most twice the Muller-state bound.