Proof of `Exact polynomial-time linear programming on a word RAM`
groundedproofs/Lax109476Proofs/RamUniformSolver.lean · lax-109476
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
One fixed structured command decodes arbitrary input, selects a feasible certificate system using exact ellipsoid decisions, recovers a rational point, and writes its certificate. Its polynomial bounds transfer through the registered compiler and word-RAM model.