C1C^1 extensions of functions and stabilization of Glaeser refinements

  • Bo'az Klartag

    Tel-Aviv University, Israel
  • Nahum Zobin

    College of William and Mary, Williamsburg, USA


Given an arbitrary set ERnE \subset \mathbb R^n, n2n\ge 2, and a function f:ERf: E \rightarrow \mathbb R, consider the problem of extending ff to a C1C^1 function defined on the entire Rn\mathbb R^n. A procedure for determining whether such an extension exists was suggested in 1958 by G. Glaeser. In 2004 C. Fefferman proposed a related procedure for dealing with the much more difficult cases of higher smoothness. The procedures in question require iterated computations of some bundles until the bundles stabilize. How many iterations are needed? We give a sharp estimate for the number of iterations that could be required in the C1C^1 case. Some related questions are discussed.

Cite this article

Bo'az Klartag, Nahum Zobin, C1C^1 extensions of functions and stabilization of Glaeser refinements. Rev. Mat. Iberoam. 23 (2007), no. 2, pp. 635–669

DOI 10.4171/RMI/507