Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.10 — iterates of a continuous MMM-Fejér map converge to a point of MMM

Proved
ShorNonsmooth.Fejer.fejer_map_iterates_converge

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

fejer-mapfixed-point-iterationp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let M⊆EnM \subseteq E_nM⊆En​ be nonempty and let φ:En→En\varphi : E_n \to E_nφ:En​→En​ be an MMM-Fejér map: φ(y)=y\varphi(y) = yφ(y)=y and ∥φ(x)−y∥<∥x−y∥\|\varphi(x) - y\| < \|x - y\|∥φ(x)−y∥<∥x−y∥ for all y∈My \in My∈M and x∉Mx \notin Mx∈/M. If φ\varphiφ is continuous, then for every starting point x0∈Enx_0 \in E_nx0​∈En​ the sequence

xk+1=φ(xk),k=0,1,…,x_{k+1} = \varphi(x_k), \qquad k = 0, 1, \dots,xk+1​=φ(xk​),k=0,1,…,

converges to an element of MMM: there is xˉ∈M\bar x \in Mxˉ∈M with xk→xˉx_k \to \bar xxk​→xˉ.

This is the basic convergence principle of Fejér-type approximations (Eremin). Polyak's method is built on the same inequality, but its map need not be continuous, so the principle does not apply to it directly.

Formalization Note MMM is any nonempty subset of EnE_nEn​ (no closedness is assumed, as in the book). The sequence is any x:N→Enx : \mathbb{N} \to E_nx:N→En​ satisfying the recursion; its first term is arbitrary.

Preamble
import Mathlib
import Definitions.Def_ShorNonsmooth_Fejer_PolyakMethod

open Filter Topology
Formal statement
namespace ShorNonsmooth.Fejer

/-- Shor (1985), p. 37, Theorem 2.10 (after Eremin [23]). If an `M`-Fejér map `φ` is
continuous, then for any starting point `x₀` the sequence generated by `x_{k+1} = φ(x_k)`,
`k = 0, 1, …`, converges to an element of `M`. -/
theorem fejer_map_iterates_converge {n : ℕ} (M : Set (EuclideanSpace ℝ (Fin n)))
    (φ : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (hφ : IsMFejer M φ) (hcont : Continuous φ)
    (x : ℕ → EuclideanSpace ℝ (Fin n)) (hx : ∀ k, x (k + 1) = φ (x k)) :
    ∃ xbar ∈ M, Tendsto x atTop (𝓝 xbar) := by sorry

end ShorNonsmooth.Fejer
Source
Shor, Minimization Methods for Non-Differentiable Functions, Springer 1985, p. 37, Theorem 2.10 (with Definition (2.31), p. 36)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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