Correctness of the total exact rational feasibility decision
ProvedLax109476Proofs.RationalFeasibilityDecision.feasible_correct_nativealgorithmscomputational-complexitygraph-theory
For every rational linear program , including zero-dimensional and infeasible systems, the source's total computable rational ellipsoid decision satisfies
The decision clears rational denominators and uses padded integer feasibility; there is no dimension or feasibility promise. This semantic theorem connects the Boolean used by native recovery queries to real feasibility.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeBlockInterfaces namespace Lax109476Proofs.RationalFeasibilityDecision end Lax109476Proofs.RationalFeasibilityDecision
Formal statement
theorem Lax109476Proofs.RationalFeasibilityDecision.feasible_correct_native : ∀ {m n : Nat} (P : Lax109476.LinearProgram.Program Rat m n),
Iff (@Eq Bool (@Lax109476Proofs.RationalFeasibilityDecision.feasible m n P) Bool.true)
(@Lax109476.LinearProgram.IsFeasible m n (@Lax109476.RationalCertificates.toReal m n P)) := by sorrySource