Lax Lean Archive

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

Proof of `The finite randomized PCP-to-clique transfer` (2nd statement)

groundedproofs/Lax253009Proofs/RandomizedReduction.lean · lax-253009

What this proof establishes

thm✓Lax253009.RandomizedReduction (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

The expected sampled acceptance count is m+2. The multiplicative tail bound applies simultaneously to all 2^m possible proofs.