SearcharxivSearch

arXiv · 2506.17982

Projective length, phantom extensions, and the structure of flat modules

Abstract

We consider the natural generalization of the notion of the order of a phantom map from the topological setting to triangulated categories. When applied to the derived category of the category of countable flat modules over a countable Dedekind domain, this yields a notion of\emph{\ phantom extension} of order $\alpha <\omega _{1}$. We provide a complexity-theoretic characterization of the module $\mathrm{Ph}% ^{\alpha }\mathrm{Ext}\left( C,A\right) $ of phantom extensions of order $\alpha $ with respect to the structure of \emph{phantom Polish module} on $\mathrm{Ext}\left( C,A\right) $ obtained by considering it as an object of the left heart of the quasi-abelian category of Polish modules. We use this characterization to prove the following Dichotomy Theorem: either all the extensions of a countable flat module $A$ are trivial (which happens precisely when $A$ is divisible) or $A$ has phantom extensions of arbitrarily high order. By producing canonical phantom projective resolutions of order $\alpha $, we prove that phantom extensions of order $\alpha $ define on the category of countable flat modules an exact structure $\mathcal{E}_{\alpha }$ that is hereditary with enough projectives, and the functor $\mathrm{Ph}^{\alpha }% \mathrm{Ext}$ is the derived functor of $\mathrm{Hom}$ with respect to $\mathcal{E}_{\alpha }$. We prove a Structure Theorem characterizing the objects of the class $\mathcal{P}_{\alpha }$ of countable flat modules that have \emph{projective length at most }$\alpha $ (i.e., are $\mathcal{E}_{\alpha }$-projective) as the direct summands of colimits of presheaves of finite flat modules over well-founded forests of rank $% 1+\alpha $ regarded as ordered sets. This can be seen as the first analogue in the flat case of the classical Ulm Classification Theorem for torsion modules.

Explore related subjects

Keep this discovery

BibTeXRIS

Matteo Casarosa, Martino Lupini. 2025-06-22. Projective length, phantom extensions, and the structure of flat modules. https://arxiv.org/abs/2506.17982

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