Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.1, p. 46 — contraction principle on V_ε with the bound (2.5): ‖x(p) − x‖ ≤ (1 − λδ)⁻¹‖Φ_p(x) − x‖

Proved
RobinsonSR.IFT.contraction_principle_ball

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

banach-spacecontraction-principlefixed-pointp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let XXX be a real Banach space, x0∈Xx_0\in Xx0​∈X, ρ>0\rho>0ρ>0, and VεV_\varepsilonVε​ the closed ball of radius ρ\rhoρ about x0x_0x0​. Let Φ:X→X\Phi:X\to XΦ:X→X map VεV_\varepsilonVε​ into itself and satisfy, for some κ\kappaκ with 0≤κ<10\le\kappa<10≤κ<1,

∥Φ(x1)−Φ(x2)∥≤κ∥x1−x2∥(x1,x2∈Vε).\|\Phi(x_1)-\Phi(x_2)\|\le\kappa\|x_1-x_2\|\qquad(x_1,x_2\in V_\varepsilon).∥Φ(x1​)−Φ(x2​)∥≤κ∥x1​−x2​∥(x1​,x2​∈Vε​).

Then Φ\PhiΦ has a unique fixed point xpx_pxp​ in VεV_\varepsilonVε​, and for each x∈Vεx\in V_\varepsilonx∈Vε​

∥xp−x∥≤(1−κ)−1∥Φ(x)−x∥.(2.5)\|x_p-x\|\le(1-\kappa)^{-1}\|\Phi(x)-x\|. \tag{2.5}∥xp​−x∥≤(1−κ)−1∥Φ(x)−x∥.(2.5)

In the proof of Theorem 2.1 this is applied with Φ=Φp\Phi=\Phi_pΦ=Φp​ and κ=λδ\kappa=\lambda\deltaκ=λδ; the fixed point is the solution x(p)x(p)x(p), and (2.5) is the bound from which (2.4) follows.

Formalization Note XXX is assumed complete. The page applies the contraction principle on VεV_\varepsilonVε​ in a space it calls only normed; on a closed ball of an incomplete space the principle can fail, so completeness is the hypothesis under which the principle, as invoked, holds. Theorem 2.1 itself is stated without completeness. The values of Φ\PhiΦ off VεV_\varepsilonVε​ play no role, and uniqueness is among fixed points in VεV_\varepsilonVε​.

Preamble
import Mathlib
Formal statement
namespace RobinsonSR.IFT

/-- Proof of Theorem 2.1, p. 46, the contraction principle as invoked there: a self-map `Φ` of
the closed ball `V_ε = closedBall x₀ ρ` (`ρ > 0`) of a Banach space that is a contraction with
modulus `κ ∈ [0, 1)` on it has a unique fixed point `x_p ∈ V_ε`, and
`‖x_p − x‖ ≤ (1 − κ)⁻¹ ‖Φ x − x‖` for every `x ∈ V_ε` (bound (2.5), with `κ = λδ`). -/
theorem contraction_principle_ball {X : Type*} [NormedAddCommGroup X] [NormedSpace ℝ X]
    [CompleteSpace X] (x0 : X) (rho : ℝ) (hrho : 0 < rho) (Φ : X → X)
    (hmaps : Set.MapsTo Φ (Metric.closedBall x0 rho) (Metric.closedBall x0 rho))
    (kappa : ℝ) (hk0 : 0 ≤ kappa) (hk1 : kappa < 1)
    (hcontr : ∀ x₁ ∈ Metric.closedBall x0 rho, ∀ x₂ ∈ Metric.closedBall x0 rho,
      ‖Φ x₁ - Φ x₂‖ ≤ kappa * ‖x₁ - x₂‖) :
    ∃ xp ∈ Metric.closedBall x0 rho, Φ xp = xp ∧
      (∀ z ∈ Metric.closedBall x0 rho, Φ z = z → z = xp) ∧
      ∀ x ∈ Metric.closedBall x0 rho, ‖xp - x‖ ≤ (1 - kappa)⁻¹ * ‖Φ x - x‖ := by sorry

end RobinsonSR.IFT
Source
Robinson, Strongly regular generalized equations, Math. Oper. Res. 5 (1980), p. 46, proof of Theorem 2.1, (2.5)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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