Derived equivalences between diagram categories of finite posets
Abstract
We study universal derived equivalences between diagram categories indexed by finite posets. Starting from a construction of Ladkani, we give an intrinsic criterion for determining when a finite poset admits a decomposition to which this construction can be applied. This leads to the notion of an admissible cut, formulated entirely in terms of the order structure of the poset. Our main result therefore provides a method for producing, from a given finite poset admitting such a cut, a new poset that is universally derived equivalent to it. The construction is reversible once the partition is retained, so that the original mixed order relations can be recovered from the transformed poset. As applications, we show that every finite poset of height at most one is universally derived equivalent to its opposite, give a criterion characterizing source-to-sink transformations at minimal elements, and recover the universal derived equivalence of all orientations of a finite tree through sequences of such local transformations. These results are also applied to persistence modules indexed by finite posets and to extensions obtained by adjoining further finite parameters.
Related
- Simple-shifted monoidal derived equivalences for tensor categories
- Normalization graphs and Dold-Kan equivalences for generalized Reedy categories
- A geometric realization of socle-projective categories for posets of type 𝔻
- Relative tilting, interlacing categories and rational Dyck posets
- Rickard's question on standard derived equivalences
BibTeX
@misc{ascenzi2026derived,
title = {{Derived equivalences between diagram categories of finite posets}},
author = {Chiara Ascenzi},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.10110},
eprint = {2609.10110},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.10110},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Derived equivalences between diagram categories of finite posets
AU - Chiara Ascenzi
PY - 2026
DA - 2026/09/09
PB - arXiv
DO - 10.48550/arxiv.2609.10110
UR - https://arxiv.org/abs/2609.10110
AB - We study universal derived equivalences between diagram categories indexed by finite posets. Starting from a construction of Ladkani, we give an intrinsic criterion for determining when a finite poset admits a decomposition to which this construction can be applied. This leads to the notion of an admissible cut, formulated entirely in terms of the order structure of the poset. Our main result therefore provides a method for producing, from a given finite poset admitting such a cut, a new poset that is universally derived equivalent to it. The construction is reversible once the partition is retained, so that the original mixed order relations can be recovered from the transformed poset. As applications, we show that every finite poset of height at most one is universally derived equivalent to its opposite, give a criterion characterizing source-to-sink transformations at minimal elements, and recover the universal derived equivalence of all orientations of a finite tree through sequences of such local transformations. These results are also applied to persistence modules indexed by finite posets and to extensions obtained by adjoining further finite parameters.
ER -