Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2(c) — in N∞−(β)\mathcal N^-_\infty(\beta)N∞−​(β), ∥r∥2≤nμ\|r\|^2\le n\mu∥r∥2≤nμ; in N∞(β)\mathcal N_\infty(\beta)N∞​(β), ∥r∥∞2≤(1+β)μ\|r\|_\infty^2\le(1+\beta)\mu∥r∥∞2​≤(1+β)μ

Proved
AdaptiveStepIPM.WideNbhd.lemma_2c

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

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

Let β∈(0,1)\beta\in(0,1)β∈(0,1) and γ∈(0,1)\gamma\in(0,1)γ∈(0,1) with γ≤2(1−β)\gamma\le 2(1-\beta)γ≤2(1−β). For a pair (x,s)(x,s)(x,s) let μ=xTs/n\mu = x^Ts/nμ=xTs/n and r=(XS)−1/2(γμe−Xs)r = (XS)^{-1/2}(\gamma\mu e - Xs)r=(XS)−1/2(γμe−Xs), that is rj=(γμ−xjsj)/xjsjr_j = (\gamma\mu - x_js_j)/\sqrt{x_js_j}rj​=(γμ−xj​sj​)/xj​sj​​.

  1. If (x,s)∈N∞−(β)(x,s)\in\mathcal N^-_\infty(\beta)(x,s)∈N∞−​(β), then ∥r∥2≤nμ\|r\|^2\le n\mu∥r∥2≤nμ (Euclidean norm).
  2. If (x,s)∈N∞(β)(x,s)\in\mathcal N_\infty(\beta)(x,s)∈N∞​(β), then for each jjj
1−βμ  ≥  (γ1−β−1−β)μ  ≥  rj  ≥  (γ1+β−1+β)μ  ≥  −1+βμ,\sqrt{1-\beta}\sqrt\mu \;\ge\; \Big(\frac{\gamma}{\sqrt{1-\beta}}-\sqrt{1-\beta}\Big)\sqrt\mu \;\ge\; r_j \;\ge\; \Big(\frac{\gamma}{\sqrt{1+\beta}}-\sqrt{1+\beta}\Big)\sqrt\mu \;\ge\; -\sqrt{1+\beta}\sqrt\mu,1−β​μ​≥(1−β​γ​−1−β​)μ​≥rj​≥(1+β​γ​−1+β​)μ​≥−1+β​μ​,

so ∥r∥∞2≤(1+β)μ\|r\|_\infty^2 \le (1+\beta)\mu∥r∥∞2​≤(1+β)μ.

Combined with Lemma 1(c), part 1 bounds the second-order term by nμ/4n\mu/4nμ/4 in the wide neighbourhood, which is what gives the O(nt)O(nt)O(nt) bound of Theorem 2.

Formalization Note The four inequalities of the chain are stated separately for each coordinate jjj, together with the conclusion on ∥r∥∞2\|r\|_\infty^2∥r∥∞2​. The standing condition n≥1n\ge1n≥1 (so that μ\muμ is defined) is a hypothesis.

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

open Matrix

/-- Lemma 2(c) of Mizuno–Todd–Ye (p. 6): let `β, γ ∈ (0, 1)` with `γ ≤ 2(1 − β)`, `μ = xᵀs/n` and
`r = (XS)^{-0.5}(γμe − Xs)`. If `(x, s) ∈ N_∞⁻(β)` then `‖r‖² ≤ nμ`. Moreover, if
`(x, s) ∈ N_∞(β)` then for each `j`
`√(1−β)√μ ≥ (γ/√(1−β) − √(1−β))√μ ≥ r_j ≥ (γ/√(1+β) − √(1+β))√μ ≥ −√(1+β)√μ`,
so `‖r‖²_∞ ≤ (1 + β)μ`. -/
theorem lemma_2c {n m : ℕ} (hn : 1 ≤ n) (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (c : Fin n → ℝ) (β γ : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1) (hγ0 : 0 < γ) (hγ1 : γ < 1)
    (hγβ : γ ≤ 2 * (1 - β)) (x s : Fin n → ℝ) :
    ((x, s) ∈ NinfMinus A b c β → norm2 (rvec γ x s) ^ 2 ≤ (n : ℝ) * AdaptiveStepIPM.PredCorr.mu x s) ∧
      ((x, s) ∈ Ninf A b c β →
        (∀ j, (γ / Real.sqrt (1 - β) - Real.sqrt (1 - β)) * Real.sqrt (AdaptiveStepIPM.PredCorr.mu x s) ≤
              Real.sqrt (1 - β) * Real.sqrt (AdaptiveStepIPM.PredCorr.mu x s) ∧
            rvec γ x s j ≤ (γ / Real.sqrt (1 - β) - Real.sqrt (1 - β)) * Real.sqrt (AdaptiveStepIPM.PredCorr.mu x s) ∧
            (γ / Real.sqrt (1 + β) - Real.sqrt (1 + β)) * Real.sqrt (AdaptiveStepIPM.PredCorr.mu x s) ≤ rvec γ x s j ∧
            -(Real.sqrt (1 + β) * Real.sqrt (AdaptiveStepIPM.PredCorr.mu x s)) ≤
              (γ / Real.sqrt (1 + β) - Real.sqrt (1 + β)) * Real.sqrt (AdaptiveStepIPM.PredCorr.mu x s)) ∧
        normInf (rvec γ x s) ^ 2 ≤ (1 + β) * AdaptiveStepIPM.PredCorr.mu x s) := 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. 6, Lemma 2(c)
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