Mathematics > Representation Theory
[Submitted on 4 Oct 2022 (v1), last revised 9 Jan 2023 (this version, v2)]
Title:A correspondence and distance of t-structures
View PDFAbstract:For two t-structures $D_{1}=(D_{1}^{\leqslant 0},D_{1}^{\geqslant 1})$ and $D_{2}=(D_{2}^{\leqslant 0},D_{2}^{\geqslant 1})$ with $D_{1}^{\leqslant 0} \subseteq D_{2}^{\leqslant 0}$ on a triangulated category $\mathcal{D}$, we give a correspondence between t-structure $D_{i}=(D_{i}^{\leqslant 0},D_{i}^{\geqslant 1})$ which satisfies $D_{1}^{\leqslant 0} \subseteq D_{i}^{\leqslant 0} \subseteq D_{2}^{\leqslant 0}$ and a pair of full subcategories of $D_{1}^{\geqslant 1}\bigcap D_{2}^{\leqslant 0}$. Then we give a way to determine the distance of two t-structure if we have known that their distance is this http URL addition, if we set a t-structure $D_{1}$ whose heart $H_{1} \neq 0$ and that $H_{1}$ has a non-trivial torsion pair, then for any integer $n$, we can construct a t-structure $D_{2}$ such that the distance between $D_{1}$ and $D_{2}$ is $n$.
Submission history
From: Junhua Zheng [view email][v1] Tue, 4 Oct 2022 11:56:09 UTC (12 KB)
[v2] Mon, 9 Jan 2023 20:12:21 UTC (12 KB)
Current browse context:
math.RT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.