Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.4, Case III — if x(t)x(t)x(t) enters and leaves B(0,∥x∗∥)B(0,\|x^*\|)B(0,∥x∗∥) for arbitrarily large ttt, then lim inf⁡t→+∞∥x(t)−x∗∥=0\liminf_{t\to+\infty}\|x(t)-x^*\|=0liminft→+∞​∥x(t)−x∗∥=0

Proved
TikhonovHDD.Strong.theorem_4_4_case_III

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

convex-optimizationdynamical-systemsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1tikhonov-regularization

Work under the hypotheses of Theorem 4.4. Let H\mathcal HH be a real Hilbert space, t0>0t_0>0t0​>0, α≥3\alpha\ge 3α≥3, β≥0\beta\ge 0β≥0, u0,v0∈Hu_0,v_0\in\mathcal Hu0​,v0​∈H, let ggg and ϵ\epsilonϵ satisfy the General assumption, and let xxx be a global C2C^2C2-solution of

x¨(t)+αtx˙(t)+β∇2g(x(t))x˙(t)+∇g(x(t))+ϵ(t)x(t)=0,x(t0)=u0, x˙(t0)=v0.\ddot x(t)+\frac{\alpha}{t}\dot x(t)+\beta\nabla^2 g(x(t))\dot x(t)+\nabla g(x(t))+\epsilon(t)x(t)=0,\qquad x(t_0)=u_0,\ \dot x(t_0)=v_0 .x¨(t)+tα​x˙(t)+β∇2g(x(t))x˙(t)+∇g(x(t))+ϵ(t)x(t)=0,x(t0​)=u0​, x˙(t0​)=v0​.

Assume:

  1. ∫t0+∞ϵ(t)t dt<+∞\int_{t_0}^{+\infty}\frac{\epsilon(t)}{t}\,dt<+\infty∫t0​+∞​tϵ(t)​dt<+∞;
  2. lim⁡t→+∞βϵ(t)tα3+1∫t0tϵ2(s)sα3+1 ds=0\displaystyle\lim_{t\to+\infty}\frac{\beta}{\epsilon(t)t^{\frac{\alpha}{3}+1}}\int_{t_0}^{t}\epsilon^2(s)s^{\frac{\alpha}{3}+1}\,ds=0t→+∞lim​ϵ(t)t3α​+1β​∫t0​t​ϵ2(s)s3α​+1ds=0;
  3. there exist a>1a>1a>1 and t1≥t0t_1\ge t_0t1​≥t0​ with ϵ˙(t)≤−aβ2ϵ2(t)\dot\epsilon(t)\le-\frac{a\beta}{2}\epsilon^2(t)ϵ˙(t)≤−2aβ​ϵ2(t) for every t≥t1t\ge t_1t≥t1​;
  4. if α=3\alpha=3α=3: lim⁡t→+∞t2ϵ(t)=+∞\lim_{t\to+\infty}t^2\epsilon(t)=+\inftylimt→+∞​t2ϵ(t)=+∞;
  5. if α>3\alpha>3α>3: there exists c>0c>0c>0 with t2ϵ(t)≥23α(13α−1+βc2)t^2\epsilon(t)\ge\frac23\alpha\left(\frac13\alpha-1+\beta c^2\right)t2ϵ(t)≥32​α(31​α−1+βc2) for all ttt large enough;

and let x∗x^*x∗ be the element of minimum norm of argmin⁡g\operatorname{argmin} gargming. Assume that for every T≥t0T\ge t_0T≥t0​ there exists t≥Tt\ge Tt≥T with ∥x(t)∥<∥x∗∥\|x(t)\|<\|x^*\|∥x(t)∥<∥x∗∥ and there exists s≥Ts\ge Ts≥T with ∥x∗∥≤∥x(s)∥\|x^*\|\le\|x(s)\|∥x∗∥≤∥x(s)∥. Then

lim inf⁡t→+∞∥x(t)−x∗∥=0.\liminf_{t\to+\infty}\|x(t)-x^*\|=0 .t→+∞liminf​∥x(t)−x∗∥=0.

This is the third of the three exhaustive cases into which the paper splits the proof of Theorem 4.4: the trajectory neither eventually stays inside nor eventually stays outside the ball B(0,∥x∗∥)B(0,\|x^*\|)B(0,∥x∗∥).

Formalization Note Stated for every global C2C^2C2-solution of (5) (existence is Theorem 2.1 of the paper). The conclusion lim inf⁡t→+∞∥x(t)−x∗∥=0\liminf_{t\to+\infty}\|x(t)-x^*\|=0liminft→+∞​∥x(t)−x∗∥=0 is written as: for every δ>0\delta>0δ>0, ∥x(t)−x∗∥<δ\|x(t)-x^*\|<\delta∥x(t)−x∗∥<δ for arbitrarily large ttt. This avoids Lean's Filter.liminf, which returns 000 by convention for a function tending to +∞+\infty+∞.

Preamble
import Mathlib
import Definitions.Def_TikhonovHDD_Strong_Setting

open Set Filter Topology
Formal statement
namespace TikhonovHDD.Strong

/-- Theorem 4.4, proof, Case III (p. 26): if for every `T ≥ t₀` there are `t, s ≥ T`
with `‖x(t)‖ < ‖x⋆‖ ≤ ‖x(s)‖`, then `liminf_{t→+∞} ‖x(t) − x⋆‖ = 0`, stated as: for every
`δ > 0`, `‖x(t) − x⋆‖ < δ` for arbitrarily large `t`.
Standing hypotheses (those of Theorem 4.4, arXiv:1911.12845v2, p. 21): the General
assumption, `t₀ > 0`, `α ≥ 3`, `β ≥ 0`, `x` a global `C²`-solution of (5),
`∫_{t₀}^{+∞} ε(t)/t dt < +∞`, `β/(ε(t) t^{α/3+1}) ∫_{t₀}^t ε²(s) s^{α/3+1} ds → 0`,
`ε̇(t) ≤ −(aβ/2) ε²(t)` for `t ≥ t₁` (some `a > 1`, `t₁ ≥ t₀`), for `α = 3`: `t² ε(t) → +∞`,
for `α > 3`: `t² ε(t) ≥ (2/3)α((1/3)α − 1 + βc²)` eventually (some `c > 0`), and `x⋆` the
minimum-norm element of `argmin g`. -/
theorem theorem_4_4_case_III
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (g : H → ℝ) (α β t₀ : ℝ) (ε ε' : ℝ → ℝ) (u₀ v₀ : H) (x xd xdd : ℝ → H) (xstar : H)
    (ht₀ : 0 < t₀) (hα : 3 ≤ α) (hβ : 0 ≤ β)
    (hGA : GeneralAssumption g t₀ ε ε')
    (hx : IsSolution g α β t₀ ε u₀ v₀ x xd xdd)
    (hε_int : MeasureTheory.IntegrableOn (fun t => ε t / t) (Ici t₀))
    (hε_lim : Tendsto
      (fun t => β / (ε t * t ^ (α / 3 + 1)) * ∫ s in t₀..t, ε s ^ 2 * s ^ (α / 3 + 1))
      atTop (𝓝 0))
    (hε_deriv : ∃ a > (1 : ℝ), ∃ t₁ ≥ t₀, ∀ t ≥ t₁, ε' t ≤ -(a * β / 2) * ε t ^ 2)
    (hα3 : α = 3 → Tendsto (fun t => t ^ 2 * ε t) atTop atTop)
    (hα3lt : 3 < α → ∃ c > (0 : ℝ),
      ∀ᶠ t in atTop, 2 / 3 * α * (1 / 3 * α - 1 + β * c ^ 2) ≤ t ^ 2 * ε t)
    (hxstar : IsMinNormMinimizer g xstar)
    (hin : ∀ T ≥ t₀, ∃ t ≥ T, ‖x t‖ < ‖xstar‖)
    (hout : ∀ T ≥ t₀, ∃ s ≥ T, ‖xstar‖ ≤ ‖x s‖) :
    ∀ δ > (0 : ℝ), ∃ᶠ t in atTop, ‖x t - xstar‖ < δ := by sorry

end TikhonovHDD.Strong
Source
Boţ, Csetnek, László, Tikhonov regularization of a second order dynamical system with Hessian driven damping, arXiv:1911.12845v2, §4.2, proof of Theorem 4.4, Case III, p. 26
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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