Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0708.3697

Homotopy characterization of ANR mapping spaces

Jaka Smrekar
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let Y be an absolute neighborhood retract (ANR) for the class of metric spaces and let X be a Hausdorff space. Let map(X,Y) denote the space of continuous maps from X to Y with the compact open topology. It is shown that if X is a CW complex then map(X,Y) is an ANR for the class of metric spaces if and only if map(X,Y) is metrizable and has the homotopy type of a CW complex. The same holds also when X is a compactly generated hemicompact space (metrizability assumption is void in this case).

Explore related subjects

math.ATmath.GN

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jaka Smrekar. 2007-08-29. Homotopy characterization of ANR mapping spaces. https://arxiv.org/abs/0708.3697

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

KEEP EXPLORING

Related papers

arXiv2026

A derived Chouinard's theorem for infinite groups

We establish a Chouinard-type theorem for modules over algebras of cochains on the classifying spaces of a broad class of infinite groups, allowing commutative ring spectra as coefficients. We then use this result to study finiteness properties of the integral cohomology rings of certain infinite groups, as well as stratification of the corresponding module categories. In particular, we complete the (co)stratification of module categories associated to homotopical groups over fields of positive characteristic.

math.AT↗
arXiv2026

Galois Connections in Persistent Homology

We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings. Second, it provides access to Rota's Galois connection theorem -- a powerful tool with many potential applications in applied topology. To illustrate this, we use Rota's Galois connection theorem to give a substantially easier proof of the bottleneck stability theorem. Finally, we use this language to establish relationships between various notions of multiparameter persistence diagrams.

math.AT↗