Related papers: A Sard theorem for Tame Set-Valued mappings

Continuity of set-valued maps is hereby revisited: after recalling some basic concepts of variational analysis and a short description of the State-of-the-Art, we obtain as by-product two Sard type results concerning local minima of scalar…

We present a theorem of Sard type for semi-algebraic set-valued mappings whose graphs have dimension no larger than that of their range space: the inverse of such a mapping admits a single-valued analytic localization around any pair in the…

The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…

We show that if $X$ is an $m$-dimensional definable set in $\mathbb{R}^\text{pow}_\text{an}$, the structure of real subanalytic sets with real power maps added, then for any positive integer r there exists a $C^r$-parameterization of X…

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

Let $f:M^m\to N^n$ be a smooth map between two differential manifolds with $N$ connected, $f(M)$ closed and $f(M)\neq N$. In this short note, we show that either all the points of $M$ are critical points of $f$ or the dimension the…

Sard's theorem asserts that the set of critical values of a smooth map from one Euclidean space to another one has measure zero. A version of this result for infinite-dimensional Banach manifolds was proven by Smale for maps with Fredholm…

Examples exist of extended-real-valued closed functions on ${\bf R}^n$ whose subdifferentials (in the standard, limiting sense) have large graphs. By contrast, if such a function is semi-algebraic, then its subdifferential graph must have…

We work with semi-algebraic functions on arbitrary real closed fields. We generalize the notion of critical values and prove a Sard type theorem in our framework.

The classical Morse--Sard theorem claims that for a mapping $v:\mathbb R^n\to\mathbb R^{m+1}$ of class $C^k$ the measure of critical values $v(Z_{v,m})$ is zero under condition $k\ge n-m$. Here the critical set, or $m$-critical set is…

In Carnot-Caratheodory or sub-Riemannian geometry, one of the major open problems is whether the conclusions of Sard's theorem holds for the endpoint map, a canonical map from an infinite-dimensional path space to the underlying…

Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…

In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all…

To give characterizations of monotonically countably paracompact spaces with set-valued maps, Yamazaki [22] introduced the notion of strictly increasing closed cover of a topological space with which the boundedness of a set-valued map was…

In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to…

We prove a new Morse-Sard type theorem for the asymptotic critical values of semi-algebraic mappings and a new fibration theorem at infinity for $C^2$ mappings. We show the equivalence of three different types of regularity conditions which…

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…

Let $X\subset\Bbb C^n$ be an affine variety and $f:X\to\Bbb C^m$ be the restriction to $X$ of a polynomial map $\Bbb C^n\to\Bbb C^m$. In this paper, we construct an affine Whitney stratification of $X$. The set $K(f)$ of stratified…

A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k < n$, if the removal of any $k$ vertices results in a graph with a perfect matching. $1$- and $2$-factor-critical graphs are the well-known factor-critical and…

A finite subset $M \subset \mathbb{R}^d$ is basic, if for any function $f \colon M \to \mathbb{R}$ there exists a collection of functions $f_1, \ldots, f_d \colon \mathbb{R} \to \mathbb{R}$ such that for each element $(x_1, \ldots, x_d)\in…