Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fixed native distance-LP construction and solver invocation

Proved
Lax263307Proofs.NativeDistanceOracle.exists_invocation

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

algorithmsgraph-theorylinear-programming

Let fff be a polynomial-time word-RAM function on finite word lists. One fixed native program and natural polynomials for its word width and time implement every distance-LP query. For a rational program PPP, rational center xxx, and query Q=encode⁡(distanceLP⁡(P,x))Q=\operatorname{encode}(\operatorname{distanceLP}(P,x))Q=encode(distanceLP(P,x)), the output is exactly f(Q)f(Q)f(Q).

The complete call is valid under the stated source-height, word-width, input-size, polynomial-evaluation and workspace guards. It preserves the encoded source program and center, returns a halted virtual solver state, and satisfies the explicit native distance-oracle instruction bound. The same finite program and polynomial bounds precede every program and center. This is the construction-and-simulation part of the exact native projection interface.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeOracleInterfaces
Formal statement
theorem Lax263307Proofs.NativeDistanceOracle.exists_invocation : ∀ (f : List ℕ → List ℕ),
  Lax759944.RamPolytime.RamPolytime f →
    ∃ (p : Lax808846.Ram.Program) (wp : Polynomial ℕ) (tp : Polynomial ℕ) (coeff : List ℕ),
      (∀ (z : ℕ), Lax455465Proofs.RamPolynomial.value coeff z = Polynomial.eval z wp) ∧
        ∀ (m n : ℕ) (P : Lax109476.LinearProgram.Program ℚ m n) (x : Fin n → ℚ),
          have query := Lax109476.RationalEncoding.encodeProgram (Lax263307.DistanceProjection.distanceProgram P x);
          Lax759944.RamPolytime.FitsInWords (Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize query) wp)
              (query.length :: query ++ f query) ∧
            ∀ (B : ℕ),
              Lax263307Proofs.NativeDistanceData.shapeSize m n < B →
                Lax263307Proofs.NativeDistanceData.Bounded B P x →
                  Lax759944.BinaryWordEncoding.bitSize query + 1 < B →
                    Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize query + 1) wp < B →
                      2 * (2 ^ Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize query) wp) ^ 2 + 3 < B →
                        Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize query) tp + 1 < B →
                          Lax455465Proofs.RamVirtualConstants.allowance p < B →
                            Lax808846Proofs.Reasoning.Spec B
                              (fun (σ : Lax808846Proofs.Imp.Env) =>
                                Lax455465Proofs.RamVirtualState.Prefix (Lax109476.RationalEncoding.encodeProgram P)
                                    "lp.input" σ ∧
                                  Lax455465Proofs.RamVirtualState.Prefix (Lax109476.RationalEncoding.encodeVector x)
                                      "projection.center" σ ∧
                                    Lax263307Proofs.NativeDistanceData.wordLength m n < (σ.arrs "lp.word").length ∧
                                      query.length < (σ.arrs "vm.input").length ∧
                                        Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize query) tp <
                                            (σ.arrs "vm.addresses").length ∧
                                          Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize query) tp <
                                              (σ.arrs "vm.values").length ∧
                                            Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize query) tp <
                                              (σ.arrs "vm.output").length)
                              (Lax263307Proofs.NativeDistanceOracle.command p coeff)
                              (fun (x_1 τ : Lax808846Proofs.Imp.Env) =>
                                Lax455465Proofs.RamVirtualState.Prefix (f query) "vm.output" τ ∧
                                  τ.vars "vm.outputLength" = (f query).length ∧
                                    τ.vars "vm.running" = 0 ∧
                                      Lax455465Proofs.RamVirtualState.Prefix
                                          (Lax109476.RationalEncoding.encodeProgram P) "lp.input" τ ∧
                                        Lax455465Proofs.RamVirtualState.Prefix
                                          (Lax109476.RationalEncoding.encodeVector x) "projection.center" τ)
                              (Lax263307Proofs.NativeDistanceOracle.cost m n p coeff
                                (Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize query) tp)
                                (Lax759944.BinaryWordEncoding.bitSize query)) := by sorry
Source
https://github.com/EdouardBonnet/lax-263307/blob/68b2d26aa2075e2ef80fd9d355ea748d2a818fd1/proofs/Lax263307Proofs/NativeDistanceOracle.lean, theorem exists_invocation

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