Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2 case (b.2), first bullet, p. 493 — if bᵀx* = 0, v = u + τx* has vᵀx* ≠ 0 and vᵀ(A + λ*I)v < 0 for the stated τ < 0

Proved
TaoAnDCA.Restart.restart_case_b2_zero

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

kuhn-tuckernegative-curvaturep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1restarttrust-region

Let AAA be a real symmetric n×nn\times nn×n matrix, b∈Rnb\in\mathbb R^nb∈Rn, r>0r>0r>0, and let x∗x^*x∗ be a Kuhn–Tucker point of min⁡{12⟨x,Ax⟩+⟨b,x⟩:∥x∥≤r}\min\{\tfrac12\langle x,Ax\rangle+\langle b,x\rangle:\|x\|\le r\}min{21​⟨x,Ax⟩+⟨b,x⟩:∥x∥≤r} with multiplier λ∗\lambda^*λ∗ and ∥x∗∥=r\|x^*\|=r∥x∗∥=r. Let u∈Rnu\in\mathbb R^nu∈Rn satisfy uT(A+λ∗I)u<0u^T(A+\lambda^*I)u<0uT(A+λ∗I)u<0 and uTx∗=0u^Tx^*=0uTx∗=0, assume bTx∗=0b^Tx^*=0bTx∗=0, and put v=u+τx∗v=u+\tau x^*v=u+τx∗. Then:

  1. if bTu≤0b^Tu\le0bTu≤0, then vTx∗≠0v^Tx^*\ne0vTx∗=0 and vT(A+λ∗I)v<0v^T(A+\lambda^*I)v<0vT(A+λ∗I)v<0 for every τ<0\tau<0τ<0;
  2. if bTu>0b^Tu>0bTu>0, then vTx∗≠0v^Tx^*\ne0vTx∗=0 and vT(A+λ∗I)v<0v^T(A+\lambda^*I)v<0vT(A+λ∗I)v<0 for every τ\tauτ with
0>τ>uT(A+λ∗I)u2 bTu.0>\tau>\frac{u^T(A+\lambda^*I)u}{2\,b^Tu}.0>τ>2bTuuT(A+λ∗I)u​.

Such a vvv is the direction with which case (b.1) is re-entered when ∥x∗∥=r\|x^*\|=r∥x∗∥=r and uTx∗=0u^Tx^*=0uTx∗=0.

Formalization Note The page prints the range in item 2 as 0>τ>uT(A+λ∗I)u/bTu0>\tau>u^T(A+\lambda^*I)u/b^Tu0>τ>uT(A+λ∗I)u/bTu, without the factor 222. With bTx∗=0b^Tx^*=0bTx∗=0 the curvature is −2τ bTu+uT(A+λ∗I)u-2\tau\,b^Tu+u^T(A+\lambda^*I)u−2τbTu+uT(A+λ∗I)u, so the correct bound carries the factor 2, and the printed range is false for a general uuu (take uT(A+λ∗I)u=−1u^T(A+\lambda^*I)u=-1uT(A+λ∗I)u=−1, bTu=1b^Tu=1bTu=1, τ=−0.9\tau=-0.9τ=−0.9: the curvature is +0.8+0.8+0.8). The statement uses the corrected bound. It takes a general uuu with negative curvature rather than the eigenvector of §4.2: for an eigenvector uuu with uTx∗=0u^Tx^*=0uTx∗=0 one has bTu=−(λ1+λ∗)uTx∗=0b^Tu=-(\lambda_1+\lambda^*)u^Tx^*=0bTu=−(λ1​+λ∗)uTx∗=0, so item 2 would be vacuous.

Preamble
import Mathlib
import Definitions.Def_TaoAnDCA_Restart_Setting
Formal statement
namespace TaoAnDCA.Restart

theorem restart_case_b2_zero {n : ℕ} (A : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)) (hA : IsSelfAdjoint A)
    (b : EuclideanSpace ℝ (Fin n)) (r : ℝ) (hr : 0 < r)
    (xs : EuclideanSpace ℝ (Fin n)) (lamStar : ℝ) (hkkt : TaoAnDCA.TRS.IsKKT A b r xs lamStar) (hnorm : ‖xs‖ = r)
    (u : EuclideanSpace ℝ (Fin n)) (hu : inner ℝ u (A u + lamStar • u) < 0) (hux : inner ℝ u xs = 0)
    (hb : inner ℝ b xs = 0) :
    (inner ℝ b u ≤ 0 → ∀ τ : ℝ, τ < 0 →
        inner ℝ (u + τ • xs) xs ≠ 0 ∧
          inner ℝ (u + τ • xs) (A (u + τ • xs) + lamStar • (u + τ • xs)) < 0) ∧
      (0 < inner ℝ b u → ∀ τ : ℝ, inner ℝ u (A u + lamStar • u) / (2 * inner ℝ b u) < τ → τ < 0 →
        inner ℝ (u + τ • xs) xs ≠ 0 ∧
          inner ℝ (u + τ • xs) (A (u + τ • xs) + lamStar • (u + τ • xs)) < 0) := by sorry

end TaoAnDCA.Restart
Source
Pham Dinh & Le Thi, A d.c. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim. 8 (1998), p. 493, §4.2, case (b.2), first bullet
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