The Core of a 2-Dimensional Set-Valued Mapping. Existence Criteria and Efficient Algorithms for Lipschitz Selections of Low Dimensional Set-Valued Mappings

arXiv2010.04540MaRDI QIDQ6350893FDOQ6350893

Pavel Shvartsman

Publication date: 9 October 2020

Abstract: Let $mathfrakM=(mathcalM,ho)$ be a metric space and let $X$ be a Banach space. Let $F$ be a set-valued mapping from $mathcalM$ into the family ${mathcalK}_m(X)$ of all compact convex subsets of $X$ of dimension at most $m$. The main result in our recent joint paper with Charles Fefferman (which is referred to as a "Finiteness Principle for Lipschitz selections") provides efficient conditions for the existence of a Lipschitz selection of $F$, i.e., a Lipschitz mapping $f:mathcalMoX$ such that $f(x)inF(x)$ for every $xinmathcalM$. We give new alternative proofs of this result in two special cases. When $m=2$ we prove it for $$, and when $m=1$ we prove it for all choices of $X$. Both of these proofs make use of a simple reiteration formula for the "core" of a set-valued mapping $F$, i.e., for a mapping $G:mathcalMo{mathcalK}_m(X)$ which is Lipschitz with respect to the Hausdorff distance, and such that $G(x)subsetF(x)$ for all $xinmathcalM$. We also present several constructive criteria for the existence of Lipschitz selections of set-valued mappings from $mathcalM$ into the family of all closed half-planes in $$.

Mathematics Subject Classification ID

Sobolev spaces and other spaces of ``smooth functions, embedding theorems, trace theorems (46E35)

This page was built for publication: The Core of a 2-Dimensional Set-Valued Mapping. Existence Criteria and Efficient Algorithms for Lipschitz Selections of Low Dimensional Set-Valued Mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6350893)