Lax Lean Archive

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

Proof of `Per-Client Fairness Parameters Reduce to a Uniform One` (3rd statement)

groundedproofs/Lax117284Proofs/WordCorrect.lean · lax-117284

What this proof establishes

lem✓Lax117284.Lemma15 (3rd statement)

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 word whose parameters do not exceed its number of days is sent to the code of the constructed instance with the parameter mm, and the construction preserves the answer; every other word goes to the rejected word, which is in no language, and is in no per-client language of parameters below the days either.