Sharp quantitative nonembeddability of the Heisenberg group into superreflexive Banach spaces

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Let $\H$ denote the discrete Heisenberg group, equipped with a word metric $d_W$ associated to some finite symmetric generating set. We show that if $(X,\|\cdot\|)$ is a $p$-convex Banach space then for any Lipschitz function $f:\H\to X$ there exist $x,y\in \H$ with $d_W(x,y)$ arbitrarily large and \begin{equation}\label{eq:comp abs} \frac{\|f(x)-f(y)\|}{d_W(x,y)}\lesssim \left(\frac{\log\log d_W(x,y)}{\log d_W(x,y)}\right)^{1/p}. \end{equation} We also show that any embedding into $X$ of a ball of radius $R\ge 4$ in $\H$ incurs bi-Lipschitz distortion that grows at least as a constant multiple of \begin{equation}\label{eq:dist abs} \left(\frac{\log R}{\log\log R}\right)^{1/p}. \end{equation} Both~\eqref{eq:comp abs} and~\eqref{eq:dist abs} are sharp up to the iterated logarithm terms. When $X$ is Hilbert space we obtain a representation-theoretic proof yielding bounds corresponding to~\eqref{eq:comp abs} and~\eqref{eq:dist abs} which are sharp up to a universal constant.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Sharp quantitative nonembeddability of the Heisenberg group into superreflexive Banach spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sharp quantitative nonembeddability of the Heisenberg group into superreflexive Banach spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharp quantitative nonembeddability of the Heisenberg group into superreflexive Banach spaces will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-368922

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.