Finiteness principles for smooth selection (Q2628929)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finiteness principles for smooth selection
scientific article

    Statements

    Finiteness principles for smooth selection (English)
    0 references
    0 references
    0 references
    0 references
    19 July 2016
    0 references
    The authors prove finiteness principles for \(C^m(\mathbb{R}^n,\mathbb{R}^D)\) - selection, and for \(C^{m-1,1}(\mathbb{R}^n,\mathbb{R}^D)\) - selection. In particular, they provide a proof for the conjecture of \textit{Y. Brudnyi} and \textit{P. Shvartsman} [Int. Math. Res. Not. 1994, No. 3, 129--139 (1994; Zbl 0845.57022)] on Lipschitz selections for the case when the domain is \(X=\mathbb{R}^n\). The paper is organized into four sections as follows : Introduction, Shape Fields and Their Refinements (shape fields, polynomials basis, the transport lemma), The Main Lemma (statement, the base case, setup for the induction step, Calderón-Zygmund decomposition, auxiliary polynomials, good news about \(CZ\) cubes, local interpolants, completing the induction), Applications (finiteness principles I and II). Other papers of the first author connected to this topic are [Ann. Math. (2) 161, No. 1, 509--577 (2005; Zbl 1102.58005); Ann. Math. (2) 164, No. 1, 313--359 (2006; Zbl 1109.58016); Rev. Mat. Iberoam. 21, No. 2, 577--688 (2005; Zbl 1102.58004); Bull. Am. Math. Soc., New Ser. 46, No. 2, 207--220 (2009; Zbl 1207.58011)] (with \textit{B.Klartag}) [Ann. Math. (2) 169, No. 1, 315--346 (2009; Zbl 1175.41001); Rev. Mat. Iberoam. 25, No. 1, 49--273 (2009; Zbl 1170.65006); erratum ibid. 28, No. 4, 1193 (2012)].
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    shape fields
    0 references
    polynomials basis
    0 references
    Calderón-Zygmund decomposition
    0 references
    Taylor polynomial
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references