Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(46), p. 20 — ∫_{t₀}^{t} (ε(s)/s)(h_{x*}(s) − ½(‖x*‖² − ‖x_{ε(s)}‖²)) ds ≤ C

Proved
TikhonovHDD.Ergodic.eq_46

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, α>0\alpha>0α>0, β≥0\beta\ge0β≥0, and let ggg and ϵ\epsilonϵ satisfy the General assumption. 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​,

and assume ∫t0+∞ϵ(t)t dt=+∞\int_{t_0}^{+\infty}\frac{\epsilon(t)}{t}\,dt=+\infty∫t0​+∞​tϵ(t)​dt=+∞. Let x∗x^*x∗ be the element of minimum norm of argmin⁡g\operatorname{argmin} gargming, hx∗(t)=12∥x(t)−x∗∥2h_{x^*}(t)=\tfrac12\|x(t)-x^*\|^2hx∗​(t)=21​∥x(t)−x∗∥2, and for ϵ>0\epsilon>0ϵ>0 let xϵx_\epsilonxϵ​ be the minimizer of g+ϵ2∥⋅∥2g+\frac\epsilon2\|\cdot\|^2g+2ϵ​∥⋅∥2. Then there exists C>0C>0C>0 such that

∫t0tϵ(s)s(hx∗(s)−12(∥x∗∥2−∥xϵ(s)∥2)) ds≤Cfor every t≥t0.\int_{t_0}^{t}\frac{\epsilon(s)}{s}\Big(h_{x^*}(s)-\frac12\big(\|x^*\|^2-\|x_{\epsilon(s)}\|^2\big)\Big)\,ds\le C\qquad\text{for every }t\ge t_0 .∫t0​t​sϵ(s)​(hx∗​(s)−21​(∥x∗∥2−∥xϵ(s)​∥2))ds≤Cfor every t≥t0​.

This is the last estimate of the proof of Theorem 4.2 before the l'Hospital step: dividing by ∫t0tϵ(s)s ds→+∞\int_{t_0}^t\frac{\epsilon(s)}{s}\,ds\to+\infty∫t0​t​sϵ(s)​ds→+∞ yields the ergodic convergence.

Formalization Note The curve ϵ↦xϵ\epsilon\mapsto x_\epsilonϵ↦xϵ​ is a selection required to minimize g+ϵ2∥⋅∥2g+\frac\epsilon2\|\cdot\|^2g+2ϵ​∥⋅∥2 for every ϵ>0\epsilon>0ϵ>0. The integrand evaluates it only at ϵ(s)\epsilon(s)ϵ(s), and ϵ(s)>0\epsilon(s)>0ϵ(s)>0 for every s≥t0s\ge t_0s≥t0​ under the divergence hypothesis (if ϵ(T)=0\epsilon(T)=0ϵ(T)=0, then ϵ≡0\epsilon\equiv0ϵ≡0 on [T,+∞)[T,+\infty)[T,+∞) and the integral would converge). The divergence hypothesis is stated as ∫t0Tϵ(t)t dt→+∞\int_{t_0}^{T}\frac{\epsilon(t)}{t}\,dt\to+\infty∫t0​T​tϵ(t)​dt→+∞ as T→+∞T\to+\inftyT→+∞. The integrals are oriented integrals over [t0,t][t_0,t][t0​,t]; the integrand is continuous there.

Preamble
import Mathlib
import Definitions.Def_TikhonovHDD_Ergodic_TikhonovCurve
import Definitions.Def_TikhonovHDD_Ergodic_Setting

open Set Filter Topology MeasureTheory
Formal statement
namespace TikhonovHDD.Ergodic

/-- (46), §4.1, p. 20 (proof of Theorem 4.2): under the hypotheses of Theorem 4.2 there is
`C > 0` with
`∫_{t₀}^{t} ε(s)/s (h_{x⋆}(s) − ½(‖x⋆‖² − ‖x_{ε(s)}‖²)) ds ≤ C` for every `t ≥ t₀`,
where `x_e` is the Tikhonov approximation curve. -/
theorem eq_46 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (g : H → ℝ) (α β t₀ : ℝ) (ε ε' : ℝ → ℝ) (u₀ v₀ : H) (x xd xdd : ℝ → H) (xstar : H)
    (xε : ℝ → 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)
    (hxε : ∀ e > 0, IsTikhonovPoint g e (xε e)) :
    ∃ C > 0, ∀ t ≥ t₀,
      ∫ s in t₀..t, ε s / s * (hFun x xstar s - 1 / 2 * (‖xstar‖ ^ 2 - ‖xε (ε s)‖ ^ 2))
        ≤ C := by sorry

end TikhonovHDD.Ergodic
Source
Boţ, Csetnek, László, Tikhonov regularization of a second order dynamical system with Hessian driven damping, arXiv:1911.12845v2, p. 20, §4.1, proof of Theorem 4.2, (46)
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