Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.2, pp. 15–16 — retractors give retractions

Proved
ProjLikeRetr.Retractor.retractor_gives_retraction

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

implicit-function-theoremp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1retractionretractorriemannian-optimizationsubmanifold

Let M\mathcal MM be a ddd-dimensional submanifold of class CkC^kCk (k≥2k\ge2k≥2) of an nnn-dimensional Euclidean space E\mathcal EE, and let DDD be a retractor on M\mathcal MM (Definition 4.1). For (x,u)(x,u)(x,u) in the tangent bundle TM\mathrm T\mathcal MTM, let D(x,u)=x+u+D(x,u)\mathcal D(x,u)=x+u+D(x,u)D(x,u)=x+u+D(x,u) and let R(x,u)R(x,u)R(x,u) be the set of points of M∩D(x,u)\mathcal M\cap\mathcal D(x,u)M∩D(x,u) nearest to x+ux+ux+u. Then RRR is a retraction on M\mathcal MM. Precisely: for every xˉ∈M\bar x\in\mathcal Mxˉ∈M there is a map rrr such that

R(x,u)={r(x,u)}for all (x,u)∈TM near (xˉ,0),R(x,u)=\{r(x,u)\}\quad\text{for all }(x,u)\in\mathrm T\mathcal M\text{ near }(\bar x,0),R(x,u)={r(x,u)}for all (x,u)∈TM near (xˉ,0),

and rrr is a retraction on M\mathcal MM around xˉ\bar xxˉ (Definition 2.1). In particular RRR maps a neighbourhood of (xˉ,0)(\bar x,0)(xˉ,0) in TM\mathrm T\mathcal MTM to singletons.

The retraction RRR is called the retraction induced by DDD. The theorem turns the construction of retractions — the basic tool of Newton and gradient methods on matrix manifolds — into the choice of a smooth field of admissible directions transverse to the tangent space; the orthographic retraction (D=NM(x)D=\mathrm N_{\mathcal M}(x)D=NM​(x)) and the projective retraction (D=NM(PM(x+u))D=\mathrm N_{\mathcal M}(P_{\mathcal M}(x+u))D=NM​(PM​(x+u))) are special cases.

Formalization Note "Near (xˉ,0)(\bar x,0)(xˉ,0) in TM\mathrm T\mathcal MTM" is the filter NTM(xˉ,0)\mathcal N_{\mathrm T\mathcal M}(\bar x,0)NTM​(xˉ,0) (neighbourhoods within TM\mathrm T\mathcal MTM). The singleton claim is an equality of sets, so it also asserts that R(x,u)R(x,u)R(x,u) is nonempty. DDD is a total map into subspaces of E\mathcal EE; the retractor hypothesis only constrains it near the zero section.

Preamble
import Mathlib
import Definitions.Def_ProjLikeRetr_Retractor_IsSubmanifold
import Definitions.Def_ProjLikeRetr_Retractor_tangentBundle
import Definitions.Def_ProjLikeRetr_Retractor_IsRetraction
import Definitions.Def_ProjLikeRetr_Retractor_IsRetractor
import Definitions.Def_ProjLikeRetr_Retractor_retractorR

open Filter Topology
Formal statement
namespace ProjLikeRetr.Retractor

/-- Theorem 4.2, pp. 15–16 (retractors give retractions). Let `M` be a `d`-dimensional `C^k`
submanifold (`k ≥ 2`) of the Euclidean space `E` and `D` a retractor on `M`. For every
`x̄ ∈ M`, the set `R(x, u)` of points of `M ∩ (x + u + D(x, u))` nearest to `x + u` is a
singleton `{r(x, u)}` for all `(x, u)` of `TM` near `(x̄, 0)`, and `r` is a retraction on `M`
around `x̄`. Hence `R` is a retraction on `M`. -/
theorem retractor_gives_retraction {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    [FiniteDimensional ℝ E] (k d : ℕ) (M : Set E) (D : E × E → Submodule ℝ E)
    (hk : 2 ≤ k) (hM : IsSubmanifold k d M) (hD : IsRetractor k d M D) :
    ∀ xbar ∈ M, ∃ r : E × E → E,
      (∀ᶠ p in 𝓝[tangentBundle M] (xbar, 0), retractorR M D p = {r p}) ∧
      IsRetractionAt k M r xbar := by sorry

end ProjLikeRetr.Retractor
Source
Absil & Malick, Projection-like retractions on matrix manifolds, HAL hal-00651608v2, pp. 15–16, Theorem 4.2
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