Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of stored rational feasibility decisions

Proved
Lax109476Proofs.RamCertificateDecision.decideFeasible_spec

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

algorithmscomputational-complexitylinear-programming

Let FFF be an integer linear system with rrr rows and sss columns. Let SSS bound these dimensions and let 22S2^{2S}22S bound its coefficient magnitudes. The feasibility command uses word width www, a source array prefix and a disjoint target prefix. Assume the stated decision-width bound and that the source system is encoded correctly. Then the command preserves the source representation and source-data predicate, and writes a Boolean feasibility decision at the target:

decision⁡(F)=feasibleSystem⁡(F).\operatorname{decision}(F)=\operatorname{feasibleSystem}(F).decision(F)=feasibleSystem(F).

Its operational running time is at most the explicit decision-cost function of SSS. Array-prefix disjointness and all required word-range conditions are hypotheses. This result supplies the actual feasibility subroutine used when selecting optimality, infeasibility or unboundedness certificates.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeOperationalInterfaces
Formal statement
theorem Lax109476Proofs.RamCertificateDecision.decideFeasible_spec : ∀ (r s S w : ℕ) (F : Lax109476.LinearProgram.Program ℤ r s) (source target : String),
  2 ^ (2 * S) < 2 ^ w →
    r * s + r + s + 4 < 2 ^ w →
      Lax109476Proofs.RamStoredFeasibility.wordWidth (Lax109476Proofs.RamCertificateDecision.sizeBound r s S) ≤ w →
        (∀ (i : Fin r) (j : Fin s), (F.A i j).natAbs ≤ 2 ^ (2 * S)) →
          (∀ (i : Fin r), (F.b i).natAbs ≤ 2 ^ (2 * S)) →
            (∀ (j : Fin s), F.c j = 0) →
              Lax109476Proofs.RamCopy.Disjoint (source ++ "system.A") (target ++ "lp.A") →
                Lax109476Proofs.RamCopy.Disjoint (source ++ "system.b") (target ++ "lp.A") →
                  Lax109476Proofs.RamCopy.Disjoint (source ++ "system.b") (target ++ "lp.b") →
                    (∀ t ∈ Lax109476Proofs.RamCopy.suffixes,
                        source ++ ("system.A" ++ t) ∉
                          (Lax109476Proofs.RamCertificateDecision.decideFeasible source target).warrs) →
                      (∀ t ∈ Lax109476Proofs.RamCopy.suffixes,
                          source ++ ("system.b" ++ t) ∉
                            (Lax109476Proofs.RamCertificateDecision.decideFeasible source target).warrs) →
                        Lax808846Proofs.Reasoning.Spec (2 ^ w)
                          (Lax109476Proofs.RamCertificateDecision.Input F source target)
                          (Lax109476Proofs.RamCertificateDecision.decideFeasible source target)
                          (fun (x τ : Lax808846Proofs.Imp.Env) =>
                            Lax109476Proofs.RamEquationData.Data F
                                (Lax109476Proofs.RamCertificateDecision.prefixedView source τ) ∧
                              Lax808846Proofs.Imp.Cond.evalB (2 ^ w) Lax109476Proofs.RamBisectionCommit.condition τ =
                                Option.some
                                  (Lax109476Proofs.RationalFeasibilityDecision.feasible
                                    (Lax109476Proofs.IntegerEncoding.rationalProgram F)))
                          (Lax109476Proofs.RamCertificateDecision.instructionBound r s S) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamCertificateDecision.lean, theorem decideFeasible_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