Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(16) — one step of Algorithm 3 decreases ψ\psiψ by at least (3n2θ2−/(βγ)−n)log⁡11−β(3n^2\theta_2^-/(\beta\gamma) - n)\log\frac{1}{1-\beta}(3n2θ2−​/(βγ)−n)log1−β1​

Proved
AdaptiveStepIPM.Potential.eq_16

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

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

Let n≥1n \ge 1n≥1, β,γ∈(0,1)\beta, \gamma \in (0,1)β,γ∈(0,1) with γ≤2(1−β)\gamma \le 2(1-\beta)γ≤2(1−β), and ρ=n+(3βγ(1−γ)log⁡11−β)n2\rho = n + \bigl(\frac{3}{\beta\gamma(1-\gamma)}\log\frac{1}{1-\beta}\bigr)n^2ρ=n+(βγ(1−γ)3​log1−β1​)n2. Let (x,s)∈N∞−(β)(x, s) \in \mathcal N_\infty^-(\beta)(x,s)∈N∞−​(β) with μ=xTs/n\mu = x^Ts/nμ=xTs/n, let d=(dx,dy,ds)d = (d_x, d_y, d_s)d=(dx​,dy​,ds​) be a solution of system (2) at (x,s)(x,s)(x,s) with parameter γ\gammaγ, and let x(θ)=x+θdxx(\theta) = x + \theta d_xx(θ)=x+θdx​, s(θ)=s+θdss(\theta) = s + \theta d_ss(θ)=s+θds​. Let θˉ\bar\thetaθˉ be a step of Algorithm 3: (x(θˉ),s(θˉ))∈N∞−(β)(x(\bar\theta), s(\bar\theta)) \in \mathcal N_\infty^-(\beta)(x(θˉ),s(θˉ))∈N∞−​(β) and ψ(x(θˉ),s(θˉ))≤ψ(x(θ),s(θ))\psi(x(\bar\theta), s(\bar\theta)) \le \psi(x(\theta), s(\theta))ψ(x(θˉ),s(θˉ))≤ψ(x(θ),s(θ)) for every real θ\thetaθ with (x(θ),s(θ))∈N∞−(β)(x(\theta), s(\theta)) \in \mathcal N_\infty^-(\beta)(x(θ),s(θ))∈N∞−​(β). With θ2−=min⁡{1,βγμ/∥Pq∥∞−}\theta_2^- = \min\{1, \beta\gamma\mu/\|Pq\|_\infty^-\}θ2−​=min{1,βγμ/∥Pq∥∞−​} as in Lemma 5,

ψ(x(θˉ),s(θˉ))−ψ(x,s)≤−(3n2θ2−βγ−n)log⁡11−β.(16)\psi(x(\bar\theta), s(\bar\theta)) - \psi(x, s) \le -\Bigl(\frac{3n^2\theta_2^-}{\beta\gamma} - n\Bigr)\log\frac{1}{1-\beta}. \tag{16}ψ(x(θˉ),s(θˉ))−ψ(x,s)≤−(βγ3n2θ2−​​−n)log1−β1​.(16)

This is the potential-decrease estimate behind Theorem 3 and Corollary 3: a large step bound θ2−\theta_2^-θ2−​, i.e. a small second-order term PqPqPq, gives a large decrease of ψ\psiψ.

Formalization Note ψ\psiψ is LinearOptimization.interiorPointPotential with parameter ρ\rhoρ; all points at which it is evaluated lie in N∞−(β)\mathcal N_\infty^-(\beta)N∞−​(β), so are strictly positive. θ2−:=1\theta_2^- := 1θ2−​:=1 when ∥Pq∥∞−=0\|Pq\|_\infty^- = 0∥Pq∥∞−​=0. The statement is self-contained: the admissibility of θ2−\theta_2^-θ2−​ (Lemma 5 of the paper) is part of what is to be proved.

Preamble
import Mathlib
import Definitions.Def_LinearOptimization_InteriorPointPotential
import Definitions.Def_AdaptiveStepIPM_Potential_Algorithm3

open Matrix
Formal statement
namespace AdaptiveStepIPM.Potential

/-- **(16), proof of Theorem 3, p. 12.** Let `β, γ ∈ (0, 1)` with `γ ≤ 2(1 − β)`,
`ρ = n + (3/(βγ(1 − γ)) log(1/(1 − β))) n²`, `(x, s) ∈ N_∞⁻(β)`, `d` a solution of (2) at
`(x, s)` with `γ`, and `θ̄` an Algorithm 3 step: `(x(θ̄), s(θ̄)) ∈ N_∞⁻(β)` and `θ̄` minimises
`ψ(x(θ), s(θ))` over all `θ` with `(x(θ), s(θ)) ∈ N_∞⁻(β)`. Then
`ψ(x(θ̄), s(θ̄)) − ψ(x, s) ≤ −(3n²θ₂⁻/(βγ) − n) log(1/(1 − β))`. -/
theorem eq_16 {m n : ℕ} (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 → ℝ) (hN : InNinfMinus A b c β x s)
    (dx : Fin n → ℝ) (dy : Fin m → ℝ) (ds : Fin n → ℝ)
    (hd : IsNewtonDirection A γ x s dx dy ds) (θbar : ℝ)
    (hθN : InNinfMinus A b c β (lineStep x dx θbar) (lineStep s ds θbar))
    (hθmin : ∀ θ : ℝ, InNinfMinus A b c β (lineStep x dx θ) (lineStep s ds θ) →
      LinearOptimization.interiorPointPotential (rho n β γ)
          (lineStep x dx θbar) (lineStep s ds θbar) ≤
        LinearOptimization.interiorPointPotential (rho n β γ)
          (lineStep x dx θ) (lineStep s ds θ)) :
    LinearOptimization.interiorPointPotential (rho n β γ)
          (lineStep x dx θbar) (lineStep s ds θbar) -
        LinearOptimization.interiorPointPotential (rho n β γ) x s ≤
      -(3 * (n : ℝ) ^ 2 * theta2Minus β γ x s dx ds / (β * γ) - n) *
        Real.log (1 / (1 - β)) := by sorry

end AdaptiveStepIPM.Potential
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. 12, proof of Theorem 3, (16)
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