Skip to main navigation Skip to search Skip to main content

Smooth selection for infinite sets

Fushuai Jiang*, Garving K. Luli, Kevin O'Neill

*Corresponding author for this work

Research output: Journal Publications and Reviews โ€บ RGC 21 - Publication in refereed journal โ€บ peer-review

Abstract

Whitney's extension problem asks the following: Given a compact set ๐ธย โŠ‚ โ„๐‘›ย and a function ฦ’ : ๐ธ โ†’ โ„, how can we tell whether there exists ๐น โˆˆ ๐ถ๐‘šย (โ„๐‘›) such that ๐น = ฦ’ on ๐ธ? A 2006 theorem of Charles Fefferman [6] answers this question in its full generality.ย 

In this paper, we establish a version of this theorem adapted for variants of the Whitney extension problem, including nonnegative extensions and the smooth selection problems. Among other things, we generalize the Finiteness Principle for smooth selection by Fefferman-Israel-Luli [9] to the setting of infinite sets.ย 

Our main result is stated in terms of the iterated Glaeser refinement of a bundle formed by taking potential Taylor polynomials at each point of E. In particular, we show that such bundles (and any bundles with closed, convex fibers) stabilize after a bounded number of Glaeser refinements, thus strengthening the previous results of Glaeser, Bierstone-Milman-Pawล‚ucki, and Fefferman which only hold for bundles with affine fibers.ย ยฉ 2022 Elsevier Inc.

Original languageEnglish
Article number108566
JournalAdvances in Mathematics
Volume407
Online published16 Jul 2022
DOIs
Publication statusPublished - 8 Oct 2022
Externally publishedYes

Research Keywords

  • Glaeser refinement
  • Linear system
  • Nonnegative extension
  • Range-restricted extension
  • Smooth selection
  • Whitney problems

Fingerprint

Dive into the research topics of 'Smooth selection for infinite sets'. Together they form a unique fingerprint.

Cite this