Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of bounded rational feasible-point recovery

Proved
Lax109476Proofs.RamRecoverFeasibleSystem.recover_spec

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

algorithmscomputational-complexitylinear-programming

Let P=(A,b,c)P=(A,b,c)P=(A,b,c) be an integer program with mmm constraints and nnn variables whose rational constraint system has a feasible point. Let m+n≤Sm+n\le Sm+n≤S, assume the entries of A,bA,bA,b have absolute value at most 22S2^{2S}22S, and let the word width www meet the published recovery-width bound. Let the allocated reconstruction stack length NNN be at least the reconstruction-depth bound for the recovery precision, plus one.

From the encoded recovery input, the command produces a vector z∈Qn+mz\in\mathbb Q^{n+m}z∈Qn+m and a complete persistent recovery state such that

P is feasible at (z0,…,zn−1),height⁡(zj)≤κ(m,n,22S)(0≤j<n+m).P\text{ is feasible at }(z_0,\ldots,z_{n-1}),\qquad \operatorname{height}(z_j)\le\kappa(m,n,2^{2S})\quad(0\le j<n+m).P is feasible at (z0​,…,zn−1​),height(zj​)≤κ(m,n,22S)(0≤j<n+m).

Here κ\kappaκ is the published integer-certificate coordinate bound, and height bounds numerator magnitude and positive denominator. The execution uses at most the explicit recovery instruction bound for (m,n,S)(m,n,S)(m,n,S). All allocated array and stack conditions are retained in the input predicate. This result recovers an actual bounded rational witness rather than only a feasibility decision.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeCertificateInterfaces
Formal statement
theorem Lax109476Proofs.RamRecoverFeasibleSystem.recover_spec : ∀ (m n S N w : ℕ) (P : Lax109476.LinearProgram.Program ℤ m n),
  m + n ≤ S →
    Lax109476Proofs.RamRecoverFeasibleSystem.wordWidth m n S ≤ w →
      Lax109476Proofs.RamRationalReconstruction.depthBound (Lax109476Proofs.RamRecoverFeasibleSystem.recoveryBits S) +
            1 ≤
          N →
        (∀ (i : Fin m) (j : Fin n), (P.A i j).natAbs ≤ 2 ^ (2 * S)) →
          (∀ (i : Fin m), (P.b i).natAbs ≤ 2 ^ (2 * S)) →
            (∃ (x : Fin n → ℚ),
                Lax109476.LinearProgram.PrimalFeasible (Lax109476Proofs.IntegerEncoding.rationalProgram P) x) →
              Lax808846Proofs.Reasoning.Spec (2 ^ w) (Lax109476Proofs.RamRecoverFeasibleSystem.Input P S N)
                Lax109476Proofs.RamRecoverFeasibleSystem.recover
                (fun (x τ : Lax808846Proofs.Imp.Env) =>
                  ∃ (z : Fin (n + m) → ℚ),
                    Lax109476Proofs.RamRecoveryThreshold.Persistent
                        (Lax109476Proofs.RamStandardPointRecovery.program
                          (Lax109476Proofs.IntegerPointRecovery.slackMatrix P) P.b)
                        z (n + m) τ ∧
                      (Lax109476.LinearProgram.PrimalFeasible (Lax109476Proofs.IntegerEncoding.rationalProgram P)
                          fun (j : Fin n) => z (Fin.castAdd m j)) ∧
                        ∀ (j : Fin (n + m)),
                          Lax109476Proofs.RationalArithmeticBounds.Height (z j)
                            (Lax109476Proofs.IntegerCertificates.coordinateCap m n (2 ^ (2 * S))))
                (Lax109476Proofs.RamRecoverFeasibleSystem.instructionBound m n S) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamRecoverFeasibleSystem.lean, theorem recover_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