§4.2 case (b.2), second bullet, p. 493 — if bᵀx* < 0, v = u + τx* has vᵀx* ≠ 0 and vᵀ(A + λ*I)v < 0 for τ₁ < τ < 0
ProvedTaoAnDCA.Restart.restart_case_b2_negLet be a real symmetric matrix, , , and let be a Kuhn–Tucker point of with multiplier and . Let satisfy and , and assume . Let
Then , is the smallest root of the polynomial , and for every with the vector satisfies and .
Together with the first bullet this supplies, when and , a direction with which case (b.1) is re-entered.
Formalization Note The page defines as "the smallest root of the second degree polynomial" and then prints , with unbalanced brackets and the sign of reversed. The statement uses the smallest root, which is the formula above (check: , , gives roots , smallest , while the printed formula gives ). The two agree when , the case of an eigenvector . The radicand is positive under the hypotheses. As in the first bullet, is a general vector of negative curvature.
import Mathlib import Definitions.Def_TaoAnDCA_Restart_Setting
namespace TaoAnDCA.Restart
theorem restart_case_b2_neg {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) :
let τ₁ : ℝ := (Real.sqrt (inner ℝ b u ^ 2 + inner ℝ b xs * inner ℝ u (A u + lamStar • u))
- inner ℝ b u) / inner ℝ b xs
τ₁ < 0 ∧
-(inner ℝ b xs) * τ₁ ^ 2 - 2 * inner ℝ b u * τ₁ + inner ℝ u (A u + lamStar • u) = 0 ∧
(∀ τ : ℝ, -(inner ℝ b xs) * τ ^ 2 - 2 * inner ℝ b u * τ + inner ℝ u (A u + lamStar • u) = 0 →
τ₁ ≤ τ) ∧
∀ τ : ℝ, τ₁ < τ → τ < 0 →
inner ℝ (u + τ • xs) xs ≠ 0 ∧
inner ℝ (u + τ • xs) (A (u + τ • xs) + lamStar • (u + τ • xs)) < 0 := by sorry
end TaoAnDCA.Restart
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.