Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A native polynomial-time rounded ellipsoid step

Proved
Lax263307Proofs.NativeRoundedStep.exists_program

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

algorithmscomputational-complexitygraph-theory

One fixed RAM program performs the rational rounded ellipsoid update. There is a positive constant ccc such that valid dimension-nnn states, integer separating normals, and height parameter hhh satisfy

t≤c(n+h+k+1)12t\le c(n+h+k+1)^{12}t≤c(n+h+k+1)12

for the actual instruction count and sufficient host word width. The output is the exact prescribed rounded update, including both center and shape matrix.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax263307Proofs.NativeRoundedStep.exists_program : ∃ (p : Lax808846.Ram.Program) (c : ℕ),
  0 < c ∧
    ∀ (n k h : ℕ),
      2 ≤ n →
        1 ≤ h →
          ∀ (state : Lax263307.RoundedOracleSearch.State n) (a : Fin n → ℤ),
            (∀ (i j : Fin n), Lax263307.NativeRoundedStep.height (state.1 i j) h) →
              (∀ (i : Fin n), Lax263307.NativeRoundedStep.height (Lax263307.RoundedOracleSearch.rationalNormal a i) h) →
                (∀ (i : Fin n), Lax263307.NativeRoundedStep.height (state.2 i) h) →
                  0 <
                      Lax263307.RoundedOracleSearch.rationalNormal a ⬝ᵥ
                        state.1.mulVec (Lax263307.RoundedOracleSearch.rationalNormal a) →
                    ∀ (w : ℕ),
                      c * (n + h + k + 1) ^ 12 ≤ w →
                        ∃ t ≤ c * (n + h + k + 1) ^ 12,
                          Lax808846.Ram.RunsTo w p (Lax263307.NativeRoundedStep.encodeInput k state a)
                            (Lax263307.NativeRoundedStep.encodeOutput (Lax263307.RoundedOracleSearch.update k state a))
                            t := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeRoundedStep.lean, theorem exists_program

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