Search arXivSearch

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 $α<ω_{1}$. We provide a complexity-theoretic characterization of the module $\mathrm{Ph}% ^{α}\mathrm{Ext}\left( C,A\right) $ of phantom extensions of order $α$ 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 $α$, we prove that phantom extensions of order $α$ define on the category of countable flat modules an exact structure $\mathcal{E}_{α}$ that is hereditary with enough projectives, and the functor $\mathrm{Ph}^{α}% \mathrm{Ext}$ is the derived functor of $\mathrm{Hom}$ with respect to $\mathcal{E}_{α}$. We prove a Structure Theorem characterizing the objects of the class $\mathcal{P}_{α}$ of countable flat modules that have \emph{projective length at most }$α$ (i.e., are $\mathcal{E}_{α}$-projective) as the direct summands of colimits of presheaves of finite flat modules over well-founded forests of rank $% 1+α$ 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

Explore connections, maps & timelines

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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO