Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of rational ellipsoid coefficient computation

Proved
Lax109476Proofs.RamEllipsoidCoefficients.computeCoefficients_spec

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

algorithmscomputational-complexitylinear-programming

Let n≥2n\ge2n≥2 be the dimension and q>0q>0q>0 the rational quadratic-form value. Let D,E>0D,E>0D,E>0 be the precision grids, MMM a height and magnitude bound, CCC a height bound for the resulting five coefficients, and BBB the machine modulus. Assume the explicit intermediate word-range inequalities and that the scalar input fields and five allocated zero coefficient entries are present. The coefficient command writes exactly the implementation's vector g(n,q,D,E)g(n,q,D,E)g(n,q,D,E) and preserves its scalar input:

coefficients⁡out=g(n,q,D,E),T≤582 size⁡(M)+687.\operatorname{coefficients}_{\rm out}=g(n,q,D,E),\qquad T\le582\,\operatorname{size}(M)+687.coefficientsout​=g(n,q,D,E),T≤582size(M)+687.

Here size⁡(M)\operatorname{size}(M)size(M) is the binary length of MMM. The vector contains the rational scaling, rank-one, center, inflation and diagonal coefficients for the rounded ellipsoid update. This is a reusable operational specification of their computation, including the necessary arithmetic bounds.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeOperationalInterfaces
Formal statement
theorem Lax109476Proofs.RamEllipsoidCoefficients.computeCoefficients_spec : ∀ (B n M C D E : ℕ) (q : ℚ),
  2 ≤ n →
    0 < q →
      Lax109476Proofs.RationalArithmeticBounds.Height q M →
        n ≤ M →
          D ≤ M →
            E ≤ M →
              0 < D →
                0 < E →
                  n ^ 2 < B →
                    (E + 1) ^ 2 < B →
                      2 * M ^ 2 + 3 < B →
                        (2 * (M ^ 3 + 2) + 1) ^ 2 + M ^ 3 + 3 < B →
                          C < B →
                            (∀ v ∈ Lax109476Proofs.RamEllipsoidCoefficients.coefficients n q D E,
                                Lax109476Proofs.RationalArithmeticBounds.Height v C) →
                              Lax808846Proofs.Reasoning.Spec B
                                (fun (σ : Lax808846Proofs.Imp.Env) =>
                                  Lax109476Proofs.RamEllipsoidCoefficients.ScalarInput n q D E σ ∧
                                    Lax109476Proofs.RamRationalArrays.Represents "ell.coeff" (List.replicate 5 0) σ)
                                Lax109476Proofs.RamEllipsoidCoefficients.computeCoefficients
                                (fun (x τ : Lax808846Proofs.Imp.Env) =>
                                  Lax109476Proofs.RamRationalArrays.Represents "ell.coeff"
                                      (Lax109476Proofs.RamEllipsoidCoefficients.coefficients n q D E) τ ∧
                                    Lax109476Proofs.RamEllipsoidCoefficients.ScalarInput n q D E τ)
                                (582 * M.size + 687) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamEllipsoidCoefficients.lean, theorem computeCoefficients_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