SearcharxivSearch

arXiv · 2306.09155

Definable Lipschitz selections for affine-set valued maps

Abstract

Whitney's extension problem, i.e., how one can tell whether a function $f : X \to \mathbb R$, $X \subseteq \mathbb R^n$, is the restriction of a $C^m$-function on $\mathbb R^n$, was solved in full generality by Charles Fefferman in 2006. In this paper, we settle the $C^{1,\omega}$-case of a related conjecture: given that $f$ is semialgebraic and $\omega$ is a semialgebraic modulus of continuity, if $f$ is the restriction of a $C^{1,\omega}$-function then it is the restriction of a semialgebraic $C^{1,\omega}$-function. We work in the more general setting of sets that are definable in an o-minimial expansion of the real field. An ingenious argument of Brudnyi and Shvartsman relates the existence of $C^{1,\omega}$-extensions to the existence of Lipschitz selections of certain affine-set valued maps. We show that if a definable affine-set valued map has Lipschitz selections then it also has definable Lipschitz selections. In particular, we obtain a Lipschitz solution (more generally, $\omega$-H\"older solution, for any definable modulus of continuity $\omega$) of the definable Brenner-Epstein-Hochster-Koll\'ar problem. In most of our results we have control over the respective (semi)norms.

Explore related subjects

Keep this discovery

BibTeXRIS

Adam Parusiński, Armin Rainer. 2023-06-15. Definable Lipschitz selections for affine-set valued maps. https://arxiv.org/abs/2306.09155

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO