A native rational projection oracle from one selected LP solver
ProvedLax263307Proofs.NativeSelectedLP.exists_programalgorithmscomputational-complexitygraph-theory
Every exact polynomial-time word-RAM LP solver admits a fixed native projection-oracle implementation with polynomial resource bounds:
The program uses the same selected LP backend for its width guarantee and actual invocation; it retains the encoded query and classifies the exact certificate.
Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax263307Proofs.NativeSelectedLP.exists_program : ∀ (f : List ℕ → List ℕ),
Lax759944.RamPolytime.RamPolytime f →
Lax263307Proofs.NativeEncodedLP.Encoded f → Nonempty (Lax263307Proofs.NativeSelectedLP.Program f) := by sorrySource