Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Execution of unboundedness-certificate system construction

Proved
Lax109476Proofs.RamCertificateFamilies.unbounded_spec

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

algorithmscomputational-complexitylinear-programming

Let P=(A,b,c)P=(A,b,c)P=(A,b,c) be an integer linear program with mmm constraints and nnn variables. Let M≥1M\ge1M≥1 bound the absolute values of all entries, and let B>MB>MB>M be the machine modulus. Put r=2m+1r=2m+1r=2m+1 and s=2ns=2ns=2n. Assume

mn+2m+2n+8<B,rs+r+s+4<B.mn+2m+2n+8<B,\qquad rs+r+s+4<B.mn+2m+2n+8<B,rs+r+s+4<B.

Given the stored source program and allocated target arrays of lengths rsrsrs and rrr, the unboundedness-family command writes the exact matrix and right-hand side of the published ray-certificate system Funb(P)F_{\rm unb}(P)Funb​(P) and preserves the source representation. Its actual execution satisfies

T≤134rs+90r+74.T\le134rs+90r+74.T≤134rs+90r+74.

The statement includes zero-dimensional inputs. It provides the operational construction needed before deciding and recovering an unboundedness certificate.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeCertificateInterfaces
Formal statement
theorem Lax109476Proofs.RamCertificateFamilies.unbounded_spec : ∀ (B M m n : ℕ) (P : Lax109476.LinearProgram.Program ℤ m n),
  1 ≤ M →
    M < B →
      m * n + 2 * m + 2 * n + 8 < B →
        (m + (m + 1)) * (n + n) + (m + (m + 1)) + (n + n) + 4 < B →
          (∀ (i : Fin m) (j : Fin n), (P.A i j).natAbs ≤ M) →
            (∀ (i : Fin m), (P.b i).natAbs ≤ M) →
              (∀ (j : Fin n), (P.c j).natAbs ≤ M) →
                Lax808846Proofs.Reasoning.Spec B (Lax109476Proofs.RamCertificateFamilies.Input P (m + (m + 1)) (n + n))
                  Lax109476Proofs.RamCertificateFamilies.unbounded
                  (fun (x τ : Lax808846Proofs.Imp.Env) =>
                    Lax109476Proofs.RamCertificateSource.Data P τ ∧
                      Lax109476Proofs.RamEquationData.Data (Lax109476Proofs.CertificateFamilyPrograms.unbounded P) τ)
                  (134 * ((m + (m + 1)) * (n + n)) + 90 * (m + (m + 1)) + 74) := by sorry
Source
https://github.com/EdouardBonnet/lax-109476/blob/0a042604c7ae1ef4cd9a4c7d82eb902f313d4864/proofs/Lax109476Proofs/RamCertificateFamilies.lean, theorem unbounded_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