Proposition 2 — φ(y_n, z_n) → 0 with one sequence bounded implies y_n − z_n → 0
ProvedProximalBanach.Hybrid.prop2_sub_tendsto_zeroduality-mappingp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1uniformly-convex
Let be a uniformly convex and smooth real Banach space with duality mapping , and let . Let , be sequences in . If and either or is bounded, then
This is how the paper converts convergence of into strong convergence, both for and for the final step of Theorem 8.
Formalization Note is a function with for all . Boundedness is boundedness of the range of the sequence.
Preamble
import Mathlib import Definitions.Def_ProximalBanach_Hybrid_Basic
Formal statement
namespace ProximalBanach.Hybrid
open Filter Topology
variable {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E]
/-- Proposition 2 (p. 940): in a uniformly convex smooth Banach space, if
`φ(y_n, z_n) → 0` and either `{y_n}` or `{z_n}` is bounded, then `y_n - z_n → 0`. -/
theorem prop2_sub_tendsto_zero [UniformConvexSpace E] (hS : IsSmooth E)
(J : E → StrongDual ℝ E) (hJ : ∀ x, J x ∈ dualityMap x) (y z : ℕ → E)
(hφ : Tendsto (fun n => phi J (y n) (z n)) atTop (𝓝 0))
(hb : Bornology.IsBounded (Set.range y) ∨ Bornology.IsBounded (Set.range z)) :
Tendsto (fun n => y n - z n) atTop (𝓝 0) := by sorry
end ProximalBanach.Hybrid
Source
Kamimura and Takahashi, Strong convergence of a proximal-type algorithm in a Banach space, SIAM J. Optim. 13(3), 2003, p. 940, Proposition 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.