Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1, p. 152 — Hk+1=∣xk+1−xk∣/2H_{k+1}=|x_{k+1}-x_k|/2Hk+1​=∣xk+1​−xk​∣/2 and pk+1=−∣xk+1−xk∣2sgn⁡(xk+1)p_{k+1}=-\frac{|x_{k+1}-x_k|}{2}\operatorname{sgn}(x_{k+1})pk+1​=−2∣xk+1​−xk​∣​sgn(xk+1​)

Proved
NonsmoothQN.Secant.secant_H_and_direction

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quasi-newtonsecant-method

Run the secant method on f(x)=∣x∣f(x)=|x|f(x)=∣x∣ with the inexact line search of §5.1, from any x0x_0x0​ and any H0>0H_0>0H0​>0. For every kkk with xk≠0x_k\ne0xk​=0 and xk+1≠0x_{k+1}\ne0xk+1​=0, the inverse Hessian approximation given by the secant equation and the next search direction are

Hk+1=∣xk+1−xk∣2,pk+1=−∣xk+1−xk∣2 sgn⁡(xk+1),H_{k+1}=\frac{|x_{k+1}-x_k|}{2},\qquad p_{k+1}=-\frac{|x_{k+1}-x_k|}{2}\,\operatorname{sgn}(x_{k+1}),Hk+1​=2∣xk+1​−xk​∣​,pk+1​=−2∣xk+1​−xk​∣​sgn(xk+1​),

and the iterates alternate in sign: xkxk+1<0x_kx_{k+1}<0xk​xk+1​<0.

So the search direction always points back across zero with length half the distance to the previous iterate; this is what reduces the method to a bisection scheme.

Formalization Note The page assumes the setting of Algorithm 2.1, where H0H_0H0​ is positive definite, i.e. H0>0H_0>0H0​>0; this is the only hypothesis. The conditions xk≠0≠xk+1x_k\ne0\ne x_{k+1}xk​=0=xk+1​ are the page's ("providing xk≠0≠xk+1x_k\ne0\ne x_{k+1}xk​=0=xk+1​"); a run with xk=0x_k=0xk​=0 has already stopped.

Preamble
import Mathlib
import Definitions.Def_NonsmoothQN_Secant_Basic
import Definitions.Def_NonsmoothQN_Secant_Expansion
Formal statement
namespace NonsmoothQN.Secant

theorem secant_H_and_direction (x₀ H₀ : ℝ) (hH₀ : 0 < H₀) (k : ℕ)
    (hk : secX x₀ H₀ k ≠ 0) (hk1 : secX x₀ H₀ (k + 1) ≠ 0) :
    secH x₀ H₀ (k + 1) = |secX x₀ H₀ (k + 1) - secX x₀ H₀ k| / 2 ∧
    secP x₀ H₀ (k + 1) =
      -(|secX x₀ H₀ (k + 1) - secX x₀ H₀ k| / 2) * Real.sign (secX x₀ H₀ (k + 1)) ∧
    secX x₀ H₀ k * secX x₀ H₀ (k + 1) < 0 := by sorry

end NonsmoothQN.Secant
Source
Lewis, Overton, Nonsmooth optimization via quasi-Newton methods, Math. Program. Ser. A 141 (2013) 135–163, p. 152, §5.1, first display
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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