Lax Lean Archive

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

Proof of `From FAF acceptance to two-prover success` (2nd statement)

groundedproofs/Lax253009Proofs/FAFStrategyExtraction.lean · lax-253009

What this proof establishes

thm✓Lax253009.FAFStrategyExtraction (2nd 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

Choose every decoding set from the proved CNA soundness theorem with epsilon one, then instantiate the finite extraction theorem. The thresholds are independent of all tables, reference answers, projections and constraints.