Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Initialize and recover the lexicographically least rational feasible point

Proved
Lax109476Proofs.RamPointInitialization.recover_spec_native

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

algorithmscomputational-complexitygraph-theory

Let PPP be a rational linear program with mmm rows and nnn variables, zero objective, and a rational feasible vector xxx. Assume each coordinate of xxx is minimal among feasible real vectors agreeing on all earlier coordinates. Suppose coefficient and solution heights are at most 2S2^S2S, each coordinate and denominator is at most DDD, and the published bounds on DDD, reconstruction depth, stack length NNN and word width www hold. From the stored system, workspace and zero-initializable point buffer, the fixed recovery command stores all coordinates exactly:

xstored=x.x_{\rm stored}=x.xstored​=x.

It retains the bound DDD and stack length NNN, with instruction bound 33n+22+Trecovery(m,n,S,C)33n+22+T_{\rm recovery}(m,n,S,C)33n+22+Trecovery​(m,n,S,C). This initializes the complete coordinate-recovery execution used by exact certificate construction.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativePhaseInterfaces
namespace Lax109476Proofs.RamPointInitialization
end Lax109476Proofs.RamPointInitialization
Formal statement
theorem Lax109476Proofs.RamPointInitialization.recover_spec_native : ∀ (m n S C N D w : Nat) (P : Lax109476.LinearProgram.Program Rat m n) (x : Fin n → Rat),
  @LE.le Nat instLENat D.size C →
    @LE.le Nat instLENat
        (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
          (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))
            C)
          (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))))
        S →
      @LE.le Nat instLENat
          (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (Lax109476Proofs.RamRationalReconstruction.depthBound S)
            (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
          N →
        @LE.le Nat instLENat (Lax109476Proofs.RamPointRecoveryBounds.wordWidth m n S) w →
          (∀ (i : Fin m) (j : Fin n),
              Lax109476Proofs.RationalArithmeticBounds.Height (@Lax109476.LinearProgram.Program.A Rat m n P i j)
                (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                  (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) S)) →
            (∀ (i : Fin m),
                Lax109476Proofs.RationalArithmeticBounds.Height (@Lax109476.LinearProgram.Program.b Rat m n P i)
                  (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                    (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) S)) →
              (∀ (j : Fin n),
                  Lax109476Proofs.RationalArithmeticBounds.Height (x j)
                    (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                      (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) S)) →
                (∀ (j : Fin n),
                    @Eq Rat (@Lax109476.LinearProgram.Program.c Rat m n P j)
                      (@OfNat.ofNat Rat (nat_lit 0) (@Rat.instOfNat (nat_lit 0)))) →
                  @Lax109476.LinearProgram.PrimalFeasible Real Real.instRing Real.partialOrder m n
                      (@Lax109476.RationalCertificates.toReal m n P) (@Lax109476.RationalCertificates.realVector n x) →
                    (∀ (i : Fin n) (y : Fin n → Real),
                        @Lax109476.LinearProgram.PrimalFeasible Real Real.instRing Real.partialOrder m n
                            (@Lax109476.RationalCertificates.toReal m n P) y →
                          (∀ (j : Fin n),
                              @LT.lt (Fin n) (@instLTFin n) j i →
                                @Eq Real (y j) (@Rat.cast Real Real.instRatCast (x j))) →
                            @LE.le Real Real.instLE (@Rat.cast Real Real.instRatCast (x i)) (y i)) →
                      (∀ (j : Fin n),
                          And (@LE.le Rat Rat.instLE (x j) (@Nat.cast Rat Rat.instNatCast D))
                            (@LE.le Nat instLENat (x j).den D)) →
                        Lax808846Proofs.Reasoning.Spec
                          (@HPow.hPow Nat Nat Nat
                            (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                            (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
                          (fun (σ : Lax808846Proofs.Imp.Env) =>
                            And (@Lax109476Proofs.RamPointInitialization.Base m n P σ)
                              (And (Lax109476Proofs.RamRecoveryThreshold.Workspace m n σ)
                                (And (Lax109476Proofs.RamEllipsoidStep.Extents "point.x" n σ)
                                  (And (@Eq Nat (σ.vars "minimum.bound") D)
                                    (@Eq Nat (@List.length Nat (σ.arrs "cf.stack")) N)))))
                          Lax109476Proofs.RamPointInitialization.recover
                          (fun (x_1 τ : Lax808846Proofs.Imp.Env) =>
                            And (@Lax109476Proofs.RamRecoveryThreshold.Persistent m n P x n τ)
                              (And (@Eq Nat (τ.vars "minimum.bound") D)
                                (@Eq Nat (@List.length Nat (τ.arrs "cf.stack")) N)))
                          (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                            (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                              (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                                (@OfNat.ofNat Nat (nat_lit 33) (instOfNatNat (nat_lit 33))) n)
                              (@OfNat.ofNat Nat (nat_lit 22) (instOfNatNat (nat_lit 22))))
                            (Lax109476Proofs.RamPointRecoveryBounds.instructionBound m n S C)) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamPointInitialization.lean, theorem Lax109476Proofs.RamPointInitialization.recover_spec, line 47

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