Theorem 4.2 — strong ergodic convergence to the minimum-norm minimizer when ∫ ε(t)/t dt = +∞
ProvedTikhonovHDD.Ergodic.theorem_4_2Let be a real Hilbert space, , , and let and satisfy the General assumption: is convex, twice Fréchet differentiable, with gradient Lipschitz continuous on bounded sets and ; is nonincreasing, of class , with . Let be a global -solution of
Assume
and let be the element of minimum norm of the nonempty closed convex set . If , then
When the Tikhonov parameter decays slowly enough that diverges, the trajectory converges strongly in this weighted ergodic sense to the minimum-norm minimizer, extending the corresponding result for the system without Hessian damping.
Formalization Note The statement is made for every global -solution; existence and uniqueness are Theorem 2.1 of the paper. The hypothesis is the theorem's own and replaces the standing of (5). Divergence of the integral is as . The ergodic average is written with the reciprocal of , which vanishes for only at (the divergence hypothesis forces on ); the value there does not affect the limit. "" is stated as: for every there are arbitrarily large with .
import Mathlib import Definitions.Def_TikhonovHDD_Ergodic_TikhonovCurve import Definitions.Def_TikhonovHDD_Ergodic_Setting open Set Filter Topology MeasureTheory
namespace TikhonovHDD.Ergodic
/-- Theorem 4.2 (p. 18): if `∫_{t₀}^{+∞} ε(t)/t dt = +∞` and `α > 0`, every global
`C²`-solution of (5) converges strongly in the ergodic sense to the minimum-norm element `x⋆`
of `argmin g`:
`(∫_{t₀}^{t} ε(s)/s ds)⁻¹ ∫_{t₀}^{t} ε(s)/s ‖x(s) − x⋆‖² ds → 0`, and
`lim inf_{t → +∞} ‖x(t) − x⋆‖ = 0` (stated as: for every `δ > 0`, `‖x(t) − x⋆‖ < δ` for
arbitrarily large `t`). -/
theorem theorem_4_2 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
[CompleteSpace H]
(g : H → ℝ) (α β t₀ : ℝ) (ε ε' : ℝ → ℝ) (u₀ v₀ : H) (x xd xdd : ℝ → H) (xstar : H)
(ht₀ : 0 < t₀) (hα : 0 < α) (hβ : 0 ≤ β)
(hg : GeneralAssumptionG g) (hε : GeneralAssumptionEps t₀ ε ε')
(hx : IsSolution g α β ε t₀ u₀ v₀ x xd xdd)
(hdiv : Tendsto (fun T => ∫ t in t₀..T, ε t / t) atTop atTop)
(hxstar : TikhonovHDD.Strong.IsMinNormMinimizer g xstar) :
Tendsto (fun t => (∫ s in t₀..t, ε s / s)⁻¹ * ∫ s in t₀..t, ε s / s * ‖x s - xstar‖ ^ 2)
atTop (𝓝 0) ∧
∀ δ > 0, ∃ᶠ t in atTop, ‖x t - xstar‖ < δ := by sorry
end TikhonovHDD.Ergodic
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.