Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Native linear-programming completion and certificate output

Proved
Lax109476Proofs.RamSolverFinish.finish_spec

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

algorithmscomputational-complexitygraph-theory

For a rational linear program PPP, assume the decoded input and reconstruction workspace satisfy the completion precondition, at the prescribed word width and stack depth. The fixed completion command returns a valid certificate and appends its encoding to the previous output within

instructionBound⁡(bitSize⁡(encode⁡(P))).\operatorname{instructionBound}(\operatorname{bitSize}(\operatorname{encode}(P))).instructionBound(bitSize(encode(P))).

Signed rational coefficients are handled through exact denominator clearing.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem Lax109476Proofs.RamSolverFinish.finish_spec : ∀ (m n N w : ℕ) (P : Lax109476.LinearProgram.Program ℚ m n),
  Lax109476Proofs.RamSolverBranchBounds.wordWidth
        (Lax109476Proofs.RamCertificateSetup.parameter
          (Lax759944.BinaryWordEncoding.bitSize (Lax109476.RationalEncoding.encodeProgram P))) ≤
      w →
    Lax109476Proofs.RamRationalReconstruction.depthBound
            (Lax109476Proofs.RamRecoverFeasibleSystem.recoveryBits
              (Lax109476Proofs.RamCertificateSetup.parameter
                (Lax759944.BinaryWordEncoding.bitSize (Lax109476.RationalEncoding.encodeProgram P)))) +
          1 ≤
        N →
      Lax808846Proofs.Reasoning.Spec (2 ^ w) (Lax109476Proofs.RamSolverFinish.Input P N)
        (Lax109476Proofs.RamCertificateSetup.save.seq Lax109476Proofs.RamExactSolverProgram.chooseCertificate)
        (Lax109476Proofs.RamSolverFinish.Result P)
        (Lax109476Proofs.RamSolverFinish.instructionBound
          (Lax759944.BinaryWordEncoding.bitSize (Lax109476.RationalEncoding.encodeProgram P))) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamSolverFinish.lean, theorem finish_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