Real feasibility of rational linear programs has a rational witness
Lax109476.RationalFeasibility · concepts/Lax109476/RationalFeasibility.lean · lax-109476
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A finite linear system with rational coefficients has a nonnegative real feasible point if and only if it has a nonnegative rational feasible point. The direction requiring a rational witness follows from elimination over the rationals and the soundness of rational infeasibility certificates over the reals.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax109476.RationalCertificates |
| 2 | import Lax109476.FarkasSoundness |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Real feasibility of rational linear programs has a rational witness |
| 7 | type: theorem |
| 8 | --- |
| 9 | A finite linear system with rational coefficients has a nonnegative real |
| 10 | feasible point if and only if it has a nonnegative rational feasible point. |
| 11 | The direction requiring a rational witness follows from elimination over |
| 12 | the rationals and the soundness of rational infeasibility certificates over |
| 13 | the reals. |
| 14 | |
| 15 | # Formalization notes |
| 16 | |
| 17 | The statement imposes no full-dimension or interior-point condition. It |
| 18 | does not bound the size of the rational point or the time needed to find it. |
| 19 | -/ |
| 20 | |
| 21 | namespace Lax109476.RationalFeasibility |
| 22 | |
| 23 | open Lax109476.LinearProgram Lax109476.RationalCertificates |
| 24 | |
| 25 | /-- Real feasibility of rational coefficient data has an exact rational witness. -/ |
| 26 | axiom exists_rational_feasible_point : |
| 27 | ∀ (m n : ℕ) (P : Program ℚ m n), IsFeasible (toReal P) → |
| 28 | ∃ x : Fin n → ℚ, PrimalFeasible P x |
| 29 | |
| 30 | end Lax109476.RationalFeasibility |
| 31 |
Formalization notes
The statement imposes no full-dimension or interior-point condition. It does not bound the size of the rational point or the time needed to find it.
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments