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

Proof of `Polynomial-time certified optimization`

groundedproofs/Lax109476Proofs/Optimization.lean · lax-109476

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

Keep the exact solver's program, runtime bound, and returned certificate. Apply certificate soundness to that same certificate. The solver theorem is the algorithmic assumption; soundness supplies the real outcome guarantee.