Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Read a bound of the primal-dual certificate system

Proved
Lax109476Proofs.RamPairSelector.selectBound_spec_native

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

algorithmscomputational-complexitygraph-theory

Let PPP be an integer LP with mmm constraints and nnn variables, whose stored coefficients meet the published bound MMM. The joint primal-dual feasibility system has m+n+2m+n+2m+n+2 rows and n+mn+mn+m columns. For each valid requested index, under the stated source-storage and host-word guards, the selector command reads its right-hand-side entry into the signed rational result registers:

fractionout=bi⋆.\mathrm{fraction}_{\rm out}=b^\star_i.fractionout​=bi⋆​.

This is a reusable source interface for composing the complete finite-program implementation.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeDetailedInterfaces
namespace Lax109476Proofs.RamPairSelector
end Lax109476Proofs.RamPairSelector
Formal statement
theorem Lax109476Proofs.RamPairSelector.selectBound_spec_native : ∀ (B M m n : Nat) (P : Lax109476.LinearProgram.Program Int m n)
  (i :
    Fin
      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) m
        (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n
          (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))),
  @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) m n)
            (@OfNat.ofNat Nat (nat_lit 4) (instOfNatNat (nat_lit 4))))
          B →
        (∀ (r : Fin m), @LE.le Nat instLENat (@Lax109476.LinearProgram.Program.b Int m n P r).natAbs M) →
          (∀ (s : Fin n), @LE.le Nat instLENat (@Lax109476.LinearProgram.Program.c Int m n P s).natAbs M) →
            Lax808846Proofs.Reasoning.Spec B
              (fun (σ : Lax808846Proofs.Imp.Env) =>
                And (@Lax109476Proofs.RamCertificateSource.Data m n P σ)
                  (@Eq Nat (σ.vars "query.row")
                    (@Fin.val
                      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) m
                        (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) n
                          (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))))
                      i)))
              Lax109476Proofs.RamPairSelector.selectBound
              (fun (x τ : Lax808846Proofs.Imp.Env) =>
                And (@Lax109476Proofs.RamCertificateSource.Data m n P τ)
                  (Lax109476Proofs.RamRational.FractionOutput
                    (@Int.cast Rat Rat.instIntCast (@Lax109476Proofs.CertificateFamilyEntries.pairRhs m n P i)) τ))
              (@OfNat.ofNat Nat (nat_lit 40) (instOfNatNat (nat_lit 40))) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamPairSelector.lean, theorem selectBound_spec (lines 113–151)

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