Coercivity Step 1: Extract Component Bounds from Lyapunov Definition #
From L_n = (f(x_n) - f⋆) + ½‖u_n‖² + λ‖Pv_n‖², we directly read off:
- f(x_n) - f⋆ ≤ L_n
- ‖u_n‖² ≤ 2 L_n
- ‖P v_n‖² ≤ L_n / λ
Then from u_n = P⊥v_n + √μ' e_n (triangle inequality): A_n := ‖P⊥v_n‖ ≤ ‖u_n‖ + √μ'‖e_n‖ ≤ √(2L_n) + B_n
And T_n := ‖P v_n‖ ≤ √(L_n/λ).
theorem
PLAcceleratedNesterovLean.gap_le_lyapunovOfState_of_sqrt_le
{d : ℕ}
(P : E d →L[ℝ] E d)
(μ' : ℝ)
(π : E d → E d)
(f : E d → ℝ)
(η : ℝ)
(s : NesterovState d)
(ha_le1 : √(μ' * η) ≤ 1)
:
Variant: gap ≤ L when λ ≥ 0 (weak inequality, handles a = 1 edge case). Unfolds the Lyapunov definition directly; requires √(μ'·η) ≤ 1. State-based version: works for arbitrary NesterovState.
theorem
PLAcceleratedNesterovLean.gap_le_lyapunov_of_sqrt_le
{d : ℕ}
(P : E d →L[ℝ] E d)
(μ' : ℝ)
(π : E d → E d)
(f : E d → ℝ)
(η ρ : ℝ)
(x₁ : E d)
(n : ℕ)
(ha_le1 : √(μ' * η) ≤ 1)
:
Variant: gap ≤ L when λ ≥ 0 (weak inequality, handles a = 1 edge case). Unfolds the Lyapunov definition directly; requires √(μ'·η) ≤ 1.