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

Proof of `The consistency graph as an approximation input` (1st statement)

groundedproofs/Lax253009Proofs/EncodedReduction.lean · lax-253009

What this proof establishes

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

On low-optimum instances the estimator is at most a. On high-optimum instances an output at most a would contradict the strict multiplicative gap.