Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Copy a rational feasibility query into its cleared integer workspace

Proved
Lax109476Proofs.RamFeasibilityQuery.copyInput_spec_native

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

algorithmscomputational-complexitygraph-theory

Let PPP be a rational m×nm\times nm×n linear program and let LLL be its binary encoding size. Suppose www meets the decoding word bound at 2L2L2L and the full stored rational query predicate holds. The fixed copying command produces the padded-feasibility input for the denominator-cleared integer system:

Input⁡integer(integerProgram⁡(P),L).\operatorname{Input}_{\rm integer}(\operatorname{integerProgram}(P),L).Inputinteger​(integerProgram(P),L).

It runs in at most 71(mn+m)+5871(mn+m)+5871(mn+m)+58 instructions. This supplies the exact data conversion consumed by rational feasibility execution.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeBoundsInterfaces
namespace Lax109476Proofs.RamFeasibilityQuery
end Lax109476Proofs.RamFeasibilityQuery
Formal statement
theorem Lax109476Proofs.RamFeasibilityQuery.copyInput_spec_native : ∀ (m n : Nat) (P : Lax109476.LinearProgram.Program Rat m n) (w : Nat),
  @LE.le Nat instLENat
      (Lax109476Proofs.RamDecoder.wordWidth
        (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2)))
          (Lax759944.BinaryWordEncoding.bitSize (@Lax109476.RationalEncoding.encodeProgram m n P))))
      w →
    Lax808846Proofs.Reasoning.Spec
      (@HPow.hPow Nat Nat Nat (@instHPow Nat Nat (@NPow.toPow Nat (@Monoid.toNPow Nat Nat.instMonoid)))
        (@OfNat.ofNat Nat (nat_lit 2) (instOfNatNat (nat_lit 2))) w)
      (@Lax109476Proofs.RamFeasibilityQuery.Input m n P) Lax109476Proofs.RamFeasibilityQuery.copyInput
      (fun (x τ : Lax808846Proofs.Imp.Env) =>
        @Lax109476Proofs.RamPaddedFeasibility.Input m n (@Lax109476Proofs.IntegerEncoding.integerProgram m n P)
          (Lax759944.BinaryWordEncoding.bitSize (@Lax109476.RationalEncoding.encodeProgram m n P)) τ)
      (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat)
        (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) (@OfNat.ofNat Nat (nat_lit 71) (instOfNatNat (nat_lit 71)))
          (@HAdd.hAdd Nat Nat Nat (@instHAdd Nat instAddNat) (@HMul.hMul Nat Nat Nat (@instHMul Nat instMulNat) m n) m))
        (@OfNat.ofNat Nat (nat_lit 58) (instOfNatNat (nat_lit 58)))) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamFeasibilityQuery.lean, theorem Lax109476Proofs.RamFeasibilityQuery.copyInput_spec, line 33

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