Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of the rounded ellipsoid shape update

Proved
Lax109476Proofs.RamShapeUpdate.updateShape_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, a∈Qna\in\mathbb Q^na∈Qn, D>0D>0D>0 a grid and η∈Q\eta\in\mathbb Qη∈Q an inflation parameter. Assume the coefficient vector ggg has at least five entries and satisfies

g0=n2n2−1,g1=2(n+1)aTAa,g3=(1+η)2,g4=nD.g_0=\frac{n^2}{n^2-1},\quad g_1=\frac{2}{(n+1)a^TAa},\quad g_3=(1+\eta)^2,\quad g_4=\frac nD.g0​=n2−1n2​,g1​=(n+1)aTAa2​,g3​=(1+η)2,g4​=Dn​.

Let M≥1M\ge1M≥1 bound the heights of AAA, AaAaAa and these coefficients, with n2,D≤Mn^2,D\le Mn2,D≤M and the routine's explicit word-range bounds for modulus BBB. Given their encodings and three next-shape arrays of length n2n^2n2, the command writes roundedStepShape⁡(n,A,a,D,η)\operatorname{roundedStepShape}(n,A,a,D,\eta)roundedStepShape(n,A,a,D,η) in flattened order. It preserves Aa,A,g,n,DAa,A,g,n,DAa,A,g,n,D and runs in at most (468size⁡(shapeCap⁡(M))+731)n2+36(468\operatorname{size}(\operatorname{shapeCap}(M))+731)n^2+36(468size(shapeCap(M))+731)n2+36 steps. This links the matrix-entry loop to the mathematical rounded update.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeOperationalInterfaces
Formal statement
theorem Lax109476Proofs.RamShapeUpdate.updateShape_ellipsoid_spec : ∀ (B n M D : ℕ) (A : Matrix (Fin n) (Fin n) ℚ) (a : Fin n → ℚ) (gs : List ℚ) (hg : 4 < gs.length) (η : ℚ),
  1 ≤ M →
    n * n ≤ M →
      (∀ (j : Fin n), Lax109476Proofs.RationalArithmeticBounds.Height (A.mulVec a j) M) →
        (∀ (i j : Fin n), Lax109476Proofs.RationalArithmeticBounds.Height (A i j) M) →
          Lax109476Proofs.RationalArithmeticBounds.Height gs[0] M →
            Lax109476Proofs.RationalArithmeticBounds.Height gs[1] M →
              Lax109476Proofs.RationalArithmeticBounds.Height gs[3] M →
                Lax109476Proofs.RationalArithmeticBounds.Height gs[4] M →
                  D ≤ M →
                    0 < D →
                      n * n < B →
                        n < B →
                          2 * Lax109476Proofs.RamShapeCoordinate.shapeCap M ^ 2 + 3 < B →
                            gs[0] = ↑n ^ 2 / (↑n ^ 2 - 1) →
                              gs[1] = 2 / ((↑n + 1) * a ⬝ᵥ A.mulVec a) →
                                gs[3] = (1 + η) ^ 2 →
                                  gs[4] = ↑n / ↑D →
                                    Lax808846Proofs.Reasoning.Spec B
                                      (fun (σ : Lax808846Proofs.Imp.Env) =>
                                        Lax109476Proofs.RamRationalArrays.Represents "ell.u" (List.ofFn (A.mulVec a))
                                            σ ∧
                                          Lax109476Proofs.RamRationalArrays.Represents "ell.shape"
                                              (Lax109476Proofs.RamMatrixStorage.flatten A) σ ∧
                                            Lax109476Proofs.RamRationalArrays.Represents "ell.coeff" gs σ ∧
                                              (σ.arrs "ell.nextshape.s").length = n * n ∧
                                                (σ.arrs "ell.nextshape.n").length = n * n ∧
                                                  (σ.arrs "ell.nextshape.d").length = n * n ∧
                                                    σ.vars "vec.n" = n ∧ σ.vars "grid.D" = D)
                                      Lax109476Proofs.RamShapeUpdate.updateShape
                                      (fun (x τ : Lax808846Proofs.Imp.Env) =>
                                        Lax109476Proofs.RamRationalArrays.Represents "ell.nextshape"
                                            (Lax109476Proofs.RamMatrixStorage.flatten
                                              (Lax109476Proofs.EllipsoidCenter.roundedStepShape n A a D η))
                                            τ ∧
                                          Lax109476Proofs.RamRationalArrays.Represents "ell.u" (List.ofFn (A.mulVec a))
                                              τ ∧
                                            Lax109476Proofs.RamRationalArrays.Represents "ell.shape"
                                                (Lax109476Proofs.RamMatrixStorage.flatten A) τ ∧
                                              Lax109476Proofs.RamRationalArrays.Represents "ell.coeff" gs τ ∧
                                                τ.vars "vec.n" = n ∧ τ.vars "grid.D" = D)
                                      (33 * (n * n) + 26 +
                                        ((468 * (Lax109476Proofs.RamShapeCoordinate.shapeCap M).size + 690 + 4 + 4) *
                                            (n * n) +
                                          10)) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamShapeUpdate.lean, theorem updateShape_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