Projection onto a translate: for
ProvedChanPangGQVI.Contraction.proj_translateconvex-analysisp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1projection
Let be a nonempty closed convex set, let be any mapping, and put . Write for the projection (Euclidean nearest point) of on . Then for any vectors and ,
Projecting on a translated set is the same as translating back, projecting on and translating again. This reduces the Lipschitz analysis of to that of the single projection .
Formalization Note The hypotheses on (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 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.