SearcharxivSearch

arXiv · 2401.00130

Bounded $t$-structures, finitistic dimensions, and singularity categories of triangulated categories

Abstract

Recently, Amnon Neeman settled a bold conjecture by Antieau, Gepner, and Heller regarding the relationship between the regularity of finite-dimensional noetherian schemes and the existence of bounded $t$-structures on their derived categories of perfect complexes. In this paper, using different methods, we prove some very general results about the existence of bounded $t$-structures on (not necessarily algebraic or topological) triangulated categories and their invariance under completion. We show that if the opposite category of an essentially small triangulated category has finite finitistic dimension in our sense, then the existence of a bounded t-structure on it forces it to be equal to its completion. We also prove a parallel result regarding the equivalence of all bounded t-structures on any intermediate triangulated category between the starting category and its completion. Our general treatment, when specialized to the case of schemes, immediately gives us Neeman's theorem as an application and significantly generalizes another remarkable theorem by Neeman about the equivalence of bounded $t$-structures on the bounded derived categories of coherent sheaves. When specialized to other cases like associative rings, nonpositive DG-rings, connective $\mathbb{E}_1$-rings, triangulated categories without models, etc., we get many other applications. Under mild finiteness assumptions, these results not only give a categorical obstruction (the singularity category in our sense) to the existence of bounded $t$-structures on a triangulated category, but also provide plenty of triangulated categories on which all bounded $t$-structures are equivalent. The strategy used in our treatment is introducing a new concept of finitistic dimension for triangulated categories and lifting $t$-structures along completions of triangulated categories.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rudradip Biswas, Hongxing Chen, Kabeer Manali Rahul, Chris J. Parker, Junhua Zheng. 2023-12-30. Bounded $t$-structures, finitistic dimensions, and singularity categories of triangulated categories. https://arxiv.org/abs/2401.00130

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA