Proof of `Soundness of infeasibility certificates`
groundedproofs/Lax109476Proofs/Basic.lean · lax-109476
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
A feasible point and a Farkas certificate would give a nonnegative bilinear sum bounded above by a strictly negative number. This proves soundness directly, without assuming Farkas certificate existence.