Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Projection onto a translate: PK(x)(y)=m(x)+PK~(y−m(x))P_{K(x)}(y)=m(x)+P_{\tilde K}(y-m(x))PK(x)​(y)=m(x)+PK~​(y−m(x)) for K(x)=m(x)+K~K(x)=m(x)+\tilde KK(x)=m(x)+K~

Proved
ChanPangGQVI.Contraction.proj_translate

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-analysisp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1projection

Let K~⊆Rn\tilde K\subseteq\mathbb R^nK~⊆Rn be a nonempty closed convex set, let m:Rn→Rnm:\mathbb R^n\to\mathbb R^nm:Rn→Rn be any mapping, and put K(x)=m(x)+K~K(x)=m(x)+\tilde KK(x)=m(x)+K~. Write PS(z)P_S(z)PS​(z) for the projection (Euclidean nearest point) of zzz on SSS. Then for any vectors xxx and yyy,

PK(x)(y)=m(x)+PK~(y−m(x)).P_{K(x)}(y)=m(x)+P_{\tilde K}\bigl(y-m(x)\bigr).PK(x)​(y)=m(x)+PK~​(y−m(x)).

Projecting on a translated set is the same as translating back, projecting on K~\tilde KK~ and translating again. This reduces the Lipschitz analysis of FλF_\lambdaFλ​ to that of the single projection PK~P_{\tilde K}PK~​.

Formalization Note The hypotheses on K~\tilde KK~ (nonempty, closed, convex) are the standing hypotheses of Theorem 5.3, under which the display is stated in the paper; they guarantee that both projections are the unique nearest points. No hypothesis on mmm is needed.

Preamble
import Mathlib
import Definitions.Def_ChanPangGQVI_Shared_Projection
import Definitions.Def_ChanPangGQVI_Contraction_ProjectionMap
Formal statement
namespace ChanPangGQVI.Contraction

/-- Chan and Pang 1982, §5, proof of Theorem 5.3, first display (p. 221): for
`K(x) = m(x) + K̃` with `K̃` a nonempty closed convex set (the standing hypothesis of
Theorem 5.3) and any point-to-point `m`, for any vectors `x` and `y`,
`P_{K(x)}(y) = m(x) + P_{K̃}(y - m(x))`. -/
theorem proj_translate {n : ℕ}
    (m : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (Ktil : Set (EuclideanSpace ℝ (Fin n)))
    (hK_ne : Ktil.Nonempty) (hK_closed : IsClosed Ktil) (hK_convex : Convex ℝ Ktil)
    (x y : EuclideanSpace ℝ (Fin n)) :
    ChanPangGQVI.Shared.proj (Kmap m Ktil x) y =
      m x + ChanPangGQVI.Shared.proj Ktil (y - m x) := by sorry

end ChanPangGQVI.Contraction
Source
Chan and Pang, The generalized quasi-variational inequality problem, Math. Oper. Res. 7 (1982), p. 221, §5, proof of Theorem 5.3, first display
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me