Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of exact feasibility for a stored rational program

Proved
Lax109476Proofs.RamStoredFeasibility.decideFeasible_condition_spec

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

algorithmscomputational-complexitylinear-programming

Let PPP be a rational linear program with mmm constraints and nnn variables, and write LLL for the binary length of its published encoding. Let www be at least the prescribed stored-feasibility word-width function at LLL. Starting from the stored-program input and allocated workspace, the deterministic feasibility command returns a condition with exactly the mathematical feasibility value:

eval⁡2w(search.found=1)=some⁡(feasible⁡(P)).\operatorname{eval}_{2^w}(\text{search.found}=1)=\operatorname{some}(\operatorname{feasible}(P)).eval2w​(search.found=1)=some(feasible(P)).

The actual execution is bounded by the published instruction-bound function at LLL. The feasibility predicate concerns the constraints of PPP, without any assumption on its objective coefficients. This is the reusable operational interface used by the certificate-system decision routine.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeCertificateInterfaces
Formal statement
theorem Lax109476Proofs.RamStoredFeasibility.decideFeasible_condition_spec : ∀ (m n : ℕ) (P : Lax109476.LinearProgram.Program ℚ m n) (w : ℕ),
  Lax109476Proofs.RamStoredFeasibility.wordWidth
        (Lax759944.BinaryWordEncoding.bitSize (Lax109476.RationalEncoding.encodeProgram P)) ≤
      w →
    Lax808846Proofs.Reasoning.Spec (2 ^ w) (Lax109476Proofs.RamStoredFeasibility.Input P)
      Lax109476Proofs.RamStoredFeasibility.decideFeasible
      (fun (x τ : Lax808846Proofs.Imp.Env) =>
        Lax808846Proofs.Imp.Cond.evalB (2 ^ w)
            (Lax808846Proofs.Imp.Cond.eq (Lax808846Proofs.Imp.Expr.var "search.found") (Lax808846Proofs.Imp.Expr.lit 1))
            τ =
          Option.some (Lax109476Proofs.RationalFeasibilityDecision.feasible P))
      (Lax109476Proofs.RamStoredFeasibility.instructionBound
        (Lax759944.BinaryWordEncoding.bitSize (Lax109476.RationalEncoding.encodeProgram P))) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamStoredFeasibility.lean, theorem decideFeasible_condition_spec

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