Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cramer's-rule coefficient bound for a supporting inequality

Proved
KarpPapadimitriou.SmallFacial.cramer_bound

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

integer-programminglinear-algebrap2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-combinatorics

Let n≥1n\ge1n≥1 and x≥1x\ge1x≥1. Suppose an integral (n−1)×n(n-1)\times n(n−1)×n matrix WWW has linearly independent rows, each entry of absolute value at most 2x2x2x, and an integral vector v0v_0v0​ has entries of absolute value at most xxx. There is a nonzero integral normal fff satisfying Wf=0Wf=0Wf=0. Its coordinates and the intercept g=f⋅v0g=f\cdot v_0g=f⋅v0​ obey

∣fi∣≤(2nx)n,∣g∣≤(2nx)n.|f_i|\le(2nx)^n,\qquad |g|\le(2nx)^n.∣fi​∣≤(2nx)n,∣g∣≤(2nx)n.

This is the coefficient estimate used at the end of the proof of Lemma 1.

Formalization Note The paper's rows vi−v0v_i-v_0vi​−v0​ can have magnitude 2x2x2x, so that is the bound on entries of WWW. The positive hypotheses on nnn and xxx cover the degenerate determinant case; the bound remains the paper's (2nx)n(2nx)^n(2nx)n.

Preamble
import Mathlib
import Definitions.Def_KarpPapadimitriou_SmallFacial_COP
Formal statement
namespace KarpPapadimitriou.SmallFacial

/-- pp. 6–7, proof of Lemma 1: bounded integral normals from `n-1` independent rows. -/
theorem cramer_bound (n x : ℕ) (hn : 1 ≤ n) (hx : 1 ≤ x)
    (W : Matrix (Fin (n - 1)) (Fin n) ℤ) (v₀ : Fin n → ℤ)
    (hW : LinearIndependent ℚ (fun i : Fin (n - 1) => fun j : Fin n => (W i j : ℚ)))
    (hWb : ∀ i j, (W i j).natAbs ≤ 2 * x)
    (hv : ∀ j, (v₀ j).natAbs ≤ x) :
    ∃ f : Fin n → ℤ,
      f ≠ 0 ∧
      (∀ i, (∑ j, W i j * f j) = 0) ∧
      (∀ j, (f j).natAbs ≤ (2 * n * x) ^ n) ∧
      (∑ j, f j * v₀ j).natAbs ≤ (2 * n * x) ^ n := by sorry

end KarpPapadimitriou.SmallFacial
Source
Karp & Papadimitriou, MIT/LCS/TM-154 (Feb. 1980), pp. 6–7, proof of Lemma 1, Cramer's-rule normal and final coefficient bound; https://dspace.mit.edu/server/api/core/bitstreams/eb122126-c312-4445-a8d2-153e3e7d285f/content
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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