SearcharxivSearch

arXiv · 2312.09122

Whitehead's problem and condensed mathematics

Abstract

One of the better-known independence results in general mathematics is Shelah's solution to Whitehead's problem of whether $\mathrm{Ext}^1(A,\mathbb{Z})=0$ implies that an abelian group $A$ is free. The point of departure for the present work is Clausen and Scholze's proof that, in contrast, one natural interpretation of Whitehead's problem within their recently-developed framework of condensed mathematics has an affirmative answer in $\mathsf{ZFC}$. We record two alternative proofs of this result, as well as several original variations on it, both for their intrinsic interest and as a springboard for a broader study of the relations between condensed mathematics and set theoretic forcing. We show more particularly how the condensation $\underline{X}$ of any locally compact Hausdorff space $X$ may be viewed as an organized presentation of the forcing names for the points of canonical interpretations of $X$ in all possible set-forcing extensions of the universe, and we argue our main result by way of this fact. We show also that when interpreted within the category of light condensed abelian groups, Whitehead's problem is again independent of the $\mathsf{ZFC}$ axioms. In fact we show that it is consistent that Whitehead's problem has a negative solution within the category of $\kappa$-condensed abelian groups for every uncountable cardinal $\kappa$, but that this scenario, in turn, is inconsistent with the existence of a strongly compact cardinal.

Explore related subjects

Keep this discovery

BibTeXRIS

Jeffrey Bergfalk, Chris Lambie-Hanson, Jan Šaroch. 2023-12-14. Whitehead's problem and condensed mathematics. https://arxiv.org/abs/2312.09122

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