Search arXivSearch

arXiv · 1611.03513

Quantitative nullhomotopy and rational homotopy type

Abstract

In \cite{GrOrang}, Gromov asks the following question: given a nullhomotopic map $f:S^m \to S^n$ of Lipschitz constant $L$, how does the Lipschitz constant of an optimal nullhomotopy of $f$ depend on $L$, $m$, and $n$? We establish that for fixed $m$ and $n$, the answer is at worst quadratic in $L$. More precisely, we construct a nullhomotopy whose \emph{thickness} (Lipschitz constant in the space variable) is $C(m,n)(L+1)$ and whose \emph{width} (Lipschitz constant in the time variable) is $C(m,n)(L+1)^2$. More generally, we prove a similar result for maps $f:X \to Y$ for any compact Riemannian manifold $X$ and $Y$ a compact simply connected Riemannian manifold in a class which includes complex projective spaces, Grassmannians, and all other simply connected homogeneous spaces. Moreover, for all simply connected $Y$, asymptotic restrictions on the size of nullhomotopies are determined by rational homotopy type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gregory R. Chambers, Fedor Manin, Shmuel Weinberger. 2018-03-14. Quantitative nullhomotopy and rational homotopy type. https://doi.org/10.1007/s00039-018-0450-2

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

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT