This paper explores the structure of torsion classes and wide subcategories in abelian length categories, establishing lattice isomorphisms and characterizations that deepen understanding of their relationships.
Contribution
It introduces the concept of wide intervals in the lattice of torsion classes and proves their isomorphism to torsion classes in associated wide subcategories, with new lattice-theoretic characterizations.
Findings
01
Wide intervals are isomorphic to torsion classes in wide subcategories.
02
Characterization of wide intervals via lattice theory and existing correspondences.
03
Provides a new perspective on the structure of torsion classes in abelian categories.
Abstract
In this paper, we study the relationship between wide subcategories and torsion classes of an abelian length category A from the point of view of lattice theory. Motivated by τ-tilting reduction of Jasso, we mainly focus on intervals [U,T] in the lattice torsA of torsion classes in A such that W:=U⊥∩T is a wide subcategory of A; we call these intervals wide intervals. We prove that a wide interval [U,T] is isomorphic to the lattice torsW of torsion classes in the abelian category W. We also characterize wide intervals in two ways: First, in purely lattice theoretic terms based on the brick labeling established by Demonet--Iyama--Reading--Reiten--Thomas; and second, in terms of…
Equations96
F=T⊥ and T=⊥F.
F=T⊥ and T=⊥F.
X⊥:={Y∈A∣for all X∈X, HomA(X,Y)=0},
X⊥:={Y∈A∣for all X∈X, HomA(X,Y)=0},
T(X):=T∈torsA;X⊆T⋂T.
T(X):=T∈torsA;X⊆T⋂T.
[U,T]:={V∈torsA∣U⊆V⊆T}
[U,T]:={V∈torsA∣U⊆V⊆T}
Tθ
Tθ
Tθ
[U,T]+
[U,T]+
[U,T]−
{Hasse arrows in torsA starting at T}→sim(WL(T)).
{Hasse arrows in torsA starting at T}→sim(WL(T)).
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Wide subcategories and lattices of torsion classes
Sota Asai
Sota Asai: Research Institute for Mathematical Sciences, Kyoto University, Kitashirakawa-Oiwakecho, Sakyo-ku, Kyoto-shi, Kyoto-fu, 606-8502, Japan
In this paper, we study the relationship between wide subcategories and torsion classes of an abelian length category A from the point of view of lattice theory.
Motivated by τ-tilting reduction of Jasso,
we mainly focus on intervals [U,T] in the lattice torsA of torsion classes in A such that W:=U⊥∩T is a wide subcategory of A; we call these intervals wide intervals.
We prove that a wide interval [U,T] is isomorphic to
the lattice torsW of torsion classes in the abelian category W.
We also characterize wide intervals in two ways: First, in purely lattice theoretic terms based on the brick labeling established by Demonet–Iyama–Reading–Reiten–Thomas;
and second,
in terms of the Ingalls–Thomas correspondences
between torsion classes and wide subcategories, which were
further developed by Marks–Šťovíček.
In the mid-20th century Dickson [Dic] vastly generalized the torsion theory of abelian groups to abelian categories A. He defined a torsion pair(T,F) in A to be a pair of full subcategories T,F⊆A satisfying the Hom-orthogonality conditions
[TABLE]
Here and throughout, we indicate the right Hom-perpendicular category of a full subcategory X⊆A by
[TABLE]
and define the left Hom-perpendicular category⊥X dually. Since then many authors investigated torsion pairs from several points of view, including their
classification [Brü, Hov],
derived equivalences [BB, Hap, HRS, Ric],
cluster theory [IT],
τ-tilting theory [AIR, KY, MŠ]
and stability conditions [Bri1].
From now on we assume that A is an essentially small abelian length category.
For a full subcategory T⊆A
there is a torsion pair (T,F) in A if and only if
T is closed under extensions and factor objects;
such subcategories T are called torsion classes.
In our setting the torsion classes in A form a set torsA, partially ordered by inclusion. Note that torsA is stable under arbitrary intersections. In particular, for every full subcategory X⊆A, there is a smallest torsion class T(X) containing X, namely
[TABLE]
It is not hard to see that the partially ordered set torsA is in fact a complete lattice,
that is, joins and meets of arbitrary subsets of torsA exist. More generally, every interval
[TABLE]
in torsA is a complete lattice. To an interval [U,T] in torsA we associate a full subcategory W:=U⊥∩T as proposed in [DIRRT]. This subcategory “measures the difference” between U and T in a precise sense (see Lemma 3.1). We investigate those intervals [U,T] in torsA such that W:=U⊥∩T is an abelian subcategory of A; that is, W is closed under kernels, images and cokernels. Then we can define the complete lattice torsW as before and compare it with the interval [U,T] (see Theorem 1.4). Note that such subcategories W are always closed under extensions, as U⊥ and T are. Thus, if we assume that W is abelian, it will be automatically a wide subcategory of A, that is, an abelian subcategory closed under extensions. This motivates the following definition.
We call an interval [U,T] in torsA a wide interval
if U⊥∩T is a wide subcategory of A.
An important class of examples of wide intervals is given by numerical torsion classes
in the case A=modA, where A is a finite-dimensional algebra over a field K.
Let us write projA for the category of finitely generated projective A-modules.
Proposition 1.2**.**
[BKT, Bri2]**
For each element θ∈K0(projA)⊗ZR, define two numerical
torsion classes Tθ⊆Tθ in modA by
[TABLE]
Then [Tθ,Tθ] is a wide interval
with the associated wide subcategory
Wθ:=(Tθ)⊥∩Tθ is
the θ-semistable subcategory defined by King [Kin].
See also [BST, Yur, Asa2] for more information on numerical torsion classes.
Another important example appears in τ-tilting reduction as developed by Jasso [Jas].
Proposition 1.3**.**
[Jas, Theorem 3.12]**
For a τ-rigid module U∈modA,
the interval [FacU,⊥(τU)] is a wide interval.
This interval is isomorphic to the lattice
torsWU of torsion classes in WU:=U⊥∩⊥(τU).
We aim to extend this result in this paper.
In general, we call two torsion classes U⊊T in Aadjacent if there exists no torsion class V in A satisfying U⊊V⊊T.
For example, if [U,T]=[FacU,⊥(τU)] and
U is an almost support τ-tilting module,
then U and T are adjacent [DIJ, Example 3.5].
For two adjacent torsion classes U⊊T, the subcategory W=U⊥∩T is wide and contains a unique brick S [BCZ, DIRRT].
In particular, we can label the arrow T→U
in the Hasse quiver Hasse(torsA) of the partially ordered set torsA by the brick S.
This is called brick labeling of Hasse(torsA) introduced in [Asa1] for Hasse arrows between functorially finite torsion classes and in general in [DIRRT].
Our first result shows that the wide interval [U,T] and torsW are isomorphic complete lattices and that this isomorphism is compatible with their brick labelings.
Let [U,T] be a wide interval in torsA and set W:=U⊥∩T.
(1)
There are mutually inverse isomorphisms of complete lattices
[TABLE]
given by Φ(V):=U⊥∩V and Ψ(X):=T(U,X) for V∈[U,T] and X∈torsW respectively.
Moreover, Ψ(X)=U∗X holds for every X∈torsW.
(2)
The isomorphism Φ preserves the brick labeling: Namely, the brick label of V1→V2 in [U,T] is the same as the brick label of Φ(V1)→Φ(V2) in torsW.
(3)
The following sets coincide:
–
The set simW of isomorphism classes of simple objects in W.
–
The set of labels of arrows in the Hasse quiver of [U,T] starting at T.
–
The set of labels of arrows in the Hasse quiver of [U,T] ending at U.
This is a large extension of
[Jas, Theorem 3.12] and
[DIRRT, Theorem 4.12, Proposition 4.13, Theorem 4.16],
which deal with functorially finite torsion classes in modA.
Thus, it is natural to characterize wide intervals in terms of Hasse arrows in torsA.
For this purpose, we define
[TABLE]
and introduce the following two lattice theoretic notions for intervals in torsA:
Let [U,T] be an interval in torsA.
The following conditions are equivalent:
(a)
The interval [U,T] is a wide interval.
(b)
The interval [U,T] is a join interval.
(c)
The interval [U,T] is a meet interval.
Apart from wide intervals, there are other operations connecting torsion classes and wide subcategories.
First, the operation T given in (1.1) defines a map from the set wideA of wide subcategories in A to torsA.
On the other hand,
Ingalls–Thomas [IT] and Marks–Šťovíček [MŠ]
introduced a map WL:torsA→wideA
(see (6.1) for the definition)
such that the composite
WL∘T is the identity.
It is therefore important to understand the torsion classes in the image of the map T:wideA→torsA,
which we call widely generated torsion classes.
For this purpose, we will first prove that the wide subcategory WL(T) is related to wide intervals as follows.
Below, Serre(WL(T)) denotes the set of Serre subcategories of WL(T).
For T∈torsA the following conditions are equivalent:
(a)
T* is a widely generated torsion class.*
(b)
T=T(WL(T)).
(c)
T=T(L), where L is the set of labels of Hasse arrows in torsA starting at T.
(d)
For every U∈torsA with U⊊T, there exists a Hasse arrow T→U′ such that U⊆U′.
2. Setting and notation
In this section we recall some fundamental facts about partially ordered sets and abelian length categories and describe the standing assumptions of this paper.
2.1. Partially ordered sets
Let L=(L,≤) be a partially ordered set.
First, we define the opposite partially ordered setLop:=(Lop,≤op) of L
with the same underlying set L=Lop and the partial order ≤op
such that y≤opx holds
if and only if x≤y for all x,y∈L.
An isomorphism of partially ordered setsΦ:(L,≤)→(L′,≤′)
is a bijection of sets Φ:L→L′ such that
Φ(y)≤Φ(x) if and only if y≤x.
An interval in L is a subset of the form
[TABLE]
where y≤x are elements of L.
The Hasse quiverHasseL has L as its set of vertices, and there is an arrow x→y for x,y∈L if and only if y<x and [y,x]={y,x}.
For an interval [y,x] in L,
we define its set of upper (resp. lower) elements as follows:
[TABLE]
In particular, if y=x, then [y,x]+=[y,x]−={x}.
Let S⊆L be a subset. A meet (resp. join) of S is a largest (resp. smallest) element in the set \{y\in L\mid\text{y\leq xforallx\in S}\}
(resp. \{y\in L\mid\text{y\geq xforallx\in S}\}).
If a meet (resp. join) of S exists, then it is necessarily unique,
and we will refer to it as the meet (resp. the join) of S denoted by
[TABLE]
If a meet and a join of every subset of L exists, we call L a complete lattice.
2.2. Abelian length categories
In this paper, every category is assumed to be essentially small,
and every subcategory is a full subcategory closed under isomorphism classes.
Throughout A always denotes an abelian length category,
that is, every object X∈A
has a finite filtration
0=X0⊊X1⊊⋯⊊Xl=X
where each subfactor Xi+1/Xi a simple object in A.
The opposite categoryAop of A is
defined to be the category with the same objects as A,
but HomAop(X,Y):=HomA(Y,X) for all X,Y∈A.
Note that Aop is again an essentially small abelian length category if A is so.
For a subcategory C⊆A define the following subcategories of A:
[TABLE]
We will use abbreviation rules such as
[TABLE]
for C1,…,Cm⊆A and X1,…,Xn∈A.
Also, if C,C′⊆A, then we write C∗C′ for the full subcategory
of objects X admitting a short exact sequence
[TABLE]
with C∈C and C′∈C′.
A subcategory W⊆A is called wide if W is closed under kernels, cokernels and extensions in A. In particular, every wide subcategory of A is an abelian subcategory. We denote by simW the set of isomorphism classes of simple objects in W. By abuse of notation we will not always distinguish between isomorphism classes in simW and their representatives. Write wideA for the set of wide subcatgeories of A.
A brick in A is an object S∈A such that EndA(S) is a division ring. For a subcategory C⊆A, let brickC be the set of isomorphism classes of bricks in C. A set S of isomorphism classes of bricks in A is called a semibrick if its elements are pairwise Hom-orthogonal, that is, HomA(S,S′)=0 for any two representatives S and S′ of distinct isomorphism classes in S. Let sbrickA be the set of semibricks in A.
A classical result of Ringel [Rin, 1.2] tells us that Filt and sim induce mutually inverse bijections
[TABLE]
A subcategory W of A is called
a Serre subcategory if it is closed under extensions, factor objects and subobjects. Since A is an abelian length category, a subcategory W⊆A is a Serre subcategory if and only if W=FiltS for a subset S⊆simA.
We denote the set of Serre subcategories of A by SerreA.
This set can be identified with the power set of simA.
A torsion pair(T,F) in A is a pair of subcategories T,F⊆A such that
[TABLE]
For a torsion pair (T,F) and every object X∈A,
there exists a short exact sequence
[TABLE]
with tTX∈T and fFX∈F, unique up to isomorphism. We will refer to (2.1) as the canonical sequence of X with respect to the torsion pair (T,F). Note that the subcategory T in a torsion pair (T,F) is closed under extensions and taking factor objects. Dually, the subcategory F is closed under extensions and subobjects. Conversely, one can show that, given a subcategory T⊆A closed under extensions and factor objects, the pair (T,T⊥) is a torsion pair, and we call such subcategories Ttorsion classes. The set of torsion classes in A is denoted by torsA. Dually, if F⊆A is a subcategory closed under extensions and subobjects, then (⊥F,F) is a torsion pair, and we call F a torsion-free class. The set of torsion-free classes in A is denoted by torfA.
The sets torsA and torfA are partially ordered by inclusion and closed under arbitrary intersections. In particular, given a full subcategory X⊆A,
[TABLE]
are the smallest torsion class and the smallest torsion-free class containing X respectively. It is well known that T=Filt∘Fac and F=Filt∘Sub, see [MŠ, Lemma 3.1] for a proof. These operators show that torsA and torfA are complete lattices with joins and meets given by
[TABLE]
for S⊆torsA and S′⊆torfA.
We remark that (T(X),X⊥) and (⊥X,F(X)) are torsion pairs in A for any full subcategory X⊆A.
In examples, we sometimes let A be a finite-dimensional algebra over a field K.
Then we let A=modA be the category of finite-dimensional A-modules,
and write torsA:=tors(modA).
We write projA for the category of finitely generated projective A-modules.
3. Brick labeling
Let [U,T] be an interval in torsA.
The subcategory U⊥∩T measures the “difference” between U and T in the following sense:
Lemma 3.1**.**
Let [U,T] be an interval in torsA and set W:=U⊥∩T. Then for every T∈T there is a short exact sequence
[TABLE]
with U∈U and W∈W, unique up to isomorphism of short exact sequences.
Thus T=U∗W.
Proof.
Take the canonical sequence (2.1) for T with respect to the torsion pair (U,U⊥) and let U:=tUT∈U and W:=fU⊥T∈U⊥.
Since T is closed under factor objects, we obtain W∈T;
hence W∈U⊥∩T=W.
Conversely, the desired exact sequence is unique up to isomorphism
by the uniqueness of the canonical sequence for T.
Thus we obtain the first statement, which readily implies that T=U∗W.
∎
In [DIRRT], the following fundamental properties of intervals in torsA are established.
Proposition 3.2**.**
Let [U,T] be an interval in torsA.
(1)
[DIRRT, Lemma 3.10]**
Then U⊥∩T=Filt(brick(U⊥∩T)).
(2)
[DIRRT, Theorems 3.3, 3.4]**
There is an arrow q:T→U in Hasse(torsA) if and only if there exists a unique brick Sq∈brick(U⊥∩T) up to isomorphism. In this case,
[TABLE]
and, moreover, U=T∩⊥Sq and T=T(U,Sq).
Proposition 3.2 gives rise to the following brick labeling.
The brick label of an arrow q:T→U in Hasse(torsA) is the isomorphism class of the brick Sq from Proposition 3.2.
In this case, we write TSqU.
The brick labeling may be compared to minimal extending modules for U as defined in Barnard–Carroll–Zhu [BCZ]. The minimal extending modules for U are precisely the labels of arrows ending in U,
see [BCZ, Subsection 2.2].
Dually, define brick labeling of Hasse(torfA) so that
an arrow F→G is labeled by the unique brick in
⊥G∩F. There is the following strong relationship between torsA and torfA compatible with their brick labelings.
Proposition 3.4**.**
The construction of right and left Hom-orthogonal subcategories defines isomorphisms of partially ordered sets
[TABLE]
Moreover, these isomorphisms preserve the brick labeling in the following sense: The brick label of T→U in Hasse(torsA) is the same as the brick label of U⊥→T⊥ in Hasse(torfA).
Proof.
The isomorphism (torsA)op≅torfA is well known and elementary. We show the invariance of the brick labeling. Let TSqU be a labeled arrow in Hasse(torsA). Note that ⊥(T⊥)=T since T is a torsion class in A. This basic observation implies
[TABLE]
hence, according to the dual of Definition 3.3, U⊥→T⊥ has the label Sq in Hasse(torfA).
∎
Brick labeling between torsion classes was first considered for the preprojective algebras Π of Dynkin type Δ in [IRRT]. The crucial ingredient is the bijection between the Coxeter group W associated to Δ and torsΠ established by Mizuno [Miz]. The first named author of this paper introduced brick labeling in [Asa1] for functorially finite torsion classes in the module category modA
in the context of the Koenig–Yang correspondences [KY, BY] and
τ-tilting theory [AIR].
One can easily check that the labeled Hasse quiver of torsA has the following global structure:
Proposition 3.5**.**
For an abelian length category A, the following properties hold:
•
The arrows in Hasse(torsA) ending in [math] are
FiltSS0 where S runs through simA.
•
The arrows in Hasse(torsA) starting at A are
AS⊥S where S runs through simA.
•
For S,S′∈simA, there is an inclusion FiltS⊆⊥S′ if and only if S≅S′.
Proposition 3.7 below shows that the set of labels of arrows in Hasse(torsA) starting at (resp. ending in) a fixed torsion class actually form a semibrick. In order to simplify our statements, we introduce the following notation.
Notation 3.6**.**
For a subset S⊆torsA, let LabelS denote the set of labels of arrows in the full subquiver of Hasse(torsA) with vertices in S.
Proposition 3.7**.**
Let [U,T] be an interval in torsA. The sets Label[U,T]+ and Label[U,T]− are semibricks.
Proof.
We prove only the first statement; the second one can be shown similarly.
Since all labels are bricks by Definition 3.3, it is enough to show Hom-orthogonality.
Let TiSiT be arrows in Hasse(torsA) for i∈{1,2}
with T1=T2.
We first remark that S1≅S2 follows from Proposition 3.2.
Let f∈HomA(S1,S2).
There is a short exact sequence
[TABLE]
with X′∈T and X′′∈T⊥.
Since X′′ is a factor object of S2, we deduce that X′′∈T⊥∩T2.
Then Proposition 3.2 implies X′′∈FiltS2.
Thus X′′ must be [math] or isomorphic to S2.
If X′′=0, then Cokf∈T.
Thus in the short exact sequence
[TABLE]
Imf∈T(S1)⊆T1 and Cokf∈T⊆T1 hold, so S2∈T1.
Clearly, S2∈T⊥, so S2∈T⊥∩T1.
Then Proposition 3.2 gives S2≅S1,
but this is a contradiction.
Thus X′′≅S2, and then Cokf=S2.
This implies f=0 as desired.
∎
4. Wide intervals and reduction of torsion classes
In this section we investigate wide intervals [U,T] in torsA.
Definition 4.1**.**
An interval [U,T] in torsA is a wide interval
if U⊥∩T is a wide subcategory of A.
For example,
we can construct a wide interval [U(N,Q),T(N,Q)]⊆torsA
from a τ-rigid pair (N,Q) in modA
(that is, N∈modA and Q∈projA satisfying
HomA(N,τN)=0 and HomA(Q,N)=0), where
[TABLE]
as in [Jas, DIRRT].
In this case, [U(N,Q),T(N,Q)] is isomorphic to torsCN,Q
for a certain finite-dimensional K-algebra CN,Q
[DIRRT, Theorem 4.12] (see also [Jas, Theorems 3.8, 3.12]) as a complete lattice. This bijection is compatible with the brick labeling of
[U(N,Q),T(N,Q)]⊆torsA and torsCN,Q
[DIRRT, Proposition 4.13].
We extend these results for all wide intervals as follows.
Theorem 4.2**.**
Let [U,T] be a wide interval in torsA, and set W:=U⊥∩T.
(1)
There are mutually inverse isomorphisms of complete lattices
[TABLE]
given by Φ(V):=U⊥∩V and Ψ(X):=T(U,X) for V∈[U,T] and X∈torsW respectively.
Moreover, Ψ(X)=U∗X holds for every X∈torsW.
(2)
The isomorphism Φ preserves the brick labeling:
Namely, the brick label of V1→V2 in [U,T] is the same as the brick label of Φ(V1)→Φ(V2) in torsW.
(3)
We have simW=Label[U,T]+=Label[U,T]−.
Proof.
(1)
Both maps are easily seen to be well defined morphisms of partially ordered sets.
For V∈[U,T], the identity V=U∗(U⊥∩V) follows immediately
from Lemma 3.1,
but U∗(U⊥∩V)⊆T(U,U⊥∩V) hence V=T(U,U⊥∩V) by minimality.
This proves Ψ∘Φ=id.
Let X∈torsW.
Since X⊆W⊆U⊥,
the inclusion X⊆U⊥∩T(U,X) is obvious.
For the other one, let Y∈U⊥∩T(U,X).
We use induction on the length of Y in W.
If Y=0, then the claim is clear.
Assume Y=0; then there is a short exact sequence
[TABLE]
with 0=Y′∈T(X)⊆A and Y′′∈X⊥.
Then Y′∈U⊥ because Y′ is a subobject of Y,
and Y′∈T(X)⊆T follows from X⊆W⊆T.
Thus Y′∈U⊥∩T∩T(X)=W∩T(X)=X,
since X∈torsW.
Moreover Y′′≅Cok(Y′→Y)∈W as W is assumed to be wide,
and we have Y′′∈U⊥∩T(U,X) since
W⊆U⊥ and Y′′ is a factor object of Y∈T(U,X).
Now we may apply induction on the length to Y′′.
We obtain Y′′∈X and henceforth Y∈X. This proves Φ∘Ψ=id.
Altogether Φ and Ψ are mutually inverse isomorphisms of partially ordered sets thus also isomorphisms of complete lattices.
For the last statement, let X∈torsW,
then we get
[TABLE]
(2) For every interval [V1,V2] in [U,T] the equality
[TABLE]
holds, hence Φ preserves the brick labeling by Proposition 3.2,
and so does Ψ.
(3) In view of Proposition 3.5, this follows from parts (1) and (2).
∎
Let us give an example of a wide interval which does not come from τ-rigid pairs.
Example 4.3**.**
Assume that K is an algebraically closed field and that A is the path algebra
K(1⇉2) of the Kronecker quiver 1⇉2.
We set T as the smallest torsion class containing all regular and preinjective modules,
and U as the smallest torsion class containing all preinjective modules.
In this case, W is a wide subcategory of modA, namely the subcategory of all regular A-modules. Thus [U,T] is a wide interval. The simple objects in W are all quasi-simple regular modules Sλ parametrized by
λ∈P1(K).
One can check that W≃⨁λ∈P1(K)FiltSλ
as an abelian category, so torsW can be identified with
∏λ∈P1(K)tors(FiltSλ).
Since the torsion classes in FiltSλ are FiltSλ and {0},
torsW is in bijection with the power set 2P1(K).
Therefore Theorem 4.2 gives an isomorphism of complete lattices
[TABLE]
Every arrow ending in the smallest element {0}∈torsW is of the form FiltSλ→{0} for some λ∈P1(K),
and it is labeled by the brick Sλ.
The corresponding arrow in [U,T] is T(U,Sλ)→U,
and its brick label is also Sλ.
We remark that this example can be obtained also from numerical torsion classes
[TABLE]
associated to each θ∈K0(projA)⊗ZR in [BKT, Bri2].
For any θ, the intersection
Tθ⊥∩Tθ is the θ-semistable subcategory
[TABLE]
introduced by King [Kin], which is a wide subcategory.
By setting θ:=[P1]−[P2] with Pi the indecomposable projective module,
we get Tθ=U and Tθ=T above.
Thus, [U,T] is a wide interval, and the simple objects of Wθ are
Sλ.
Similar arguments hold for tame hereditary algebras.
5. Classification of wide intervals in terms of join and meet intervals
Motivated by the results of Section 4, we next aim for characterizing
wide intervals in terms of arrows in the Hasse quiver of torsion classes.
For this purpose, we define the following notions for intervals.
Definition 5.1**.**
Let [U,T] be an interval in torsA.
(1)
The interval [U,T] is called a join interval if T=⋁[U,T]−.
(2)
The interval [U,T] is called a meet interval if U=⋀[U,T]+.
We remark that [T,T] is a join interval and a meet interval
because [T,T]−=[T,T]+={T}.
Actually, these notions coincide with wide intervals.
Theorem 5.2**.**
Let [U,T] be an interval in torsA.
Then the following conditions are equivalent:
(a)
The interval [U,T] is a wide interval.
(b)
The interval [U,T] is a join interval.
(c)
The interval [U,T] is a meet interval.
The isomorphisms between the complete lattices in Theorem 4.2 together with Proposition 3.5 imply (a)⇒(b) and (a)⇒(c).
For the remaining parts, we need the following property of join intervals.
Proposition 5.3**.**
Let [U,T] be a join interval in torsA, set W:=U⊥∩T and L:=Label[U,T]−. Then W=FiltL.
Proof.
The inclusion FiltL⊆W is immediate from W being closed under extensions and containing L. It remains to show the other inclusion.
Proposition 3.2 implies that
taking the label Sq∈L of the arrow q:V→U
for V∈[U,T]−∖{U}
gives a bijection [U,T]−∖{U}→L.
Since [U,T] is assumed to be a join interval,
[TABLE]
We first prove that T=Filt(U,L).
It is sufficient to show X∈Filt(U,L) if X is a factor object of S∈L.
Set U′:=T(U,S).
We can take a short exact sequence 0→X′→X→X′′→0
with X′∈U and X′′∈U⊥.
Then X′′∈U⊥∩U′, so X′′∈FiltS by Proposition 3.2.
Thus X∈Filt(U,L), so T=Filt(U,L).
To finish the proof, assume T∈W and show T∈FiltL
by induction on the length of T in W.
If T=0, it is clear.
If T=0, then we have a short exact sequence
0→S→T→T′→0 with S∈L,
since T∈T=Filt(U,L) and T∈W⊆U⊥.
We obtain the following commutative diagram with exact rows and columns:
[TABLE]
where U∈U and T′′∈U⊥.
The column 0→U→T′→T′′→0 is the canonical sequence of T′ with respect to (U,U⊥),
and the row 0→S→P→U→0 is obtained via pullback.
Note that T′′∈T as a proper factor of T,
hence we can apply the induction hypothesis to T′′∈U⊥∩T=W
to obtain T′′∈FiltL.
Moreover, P∈U⊥ as a subobject of T and P∈Filt(U,S). Thus P∈FiltS by Proposition 3.2.
Therefore T∈FiltL as an extension of T′′ by P.
∎
(b)⇒(a):
Define L:=Label[U,T]−.
Proposition 5.3 says that W=FiltL, and L is a semibrick by Proposition 3.7. Therefore W is a wide subcategory of A (see [Rin, 1.2]).
(c)⇒(a):
Define L:=Label[U,T]+.
If [U,T] is a meet interval, then [T⊥,U⊥] is a join interval in torfA,
and Label[T⊥,U⊥]−=Label[U,T]+=L
is a semibrick by Proposition 3.7.
Thus, similarly to Proposition 5.3,
we have
[TABLE]
Therefore
W=U⊥∩T=⊥(T⊥)∩U⊥∈wideA.
∎
We end this section by giving an example illustrating Theorem 5.2.
One can check that T coincides with the join ⋁λ∈P1(K)T(U,Sλ), which means that [U,T] is a join interval,
and also a wide interval by Theorem 5.2.
6. Classification of wide intervals in terms of Ingalls–Thomas correspondences
In [IT] Ingalls–Thomas associate to every T∈torsA the so called
left wide subcategory
[TABLE]
in the case that A=modA for a hereditary algebra A; Marks–Šťovíček studied WL(T) in [MŠ]
for arbitrary finite-dimensional algebras.
Dually to the left wide subcategories associated to torsion classes,
one can define the right wide subcategory associated to F∈torfA
as
[TABLE]
Their following result implies that there exists an injection from wideA to torsA.
We remark that the proof in [MŠ] also works for abelian length categories.
In general, T:wideA→torsA is not surjective,
so it is important to determine the image of the map T.
We will answer this problem in the next subsection,
and for this purpose, we study the relationship between T∈torsA and
the left wide subcategory WL(T) in this section.
First, we prepare the following property on Serre subcategories of WL(T).
Lemma 6.2**.**
Let T∈torsA, W∈Serre(WL(T)) and
f:XY a homomorphism with X∈T and Y∈F(W).
Then Imf∈W and Kerf∈T.
Proof.
We may assume that f is surjective by replacing Y by Imf. We proceed by induction on the length of Y.
If Y=0, then the claim is obvious, so assume Y=0.
Since Y∈F(W)=Filt(SubW), there exists a short exact sequence
[TABLE]
with Y′∈SubW non-zero and Y′′∈F(W).
We first show Y′∈W.
Since Y′∈SubW, Y′ is a subobject of some W∈W⊆WL(T).
On the other hand we find Y′∈T, because Y′ is a factor object of Y∈T.
These two statements imply that Y′∈WL(T) by checking the definition of WL(T).
In the wide subcategory WL(T), Y′ is a subobject of some W∈W,
so we obtain Y′∈W, since W∈Serre(WL(T)).
Next we prove Y′′∈W.
Consider the following commutative diagram with exact rows:
[TABLE]
Again, the definition of WL(T) yields Kerf′∈T.
Since Y′′ is a subobject of Y∈F(W), we have Y′′∈F(W).
Now
[TABLE]
is exact and, by applying the induction hypothesis to
Kerf′→Y′′, by induction we conclude that Y′′∈W.
Therefore Y∈W as an extension of Y′′ by Y′.
Now Kerf∈T follows from the definition of WL(T).
∎
We can generalize Proposition 3.2 as follows.
This is a mutation of a torsion class T at a Serre subcategory of WL(T).
Proposition 6.3**.**
Let T∈torsA, W∈Serre(WL(T)) and set U:=T∩⊥W∈torsA. Then T=U∗W and W=U⊥∩T.
Proof.
The inclusion U∗W⊆T is obvious from U,W⊆T.
For the other inclusion, let T∈T and take the canonical sequence
[TABLE]
with X∈⊥W and Y∈F(W). Lemma 6.2 implies Y∈W and X∈T∩⊥W=U, hence T∈U∗W.
Next we show W=U⊥∩T.
The inclusion W⊆U⊥∩T is easy to check.
The other inclusion U⊥∩T⊆W follows from T=U∗W.
∎
We also need the following technical lemma,
which is a generalization of [DIRRT, Lemma 3.7] and [Asa1, Lemma 2.7].
Lemma 6.4**.**
Let U∈torsA and S∈U⊥ a brick. Set T:=T(U,S).
(1)
Every homomorphism f:XS in T is zero or epic and satisfies Kerf∈T.
(2)
The brick S belongs to sim(WL(T)).
Proof.
(1)
We use induction on the length of X in A.
If X=0 the claim is clear, so we assume X=0.
Since X∈T(U,S)=Filt(U,FacS),
we can take an exact sequence
0→YaX→X′→0
such that Y is non-zero and belongs to U or FacS.
Then Y∈T in both cases.
If fa:Y→S is non-zero, then Y∈FacS holds, since S∈U⊥.
There exists an epimorphism g:Sn→Y, and the composite
fag:Sn→S is non-zero, and hence a split epimorphism of S.
Thus f is also a split epimorphism and Kerf∈T as desired.
On the other hand, if fa:Y→S is zero,
then Y⊆Kerf, so we have a commutative diagram of exact sequences
[TABLE]
By the induction hypothesis, f′ is either zero or epic, and satisfies Kerf′∈T.
Thus f is either zero or epic, and satisfies Kerf∈T.
(2)
This follows immediately from (1).
∎
Thus sim(WL(T)) is given by the brick labeling of Hasse(torsA).
Proposition 6.5**.**
Let T∈torsA and set V:=T∩⊥WL(T)∈torsA.
Then we have sim(WL(T))=Label[V,T]+=Label[0,T]+.
Proof.
First sim(WL(T))=Label[V,T]+ follows from Proposition 6.3 and Theorem 5.2,
and Label[V,T]+⊆Label[0,T]+ is obvious.
Now it remains to show Label[0,T]+⊆sim(WL(T)).
Let S∈Label[0,T]+. Then there exists a Hasse arrow TSU in
torsA, and Proposition 3.2 implies T=T(U,S);
hence S∈WL(T) by Lemma 6.4.
∎
Now we get a characterization of wide intervals in terms of
left and right wide subcategories.
Theorem 6.6**.**
Let [U,T] be an interval in torsA and set W:=U⊥∩T. Then the following conditions are equivalent:
(a)
W∈wideA,
(b)
W∈Serre(WL(T)),
(c)
W∈Serre(WR(U⊥)),
(d)
W=WR(U⊥)∩WL(T).
Proof.
(a)⇒(b):
By assumption [U,T] is a wide interval, so
W=Filt(Label[U,T]+) follows from Theorem 4.2.
Therefore W∈Serre(WL(T)) according to Proposition 6.5.
(b)⇒(a):
This is obvious, since by definition Serre subcategories are closed under extensions.
(a)⇔(c):
This follows by duality from (a)⇔(b).
Thus it suffices to show ((b) and (c))⇔(d).
((b) and (c))⇒(d):
This is deduced as
W⊆WR(U⊥)∩WL(T)⊆U⊥∩T=W.
(d)⇒(b):
Assume W=WR(U⊥)∩WL(T).
Since W=WR(U⊥)∩WL(T)∈wide(WL(T)),
it remains to check that
W is closed under taking subobjects in WL(T).
Let X∈W and X′⊆X satisfy X′∈WL(T).
As X∈W⊆U⊥, we get X′∈U⊥.
By assumption, X′∈T, so X′∈U⊥∩T=W as desired.
Thus W∈Serre(WL(T)).
(d)⇒(c):
This can be checked as (d)⇒(b).
∎
Propositions 6.3,
6.5
and Theorem 6.6 yield the following property:
Theorem 6.7**.**
Let T∈torsA. Taking labels gives a bijection
[TABLE]
Moreover, the map W↦T∩⊥W induces a bijection
[TABLE]
We end this section applying our results to τ-tilting theory.
For this purpose, we recall some related notions.
Let A be a finite-dimensional algebra over a field K,
M∈modA, and P∈projA.
Then, the pair (M,P) is called a support τ-tilting pair
if (M,P) is τ-rigid and ∣M∣+∣P∣=∣A∣,
where ∣⋅∣ denotes the number of isoclasses of indecomposable direct summands.
Adachi–Iyama–Reiten [AIR, Theorem 2.7] showed that
there exists a bijection from
the set of basic support τ-tilting pairs
to the set of functorially finite torsion classes in modA,
given by M↦FacM.
If two distinct support τ-tilting pairs (M,P)=(M′,P′) has
a common direct summand (N,Q) with ∣N∣+∣Q∣=∣A∣−1,
then we say that (M′,P′) is a mutation of (M,P).
In this case, FacM′⊊FacM or FacM′⊋FacM holds
[AIR, Definition-Proposition 2.28].
The former case is called a left mutation, and the latter is called a right mutation.
For a fixed support τ-tilting (M,P),
[DIJ, Theorem 3.1] implies that
any arrow starting at FacM in Hasse(torsA)
comes from some left mutation of (M,P);
more explicitly,
if U∈torsA has an arrow FacM→U in Hasse(torsA),
then there exists a left mutation of (M′,P′) of (M,P)
satisfying FacM′=U.
Therefore the arrows starting at FacM in Hasse(torsA)
bijectively correspond to the left mutations of (M,P).
By Proposition 6.5,
the labels of the arrows starting at FacM coincides with sim(WL(T)).
Thus we get the following result by using Theorem 6.7.
Corollary 6.8**.**
Let A be a finite-dimensional algebra over a field K and
(M,P) be a support τ-tilting pair in modA.
Consider the torsion class T:=FacM.
If m is the number of left mutations of the support τ-tilting pair (M,P),
then sim(WL(T)) has exactly m elements,
and there exist exactly 2m torsion classes V
such that [V,T] are wide intervals.
We remark that all such torsion classes V are functorially finite
in modA by [Jas, Theorem 3.14].
7. Widely generated torsion classes
In this section we consider widely generated torsion classes defined as follows:
Definition 7.1**.**
Let T∈torsA.
Then T is called a widely generated torsion class
if T admits some W∈wideA such that T=T(W).
By Proposition 6.1,
it is easy to see that T is a widely generated torsion class
if and only if T=T(WL(T)).
We have more characterizations of widely generated torsion classes
from the results in the previous section.
Theorem 7.2**.**
For T∈torsA, the following conditions are equivalent:
(a)
T* is a widely generated torsion class.*
(b)
T=T(WL(T)).
(c)
T=T(L)* where L:=Label[0,T]+.*
(d)
For every U∈torsA such that U⊊T, there exists a Hasse arrow TU′ such that U⊆U′.
Proof.
(a)⇔(b) follows from Proposition 6.1
and (b)⇔(c) is implied by Proposition 6.5.
(c)⇒(d):
Let U∈torsA such that U⊊T.
Then there exists some S∈L such that S∈/U since T=T(L).
From there, one can conclude U⊆U′:=T∩⊥S;
indeed for every U∈U and f:U→S,
f must be zero or epic by Lemma 6.4,
and f=0 since S∈/U.
(d)⇒(c): The inclusion T(L)⊆T follows from L⊆T. For the other inclusion, suppose T(L)⊊T. Then by assumption there is a Hasse arrow TSU′ with T(L)⊆U′. Obviously we get S∈L⊆T(L), but it contradicts S∈(U′)⊥⊆T(L)⊥.
∎
Remark 7.3*.*
The equivalences of (a), (c) and (d) above were also obtained
in [BCZ, Subsection 3.2]
in terms of minimal extending modules and canonical join representations of torsion classes.
If the conditions above hold,
then T=⋁S∈LT(S) is the canonical join representation of T.
Example 7.4**.**
Consider the following algebra A appearing in [Asa1, Example 4.13]:
[TABLE]
Let T be the full subcategory
[TABLE]
where S3 is the simple projective module corresponding to the vertex 3, and
S1,121,12121,… are all the indecomposable preinjective modules over the quotient algebra A/⟨e3⟩≅K(1⇉2).
Then one can check that T is a torsion class in modA.
The simple projective module S3
belongs to WL(T), and clearly it is simple in WL(T).
There exists no other simple object in WL(T);
indeed if S≅S3 is a simple object in WL(T),
then S must be a preinjective (A/⟨e3⟩)-module in T,
but one can easily check that
any preinjective (A/⟨e3⟩)-module cannot be in WL(T).
Thus WL(T)=FiltS3, and T=T(WL(T)) follows.
The condition (b) in Theorem 7.2 does not hold for
the torsion class T.
Therefore T is not a widely generated torsion class.
Set U:=T∩⊥S3. Then the modules in U are
all the preinjective (A/⟨e3⟩)-modules.
There exists a Hasse arrow T→U,
and it is the unique Hasse arrow starting at T
by Proposition 6.5.
Thus T does not satisfy the condition (d) in Theorem 7.2;
for example addS3⊊T is a torsion class not contained in U.
Funding
Sota Asai was supported by Japan Society for the Promotion of Science KAKENHI JP16J02249 and JP19K14500.
Acknowledgement
The authors thank Aaron Chan, Laurent Demonet, Osamu Iyama, Gustavo Jasso and Jan Schröer for kind instructions and discussions.
Bibliography27
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[AIR] T. Adachi, O. Iyama, I. Reiten, τ 𝜏 \tau -tilting theory . Compos. Math. 150 (2014), no. 3, 415–452.
2[Asa 1] S. Asai, Semibricks , to appear in Int. Math. Res. Not., https://academic.oup.com/imrn/advance-article/doi/10.1093/imrn/rny 150/5049384 .
3[Asa 2] S. Asai, The wall-chamber structures of the real Grothendieck groups , in preparation.
4[BCZ] E. Barnard, A. Carroll, S. Zhu, Minimal inclusions of torsion classes , ar Xiv:1710.08837 v 1.
5[BKT] P. Baumann, J. Kamnitzer, P. Tingley, Affine Mirković-Vilonen polytopes , Publ. Math. Inst. Hautes Études Sci. 120 (2014), 113–205.
6[BB] S. Brenner, M. C. R. Butler, Generalizations of the Bernšteĭn–Gel’fand–Ponomarev reflection functors , Representation theory, II (Proc. Second Internat. Conf., Carleton Univ., Ottawa, Ont., 1979), 103–169, Lecture Notes in Math. 832, Springer, Berlin-New York, 1980.
7[Bri 1] T. Bridgeland, Stability conditions on triangulated categories , Ann. of Math. (2) 166 (2007), no. 2, 317–345.
8[Bri 2] T. Bridgeland, Scattering diagrams, Hall algebras and stability conditions , Algebr. Geom. 4 (2017), no. 5, 523–561.