Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact native recovery of a capped standard-form point

Open
Lax109476Proofs.RamStandardPointRecovery.recover_with_cap_spec

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

algorithmscomputational-complexitygraph-theory

Let Cz=bCz=bCz=b be a feasible integer linear system with the specified coefficient-height bound. Assume the stated coordinate cap, precision, reconstruction-depth, word-width and initialized-workspace guards. The actual capped-recovery command returns a rational vector satisfying the equations exactly and retains the complete stored recovery-state predicate and coordinate-height conclusions:

Cz=b.Cz=b.Cz=b.

This is a reusable source interface for composing the complete finite-program implementation.

Retired because the namespace-wrapped declaration compiled during publication but the proof-comparison parser rejects that header (expected token / unknown full theorem identifier). The mathematically identical, fully qualified declaration is Lax109476Proofs.RamStandardPointRecovery.recover_with_cap_spec_native.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
Formal statement
namespace Lax109476Proofs.RamStandardPointRecovery
theorem recover_with_cap_spec : ∀ (m n H S K N w D : Nat) (C : Matrix (Fin m) (Fin n) Int) (b : Fin m → Int),
  (∀ (i : Fin m) (j : Fin n), Nat.le (C i j).natAbs H) →
    (∀ (i : Fin m), Nat.le (b i).natAbs H) →
      Nat.le H
          (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
            ((2:Nat)) S) →
        Nat.le (Lax109476Proofs.LexicographicBounds.coordinateCap m n H) D →
          Nat.le D.size K →
            Nat.le
                (Nat.add
                  (Nat.mul
                    ((4:Nat)) K)
                  ((2:Nat)))
                S →
              Nat.le
                  (Nat.add
                    (Lax109476Proofs.RamRationalReconstruction.depthBound S)
                    ((1:Nat)))
                  N →
                Nat.le
                    (Lax109476Proofs.RamPointRecoveryBounds.wordWidth
                      (Nat.add m m) n S)
                    w →
                  (∃ (x : Fin n → Rat),
                      @Lax109476Proofs.LexicographicSupport.Feasible m n
                        (@Matrix.map (Fin m) (Fin n) Int Rat C fun (z : Int) => @Int.cast Rat Rat.instIntCast z)
                        (fun (i : Fin m) => @Int.cast Rat Rat.instIntCast (b i)) x) →
                    Lax808846Proofs.Reasoning.Spec
                      (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                        ((2:Nat)) w)
                      (fun (σ : Lax808846Proofs.Imp.Env) =>
                        And
                          (@Lax109476Proofs.RamPointInitialization.Base
                            (Nat.add m m) n
                            (@Lax109476Proofs.RamStandardPointRecovery.program m n C b) σ)
                          (And
                            (Lax109476Proofs.RamRecoveryThreshold.Workspace
                              (Nat.add m 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 τ : Lax808846Proofs.Imp.Env) =>
                        ∃ (x : Fin n → Rat),
                          And
                            (@Lax109476Proofs.RamRecoveryThreshold.Persistent
                              (Nat.add m m) n
                              (@Lax109476Proofs.RamStandardPointRecovery.program m n C b) x n τ)
                            (And
                              (@Lax109476Proofs.LexicographicSupport.Feasible m n
                                (@Matrix.map (Fin m) (Fin n) Int Rat C fun (z : Int) => @Int.cast Rat Rat.instIntCast z)
                                (fun (i : Fin m) => @Int.cast Rat Rat.instIntCast (b i)) x)
                              (∀ (j : Fin n),
                                Lax109476Proofs.RationalArithmeticBounds.Height (x j)
                                  (Lax109476Proofs.LexicographicBounds.coordinateCap m n H))))
                      (Nat.add
                        (Nat.add
                          (Nat.mul
                            ((33:Nat)) n)
                          ((22:Nat)))
                        (Lax109476Proofs.RamPointRecoveryBounds.instructionBound
                          (Nat.add m m) n S K)) := by sorry
end Lax109476Proofs.RamStandardPointRecovery
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamStandardPointRecovery.lean, theorem recover_with_cap_spec (lines 19–68)

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