Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of the rounded ellipsoid center update

Proved
Lax109476Proofs.RamCenterUpdate.updateCenter_ellipsoid_spec

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

algorithmscomputational-complexitylinear-programming

Let AAA be a rational n×nn\times nn×n matrix, let a,c∈Qna,c\in\mathbb Q^na,c∈Qn, and let D>0D>0D>0 be the rounding grid. Let ggg be the coefficient vector, with its center coefficient equal to 1/((n+1)sqrtUpper⁡(aTAa,D))1/((n+1)\operatorname{sqrtUpper}(a^TAa,D))1/((n+1)sqrtUpper(aTAa,D)). Let M≥1M\ge1M≥1 bound the heights of AaAaAa, ccc and this coefficient, and assume D≤MD\le MD≤M, n<Bn<Bn<B and the prescribed center-overflow bound for modulus BBB. Given encoded Aa,c,gAa,c,gAa,c,g and three next-center arrays of length nnn, the center command produces

c′=roundedCenter⁡(n,A,a,c,D).c'=\operatorname{roundedCenter}(n,A,a,c,D).c′=roundedCenter(n,A,a,c,D).

It preserves Aa,c,g,n,DAa,c,g,n,DAa,c,g,n,D and runs in at most (180size⁡(centerCap⁡(M))+359)n+24(180\operatorname{size}(\operatorname{centerCap}(M))+359)n+24(180size(centerCap(M))+359)n+24 steps. The coefficient vector has at least three entries. The result connects a coordinate loop to the mathematical rounded-center update.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeOperationalInterfaces
Formal statement
theorem Lax109476Proofs.RamCenterUpdate.updateCenter_ellipsoid_spec : ∀ (B n M D : ℕ) (A : Matrix (Fin n) (Fin n) ℚ) (a c : Fin n → ℚ) (gs : List ℚ) (hg : 2 < gs.length),
  1 ≤ M →
    (∀ (j : Fin n), Lax109476Proofs.RationalArithmeticBounds.Height (A.mulVec a j) M) →
      (∀ (j : Fin n), Lax109476Proofs.RationalArithmeticBounds.Height (c j) M) →
        Lax109476Proofs.RationalArithmeticBounds.Height gs[2] M →
          gs[2] = 1 / ((↑n + 1) * Lax109476Proofs.RationalRounding.sqrtUpper (a ⬝ᵥ A.mulVec a) D) →
            D ≤ M →
              0 < D →
                n < B →
                  2 * Lax109476Proofs.RamCenterCoordinate.centerCap M ^ 2 + 3 < B →
                    Lax808846Proofs.Reasoning.Spec B
                      (fun (σ : Lax808846Proofs.Imp.Env) =>
                        Lax109476Proofs.RamRationalArrays.Represents "ell.u" (List.ofFn (A.mulVec a)) σ ∧
                          Lax109476Proofs.RamRationalArrays.Represents "ell.center" (List.ofFn c) σ ∧
                            Lax109476Proofs.RamRationalArrays.Represents "ell.coeff" gs σ ∧
                              (σ.arrs "ell.nextcenter.s").length = n ∧
                                (σ.arrs "ell.nextcenter.n").length = n ∧
                                  (σ.arrs "ell.nextcenter.d").length = n ∧ σ.vars "vec.n" = n ∧ σ.vars "grid.D" = D)
                      Lax109476Proofs.RamCenterUpdate.updateCenter
                      (fun (x τ : Lax808846Proofs.Imp.Env) =>
                        Lax109476Proofs.RamRationalArrays.Represents "ell.nextcenter"
                            (List.ofFn (Lax109476Proofs.EllipsoidCenter.roundedCenter n A a c D)) τ ∧
                          Lax109476Proofs.RamRationalArrays.Represents "ell.u" (List.ofFn (A.mulVec a)) τ ∧
                            Lax109476Proofs.RamRationalArrays.Represents "ell.center" (List.ofFn c) τ ∧
                              Lax109476Proofs.RamRationalArrays.Represents "ell.coeff" gs τ ∧
                                τ.vars "vec.n" = n ∧ τ.vars "grid.D" = D)
                      (33 * n + 18 +
                        ((180 * (Lax109476Proofs.RamCenterCoordinate.centerCap M).size + 318 + 4 + 4) * n + 6)) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamCenterUpdate.lean, theorem updateCenter_ellipsoid_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