Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One exact polynomial-time RAM solver for rational linear programming

Proved
Lax109476Proofs.RamUniformSolver.exists_exact_polynomial_time_solver

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmscomputational-complexitygraph-theory

There is one word-RAM algorithm fff, with polynomial bit-size resource bounds, that returns a valid exact certificate for every finite rational linear program:

f(encode⁡(P))=encode⁡(KP).f(\operatorname{encode}(P))=\operatorname{encode}(\mathcal K_P).f(encode(P))=encode(KP​).

The certificate describes an optimum, infeasibility or unboundedness. The algorithm also has bounded execution on arbitrary input words.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax109476Proofs.RamUniformSolver.exists_exact_polynomial_time_solver : ∃ (solve : List ℕ → List ℕ),
  Lax759944.RamPolytime.RamPolytime solve ∧
    ∀ (m n : ℕ) (P : Lax109476.LinearProgram.Program ℚ m n),
      ∃ (certificate : Lax109476.RationalCertificates.Certificate m n),
        solve (Lax109476.RationalEncoding.encodeProgram P) = Lax109476.RationalEncoding.encodeCertificate certificate ∧
          Lax109476.RationalCertificates.IsValidCertificate P certificate := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamUniformSolver.lean, theorem exists_exact_polynomial_time_solver

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me