Search arXivSearch

arXiv · 2210.11098

The definable content of homological invariants II: Čech cohomology and homotopy classification

Abstract

This is the second installment in a series of papers applying descriptive set theoretic techniques to both analyze and enrich classical functors from homological algebra and algebraic topology. In it, we show that the Čech cohomology functors $\check{\mathrm{H}}^n$ on the category of locally compact separable metric spaces each factor into (i) what we term their definable version, a functor $\check{\mathrm{H}}^n_{\mathrm{def}}$ taking values in the category $\mathsf{GPC}$ of groups with a Polish cover (a category first introduced in this work's predecessor), followed by (ii) a forgetful functor from $\mathsf{GPC}$ to the category of groups. These definable cohomology functors powerfully refine their classical counterparts: we show that they are complete invariants, for example, of the homotopy types of mapping telescopes of $d$-spheres or $d$-tori for any $d\geq 1$, and, in contrast, that there exist uncountable families of pairwise homotopy inequivalent mapping telescopes of either sort on which the classical cohomology functors are constant. We then apply the functors $\check{\mathrm{H}}^n_{\mathrm{def}}$ to show that a seminal problem in the development of algebraic topology, namely Borsuk and Eilenberg's 1936 problem of classifying, up to homotopy, the maps from a solenoid complement $S^3\backslashΣ$ to the $2$-sphere, is essentially hyperfinite but not smooth. In the course of this work, we record Borel definable versions of a number of classical results bearing on both the combinatorial and homotopical formulations of Čech cohomology; in aggregate, this work may be regarded as laying foundations for the descriptive set theoretic study of the homotopy relation on the space of maps from a locally compact Polish space to a polyhedron, a relation which embodies a substantial variety of classification problems arising throughout mathematics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffrey Bergfalk, Martino Lupini, Aristotelis Panagiotopoulos. 2024-04-25. The definable content of homological invariants II: Čech cohomology and homotopy classification. https://doi.org/10.1017/fmp.2024.7

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

KEEP EXPLORING

Related papers

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO