Searcharxiv⌕ Search

arXiv · math/0608686

Sublinear Higson corona and Lipschitz extensions

Abstract

The purpose of the paper is to characterize the dimension of sublinear Higson corona $ν_L(X)$ of $X$ in terms of Lipschitz extensions of functions: Theorem: Suppose $(X,d)$ is a proper metric space. The dimension of the sublinear Higson corona $ν_L(X)$ of $X$ is the smallest integer $m\ge 0$ with the following property: Any norm-preserving asymptotically Lipschitz function $f'\colon A\to \R^{m+1}$, $A\subset X$, extends to a norm-preserving asymptotically Lipschitz function $g'\colon X\to \R^{m+1}$. One should compare it to the result of Dranishnikov \cite{Dr1} who characterized the dimension of the Higson corona $ν(X)$ of $X$ is the smallest integer $n\ge 0$ such that $\R^{n+1}$ is an absolute extensor of $X$ in the asymptotic category $\AAA$ (that means any proper asymptotically Lipschitz function $f\colon A\to \R^{n+1}$, $A$ closed in $X$, extends to a proper asymptotically Lipschitz function $f'\colon X\to \R^{n+1}$). \par In \cite{Dr1} Dranishnikov introduced the category $\tilde \AAA$ whose objects are pointed proper metric spaces $X$ and morphisms are asymptotically Lipschitz functions $f\colon X\to Y$ such that there are constants $b,c > 0$ satisfying $|f(x)|\ge c\cdot |x|-b$ for all $x\in X$. We show $\dim(ν_L(X))\leq n$ if and only if $\R^{n+1}$ is an absolute extensor of $X$ in the category $\tilde\AAA$. \par As an application we reprove the following result of Dranishnikov and Smith \cite{DRS}: Theorem: Suppose $(X,d)$ is a proper metric space of finite asymptotic Assouad-Nagata dimension $\asdim_{AN}(X)$. If $X$ is cocompact and connected, then $\asdim_{AN}(X)$ equals the dimension of the sublinear Higson corona $ν_L(X)$ of $X$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Cencelj, J. Dydak, J. Smrekar, A. Vavpetic. 2006-08-28. Sublinear Higson corona and Lipschitz extensions. https://arxiv.org/abs/math/0608686

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

KEEP EXPLORING

Related papers

Many Antipodal Pairs Force Many Neighboring Pairs

Let $X=\{x_1,\dots,x_n\}\subset \mathbb{R}^2$ be a finite set of points of diameter at most $1$. It is natural to expect that if many pairs $(x_i,x_j)$ lie at distance close to $1$ from each other, then some clustering phenomenon must occur, implying that a significant number of these pairs are also very close to each other. %For $0<\varepsilon<1$, we call a pair $(x_i,x_j)$ $\varepsilon$-antipodal if $\|x_i-x_j\|\ge 1-\varepsilon$ and $\varepsilon$-neighboring if $\|x_i-x_j\|\le \varepsilon$. We prove that there exists a universal constant $c>0$ such that for all $0<\varepsilon<1$, whenever $n$ is large enough, we have: \[ \big|\{(i,j):\|x_i-x_j\|\le \varepsilon\}\big| \geq c\cdot \varepsilon^{1/2}\cdot \big|\{(i,j):\|x_i-x_j\|\geq 1-\varepsilon\}\big|. \] This confirms a recent conjecture of Steinerberger, who asked whether the $\varepsilon^{1/2}$ ratio is the best possible. We also study a two-parameter version of Steinerberger's question by considering the number of pairs at distance at most $\varepsilon_1$ and at distance at least $1-\varepsilon_2$. We show that in this case the optimal ratio is $\varepsilon_1^2\cdot\varepsilon_2^{-3/2}$ when $\varepsilon_1\leq\varepsilon_2$, and $\varepsilon_1^{1/2}$ otherwise. The proof proceeds by introducing an auxiliary graph associated with the set $X$ and reducing the problem to bounding the largest eigenvalue of its adjacency matrix. Our main result is the outcome of human--AI interactions using ChatGPT 5.4.

math.MG↗

Monge's transport problem in synthetic Lorentzian spacetimes

We prove the existence of solutions to the Lorentzian Monge problem on synthetic Lorentzian spacetimes that satisfy the forward timelike measure contraction property $TMCP^+(K,N)$. The cost for this problem is the time separation function $\ell(x,y)$ (the Lorentz distance), which represents the maximum amount a particle can age when traveling from $x$ to $y$. The solution is based on the needle decomposition technique, and amounts to a reduction of the full problem to its one-dimensional counterparts. As an application of needle decomposition, we introduce the blended $TMCP$ condition, and obtain a quantitative refinement of the synthetic Hawking singularity theorem. We additionally prove a timelike nonbranching reversibility theorem for $TCD_p(K,N)$ spacetimes, showing that forward $p$-essentially nonbranching spacetimes are backward $p$-essentially nonbranching.

math.MG↗

Metric foundations of geometry

A metric space is called all-set-homogeneous if every isometry between two of its subsets extends to an isometry of the whole space. We classify all-set-homogeneous length spaces: besides the classical examples, they include the universal metric trees of finite valence.

math.MG↗