Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 — g(x(t))→min⁡gg(x(t))\to\min gg(x(t))→ming under condition (a) or (b) on the Tikhonov parameter, for α≥3\alpha\ge 3α≥3

Proved
TikhonovHDD.Strong.theorem_3_1

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

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

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, and let ggg and ϵ\epsilonϵ satisfy the General assumption: ggg convex, twice Fréchet differentiable, with gradient Lipschitz continuous on bounded sets and argmin⁡g≠∅\operatorname{argmin} g\neq\emptysetargming=∅; ϵ:[t0,+∞)→[0,+∞)\epsilon:[t_0,+\infty)\to[0,+\infty)ϵ:[t0​,+∞)→[0,+∞) nonincreasing, of class C1C^1C1, with ϵ(t)→0\epsilon(t)\to0ϵ(t)→0. 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 that one of the following conditions holds:

  1. (a) ∫t0+∞ϵ(t)t dt<+∞\int_{t_0}^{+\infty}\frac{\epsilon(t)}{t}\,dt<+\infty∫t0​+∞​tϵ(t)​dt<+∞, and there exist a>1a>1a>1 and t1≥t0t_1\ge t_0t1​≥t0​ such that ϵ˙(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​;
  2. (b) there exist a>0a>0a>0 and t1≥t0t_1\ge t_0t1​≥t0​ such that ϵ(t)≤at\epsilon(t)\le\frac{a}{t}ϵ(t)≤ta​ for every t≥t1t\ge t_1t≥t1​.

Then

lim⁡t→+∞g(x(t))=min⁡g.\lim_{t\to+\infty}g(x(t))=\min g .t→+∞lim​g(x(t))=ming.

The theorem says that the objective values along the trajectory are minimizing as soon as the Tikhonov parameter either decays slowly in the sense of (a) or at least as fast as 1/t1/t1/t. In the proof of Theorem 4.4 it supplies g(x(t))→min⁡gg(x(t))\to\min gg(x(t))→ming in the case where the trajectory eventually stays inside the ball B(0,∥x∗∥)B(0,\|x^*\|)B(0,∥x∗∥).

Formalization Note The theorem is stated for every global C2C^2C2-solution of (5); existence and uniqueness of that solution is Theorem 2.1 of the paper. Finiteness of ∫t0+∞ϵ(t)/t dt\int_{t_0}^{+\infty}\epsilon(t)/t\,dt∫t0​+∞​ϵ(t)/tdt is integrability of t↦ϵ(t)/tt\mapsto\epsilon(t)/tt↦ϵ(t)/t on [t0,+∞)[t_0,+\infty)[t0​,+∞). min⁡g\min gming is the infimum of the range of ggg, attained because argmin⁡g≠∅\operatorname{argmin} g\neq\emptysetargming=∅.

Preamble
import Mathlib
import Definitions.Def_TikhonovHDD_Strong_Setting

open Set Filter Topology
Formal statement
namespace TikhonovHDD.Strong

/-- Theorem 3.1 (arXiv:1911.12845v2, pp. 5–6). Under the General assumption, let `x` be a
global `C²`-solution of (5) with `t₀ > 0`, `α ≥ 3`, `β ≥ 0`. If either
(a) `∫_{t₀}^{+∞} ε(t)/t dt < +∞` and `ε̇(t) ≤ −(aβ/2) ε²(t)` for all `t ≥ t₁`, for some `a > 1`,
`t₁ ≥ t₀`; or
(b) `ε(t) ≤ a/t` for all `t ≥ t₁`, for some `a > 0`, `t₁ ≥ t₀`,
then `g(x(t)) → min g` as `t → +∞`. -/
theorem theorem_3_1
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (g : H → ℝ) (α β t₀ : ℝ) (ε ε' : ℝ → ℝ) (u₀ v₀ : H) (x xd xdd : ℝ → H)
    (ht₀ : 0 < t₀) (hα : 3 ≤ α) (hβ : 0 ≤ β)
    (hGA : GeneralAssumption g t₀ ε ε')
    (hx : IsSolution g α β t₀ ε u₀ v₀ x xd xdd)
    (hcond :
      (MeasureTheory.IntegrableOn (fun t => ε t / t) (Ici t₀) ∧
        ∃ a > (1 : ℝ), ∃ t₁ ≥ t₀, ∀ t ≥ t₁, ε' t ≤ -(a * β / 2) * ε t ^ 2) ∨
      (∃ a > (0 : ℝ), ∃ t₁ ≥ t₀, ∀ t ≥ t₁, ε t ≤ a / t)) :
    Tendsto (fun t => g (x t)) atTop (𝓝 (minValue g)) := 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, pp. 5–6, Theorem 3.1
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