Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded native selection of a linear-programming certificate

Proved
Lax109476Proofs.RamSolverChooseCertificate.choose_spec

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

algorithmscomputational-complexitygraph-theory

Let PPP be an integer linear program with m+n≤Lm+n\le Lm+n≤L and coefficient magnitudes bounded by the prescribed power of two. Suppose the saved input, certificate workspace and reconstruction stack satisfy their initialization predicates, with word width and stack depth at least the stated uniform bounds. The fixed certificate-selection command terminates within

instructionBound⁡(parameter⁡(L))\operatorname{instructionBound}(\operatorname{parameter}(L))instructionBound(parameter(L))

bounded operational steps and returns a valid rational certificate for PPP. The alternatives cover an optimum, infeasibility and unboundedness.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax109476Proofs.RamSolverChooseCertificate.choose_spec : ∀ (m n L N w : ℕ) (P : Lax109476.LinearProgram.Program ℤ m n),
  m + n ≤ L →
    Lax109476Proofs.RamSolverBranchBounds.wordWidth (Lax109476Proofs.RamCertificateSetup.parameter L) ≤ w →
      Lax109476Proofs.RamRationalReconstruction.depthBound
              (Lax109476Proofs.RamRecoverFeasibleSystem.recoveryBits
                (Lax109476Proofs.RamCertificateSetup.parameter L)) +
            1 ≤
          N →
        (∀ (i : Fin m) (j : Fin n), (P.A i j).natAbs ≤ 2 ^ (2 * Lax109476Proofs.RamCertificateSetup.parameter L)) →
          (∀ (i : Fin m), (P.b i).natAbs ≤ 2 ^ (2 * Lax109476Proofs.RamCertificateSetup.parameter L)) →
            (∀ (j : Fin n), (P.c j).natAbs ≤ 2 ^ (2 * Lax109476Proofs.RamCertificateSetup.parameter L)) →
              Lax808846Proofs.Reasoning.Spec (2 ^ w)
                (fun (σ : Lax808846Proofs.Imp.Env) =>
                  Lax109476Proofs.RamCertificateSource.Data P σ ∧ Lax109476Proofs.RamSolverBranchSpecs.State P L N σ)
                Lax109476Proofs.RamExactSolverProgram.chooseCertificate
                (Lax109476Proofs.RamSolverBranchComposition.Result P)
                (Lax109476Proofs.RamSolverBranchBounds.instructionBound
                  (Lax109476Proofs.RamCertificateSetup.parameter L)) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamSolverChooseCertificate.lean, theorem choose_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