Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1(b) — −∥r∥2/4≤pjqj≤rj2/4-\|r\|^2/4 \le p_jq_j \le r_j^2/4−∥r∥2/4≤pj​qj​≤rj2​/4 for each jjj

Proved
AdaptiveStepIPM.WideNbhd.lemma_1b

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

interior-point-methodslinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let x,s∈Rnx,s\in\mathbb R^nx,s∈Rn be positive, γ∈[0,1]\gamma\in[0,1]γ∈[0,1], μ=xTs/n\mu = x^Ts/nμ=xTs/n, and let (dx,dy,ds)(d_x,d_y,d_s)(dx​,dy​,ds​) solve the Newton system (2)

Sdx+Xds=γμe−Xs,Adx=0,ATdy+ds=0.Sd_x + Xd_s = \gamma\mu e - Xs,\qquad Ad_x = 0,\qquad A^Td_y + d_s = 0 .Sdx​+Xds​=γμe−Xs,Adx​=0,ATdy​+ds​=0.

With the scaled vectors (6), pj=sj/xj (dx)jp_j = \sqrt{s_j/x_j}\,(d_x)_jpj​=sj​/xj​​(dx​)j​, qj=xj/sj (ds)jq_j=\sqrt{x_j/s_j}\,(d_s)_jqj​=xj​/sj​​(ds​)j​, rj=(γμ−xjsj)/xjsjr_j = (\gamma\mu - x_js_j)/\sqrt{x_js_j}rj​=(γμ−xj​sj​)/xj​sj​​, and ∥⋅∥\|\cdot\|∥⋅∥ the Euclidean norm, for each jjj

−∥r∥24  ≤  pjqj  ≤  rj24.-\frac{\|r\|^2}{4} \;\le\; p_jq_j \;\le\; \frac{r_j^2}{4}.−4∥r∥2​≤pj​qj​≤4rj2​​.

The product pjqjp_jq_jpj​qj​ is the jjj-th component of the second-order term DxdsD_xd_sDx​ds​ of Newton's method; this componentwise bound is the source of every step-length estimate in the paper.

Formalization Note The paper states the lemma for (x,s)(x,s)(x,s) in a neighbourhood N⊂F0\mathcal N\subset\mathcal F^0N⊂F0; only x,s>0x,s>0x,s>0 is assumed here. ∥r∥2\|r\|^2∥r∥2 is the square of the explicitly defined ℓ2\ell_2ℓ2​ norm.

Preamble
import Mathlib
import Definitions.Def_AdaptiveStepIPM_WideNbhd_Neighborhoods
import Definitions.Def_AdaptiveStepIPM_WideNbhd_Algorithm2
Formal statement
namespace AdaptiveStepIPM.WideNbhd

open Matrix

/-- Lemma 1(b) of Mizuno–Todd–Ye (p. 5): for a solution `d` of (2) at `x, s > 0` with
`γ ∈ [0, 1]`, and `p, q, r` as in (6), `−‖r‖²/4 ≤ p_j q_j ≤ r_j²/4` for each `j`
(`‖·‖` the `ℓ₂` norm). -/
theorem lemma_1b {n m : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (x s : Fin n → ℝ)
    (hx : ∀ j, 0 < x j) (hs : ∀ j, 0 < s j) (γ : ℝ) (hγ0 : 0 ≤ γ) (hγ1 : γ ≤ 1)
    (dx : Fin n → ℝ) (dy : Fin m → ℝ) (ds : Fin n → ℝ) (hd : IsDirection A x s γ dx dy ds)
    (j : Fin n) :
    -(norm2 (rvec γ x s) ^ 2 / 4) ≤ pvec x s dx j * qvec x s ds j ∧
      pvec x s dx j * qvec x s ds j ≤ rvec γ x s j ^ 2 / 4 := by sorry

end AdaptiveStepIPM.WideNbhd
Source
Mizuno, Todd, Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Cornell ORIE Technical Report No. 944 (1990, rev. 1991), p. 5, Lemma 1(b)
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