Search arXivSearch

arXiv · 2008.08782

The definable content of homological invariants I: $\mathrm{Ext}$ & $\mathrm{lim}^1$

Abstract

This is the first installment in a series of papers in which we illustrate how classical invariants of homological algebra and algebraic topology can be enriched with additional descriptive set-theoretic information. To effect this enrichment, we show that many of these invariants can be naturally regarded as functors to the category, introduced herein, of groups with a Polish cover. The resulting definable invariants provide far stronger means of classification. In the present work we focus on the first derived functors of $\mathrm{Hom}(-,-)$ and $\mathrm{lim}(-)$. The resulting definable $\mathrm{Ext}(B,F)$ for pairs of countable abelian groups $B,F$ and definable $\mathrm{lim}^{1}(\boldsymbol{A})$ for towers $\boldsymbol{A}$ of Polish abelian groups substantially refine their classical counterparts. We show, for example, that the definable $\textrm{Ext}(-,\mathbb{Z})$ is a fully faithful contravariant functor from the category of finite rank torsion-free abelian groups $\Lambda$ with no free summands; this contrasts with the fact that there are uncountably many non-isomorphic such groups $\Lambda$ with isomorphic classical invariants $\textrm{Ext}(\Lambda,\mathbb{Z}) $. To facilitate our analysis, we introduce a general Ulam stability framework for groups with a Polish cover and we prove several rigidity results for non-Archimedean abelian groups with a Polish cover. A special case of our main result answers a question of Kanovei and Reeken regarding quotients of the $p$-adic groups. Finally, using cocycle superrigidity methods for profinite actions of property (T) groups, we obtain a hierarchy of complexity degrees for the problem $\mathcal{R}(\mathrm{Aut}(\Lambda)\curvearrowright\mathrm{Ext}(\Lambda,\mathbb{Z}))$ of classifying all group extensions of $\Lambda$ by $\mathbb{Z}$ up to base-free isomorphism, when $\Lambda =\mathbb{Z}[1/p]^{d}$ for prime numbers $p$ and $ d\geq 1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeffrey Bergfalk, Martino Lupini, Aristotelis Panagiotopoulos. 2020-08-20. The definable content of homological invariants I: $\mathrm{Ext}$ & $\mathrm{lim}^1$. https://arxiv.org/abs/2008.08782

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