Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Constructing the coordinate-recovery feasibility query

Proved
Lax109476Proofs.RamRecoveryQuery.buildQuery_spec_native

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

algorithmscomputational-complexitygraph-theory

Let PPP be a rational linear program with zero objective, xxx a rational prefix vector, k<nk<nk<n and ttt a rational threshold. Suppose their entries have height at most M≥1M\ge1M≥1, the workspace has the stated array extents and all explicit address and word bounds hold. The fixed constructor preserves the recovery data and writes the exact encoded program

{y∈P:yj=xj (j<k), yk≤t}.\{y\in P:y_j=x_j\ (j<k),\ y_k\le t\}.{y∈P:yj​=xj​ (j<k), yk​≤t}.

It terminates within the specified quadratic matrix-size instruction bound.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeNextInterfaces
namespace Lax109476Proofs.RamRecoveryQuery
end Lax109476Proofs.RamRecoveryQuery
Formal statement
theorem Lax109476Proofs.RamRecoveryQuery.buildQuery_spec_native : ∀ (B M m n k : Nat) (P : Lax109476.LinearProgram.Program Rat m n) (x : Fin n → Rat) (t : Rat)
  (hk : @LT.lt Nat instLTNat k n),
  @LE.le Nat instLENat (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))) M →
    @LT.lt Nat instLTNat M B →
      @LT.lt Nat instLTNat
          (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
            (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
              (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                  (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                    (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) m
                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n n))
                    (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
                  n)
                m)
              (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n n))
            (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
          B →
        (∀ (i : Fin m) (j : Fin n),
            Lax109476Proofs.RationalArithmeticBounds.Height (@Lax109476.LinearProgram.Program.A Rat m n P i j) M) →
          (∀ (i : Fin m),
              Lax109476Proofs.RationalArithmeticBounds.Height (@Lax109476.LinearProgram.Program.b Rat m n P i) M) →
            (∀ (j : Fin n), Lax109476Proofs.RationalArithmeticBounds.Height (x j) M) →
              Lax109476Proofs.RationalArithmeticBounds.Height t M →
                (∀ (j : Fin n),
                    @Eq Rat (@Lax109476.LinearProgram.Program.c Rat m n P j)
                      (@OfNat.ofNat Rat (nat_lit 0) (@Rat.instOfNat (nat_lit 0)))) →
                  Lax808846Proofs.Reasoning.Spec B
                    (fun (σ : Lax808846Proofs.Imp.Env) =>
                      And (@Lax109476Proofs.RamRecoveryData.Data m n P x k t σ)
                        (Lax109476Proofs.RamRecoveryQuery.Extent m n σ))
                    Lax109476Proofs.RamRecoveryQuery.buildQuery
                    (fun (x_1 τ : Lax808846Proofs.Imp.Env) =>
                      And (@Lax109476Proofs.RamRecoveryData.Data m n P x k t τ)
                        (@Lax109476Proofs.RamStoredProgram.RepresentsProgram
                          (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                            (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) m
                              (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n n))
                            (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
                          n
                          (@Lax109476Proofs.CoordinateOptimization.coordinateCut
                            (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) m
                              (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n n))
                            n (@Lax109476Proofs.LexicographicMinima.fixedPrefix m n P x k) (@Fin.mk n k hk) t)
                          τ))
                    (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                        (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                          (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                            (@OfNat.ofNat Nat (nat_lit 142) (instOfNatNat (nat_lit 142)))
                            (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                              (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                                (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) m
                                  (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n n))
                                (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
                              n))
                          (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                            (@OfNat.ofNat Nat (nat_lit 138) (instOfNatNat (nat_lit 138)))
                            (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
                              (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) m
                                (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n n))
                              (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))))
                        (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat)
                          (@OfNat.ofNat Nat (nat_lit 33) (instOfNatNat (nat_lit 33))) n))
                      (@OfNat.ofNat Nat (nat_lit 106) (instOfNatNat (nat_lit 106)))) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamRecoveryQuery.lean#L71

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