Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Kirszbraun’s Theorem via an Explicit Formula

View through CrossRef
AbstractLet $X,Y$ be two Hilbert spaces, let E be a subset of $X,$ and let $G\colon E \to Y$ be a Lipschitz mapping. A famous theorem of Kirszbraun’s states that there exists $\tilde {G} : X \to Y$ with $\tilde {G}=G$ on E and $ \operatorname {\mathrm {Lip}}(\tilde {G})= \operatorname {\mathrm {Lip}}(G).$ In this note we show that in fact the function $\tilde {G}:=\nabla _Y( \operatorname {\mathrm {conv}} (g))( \cdot , 0)$, where $$\begin{align*}g(x,y) = \inf_{z \in E} \Big\lbrace \langle G(z), y \rangle + \frac{\operatorname{\mathrm{Lip}}(G)}{2} \|(x-z,y)\|^2 \Big\rbrace + \frac{\operatorname{\mathrm{Lip}}(G)}{2}\|(x,y)\|^2, \end{align*}$$defines such an extension. We apply this formula to get an extension result for strongly biLipschitz mappings. Related to the latter, we also consider extensions of $C^{1,1}$ strongly convex functions.
Title: Kirszbraun’s Theorem via an Explicit Formula
Description:
AbstractLet $X,Y$ be two Hilbert spaces, let E be a subset of $X,$ and let $G\colon E \to Y$ be a Lipschitz mapping.
A famous theorem of Kirszbraun’s states that there exists $\tilde {G} : X \to Y$ with $\tilde {G}=G$ on E and $ \operatorname {\mathrm {Lip}}(\tilde {G})= \operatorname {\mathrm {Lip}}(G).
$ In this note we show that in fact the function $\tilde {G}:=\nabla _Y( \operatorname {\mathrm {conv}} (g))( \cdot , 0)$, where $$\begin{align*}g(x,y) = \inf_{z \in E} \Big\lbrace \langle G(z), y \rangle + \frac{\operatorname{\mathrm{Lip}}(G)}{2} \|(x-z,y)\|^2 \Big\rbrace + \frac{\operatorname{\mathrm{Lip}}(G)}{2}\|(x,y)\|^2, \end{align*}$$defines such an extension.
We apply this formula to get an extension result for strongly biLipschitz mappings.
Related to the latter, we also consider extensions of $C^{1,1}$ strongly convex functions.

Related Results

Theoretical study of laser-cooled SH<sup>–</sup> anion
Theoretical study of laser-cooled SH<sup>–</sup> anion
The potential energy curves, dipole moments, and transition dipole moments for the <inline-formula><tex-math id="M13">\begin{document}${{\rm{X}}^1}{\Sigma ^ + }$\end{do...
Revisiting near-threshold photoelectron interference in argon with a non-adiabatic semiclassical model
Revisiting near-threshold photoelectron interference in argon with a non-adiabatic semiclassical model
<sec> <b>Purpose:</b> The interaction of intense, ultrashort laser pulses with atoms gives rise to rich non-perturbative phenomena, which are encoded within th...
Formula Tolerance in Postbreastfed and Exclusively Formula-fed Infants
Formula Tolerance in Postbreastfed and Exclusively Formula-fed Infants
Objective.  Perceived intolerance to infant formula is a frequently reported reason for formula switching. Formula intolerance may be related to perceived symptom...
Λc Physics at BESIII
Λc Physics at BESIII
In 2014 BESIII collected a data sample of 567 [Formula: see text] at [Formula: see text] = 4.6 GeV, which is just above the [Formula: see text] pair production threshold. By analyz...
FORMULASI FORMULA ENTERAL BLENDERIZED NON MILK BASED
FORMULASI FORMULA ENTERAL BLENDERIZED NON MILK BASED
ABSTRACTBackground: Hospital enteral formula with lactose-free content is still rare, meanwhile lactose-free enteral food is needed, especially with patients who have lactose intol...
Strong vb-dominating and vb-independent sets of a graph
Strong vb-dominating and vb-independent sets of a graph
Let [Formula: see text] be a graph. A vertex [Formula: see text] strongly (weakly) b-dominates block [Formula: see text] if [Formula: see text] ([Formula: see text]) for every vert...
Classification of spatial Lp AF algebras
Classification of spatial Lp AF algebras
We define spatial [Formula: see text] AF algebras for [Formula: see text], and prove the following analog of the Elliott AF algebra classification theorem. If [Formula: see text] a...
Independent semitotal domination excellent graphs
Independent semitotal domination excellent graphs
A dominating set [Formula: see text] of vertices of a graph [Formula: see text] with no isolated vertices is an independent semitotal dominating set of [Formula: see text] if it is...

Back to Top