Soundness of exact rational LP certificates
Lax109476.CertificateSoundness · concepts/Lax109476/CertificateSoundness.lean · lax-109476
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Every valid rational certificate establishes its claimed outcome for the linear program over real variables. Matching primal and dual objectives certify optimality, Farkas multipliers certify infeasibility, and a feasible point with an improving recession direction certifies unboundedness.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax109476.RationalCertificates |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Soundness of exact rational LP certificates |
| 6 | type: theorem |
| 7 | --- |
| 8 | Every valid rational certificate establishes its claimed outcome for the |
| 9 | linear program over real variables. Matching primal and dual objectives |
| 10 | certify optimality, Farkas multipliers certify infeasibility, and a feasible |
| 11 | point with an improving recession direction certifies unboundedness. |
| 12 | |
| 13 | # Formalization notes |
| 14 | |
| 15 | Rational arithmetic is transferred exactly to the real interpretation. |
| 16 | Optimality uses weak duality; infeasibility uses certificate soundness; |
| 17 | unboundedness follows by taking arbitrarily large nonnegative multiples |
| 18 | of the certified recession direction. No solver or certificate-existence |
| 19 | theorem is needed to check a supplied certificate. |
| 20 | -/ |
| 21 | |
| 22 | namespace Lax109476.CertificateSoundness |
| 23 | |
| 24 | open Lax109476.LinearProgram Lax109476.RationalCertificates |
| 25 | |
| 26 | /-- Exact rational certificate checks imply the asserted real LP outcome. -/ |
| 27 | axiom valid_certificate_correct : |
| 28 | ∀ (m n : ℕ) (P : Program ℚ m n) (certificate : Certificate m n), |
| 29 | IsValidCertificate P certificate → IsCorrectOutcome P certificate |
| 30 | |
| 31 | end Lax109476.CertificateSoundness |
| 32 |
Formalization notes
Rational arithmetic is transferred exactly to the real interpretation. Optimality uses weak duality; infeasibility uses certificate soundness; unboundedness follows by taking arbitrarily large nonnegative multiples of the certified recession direction. No solver or certificate-existence theorem is needed to check a supplied certificate.
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments