SearcharxivSearch

arXiv · 2210.11098

The definable content of homological invariants II: \v{C}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 \v{C}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\Sigma$ 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 \v{C}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

BibTeXRIS

Jeffrey Bergfalk, Martino Lupini, Aristotelis Panagiotopoulos. 2022-10-20. The definable content of homological invariants II: \v{C}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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO