The feasibility alternative
Lax109476.FarkasAlternative · concepts/Lax109476/FarkasAlternative.lean · lax-109476
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A real system , is infeasible if and only if there is a vector with and .
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax109476.FarkasCertificate |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The feasibility alternative |
| 6 | type: theorem |
| 7 | --- |
| 8 | A real system , is infeasible if and only if there is a |
| 9 | vector with and . |
| 10 | |
| 11 | # Formalization notes |
| 12 | |
| 13 | This packages the existence and soundness directions as an equivalence. |
| 14 | Its proof assumes Farkas' lemma and the separately proved soundness of |
| 15 | infeasibility certificates. |
| 16 | -/ |
| 17 | |
| 18 | namespace Lax109476.FarkasAlternative |
| 19 | |
| 20 | open Lax109476.LinearProgram Lax109476.FarkasCertificate |
| 21 | |
| 22 | /-- Infeasibility is equivalent to the existence of separating row multipliers. -/ |
| 23 | axiom infeasible_iff_certificate : |
| 24 | ∀ (m n : ℕ) (P : Program ℝ m n), |
| 25 | ¬ IsFeasible P ↔ ∃ y : Fin m → ℝ, IsInfeasibilityCertificate P y |
| 26 | |
| 27 | end Lax109476.FarkasAlternative |
| 28 |
Formalization notes
This packages the existence and soundness directions as an equivalence. Its proof assumes Farkas' lemma and the separately proved soundness of infeasibility certificates.
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments