pith. sign in

arxiv: 1603.02323 · v1 · pith:GBBGLUO6new · submitted 2016-03-07 · 🧮 math.FA · math.CA

Finitness Principles for Smooth Selection

classification 🧮 math.FA math.CA
keywords mathbbselectionleftprinciplesrightbrudyni-shvartsmancaseconjecture
0
0 comments X
read the original abstract

In this paper we prove finiteness principles for $C^{m}\left( \mathbb{R}^{n}, \mathbb{R}^{D}\right) $-selection, and for $C^{m-1,1}\left( \mathbb{R}^{n}, \mathbb{R}^{D}\right) $-selection, in particular providing a proof for a conjecture of Brudyni-Shvartsman (1994) on Lipschitz selections for the case when the domain is $X = \mathbb{R}^n$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.