π€ AI Summary
The formal foundations of linear optimization duality theory remain underdeveloped, particularly regarding rigorous, machine-checkable verification.
Method: We develop a sound and extensible, machine-verifiable framework in Lean 4, leveraging dependent types and algebraic structure modeling to formalize Farkasβ lemma and its variants over general ordered fields. Crucially, we extend duality theory to generalized linear inequality systems with coefficients in the extended reals (including Β±β), rigorously constructing the extended real number system and its order structure.
Contributions: (1) The first complete, machine-checked formalization in Lean 4 of multiple Farkas-type theorems, together with precise necessary and sufficient conditions over arbitrary ordered fields; (2) The first mathematical modeling and formal verification of duality theory accommodating infinite coefficients; (3) A foundational, highly reliable basis for verifying optimization algorithms and building trustworthy mathematical libraries.
π Abstract
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take ``infinite values''.