Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execute the initialized bounded ellipsoid-search loop

Proved
Lax109476Proofs.RamSearchLoop.searchLoop_spec_native

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

algorithmscomputational-complexitygraph-theory

Let AAA be an integer m×nm\times nm×n matrix with n≥2n\ge2n≥2 and coefficient magnitudes at most 2ℓ2^\ell2ℓ, and let the rational vector bbb have the same height bound. Assume N<2wN<2^wN<2w and the complete ellipsoid bit-width, dimension and separation arithmetic guards. Starting from the source’s full initialized invariant, the native loop runs through its bounded search and returns

Invariant⁡A,b,N ∧ ¬continue⁡.\operatorname{Invariant}_{A,b,N}\ \land\ \neg\operatorname{continue}.InvariantA,b,N​ ∧ ¬continue.

Its instruction count is at most (Tstep(m,n,N,ℓ)+4)N+4(T_{\rm step}(m,n,N,\ell)+4)N+4(Tstep​(m,n,N,ℓ)+4)N+4. The invariant retains the exact trajectory and first-success interpretation of the output flag and index.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeBoundsInterfaces
namespace Lax109476Proofs.RamSearchLoop
end Lax109476Proofs.RamSearchLoop
Formal statement
theorem Lax109476Proofs.RamSearchLoop.searchLoop_spec_native : ∀ {m n : Nat} (A : Matrix (Fin m) (Fin n) Int) (b : Fin m → Rat),
  @LE.le Nat instLENat (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) n →
    ∀ (N l w : Nat),
      @LT.lt Nat instLTNat N
          (@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) →
        (∀ (i : Fin m) (j : Fin n),
            @LE.le Nat instLENat (A i j).natAbs
              (@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))) l)) →
          (∀ (i : Fin m),
              Lax109476Proofs.RationalArithmeticBounds.Height (b 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))) l)) →
            @LE.le Nat instLENat
                (Lax109476Proofs.RamEllipsoidBitBounds.wordWidth n (Lax109476Proofs.RamTrajectoryBounds.stateBits n N l)
                  N)
                w →
              @LT.lt Nat instLTNat
                  (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                    (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) m n)
                      (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) m n))
                    (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
                  (@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) →
                @LT.lt Nat instLTNat
                    (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                      (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                        (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
                        (@HPow.hPow Nat Nat Nat
                          (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
                          (Lax109476Proofs.RamDotProduct.cap n
                            (@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)))
                              (Lax109476Proofs.RamTrajectoryBounds.stateBits n N l)))
                          (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
                      (@OfNat.ofNat Nat (nat_lit 3) (instOfNatNat (nat_lit 3))))
                    (@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) →
                  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.RamSearchStep.State m n A b
                          (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))) σ)
                        (And (@Eq Nat (σ.vars "search.limit") N)
                          (@Eq Nat (σ.vars "search.found") (@OfNat.ofNat Nat (nat_lit 0) (instOfNatNat (nat_lit 0))))))
                    Lax109476Proofs.RamSearchLoop.searchLoop
                    (fun (x τ : Lax808846Proofs.Imp.Env) =>
                      And (@Lax109476Proofs.RamSearchLoop.Invariant m n A b N τ)
                        (@Eq (Option Bool)
                          (Lax808846Proofs.Imp.Cond.evalB
                            (@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)
                            (Lax808846Proofs.Imp.Cond.lt (Lax808846Proofs.Imp.Expr.var "iter.k")
                              (Lax808846Proofs.Imp.Expr.var "search.limit"))
                            τ)
                          (@Option.some Bool Bool.false)))
                    (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                      (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                        (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (Lax109476Proofs.RamSearchStep.cost m n N l)
                          (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
                        N)
                      (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4)))) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamSearchLoop.lean, theorem Lax109476Proofs.RamSearchLoop.searchLoop_spec, line 64

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