Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Selecting an entry of a recovery query matrix

Proved
Lax109476Proofs.RamRecoverySelector.selectEntry_spec_native

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

algorithmscomputational-complexitygraph-theory

Let PPP have mmm rational constraints in nnn variables and let k<nk<nk<n. Under the explicit coefficient-height and word-range hypotheses, the fixed recovery-matrix selector reads row iii and column jjj and returns the corresponding entry of the coordinate-cut matrix:

a=E(P,k)ij.a=E(P,k)_{ij}.a=E(P,k)ij​.

The initial state stores the matrix and its dimensions and indices; the operational cost is at most seventy-six steps.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeNextInterfaces
namespace Lax109476Proofs.RamRecoverySelector
end Lax109476Proofs.RamRecoverySelector
Formal statement
theorem Lax109476Proofs.RamRecoverySelector.selectEntry_spec_native : ∀ (B M m n k : Nat) (P : Lax109476.LinearProgram.Program Rat m n),
  @LT.lt Nat instLTNat k n →
    ∀
      (i :
        Fin
          (@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)))))
      (j : Fin 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) →
              Lax808846Proofs.Reasoning.Spec B
                (fun (σ : Lax808846Proofs.Imp.Env) =>
                  And
                    (Lax109476Proofs.RamRationalArrays.Represents "point.A"
                      (@Lax109476Proofs.RamMatrixStorage.flatten m n (@Lax109476.LinearProgram.Program.A Rat m n P)) σ)
                    (And (@Eq Nat (σ.vars "point.m") m)
                      (And (@Eq Nat (σ.vars "point.n") n)
                        (And (@Eq Nat (σ.vars "point.k") k)
                          (And
                            (@Eq Nat (σ.vars "query.row")
                              (@Fin.val
                                (@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))))
                                i))
                            (@Eq Nat (σ.vars "query.col") (@Fin.val n j)))))))
                Lax109476Proofs.RamRecoverySelector.selectEntry
                (fun (x τ : Lax808846Proofs.Imp.Env) =>
                  Lax109476Proofs.RamRational.FractionOutput (@Lax109476Proofs.RecoveryQueryEntries.entry m n P k i j)
                    τ)
                (@OfNat.ofNat Nat (nat_lit 76) (instOfNatNat (nat_lit 76))) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamRecoverySelector.lean#L38

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