Abstract

We show how Lasry–Lions's result on regularization of functions defined on Rn or on Hilbert spaces by sup–inf convolutions with squares of distances can be extended to (finite or infinite dimensional) Riemannian manifolds M of bounded sectional curvature. More specifically, among other things we show that if the sectional curvature K of M satisfies −K0≤K≤K0 on M for some K0>0, and if the injectivity and convexity radii of M are strictly positive, then every bounded, uniformly continuous function f:M→R can be uniformly approximated by globally C1,1 functions defined by(fλ)μ=supz∈M⁡infy∈M⁡{f(y)+12λd(z,y)2−12μd(x,z)2} as λ,μ→0+, with 0<μ<λ/2. Our definition of (global) C1,1 smoothness is intrinsic and natural, and it reduces to the usual one in flat spaces, but we warn the reader that, in the noncompact case, this definition differs from other notions of (rather local) C1,1 smoothness that have been recently used by other authors (based on charts). The importance of this regularization method lies (rather than on the degree of smoothness obtained) on the fact that the correspondence f↦(fλ)μ is explicit and preserves many significant geometrical properties that the given functions f may have, such as invariance by a set of isometries, infima, sets of minimizers, ordering, local or global Lipschitzness, and (only when one additionally assumes that K≤0) local or global convexity. We also give two examples showing that this result completely fails, even for (nonflat) Cartan–Hadamard manifolds, whenever f or K are not bounded.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.