Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim in the proof of Lemma 7.2.1 — superlevel sets of the barrier are bounded

Proved
MatousekLP.InteriorPoint.barrier_superlevel_bounded

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

barrier-functioninterior-point-methodslinear-programmingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let AAA be a real m×nm\times nm×n matrix of rank mmm, b∈Rmb\in\mathbb{R}^mb∈Rm, c∈Rnc\in\mathbb{R}^nc∈Rn. Suppose the linear program (7.2) (maximize cTxc^{T}xcTx subject to Ax=bAx=bAx=b, x≥0x\ge 0x≥0) has a feasible solution x~>0\tilde x>0x~>0, and its dual (7.5) (minimize bTyb^{T}ybTy subject to ATy≥cA^{T}y\ge cATy≥c) has a feasible solution y~\tilde yy~​ whose slack vector s~=ATy~−c\tilde s=A^{T}\tilde y-cs~=ATy~​−c satisfies s~>0\tilde s>0s~>0. Fix μ>0\mu>0μ>0 and let fμ(x)=cTx+μ∑j=1nln⁡xjf_\mu(x)=c^{T}x+\mu\sum_{j=1}^n\ln x_jfμ​(x)=cTx+μ∑j=1n​lnxj​. Then the set

Q={x∈Rn: Ax=b, x>0, fμ(x)≥fμ(x~)}Q=\{x\in\mathbb{R}^n:\ Ax=b,\ x>0,\ f_\mu(x)\ge f_\mu(\tilde x)\}Q={x∈Rn: Ax=b, x>0, fμ​(x)≥fμ​(x~)}

is bounded.

This is the compactness step behind the existence of a maximizer of the barrier problem, and hence of the point x∗(μ)x^*(\mu)x∗(μ) of the central path.

Formalization Note x>0x>0x>0 means every coordinate is strictly positive; indices are Fin n. Boundedness is Bornology.IsBounded in the sup-norm topology of Fin n → ℝ, which is equivalent to boundedness in any norm.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_InteriorPoint_CentralPath
Formal statement
namespace MatousekLP.InteriorPoint

open Matrix

/-- Claim in the proof of Lemma 7.2.1 (Matoušek & Gärtner, p. 121). Let `A` be an `m × n`
matrix of rank `m`, let `x̃ > 0` satisfy `Ax̃ = b`, let `ỹ` satisfy `Aᵀỹ − c > 0`, and let
`μ > 0`. Then the set `Q = {x ∈ ℝⁿ : Ax = b, x > 0, f_μ(x) ≥ f_μ(x̃)}` is bounded. -/
theorem barrier_superlevel_bounded {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (c : Fin n → ℝ) (hrank : A.rank = m) (xt : Fin n → ℝ) (hxt : IsPrimalInterior A b xt)
    (yt : Fin m → ℝ) (hyt : IsDualInterior A c yt) (μ : ℝ) (hμ : 0 < μ) :
    Bornology.IsBounded
      {x : Fin n → ℝ | IsPrimalInterior A b x ∧ barrier c μ xt ≤ barrier c μ x} := by sorry

end MatousekLP.InteriorPoint
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, §7.2, p. 121, Claim in the proof of Lemma 7.2.1
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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