Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6, first bullet — the Mizuno–Todd–Ye predictor estimate for α∈[0,8−1/4/n^]\alpha\in[0,8^{-1/4}/\sqrt{\hat n}]α∈[0,8−1/4/n^​]

Proved
SelfDualLP.Complexity.mty_predictor_bullet

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

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

Let n^≥1\hat n\ge1n^≥1 and let x^,s^,d^x,d^s∈Rn^\hat x,\hat s,\hat d_x,\hat d_s\in\mathbb R^{\hat n}x^,s^,d^x​,d^s​∈Rn^ satisfy (14) with γ=0\gamma=0γ=0:

x^>0,s^>0,X^d^s+S^d^x=−X^s^,d^xTd^s=0,\hat x>0,\quad \hat s>0,\quad \hat X\hat d_s+\hat S\hat d_x=-\hat X\hat s,\quad \hat d_x^T\hat d_s=0,x^>0,s^>0,X^d^s​+S^d^x​=−X^s^,d^xT​d^s​=0,

where X^=diag⁡(x^)\hat X=\operatorname{diag}(\hat x)X^=diag(x^), S^=diag⁡(s^)\hat S=\operatorname{diag}(\hat s)S^=diag(s^). Put μ^=x^Ts^/n^\hat\mu=\hat x^T\hat s/\hat nμ^​=x^Ts^/n^, x^(α)=x^+αd^x\hat x(\alpha)=\hat x+\alpha\hat d_xx^(α)=x^+αd^x​, s^(α)=s^+αd^s\hat s(\alpha)=\hat s+\alpha\hat d_ss^(α)=s^+αd^s​ and μ^(α)=x^(α)Ts^(α)/n^\hat\mu(\alpha)=\hat x(\alpha)^T\hat s(\alpha)/\hat nμ^​(α)=x^(α)Ts^(α)/n^. If ∥X^s^−μ^e∥≤14μ^\|\hat X\hat s-\hat\mu e\|\le\frac14\hat\mu∥X^s^−μ^​e∥≤41​μ^​, then for every α∈[0, 8−1/4/n^]\alpha\in[0,\,8^{-1/4}/\sqrt{\hat n}]α∈[0,8−1/4/n^​]:

x^(α)>0,s^(α)>0,∥X^(α)s^(α)−μ^(α)e∥≤12μ^(α),μ^(α)=(1−α)μ^.\hat x(\alpha)>0,\quad \hat s(\alpha)>0,\quad \|\hat X(\alpha)\hat s(\alpha)-\hat\mu(\alpha)e\|\le\tfrac12\hat\mu(\alpha),\quad \hat\mu(\alpha)=(1-\alpha)\hat\mu .x^(α)>0,s^(α)>0,∥X^(α)s^(α)−μ^​(α)e∥≤21​μ^​(α),μ^​(α)=(1−α)μ^​.

This is the step-length estimate that yields the factor 1−8−1/4/n+11-8^{-1/4}/\sqrt{n+1}1−8−1/4/n+1​ per predictor step.

Formalization Note ∥⋅∥\|\cdot\|∥⋅∥ is the Euclidean norm, written out as a square root of a sum of squares; the exponent 8−.258^{-.25}8−.25 of the paper is 8−1/48^{-1/4}8−1/4 (real power). The equation of (14) is stated componentwise, with γ=0\gamma=0γ=0 written explicitly.

Preamble
import Mathlib
import Definitions.Def_SelfDualLP_Complexity_Neighborhood

open Matrix
Formal statement
namespace SelfDualLP.Complexity

/-- Proof of Theorem 6, first bullet (p. 62), the Mizuno–Todd–Ye predictor estimate. Let
`n̂ ≥ 1` and let `x̂, ŝ, d̂_x, d̂_s ∈ ℝ^{n̂}` satisfy (14) with `γ = 0`: `x̂ > 0`, `ŝ > 0`,
`X̂d̂_s + Ŝd̂_x = −X̂ŝ`, `d̂_xᵀd̂_s = 0`. Write `μ̂ = x̂ᵀŝ/n̂`, `x̂(α) = x̂ + αd̂_x`,
`ŝ(α) = ŝ + αd̂_s`, `μ̂(α) = x̂(α)ᵀŝ(α)/n̂`. If `‖X̂ŝ − μ̂e‖ ≤ (1/4)μ̂` then for every
`α ∈ [0, 8^{−1/4}/√n̂]`: `x̂(α) > 0`, `ŝ(α) > 0`, `‖X̂(α)ŝ(α) − μ̂(α)e‖ ≤ (1/2)μ̂(α)` and
`μ̂(α) = (1 − α)μ̂`. -/
theorem mty_predictor_bullet {N : ℕ} (hN : 1 ≤ N) (x s dx ds : Fin N → ℝ)
    (hx : ∀ j, 0 < x j) (hs : ∀ j, 0 < s j)
    (hnewton : ∀ j, x j * ds j + s j * dx j = -(x j * s j - 0 * muHat x s))
    (horth : dx ⬝ᵥ ds = 0)
    (hcent : deviationHat x s ≤ (1 / 4) * muHat x s) :
    ∀ α : ℝ, 0 ≤ α → α ≤ (8 : ℝ) ^ (-(1 / 4 : ℝ)) / Real.sqrt N →
      (∀ j, 0 < (x + α • dx) j) ∧ (∀ j, 0 < (s + α • ds) j) ∧
      deviationHat (x + α • dx) (s + α • ds) ≤ (1 / 2) * muHat (x + α • dx) (s + α • ds) ∧
      muHat (x + α • dx) (s + α • ds) = (1 - α) * muHat x s := by sorry

end SelfDualLP.Complexity
Source
Ye, Todd, Mizuno, An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm, Math. Oper. Res. 19(1) (1994), p. 62, proof of Theorem 6, first bullet (with (14) on p. 61)
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