Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rational feasibility execution with a Boolean output flag

Proved
Lax109476Proofs.RamRationalFeasibility.decideFeasible_with_flag_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 mmm constraints and nnn variables, and let LLL be the binary size of its encoding. Suppose www is at least the published feasibility word-width bound W(L)W(L)W(L) and the complete input and workspace predicate holds. The fixed rational feasibility command terminates within T(L)T(L)T(L) instructions and produces a genuine Boolean flag bbb satisfying

b≤1,(b=1)⟺feasible⁡(P).b\le1,\qquad(b=1)\Longleftrightarrow\operatorname{feasible}(P).b≤1,(b=1)⟺feasible(P).

Here feasibility is the source's total exact decision predicate, and the bound and decision are uniform in all rational input data. Retaining the Boolean range is needed to use the flag in actual conditional execution.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativePhaseInterfaces
namespace Lax109476Proofs.RamRationalFeasibility
end Lax109476Proofs.RamRationalFeasibility
Formal statement
theorem Lax109476Proofs.RamRationalFeasibility.decideFeasible_with_flag_spec_native : ∀ (m n : Nat) (P : Lax109476.LinearProgram.Program Rat m n) (w : Nat),
  @LE.le Nat instLENat
      (Lax109476Proofs.RamRationalFeasibility.wordWidth
        (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.RamRationalFeasibility.decideFeasible
      (fun (x τ : Lax808846Proofs.Imp.Env) =>
        And (@LE.le Nat instLENat (τ.vars "search.found") (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
          (@Eq Bool
            (@Decidable.decide
              (@Eq Nat (τ.vars "search.found") (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1))))
              (instDecidableEqNat (τ.vars "search.found") (@OfNat.ofNat Nat (nat_lit 1) (instOfNatNat (nat_lit 1)))))
            (@Lax109476Proofs.RationalFeasibilityDecision.feasible m n P)))
      (Lax109476Proofs.RamRationalFeasibility.instructionBound
        (Lax759944.BinaryWordEncoding.bitSize (@Lax109476.RationalEncoding.encodeProgram m n P))) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamFeasibilityFlags.lean, theorem Lax109476Proofs.RamRationalFeasibility.decideFeasible_with_flag_spec, line 114

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