Smooth selection for infinite sets (Q2166341)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7574801
Language Label Description Also known as
default for all languages
No label defined
    English
    Smooth selection for infinite sets
    scientific article; zbMATH DE number 7574801

      Statements

      Smooth selection for infinite sets (English)
      0 references
      0 references
      24 August 2022
      0 references
      The paper under review is related to the classical Whitney problem. Given a compact subset \(E\subseteq \mathbb{R}^n\) and given \(f:E\to C^m(\mathbb{R})\), how can we tell if there exists \(F\in C^m(\mathbb{R}^n)\) such that \(f=F|_E\)? More specifically, the authors deal with the following related problems. Problem 1.1. Given a closed subset \(E\subseteq \mathbb{R}^n\) and given \(f:E\to \mathbb{R}\), how can we tell if there exists \(F\in C^m(\mathbb{R}^n)\) such that \(F\geq 0\) and \(f=F|_E\)? Problem 1.2. Given \(n,m\in\mathbb{N}\), extended real numbers \(-\infty\leq \lambda_1\leq \lambda_2\leq \infty\) and a closed subset \(E\subseteq \mathbb{R}^n\), and given \(f:E\to [\lambda_1,\lambda_2]\cap \mathbb{R}\), how can we tell if there exists \(F\in C^m(\mathbb{R}^n)\) such that \(\lambda_1\leq F\leq \lambda_2\) and \(f=F|_E\)? The authors study a more general problem in order to give solutions to the Problems~1.1 and~1.2. The 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\).
      0 references
      Whitney problems
      0 references
      smooth selection
      0 references
      linear system
      0 references
      range-restricted extension
      0 references
      nonnegative extension
      0 references
      Glaeser refinement
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references