Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of one rounded ellipsoid step

Proved
Lax109476Proofs.RamEllipsoidStep.ellipsoidStep_spec

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

algorithmscomputational-complexitylinear-programming

Let n≥2n\ge2n≥2, let AAA be a rational n×nn\times nn×n matrix, and let a,c∈Qna,c\in\mathbb Q^na,c∈Qn, with aTAa>0a^TAa>0aTAa>0. Let H≥1H\ge1H≥1 bound the heights of their entries, and let MMM bound the intermediate form, dimension and precision quantities. Set D=22k+3n+9D=2^{2k+3n+9}D=22k+3n+9 and E=22n+4E=2^{2n+4}E=22n+4 at iteration kkk. Under the routine's explicit word-range bounds for modulus BBB, the ellipsoid-step command maps the encoded state (A,a,c)(A,a,c)(A,a,c) and its allocated workspace to the rounded next center and shape:

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

It preserves the old shape and center and the dimension field, records the grid DDD, and runs within the explicit bound Kstep(n,H,M)K_{\rm step}(n,H,M)Kstep​(n,H,M) defined by the implementation. The hypotheses include all rational-height, array-extent and intermediate overflow conditions. This operational interface is reusable both in the feasibility solver and in the native MWIS rounding program.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeOperationalInterfaces
Formal statement
theorem Lax109476Proofs.RamEllipsoidStep.ellipsoidStep_spec : ∀ (B n H M k : ℕ) (A : Matrix (Fin n) (Fin n) ℚ) (a c : Fin n → ℚ),
  2 ≤ n →
    1 ≤ H →
      (∀ (i j : Fin n), Lax109476Proofs.RationalArithmeticBounds.Height (A i j) H) →
        (∀ (i : Fin n), Lax109476Proofs.RationalArithmeticBounds.Height (a i) H) →
          (∀ (i : Fin n), Lax109476Proofs.RationalArithmeticBounds.Height (c i) H) →
            0 < a ⬝ᵥ A.mulVec a →
              n * n ≤ M →
                Lax109476Proofs.RamEllipsoidForm.formHeight n H ≤ M →
                  2 ^ (2 * k + 3 * n + 9) ≤ M →
                    2 ^ (2 * n + 4) ≤ M →
                      2 *
                              Lax109476Proofs.RamShapeCoordinate.shapeCap
                                  (Lax109476Proofs.RamEllipsoidCoefficients.coefficientCap M) ^
                                2 +
                            3 <
                          B →
                        Lax808846Proofs.Reasoning.Spec B
                          (fun (σ : Lax808846Proofs.Imp.Env) =>
                            Lax109476Proofs.RamRationalArrays.Represents "ell.shape"
                                (Lax109476Proofs.RamMatrixStorage.flatten A) σ ∧
                              Lax109476Proofs.RamRationalArrays.Represents "ell.normal" (List.ofFn a) σ ∧
                                Lax109476Proofs.RamRationalArrays.Represents "ell.center" (List.ofFn c) σ ∧
                                  Lax109476Proofs.RamEllipsoidStep.Workspace n σ ∧
                                    σ.vars "vec.n" = n ∧ σ.vars "iter.k" = k)
                          Lax109476Proofs.RamEllipsoidStep.ellipsoidStep
                          (fun (x τ : Lax808846Proofs.Imp.Env) =>
                            Lax109476Proofs.RamRationalArrays.Represents "ell.nextcenter"
                                (List.ofFn
                                  (Lax109476Proofs.EllipsoidCenter.roundedCenter n A a c (2 ^ (2 * k + 3 * n + 9))))
                                τ ∧
                              Lax109476Proofs.RamRationalArrays.Represents "ell.nextshape"
                                  (Lax109476Proofs.RamMatrixStorage.flatten
                                    (Lax109476Proofs.EllipsoidCenter.roundedStepShape n A a (2 ^ (2 * k + 3 * n + 9))
                                      (Lax109476Proofs.EllipsoidIteration.stepAccuracy n)))
                                  τ ∧
                                Lax109476Proofs.RamRationalArrays.Represents "ell.shape"
                                    (Lax109476Proofs.RamMatrixStorage.flatten A) τ ∧
                                  Lax109476Proofs.RamRationalArrays.Represents "ell.center" (List.ofFn c) τ ∧
                                    τ.vars "vec.n" = n ∧ τ.vars "grid.D" = 2 ^ (2 * k + 3 * n + 9))
                          (Lax109476Proofs.RamEllipsoidStep.stepCost n H M) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamEllipsoidStep.lean, theorem ellipsoidStep_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