Searcharxiv⌕ Search

arXiv · math/0301367

On the structure of level sets of uniform and Lipschitz quotient mappings from ${\mathbb{R}}^n$ to ${\mathbb{R}}$

Abstract

We study two questions posed by Johnson, Lindenstrauss, Preiss, and Schechtman, concerning the structure of level sets of uniform and Lipschitz quotient maps from $R^n\to R$. We show that if $f:R^n\to R$, $n\geq 2$, is a uniform quotient map then for every $t\in R$, $f^{-1}(t)$ has a bounded number of components, each component of $f^{-1}(t)$ separates $R^n$ and the upper bound of the number of components depends only on $n$ and the moduli of co-uniform and uniform continuity of $f$. Next we obtain a characterization of the form of any closed, hereditarily locally connected, locally compact, connected set with no end points and containing no simple closed curve, and we apply it to describe the structure of level sets of co-Lipschitz uniformly continuous mappings $f:R^2\to R$. We prove that all level sets of any co-Lipschitz uniformly continuous map from $R^2$ to $R$ are locally connected, and we show that for every pair of a constant $c>0$ and a function $Ω$ with $\lim_{r\to 0}Ω(r)=0$, there exists a natural number $M=M(c,Ω)$, so that for every co-Lipschitz uniformly continuous map $f:R^2\to R$ with a co-Lipschitz constant $c$ and a modulus of uniform continuity $Ω$, there exists a natural number $n(f)\le M$ and a finite set $T_f\subset R$ with $\card(T_f)\leq n(f)-1$ so that for all $t\in R\setminus T_f$, $f^{-1}(t)$ has exactly $n(f)$ components, $R^2\setminus f^{-1}(t)$ has exactly $n(f)+1$ components and each component of $f^{-1}(t)$ is homeomorphic with the real line and separates the plane into exactly 2 components. The number and form of components of $f^{-1}(s)$ for $s\in T_f$ are also described - they have a finite graph structure. We give an example of a uniform quotient map from $R^2\to R$ which has non-locally connected level sets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Beata Randrianantoanina. 2003-01-31. On the structure of level sets of uniform and Lipschitz quotient mappings from ${\mathbb{R}}^n$ to ${\mathbb{R}}$. https://arxiv.org/abs/math/0301367

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

KEEP EXPLORING

Related papers

On a characterization of spaces satisfying open mapping and equivalent theorems

We study open-mapping, continuous-inverse and closed-graph properties for maps whose domain and range belong to the same class of Hausdorff topological vector spaces. Quotient and graph stability imply equivalence of these properties. In the locally convex setting, we characterize barrelled infra-Pták spaces and barrelled Pták spaces as largest classes determined by the closed-graph property, Banach test spaces and appropriate nearly-open image conditions.

math.FA↗

A family of matrix flows converging to normal matrices

The celebrated Antezana-Pujals-Stojanoff Theorem states that the iterated Aluthge transforms of an arbitrary matrix converge to a normal matrix. We introduce a family of matrix flows that share this convergence property by defining them through ordinary differential equations. The family includes a continuous analogue of the Aluthge transform, as well as a differential equation discussed by Haagerup in the context of II$_1$ factors. We also examine the same type of flows in the setting of Hilbert space operators equipped with unitarily invariant norms.

math.FA↗

A Novel Two-Parameter Penalty: Relaxation Degree Analysis and Sparse Signal Recovery

In this article, we introduce a nonconvex two-parameter penalty function $P_{a,p}$, parameterized by $a\in(0,\infty)$ and $p\in(0,1]$, and the relaxation degree RD$_P$ for a separable nonconvex penalty function $P$. Based on $P_{a,p}$, we further propose the $P_{a,p}$ minimization framework for sparse signal recovery. This framework generalizes the TL1 minimization model established by S. Zhang and J. Xin (corresponding to the special case $p=1$) and provides a unified family of nonconvex penalty functions for sparse signal recovery. Using the sparse convex-combination technique, we establish both exact and stable sparse signal recovery under the restricted isometry property (RIP). To efficiently solve the resulting nonconvex optimization problem, we apply a modified iteratively re-weighted least squares method and the difference of convex functions algorithm (DCA) to develop the IRLSTLp algorithm for unconstrained $P_{a,p}$ minimization and prove some convergence results. Finally, numerical experiments compare recovery and runtime against single- and double-loop baselines, examine sensitivity to $(a,p)$, and assess the empirical correlation between RD$_{P_{a,p}}$ and recovery within the proposed family.

math.FA↗