\excludeversion
invisible
Liftable pairs of functors and Initial objects
Alessandro Ardizzoni
University of Turin, Department of Mathematics “G. Peano”, via
Carlo Alberto 10, I-10123 Torino, Italy
[email protected]
http://sites.google.com/site/aleardizzonihome
,
Isar Goyvaerts
Department of Mathematics, Faculty of
Engineering, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussel,
Belgium
[email protected]
and
Claudia Menini
University of Ferrara, Department of Mathematics and Computer Science, Via Machiavelli
30, Ferrara, I-44121, Italy
[email protected]
http://sites.google.com/a/unife.it/claudia-menini
Abstract.
Let A and B be monoidal categories and let R:A→B be a lax monoidal functor. If R has a left adjoint L, it is well-known that the two adjoints induce functors R=Alg(R):Alg(A)→Alg(B) and L=Coalg(L):Coalg(B)→Coalg(A) respectively. The pair (L,R) is called liftable if the functor R has a left adjoint and if the
functor L has a right adjoint. A pleasing fact is that, when A, B and R are moreover braided, a liftable pair of functors as above gives rise to
an adjunction at the level of bialgebras.
In this note, sufficient conditions on the category A for R to possess a left adjoint, are given. Natively these conditions involve the existence of suitable colimits that we interpret as objects which are simultaneously initial in four distinguished categories (among which the category of epi-induced objects), allowing for an explicit construction of L, under the appropriate hypotheses. This is achieved by introducing a relative version of the notion of weakly coreflective subcategory, which turns out to be a useful tool to compare the initial objects in the involved categories.
We apply our results to obtain an analogue of Sweedler’s finite dual for the
category of vector spaces graded by an abelian group G endowed with a bicharacter. When the bicharacter on G is skew-symmetric, a lifted adjunction as mentioned above is explicitly
described, inducing an auto-adjunction on the category of bialgebras
“colored” by G.
Key words and phrases:
Monoidal categories, liftable pairs, initial objects, weakly coreflective subcategories, group graded vector spaces.
1991 Mathematics Subject Classification:
Primary 18M05; Secondary 16W50
This article was written while the first and the third author were
members of the National Group for Algebraic and Geometric Structures, and
their Applications (GNSAGA-INdAM). They were both partially supported by
MIUR within the National Research Project PRIN 2017. The first author was
partially supported by the research grant “Progetti di Eccellenza
2011/2012” from the “Fondazione Cassa di Risparmio di Padova e Rovigo”.
He thanks the members of the department of Mathematics of both Vrije
Universiteit Brussel and Université Libre de Bruxelles for their warm
hospitality and support during his stay in Brussels in August 2013, when the
work on this paper was initiated. The second named author acknowledges the
financial support of an INdAM Marie Curie Fellowship.
The authors would also like to thank Joost Vercruysse and Miodrag C. Iovanov
for helpful discussions and the referee for pointing out a mistake in a
previous version of this article.
Contents
-
1 Preliminaries and first results
-
1.1 Some notational conventions
-
1.2 Liftability of adjoint pairs
-
1.3 An approach to a result by Tambara, inspired by Dubuc
-
2 Relative weak coreflections and fibrations
-
2.1 Relative weak coreflections
-
2.2 Relative fibrations
-
3 The crucial colimit as an initial object
-
3.1 Induced objects and algebras
-
3.2 Epi-induced objects and algebras and initial objects
-
3.3 Comparing the Initial objects in IndObj(B) and IndObje(B)
-
3.4 Comparing the Initial objects in IndAlg(B) and IndAlge(B)
-
3.5 Comparing all of the Initial objects
-
3.6 Constructing the Initial object in IndObje(B)
-
4 Application: the group-graded case
-
4.1 Pre-rigid monoidal categories
-
4.2 A group-graded version of Sweedler’s finite dual
Introduction
Let A and B be monoidal categories and let L⊣R:A→B be adjoint functors. It is well-known that, if L can
be endowed with the structure of a colax monoidal functor, then R becomes
a lax monoidal functor, and the other way around. Letting (R,ϕ2,ϕ0):A→B now be a lax monoidal functor, R
induces a functor R=Alg(R):Alg(A)→Alg(B) between the respective categories of algebra
objects. Dually, a colax monoidal functor (L,ψ2,ψ0):B→A colifts to a functor L=Coalg(L):Coalg(B)→Coalg(A) between the respective categories of coalgebra objects.
In the article [GV], an adjoint pair of functors (L,R)
between monoidal categories A and B such that R is
a lax monoidal functor (or, equivalently, L is colax monoidal) is called
liftable if the functor R has a left adjoint, say L, and if
the functor L has a right adjoint, say R. If A and B come both endowed with a braiding, it is shown in loc. cit.
that such a liftable pair of functors (L,R) gives rise to an adjunction
between the respective categories of bialgebra objects
[TABLE]
provided the functor R enjoys the property of being braided with respect
to the braidings of A and B (cf. [GV, Theorem 2.7]).
A prototypical example of a liftable pair of functors is obtained by taking B to be the symmetric monoidal category Vec of k-vector
spaces (k a field) where the symmetry is just the twist. Putting A to be the opposite category Vecop of Vec and taking the vector space
dual X∗=Homk(X,k), one obtains a (covariant) adjunction L⊣R:A→B with L=(−)∗ and R=(−)∗.
The functor R satisfies the necessary conditions to induce a functor R=Alg(R):Alg(A)→Alg(B).
Explicitly, one obtains that R is the well-known functor that
computes the dual algebra of a k-coalgebra (remark that the functor L=Coalg(L):Coalg(B)→Coalg(A) is
exactly the same functor). A left adjoint L=(−)∘ for R is given by the
functor that assigns the so-called finite dual coalgebra A∘ to a k-algebra A; this construction is originally due to Sweedler, see [Sw]. Noticing that the very same construction provides a right
adjoint for the functor L, one obtains that the pair (L,R)
is indeed liftable and, applying the above-cited theorem, one recovers the
result that the finite dual induces an auto-adjunction on the category of k-bialgebras (cf. [Ab, page 87], for instance).
Generalizations of this construction have
been studied by different authors, see e.g. [AGW, CN, Por3] and [PS].
Let us go back to our general setting of a functor R:A→B as at the beginning of this introductory section and notice that being liftable really is a condition: there exist examples of lax monoidal functors R between monoidal categories that have
a left adjoint L, but for which R does not have a left
adjoint (cf. [AGM, Example 4.2]). One aim of this paper is to give sufficient conditions on the category A for the functor R=Alg(R):Alg(A)→Alg(B) to possess a left adjoint L. As we will see, these conditions involve the existence of suitable colimits that we manage to interpret as objects which are simultaneously initial in four distinguished categories, among them the category of epi-induced objects, which allows for an explicit construction of L, under the appropriate hypotheses. This is performed by introducing a relative version of the notion of weakly coreflective subcategory that allows, among other things, to identify the initial objects in these categories and that we find is of independent interest.
In the article [AGM], a context, appeared in its original form in [GV], where the liftability assumption can be proved to hold is studied: a so-called pre-rigid braided
monoidal category C always allows for a liftable pair of adjoint
functors L⊣R:Cop→C, with L=(−)∗ and R=(−)∗,
provided R has a left adjoint. In the present paper, we consider C
to be the category of vector spaces graded by an abelian group G. When
being given a skew-symmetric bicharacter on G, the lifted adjunction between bialgebras
in C can be explicitly computed and provides a G-graded
version of Sweedler’s classical finite dual construction. To the best of our
knowledge, this application does not appear elsewhere in literature. Let us
sketch in more detail how we go about this computation.
In Section 1, we start by recalling some of the notions we use in the paper, among them the one of liftable pair of adjoint functors and its behaviour on braided categories. Then, in Subsection 1.3, we present sufficient conditions for R
to possess a left adjoint, provided some extra conditions on the category A hold (cf. Theorem 1.5). This is obtained by
slightly improving results by Dubuc [Du1, Du2] and by Tambara [Ta]. An advantage of our treatment in this
section is the fact that the construction of the adjoint L can
be given explicitly by means of a specific colimit in Alg(A).
In Section 2, we
consider the notion of weakly coreflective subcategory and we introduce a relative version of it in order to reinterpret this colimit as a suitable initial object and obtain an explicit description for LB, for every algebra B in B. This turns out to be a useful tool to compare the initial objects in the involved categories. An instance of this fact is Proposition 2.5, where we prove that, if C is a replete posetal weakly coreflective full subcategory of a category D, then C and D have the same initial objects, if any.
Then we study pullbacks of a relative weakly coreflective subcategory along relative fibrations.
More precisely, in Proposition 2.7, we prove that, if C is a weakly E-coreflective full subcategory of a category D, then the pullback C′ of C along an E-fibration V:D′→D is a weakly coreflective full subcategory of D′.
[TABLE]
These results will be applied in Section 3 to the particular pullback represented in the diagram above, which involves the categories IndObj(B), IndObje(B), IndAlg(B) and IndAlge(B). We have mentioned that the functor L can be given explicitly in terms of a specific colimit. First, in Proposition 3.4, we reinterpret this colimit as an initial object in the category IndAlg(B) of induced algebras of B leading us to Theorem 3.5. Then, under suitable assumptions, we will see in Theorem 3.21 that IndAlg(B) can be replaced by other three categories, precisely IndObj(B), IndObje(B) and IndAlge(B), that can be more easy to handle in practice, among them the category IndObje(B) of epi-induced objects. Then, in Proposition 3.23, we provide a construction of an initial object in IndObje(B). Putting together these results we obtain Proposition 3.24 giving an explicit description for LB. By taking Cop instead of A, we get Proposition 3.26 that will be applied to the main example we are concerned in Section 4, namely the category VecG of G-graded vector spaces. This category is a particular instance of a pre-rigid category as it is monoidal closed. This led us to look for an analogue of Sweedler’s finite dual in the general context of pre-rigid
braided monoidal categories. In [AGM], a monoidal category C
is called pre-rigid if for every object X there exists an object X∗ and a morphism evX:X∗⊗X→\mathdsI
such that the map
[TABLE]
is bijective for every object T in C. In this framework, consider the functor R:=(−)∗:Cop→C. It turns out, see Proposition 4.3 and Lemma 4.5, that the adjunction (L,R) is liftable, whenever the functor R has a left adjoint. In
Proposition 4.2 we present conditions guaranteeing that this happens. Moreover, in Corollary 4.7 we find a pre-rigid analogue of [PS, Proposition 8].
In Subsection 4.2 we deal with the case when C is taken
to be the braided monoidal category VecGα of vector spaces graded by an abelian group G, where the braiding depends on a bicharacter α:G×G→k∖{0} on G. In case α is skew-symmetric, our theory gives rise to
auto-adjunctions on the categories of bialgebras “colored” by G. As a
consequence of arguments settled in the slightly more general setting
in Remark 4.6, the lifted functors in this example can be described
explicitly. The paper concludes with hinting at
why one could expect that explicit descriptions as in case of VecG
could be carried out, more generally, for the category of comodules over a
coquasi-bialgebra.
1. Preliminaries and first results
We begin our exposition by recalling some notions we need in the paper, among them the one of liftable pair of adjoint functors and its behaviour on braided categories, from [GV]. Then we will present sufficient conditions for the functor induced by a lax monoidal right adjoint at the level of algebras to possess a left adjoint, see Theorem 1.5. This is obtained by slightly improving results by Dubuc and by Tambara.
1.1. Some notational conventions
When X is an object in a category C, we will denote the
identity morphism on X by 1X or X for short. For categories C and D, a functor F:C→D will be the
name for a covariant functor; it will only be a contravariant one if it is
explicitly mentioned. By idC we denote the identity
functor on C. For any functor F:C→D, we
denote IdF (or sometimes -in order to lighten notation in some
computations- just F, if the context does not allow for confusion) the
natural transformation defined by IdFX=1FX.
Let C be a category. Denote by Cop the
opposite category of C. Using the notation of [Pa1, page 12], an object X and a morphism f:X→Y in C will be denoted by Xop and fop:Yop→Xop when regarded as object and
morphism in Cop. Given a functor F:C→D, one defines its opposite functor Fop:Cop→Dop by setting FopXop=(FX)op and Fopfop=(Ff)op. If α:F→G is a natural transformation, its opposite αop is given by (αop)Xop:=(αX)op for every object X.
Throughout the paper, we will work in the setting of monoidal categories.
With respect to the material presented below, it is useful to recall the
following notation. Let (M,⊗,\mathdsI,a,l,r) be a
monoidal category. Following [SR, 0.1.4, 1.4], we have that
Mop is also monoidal, the monoidal structure being
given by
[TABLE]
If M is moreover braided (with braiding c), then so is Mop, the braiding being given by
[TABLE]
Unless explicitly stated, we will assume monoidal categories to be strict from now on. By Mac Lane’s Coherence Theorem, this does not impose
restrictions on the obtained results. We will moreover consider braided
monoidal categories. A basic reference for these notions is [McL],
for instance.
Recall (see e.g. [AM, Definition 3.1])
that a functor F:A→B between monoidal categories (A,⊗,\mathdsIA) and (B,⊗′,\mathdsIB) is said to be a lax monoidal
functor if it comes equipped with a family of natural morphisms ϕ2(X,Y):F(X)⊗′F(Y)→F(X⊗Y), for X,Y∈A, and a B-morphism ϕ0:\mathdsIB→F(\mathdsIA), satisfying the known suitable compatibility
conditions with respect to the associativity and unit constraints of A and B.
Dually, colax monoidal functors are defined.
Also recall that given a lax monoidal functor (F,ϕ2,ϕ0), then (Fop,ϕ2op,ϕ0op) is a colax monoidal functor, where we set ϕ2op(Xop,Yop):=ϕ2(X,Y)op, see e.g. [AM, Proposition 3.7].
1.2. Liftability of adjoint pairs
Let (L:B→A,R:A→B) be an adjunction with unit η and counit ϵ. It is known, see e.g. [AM, Proposition 3.84], that if (L,ψ2,ψ0)
is a colax monoidal functor, then (R,ϕ2,ϕ0) is a lax
monoidal functor where, for every X,Y∈A,
[TABLE]
Conversely, if (R,ϕ2,ϕ0) is a lax monoidal functor, then (L,ψ2,ψ0) is a colax monoidal functor where, for every X,Y∈B
[TABLE]
Let (R,ϕ2,ϕ0):A→B be a lax
monoidal functor. It is well-known that R induces a functor R:=Alg(R):Alg(A)→Alg(B) such that the diagram on the right-hand side in (7) commutes (cf. [Be, Proposition 6.1, page 52]; see also [AM, Proposition 3.29]).
Explicitly,
[TABLE]
Dually, a colax monoidal functor (L,ψ2,ψ0):B→A colifts to a functor L:=Coalg(L):Coalg(B)→Coalg(A) such that the diagram on the left-hand side in (7)
commutes. Explicitly,
[TABLE]
The vertical arrows in the two diagrams below are the obvious forgetful
functors.
[TABLE]
Definition 1.1** ([GV, Definition 2.3]).**
Suppose A and B are monoidal
categories and R:A→B is a lax
monoidal functor with a left adjoint L. The pair (L,R) is called liftable if the induced functor R=Alg(R):Alg(A)→Alg(B) has a left adjoint111in general the left adjoint of R is not assumed to be of form Alg(L). In fact we can’t even consider Alg(L) as L needs not to be lax monoidal. A similar observation holds for the right adjoint of L., say L, and the induced functor L=Coalg(L):Coalg(B)→Coalg(A) has a right adjoint, say R.
Notice that being liftable really is a condition: there exist
examples of lax monoidal functors R between monoidal categories that have
a left adjoint L, but for which R does not have a left
adjoint. For instance, let k be a field and set S:=(X2)k[X]. Consider the functor
[TABLE]
In [AGM, Example 4.2], it is shown that Rf has no left
adjoint.
Liftability for braided monoidal categories.
Recall that when a monoidal category is braided, its algebras and coalgebras inherit the monoidal structure, see e.g. [AM, 1.2.2].
Let A and B now be braided monoidal categories and let R:A→B
be a braided lax monoidal functor having a left adjoint L. By e.g. [AM, Proposition 3.80], the functor R is lax
monoidal too. Explicitly, the lax monoidal functors (R,ϕ2,ϕ0)
and (R,ϕ2,ϕ0) are connected
by the following equalities, for every A=(A,mA,uA),B=(B,mB,uB)∈Alg(A)
[TABLE]
Note that R is a braided lax monoidal functor if and only if L is a braided colax monoidal functor, see e.g. [AM, Proposition 3.85]. Moreover, if L is a braided colax monoidal functor one shows in a similar fashion as above that L is colax monoidal. The colax monoidal functors (L,ψ2,ψ0) and (L,ψ2,ψ0) are connected by the following equalities for every C=(C,ΔC,εC),D=(D,ΔD,εD)∈Coalg(B)
[TABLE]
As [AGM, Example 4.2] shows, a pair (L,R), where R:A→B is a (braided) lax monoidal functor between
(braided) monoidal categories A and B, having a left
adjoint L, needs not to be liftable, a priori. But, in case A and B are braided monoidal categories and R:A→B is a braided lax monoidal functor having
a left adjoint L such that the pair (L,R) is liftable, then, by
[GV, Lemma 2.4 and Theorem 2.7], there is an adjunction (L,R) that fits
into the following commutative diagrams (and explains the choice of the
-perhaps somewhat fuzzy- term “liftable”)
[TABLE]
In this diagram, all vertical arrows are forgetful functors.
1.3. An approach to a result by Tambara, inspired by Dubuc
In this subsection, we provide sufficient conditions (Theorem 1.5 together with Proposition 1.6) for R to have a left adjoint. Under relatively mild assumptions,
this is obtained by considering a result by Dubuc [Du1, Du2] and by using it to provide a result in the spirit of
Tambara’s [Ta, Remark 1.5], cf. [AEM, Theorem 2.2.8] for an unpublished proof of this result (Tambara does
not provide his own proof).
More precisely, let us compare the following two diagrams.
[TABLE]
The diagram on the left-hand side. Here A and B are monoidal categories and it is assumed that the forgetful functor Ω:Alg(A)→A has a left
adjoint T. Also, R:A→B is supposed to be
a lax monoidal functor having a left adjoint L.
If we are moreover given that A has colimits and the tensor
product commutes with them, [Ta, Remark 1.5] states that R has a left adjoint, too.
The diagram on the right-hand side. Here we are in the
setting of [Du1, Theorem 1] (see also [Du2, Theorem A.1]) where, in case the category A has reflexive coequalizers, the functor K has a left adjoint (U denotes the forgetful functor from the Eilenberg-Moore
category of algebras over the monad Q on B while K is the
functor having a derivable adjoint triangle).
Thus, although the forgetful Ω′:Alg(B)→B (as above) is neither right adjoint222it does if B has denumerable coproducts and they are
preserved by the tensor products, cf. [McL, Theorem 2, page 172]. nor, equivalently, monadic (cf. [AMe1, Theorem A.6]), it
is still possible to produce a left adjoint for R like in the
diagram on the right-hand side, where instead U is both right adjoint and
monadic. Moreover, on the right-hand side, just the existence of
reflexive coequalizers is required not of all colimits.
Inspired by Dubuc’s work, we now present a result in the spirit of
Tambara’s.
Note that there is no requirement on Ω here (no monadicity, neither
left adjoint). As a particular case we do, however, require that A has all
coequalizers (not just reflexive coequalizers).
Proposition 1.2**.**
Consider the following diagram
[TABLE]
where B is a monoidal category, ΩK=R and (L,R) is an adjunction with unit η and counit ϵ.
Given any algebra B:=(B,mB,uB) in B, write KLB in the form (RLB,mRLB,uRLB) and assume
that the diagram
[TABLE]
has a colimit (ΛB,κB:LB→ΛB) (e.g. the category A has coequalizers). This yields a functor Λ which is a left adjoint
of the functor K.
Moreover the morphisms κB define a natural transformation κ:LΩ→Λ such that κ=ϵΛ∘LΩη, where η denotes the unit of (Λ,K).
Proof.
Let B:=(B,mB,uB) be an algebra in B. From ΩK=R, we can write KLB in the form (RLB,mRLB,uRLB). By hypothesis, the diagram (9) has a colimit (ΛB,κB:LB→ΛB) (in case A has
coequalizers, it is obtained by taking the coequalizer (Λ′B,κB′:LB→Λ′B) of the left-hand side pair and then
computing the coequalizer of the pair (κB′∘LuB,κB′∘ϵLB∘LuRLB)). Let f:B→E be a
morphism in Alg(B). Then
[TABLE]
so that the following diagram serially commutes.
[TABLE]
As a consequence, there is a unique morphism Λf:ΛB→ΛE such that
[TABLE]
Since κB is an epimorphism, one easily checks that Λ(f∘f′)=Λf∘Λf′
for all morphisms f,f′ in Alg(B) that
can be composed. We thus get a functor Λ:Alg(B)→A and (10) means that κ− is
natural in the lower argument. Let us check that (Λ,K) is
an adjunction. For every A∈A, consider the diagram (9) for B=KA (hence B=RA) i.e.
[TABLE]
Then it is easily verified that ϵA∘(ϵLRA∘LmRLRA∘L(ηRA⊗ηRA))=ϵA∘LmRA and that
ϵA∘(ϵLRA∘LuRLB)=ϵA∘LuRA, so there exists a unique morphism ϵA:ΛKA→A such that
[TABLE]
If h:A→A′ is a morphism in A, we have
[TABLE]
and hence ϵA′∘ΛKh=h∘ϵA which means that ϵ− is
natural in the lower argument. We have
[TABLE]
so that RκB∘ηB induces an algebra map ηB:B→KΛB such that
[TABLE]
Given a morphism f:B→E in Alg(B), we get
[TABLE]
and hence ηE∘f=KΛf∘ηB which means that η− is
natural in the lower argument. We have that
[TABLE]
so that ϵΛB∘ΛηB=IdΛB.
Moreover,
[TABLE]
Since Ω is faithful, we get that KϵA∘ηKA=IdKA. Thus (Λ,K) is an adjunction. We compute
[TABLE]
Remark 1.3*.*
We already observed that, if R:A→B is a lax
monoidal functor having a left adjoint and if A has colimits and
the tensor product commutes with them, then R is a right
adjoint too. It can be shown that the pair
[TABLE]
is reflexive if we assume that η\mathdsI:\mathdsI→RL\mathdsI is multiplicative.
Let us fix the following setting we will frequently work in.
Setting 1.4*.*
Let A and B be monoidal categories and let R:A→B be a lax monoidal functor with a left adjoint L,
unit η:idB→RL and counit ϵ:LR→idA. Assume that the forgetful functor Ω:Alg(A)→A has a left adjoint T, with unit α:idA→ΩT and counit γ:TΩ→idAlg(A).
Given an algebra B=(B,mB,uB) in B, write
[TABLE]
and set μ:=γTLB∘TϵΩTLB∘TLmRΩTLB∘TL(RαLB∘ηB⊗RαLB∘ηB). Consider the diagram
[TABLE]
The following result provides a sufficient condition for
R=Alg(R) to have a left adjoint for a lax monoidal functor R with a left adjoint.
Theorem 1.5**.**
In the Setting 1.4, assume
that for every algebra B in B the diagram (12) has a colimit (LB,κB:TLB→LB) (e.g. the
category Alg(A) has coequalizers). This yields a
functor L which is a left adjoint of the functor R=Alg(R):Alg(A)→Alg(B) and the morphisms κB define a natural transformation κ:TLΩ→L.
Proof.
Let (L,R,η,ϵ) and (T,Ω,α,γ) be the
adjunctions as in Setting 1.4. Their composition yields the adjunction
[TABLE]
Then diagram (9) becomes (\refeq:14bis) in
our setting as the role of diagram (8) is played by the
following diagram
[TABLE]
where Ω′R=RΩ. The conclusion follows by
Proposition 1.2.
∎
The next result collects sufficient conditions for Theorem 1.5 to be applied.
Proposition 1.6**.**
For a monoidal category A, assume that Alg(A) is complete, well-powered and it has a cogenerating family. Then the category Alg(A) has coequalizers. Moreover, the forgetful functor Ω:Alg(A)→A has a left adjoint T.
Proof.
By [Bo, Proposition 3.3.8], the category Alg(A) is cocomplete. In particular, Alg(A) has coequalizers. Moreover, since Ω creates limits (cf. [Pa2, Proposition 2.5]), it also preserves them so that by the special adjoint functor theorem (cf. [Bo, Theorem 3.3.4]) it has a left adjoint T.
∎
Example 1.7**.**
Let k be a commutative ring. Let A=k-Modop be the opposite of the category k-Mod.
Thus Alg(A)=k-Coalgop is the opposite of the category k-Coalg=Coalg(k-Mod) of k-coalgebras and their morphisms.
By the proof of [Ba, Theorem 4.1], the category Alg(A) is complete, well-powered and it has a cogenerating family.
Thus Proposition 1.6 applies. As a consequence, by Theorem 1.5, for every lax monoidal functor R:k-Modop→B with a left adjoint, the functor R=Alg(R):k-Coalgop→Alg(B) has a left adjoint too.
In Theorem 1.5, the existence of a colimit for diagram (12) plays a crucial role. In Section 3 we will reinterpret this colimit as a suitable initial object obtaining an explicit description for LB, for every algebra B in B, under relevant assumptions. The aforementioned reinterpretation is based on the notions of relative weak coreflections and fibrations, which is our next topic of investigation.
2. Relative weak coreflections and fibrations
In this section we consider the notion of weakly coreflective subcategory and a relative version of it as a tool to compare the initial objects in the involved categories, obtaining Corollary 2.3 and Proposition 2.5. Then we study pullbacks of a relative weakly coreflective subcategory along relative fibrations, see Proposition 2.7. These results will be used in Section 3 in order to prove Proposition 3.12, Proposition 3.15 and Proposition 3.23.
2.1. Relative weak coreflections
Consider a full subcategory C of a category D. By a weak coreflection of an object D∈D in C we mean a morphism rD:D⋆→D in D with D⋆∈C and such that the function HomD(C,rD):HomD(C,D⋆)→HomD(C,D) is surjective for all C∈C.
Given a class E of morphisms in D, then C is said to be weakly E-coreflective if each object in D has a weak coreflection rD∈E. If E is the whole class of morphisms in D we will just say weakly coreflective, see e.g. [AR, Definition 4.5]. Clearly, a weakly E-coreflective subcategory is in particular weakly coreflective.
Remark 2.1*.*
When E is the class of monomorphisms (resp. epimorphism) one could speak about weakly mono-coreflective (epi-coreflective), in analogy to the non-weak case, see e.g. [HS]. Anyway, we will not deal with these cases.
Consider a weakly coreflective subcategory C of a category D and let J:C→D be the canonical embedding.
Then the object function (−)⋆:Obj(D)→Obj(C),D↦D⋆, yields a weak right adjoint to the functor J, see [Ma] (where it is called a right adjoint system). The item 1) in the following result, proved under the further assumption that the category C is posetal, is an analogue, for this particular weak right adjoint, of the well-known fact that a right adjoint preserves limits.
Proposition 2.2**.**
Let C be a posetal weakly coreflexive full subcategory of a category D and let J:C→D be the canonical embedding. Given a functor F:A→C, the following assertions holds.
- 1)
If (L,(lA)A∈A) is a limit of JF, then (L⋆,(lA∘rL)A∈A) is a limit of F.
2. 2)
If (L,(lA)A∈A) is a colimit of JF, then (L⋆,(lA⋆)A∈A) is a colimit of F, for a unique morphism lA⋆:FA→L⋆ in C such that rL∘lA⋆=lA, for every A∈A.
Proof.
1) Set lA⋆:=lA∘rL:L⋆→FA which is clearly a morphism in C. Given a morphism a:A→A′ in A, we have that Fa∘lA⋆=JFa∘lA∘rL=lA′∘rL=lA′⋆ so that (L⋆,(lA⋆)A∈A) is a cone on F. Given another cone (C,(cA)A∈A) on F, it is in particular a cone on JF so that, since (L,(lA)A∈A) is a limit of JF, there is a unique morphism c:C→L in D such that lA∘c=cA. Since HomD(C,rL):HomD(C,L⋆)→HomD(C,L) is surjective, there is c′:C→L⋆ in D such that rL∘c′=c. Thus lA⋆∘c′=lA∘rL∘c′=lA∘c=cA. Finally, since C and L⋆ are in C, the morphism c′ is in fact a morphism in C and hence it is unique as C is posetal.
2) Since HomD(FA,rL):HomD(FA,L⋆)→HomD(FA,L) is surjective, there is lA⋆:FA→L⋆ in D such that rL∘lA⋆=lA. Since FA and L⋆ are in C, the morphism lA⋆ is in fact a morphism in C and hence it is unique as C is posetal. Clearly (L⋆,(lA⋆)A∈A) is automatically a cocone on F as C is posetal. Given another cocone (C,(cA)A∈A) on F, it is in particular a cocone on JF so that, since (L,(lA)A∈A) is a colimit of JF, there is a unique morphism c:L→C in D such that c∘lA=cA. Set c⋆:=c∘rL:L⋆→C. This is a morphism in C whence it is unique as C is posetal. Moreover c⋆∘lA⋆=c∘rL∘lA⋆=c∘lA=cA.
∎
The following result will be useful in constructing explicitly an initial object in a posetal weakly coreflexive full subcategory.
Corollary 2.3**.**
Let C be a posetal weakly coreflexive full subcategory of a category D. Assume there is a set S consisting of objects in C such that each object in C is isomorphic to an element of S. If there exists the product ∏S∈SS in D, then (∏S∈SS)⋆ is an initial object in C.
Proof.
Set D:=∏S∈SS∈D. By Proposition 2.2, we have that D⋆∈C is the product of the elements of S in C so that we can consider the canonical projection pS:D⋆→S in C, for every S∈S. Given C∈C, there is S∈S and an isomorphism f:S→C in C. Since C is posetal we get HomC(D⋆,C)={f∘pS} and hence D⋆ is an initial object in C.
∎
Lemma 2.4**.**
Let C be a posetal weakly coreflective full subcategory of a category D. Then, for every C∈C and D∈D, there can be a unique morphism C→D in D.
Proof.
Since C is weakly coreflective, there is a morphism rD:D⋆→D with D⋆∈C and such that the function HomD(C,rD):HomD(C,D⋆)→HomD(C,D) is surjective. Since C is a posetal full subcategory of a category D, we have that HomD(C,D⋆)=HomC(C,D⋆) has at most one element so that HomD(C,D) has at most one element.
∎
Proposition 2.5**.**
Let C be a replete posetal weakly coreflective full subcategory of a category D.
Then C and D have the same initial objects, if any.
Proof.
Assume that I is an initial object in C and let D∈D. By Lemma 2.4, the set HomD(I,D) has at most one element. Since C is weakly coreflective, there is a morphism rD:D⋆→D with D⋆∈C and since I is initial in C there is a morphism i:I→D⋆ so that rD∘i∈HomD(I,D) and hence HomD(I,D)={rD∘i} so that I is initial in D.
Conversely, assume I is an initial object in D. Since I is a particular instance of colimit, by Proposition 2.2, we have that I⋆ is an initial object in C. By the foregoing, I⋆ is an initial object also in D. By uniqueness we get I≅I⋆ as objects in D. Since C is replete and I⋆∈C, we get that I∈C. Thus I is an initial object also in C.
∎
Let C be a full subcategory of a category D. We can consider the pullback of C along a functor V:D′→D i.e. the full subcategory C′ of D′ whose objects are the D′∈D′ such that VD′∈C. Clearly V induces the functor U:C′→C,C′↦VC′,f′↦Vf′ which makes commute the diagram
[TABLE]
The instance of this situation we are interested in is the diagram in Remark 3.7.
Lemma 2.6**.**
Let C be a replete posetal full subcategory of a category D. Consider the pullback C′ of C along a faithful functor V:D′→D. Then C′ is a replete posetal full subcategory of D′.
Proof.
Let C′∈C′ and D′∈D′. Given an isomorphism h′:C′→D′ in D′, then we get an isomorphism Vh′:VC′→VD′ in D. Since VC′∈C, and C is replete, we get that VD′∈C and hence D′∈C′. Thus D′ is a replete full subcategory of C′.
Given morphisms f,g:C′→C′′ in C′, we get that Vf,Vg:VC′→VC′′ are morphisms in C. Since C is posetal we get Vf=Vg. Since V is faithful, we get f=g and hence C′ is posetal.
∎
2.2. Relative fibrations
Let F:A→B be a functor. Recall that a morphism f∈A is cartesian (with
respect to F) over a morphism f′∈B whenever Ff=f′ and, when given g∈A and h∈B such
that Ff∘h=Fg, there exists a unique morphism k∈A
such that Fk=h and f∘k=g.
[TABLE]
Let E be a class of morphisms in B. We say that F is an E-fibration if every morphism f′:B→FA in E there is f:A^{\prime}\rightarrow A\which is cartesian over f′, see [AMe2, Definition 4.1].
Proposition 2.7**.**
Let C be a weakly E-coreflexive full subcategory of a category D. Consider the pullback C′ of C along an E-fibration V:D′→D. Then C′ is a weakly coreflexive full subcategory of D′.
Proof.
Given X∈D′, since VX∈D, we can consider rVX:(VX)⋆→VX in E. Since V is an E-fibration, there is a morphism rX′:X⋆→X in D′ which is cartesian over rVX. In particular V(rX′)=rVX so that V(X⋆)=(VX)⋆ and hence X⋆∈C′. We have to check that HomD′(C′,rX′) is surjective for all C′∈C′.
[TABLE]
Let f∈HomD′(C′,X). Then Vf∈HomD(VC′,VX). Since HomD(VC′,rVX) is surjective, there is g∈HomD(VC′,(VX)⋆) such that rVX∘g=Vf. Since rX′ is cartesian over rVX, there is a unique morphism g′∈HomD′(C′,X⋆) such that Vg′=g and rX′∘g′=f. Thus HomD′(C′,rX′) is surjective.
∎
3. The crucial colimit as an initial object
In Theorem 1.5 it is shown that, in the Setting 1.4, the existence of a colimit for the diagram (12), for every algebra B in B, yields a functor L which is a left adjoint of the functor R=Alg(R):Alg(A)→Alg(B). The first aim of this section is to reinterpret this colimit as an initial object in the category IndAlg(B) of induced algebras of B. This will lead us to rewrite Theorem 1.5 as Theorem 3.5. Then, under suitable assumptions, in several steps we will see in Theorem 3.21 that IndAlg(B) can be replaced by three other categories that can be more easy to handle in practice, among them the category IndObje(B) of epi-induced objects. Then we will provide a construction of an initial object in IndObje(B). Putting together these results we will provide Proposition 3.24 giving an explicit description for LB. By taking Cop instead of A we will get Proposition 3.26 that will be used together with Remark 4.6 in the Section 4 for our main example.
3.1. Induced objects and algebras
Our aim here is to characterize a colimit for (12) as an initial object in the category IndAlg(B) of induced algebras of B.
Definition 3.1**.**
Let (L:B→A,ψ2,ψ0)
be a colax monoidal functor and let B:=(B,mB,uB) be an algebra in B.
We say that (A,q) is an induced object of B (by L) whenever A=(A,mA,uA)
consists of an object A and morphisms mA:A⊗A→A, uA:\mathdsI→A and q:LB→A in A such
that
[TABLE]
A morphism h:(A,q)→(A′,q′) of induced objects of B is a morphism h:A→A′ such that h∘q=q′. In this way we have defined the category IndObj(B) of induced objects of B and their morphisms.
Given (A,q) in IndObj(B),
if the triple A=(A,mA,uA) is an algebra in A then (A,q) is called an induced algebra of B (by L). Note that (A,q) is an object in the comma category (LB↓Ω), see [McL, page 47], where Ω:Alg(A)→A is the forgetful functor. Thus we can define a morphism h:(A,q)→(A′,q′) of induced algebras of B to be an algebra morphism h:A→A′ such that Ωh∘q=q′. In this way we have defined the category IndAlg(B) of induced algebras of B an their morphisms.
Remark 3.2*.*
The two above notions of induced object and algebra
already appeared in [PS, Definition 11] with a slightly different
terminology.
We now turn to the Setting 1.4.
It is well-known that the colimit of a diagram D is the initial object in the category formed by cocones on D.
Invisible: See, e.g. Definition 5.16 in [Awodey, "Category Theory"]
In particular, we get that a colimit for diagram (12) is an initial object in the category Cocone(B) whose objects are pairs (A,ξ), where ξ:TLB→A is an algebra morphism that coequalizes the pairs in (12) and whose morphisms (A,ξ)→(A′,ξ′) are algebra morphisms f:A→A′ such that f∘ξ=ξ′.
The next aim is to use the adjunction (T,Ω,α:idA→ΩT,γ:TΩ→idAlg(A)) to show that the category Cocone(B) is isomorphic to the category IndAlg(B) so that the respective initial objects are in bijective correspondence.
Proposition 3.3**.**
In the Setting 1.4, let B:=(B,mB,uB) be an algebra in B.
Then an algebra morphism ξ:TLB→A coequalizes the
pairs in (12) if and only if (A,Ωξ∘αLB:LB→A) is an induced
algebra of B. As a consequence we get the category isomorphism
[TABLE]
whose inverse F−1 is given by F−1(A,q):=(A,γA∘Tq).
Proof.
Recall that the morphisms mRΩTLB and uRΩTLB are
determined by the equality (11) so that
[TABLE]
where TLB=(ΩTLB,mΩTLB,uΩTLB). By
using this fact, we want to rewrite some of the morphisms in (\refeq:14bis). We have
[TABLE]
and
[TABLE]
Now, let ξ:TLB→A be some algebra morphism. Then ξ
coequalizes at the same time both pairs in (\refeq:14bis)
if and only if
[TABLE]
These are equalities in HomAlg(A)(TL(B⊗B),A) and HomAlg(A)(TL\mathdsI,A), respectively. Note that, using the adjunction (T,Ω), one has that the map
[TABLE]
has inverse
[TABLE]
By applying Φ(X,Y), the equalities above reduce to
[TABLE]
i.e.
[TABLE]
Since ξ:TLB→A is an algebra morphism, Ωξ∘mΩTLB=mA∘(Ωξ⊗Ωξ) and Ωξ∘uΩTLB=uA so that, if we set qξ:=Ωξ∘αLB:LB→A, the last displayed equalities above
can be rewritten as
[TABLE]
Since, from the very beginning, A=(A,mA,uA)
is an algebra, the last displayed equalities mean that (A,qξ) is an induced algebra of B. More precisely, an
algebra morphism ξ:TLB→A coequalizes the pairs in (12) if and only if (A,qξ:LB→A) is an induced algebra of B.
By the foregoing, we have that F is well-defined on objects. Moreover If f:(A,ξ)→(A′,ξ′) is a morphism in Cocone(B), then Ωf∘qξ=Ωf∘Ωξ∘αLB=Ω(f∘ξ)∘αLB=Ωξ′∘αLB=qξ′ so that f:(A,qξ)→(A′,qξ′) is a morphism in IndAlg(B) and hence F is well-defined on morphisms too.
Let now (A,q) be an object in IndAlg(B). Via the adjunction (T,Ω,α,γ), we have that q=Ωξq∘αLB:LB→A where ξq:=γA∘Tq. By the first part of the statement, we have that ξq coequalizes (12) so that (A,ξq) is an object in Cocone(B). Thus we can define G:IndAlg(B)→Cocone(B),(A,q)↦(A,ξq),f↦f. Note that G is well-defined on morphisms as, given f:(A,q)→(A′,q′), we have f∘ξq=f∘γA∘Tq=γA′∘TΩf∘Tq=γA′∘T(Ωf∘q)=γA′∘Tq′=ξq′. Since (T,Ω,α,γ) is an adjunction, it is clear that ξ=ξqξ and q=qξq so that we get that F∘G and G∘F act as the identity functors on objects. Since they also act as the identity on morphisms, we get F∘G=Id and G∘F=Id.
∎
As a consequence of Proposition 3.3 and of the observation we made that a colimit for (12) is nothing but an initial object in the category Cocone(B), we get the following characterization.
Proposition 3.4**.**
In the Setting 1.4, the
following assertions are equivalent for any algebra B:=(B,mB,uB) in B.
- (1)
(P,p:LB→ΩP)* is an initial object in the category IndAlg(B) of induced algebras of B.*
2. (2)
(P,κ:TLB→P)* is a colimit for (12).*
The morphisms p and κ correspond to each other through the adjunction
(T,Ω,α,γ) i.e. p:=Ωκ∘αLB and κ:=γP∘Tp.
By using Proposition 3.4 we are now able to rewrite Theorem 1.5 in a different form.
Theorem 3.5**.**
In the Setting 1.4, assume
that for any algebra B:=(B,mB,uB) in B there is an initial object (PB,pB:LB→ΩPB)
in the category IndAlg(B) of induced algebras of B.
Then R=Alg(R):Alg(A)→Alg(B) has a left adjoint L defined by LB:=PB for any B as above. Moreover the morphisms pB define a natural transformation p:LΩ→ΩL whose naturality completely determines how L acts on morphisms.
Proof.
Since condition (1) in Proposition 3.4 is satisfied, we know there is a morphism κB:TLB→PB such that (PB,κB) is a colimit for (\refeq:14bis). Moreover we have that pB=ΩκB∘αLB.
By Theorem 1.5, this colimit yields a
functor L which is a left adjoint of the functor R:Alg(A)→Alg(B) and the morphisms κB define a natural transformation κ:TLΩ→L. Explicitly LB:=PB and the action of L on morphisms is uniquely determined by the naturality of κ. From pB=ΩκB∘αLB we get that the morphisms pB define a natural transformation p:LΩ→ΩL such that p=Ωκ∘αLΩ.
Indeed, since we also have κB=γLB∘TpB, the naturality of κ is equivalent to the naturality of p and hence the latter completely determines the action of L on morphisms as well.
∎
Theorem 3.5 shows how central is the role played by an initial object in the category IndAlg(B) of induced algebras of B. Under suitable assumptions, we will see that this category can be replaced by three other categories that can be more easy to handle in practice. One of them is IndObj(B) while the remaining two, namely IndObje(B) and IndAlge(B), are introduced in Subsection 3.2.
3.2. Epi-induced objects and algebras and initial objects
Here we introduce the categories IndObje(B) and IndAlge(B) and, in Theorem 3.21, we show that, under the proper assumptions, the four categories IndObje(B), IndObj(B), IndAlge(B) and IndAlg(B) have the same initial object, if any. This will be done by exploiting the results on relative weak coreflections and fibrations of Section 2.
Definition 3.6**.**
By an epi-induced object (or algebra) of B we mean an induced object (or algebra) (A,q) of B such that q is an epimorphism.
We denote by IndObje(B) the full subcategory of IndObj(B) formed by epi-induced objects and by IndAlge(B) the full subcategory of IndAlg(B) formed by epi-induced algebras.
Remark 3.7*.*
Clearly the forgetful functor Ω:Alg(A)→A induces the faithful functors
[TABLE]
that make commute the following diagram of functors
[TABLE]
where the vertical arrows are the canonical full embeddings. Note that the category IndAlge(B) is the pullback of IndObje(B) along V meaning that it is the full subcategory of IndAlg(B) consisting of objects whose image through V belongs to IndObje(B).
The assumptions we will use, include the notion of (Epi, StrongMono)-factorization. Let us
recall the definition of a strong monomorphism in a
category.
Definition 3.8**.**
A monomorphism m is called strong if for every commutative square
[TABLE]
where e is an epimorphism, there is a unique morphism w such that w∘e=u and m∘w=v.
For instance, one can easily verify that a regular monomorphism is always
strong.
Remark 3.9*.*
Following [Mit, page 12], recall that a coimage of a
morphism q:Q→A in an arbitrary category C is a pair Coim(q):=(A′,q′) where q′:Q→A′ is an epimorphism such that q factors through q′ and, if there is another epimorphism q′′:Q→A′′ such that q factors through q′′, then q′ factors through q′′. In other words Coim(q) is the biggest epi-induced object of Q that q factors through.
[TABLE]
Now, consider a morphism q:Q→A in C that admits an (Epi, StrongMono)-factorization
i.e. q factors as an epimorphism q′:Q→A′
followed by a strong monomorphism h′:A′→A, so
that q=h′∘q′. Then (A′,q′)=Coim(q).
3.3. Comparing the Initial objects in IndObj(B) and IndObje(B)
We are going to prove Proposition 3.12 which compares the initial objects in IndObj(B) and IndObje(B). First we need two lemmata.
Lemma 3.10**.**
Let (L:B→A,ψ2,ψ0) be a
colax monoidal functor and let (E,q)∈IndObj(B) be such that
q* factors as q=h∘q′, where h:E′→E is a strong monomorphism and q′:LB→E′ is an epimorphism;*
the morphisms (q′⊗q′)∘ψ2(B,B) and ψ0 are epimorphisms.
*Then E′ becomes an (E′,q′)∈IndObj(B) and h induces a morphism h:(E′,q′)→(E,q) in IndObj(B) such that h∘mE′=mE∘(h⊗h) and h∘uE′=uE.
*
Proof.
We have
[TABLE]
and uE∘ψ0=q∘LuB=h∘q′∘LuB.
Hence we have the following commutative squares
[TABLE]
Since the morphisms (q′⊗q′)∘ψ2(B,B) and ψ0 are epimorphisms, and h is a
strong monomorphism, there is a unique morphism mE′ such that h∘mE′=mE∘(h⊗h) and mE′∘(q′⊗q′)∘ψ2(B,B)=q′∘LmB, and there is a unique
morphism uE′ such that h∘uE′=uE and uE′∘ψ0=q′∘LuB. Thus (E′,q′)∈IndObj(B), where we set E′:=(E′,mE′,uE′).
∎
Lemma 3.11**.**
IndObje(B)* is a replete posetal full subcategory of IndObj(B).*
Proof.
Let (A,p)∈IndObje(B) and (A′,p′)∈IndObj(B).
Given an isomorphism h:(A,p)→(A′,p′), we have p′=h∘p so that p′ is an epimorphism as p. Thus IndObje(B) is a replete full subcategory of IndObj(B).
Given morphisms f,g:(A,p)→(A′,p′) in IndObj(B), we get f∘p=p′=g∘p. Since p is an epimorphism we get f=g. In particular IndObje(B) is posetal.∎
Denote by E(B) the class of morphisms h:(A′,q′)→(A,q) in IndObj(B) such that h:A′→A is a monomorphism, h∘mA′=mA∘(h⊗h) and h∘uA′=uA.
Proposition 3.12**.**
In the Setting 1.4, assume that
If (A,q)∈IndObj(B), then q admits an (Epi,
StrongMono)-factorization q=h∘q′,
the morphisms (q′⊗q′)∘ψ2(B,B) and ψ0 are epimorphisms.
Then, IndObje(B) is a weakly E(B)-coreflective subcategory of IndObj(B). Explicitly, given (A,q)∈IndObj(B), we have that (A,q)⋆=(A′,q′) where (A′,q′)=Coim(q).
As a consequence IndObj(B) and IndObje(B) have the same initial objects.
Proof.
Let (A,q:LB→A) be an induced object of
B in A. By hypothesis, q admits an (Epi,
StrongMono)-factorization q=h∘q′ where h:A′→A is a strong monomorphism and q′:LB→A′ is an epimorphism. Moreover the morphisms (q′⊗q′)∘ψ2(B,B) and ψ0 are epimorphisms. Note that, by Remark 3.9, we have that (A′,q′)=Coim(q). We can apply Lemma 3.10 to deduce that A′ becomes an epi-induced object (A′,q′) of B and h induces a morphism h:(A′,q′)→(A,q) of induced objects such that h∘mA′=mA∘(h⊗h) and h∘uA′=uA. Thus h:(A′,q′)→(A,q) is in E(B).
We have so proved that, for any (A,q) in IndObj(B), there is (A′,q′) in IndObje(B) and a morphism h:(A′,q′)→(A,q) in E(B).
Given (E,p) in IndAlge(B), let us check that
[TABLE]
is surjective. Given a morphism f:(E,p)→(A,q) in IndObj(B), we have that f∘p=q=h∘q′ so that f∘p=h∘q′. Since h is a strong monomorphism and p is an epimorphism, there is a unique morphism w:E→A such that h∘w=f and w∘p=q′. These equalities say we have a morphism w:(E,p)→(A′,q′) whose image through HomIndAlg(B)((E,p),h) is exactly the starting morphism f.
Thus HomIndAlg(B)((E,p),h) is surjective. Hence IndAlge(B) is a weakly E(B)-coreflective subcategory of IndAlg(B). In particular IndAlge(B) is a weakly coreflective subcategory of IndAlg(B). This, together with Lemma 3.11, implies that we can apply Proposition 2.5 to conclude.
∎
3.4. Comparing the Initial objects in IndAlg(B) and IndAlge(B)
Next aim is proving Proposition 3.15, which compares the initial objects of IndAlg(B) and IndAlge(B). We first need the following lemmata.
Lemma 3.13**.**
IndAlge(B)* is a replete posetal full subcategory of IndAlg(B).*
Proof.
It follows by Remark 3.7 and Lemma 2.6.
∎
Lemma 3.14**.**
The functor V:IndAlg(B)→IndObj(B) of Remark 3.7 is an E(B)-fibration.
Proof.
Let (A,q)∈IndAlg(B), (A′,q′)∈IndObj(B) and let h:(A′,q′)→V(A,q) be a morphism in E(B). Thus h:A′→A is a monomorphism such that h∘mA′=mA∘(h⊗h) and h∘uA′=uA. Since h is a monomorphism, one easily checks that A′=(A′,mA′,uA′) is an algebra, by using the fact that A=(A,mA,uA) is an algebra. Then h induces an algebra morphism h:A′→A such that Ωh=h and we get a morphism h:(A′,q′)→(A,q) in IndAlg(B) whose image through V is h:(A′,q′)→V(A,q). It remains to check that h is cartesian over h. Given a morphism g:(A′′,q′)→(A,q) in IndAlg(B) and a morphism l:V(A′′,q′′)→V(A′,q′) such that h∘l=Vg=:g, we have h∘l∘mA′′=g∘mA′′=mA∘(g⊗g)=mA∘(h⊗h)∘(l⊗l)=h∘mA′∘(l⊗l) so that l∘mA′′=mA′∘(l⊗l) as h is a monomorphism. Similarly h∘l∘uA′′=g∘uA′′=uA=h∘uA′ and hence l∘uA′′=uA′. Therefore there is an algebra morphism l:A′′→A′ such that Ωl=l. Thus l:(A′′,q′′)→(A′,q′) is a morphism whose image through V is l:V(A′′,q′′)→V(A′,q′) and such that h∘l=g.
∎
Proposition 3.15**.**
In the Setting 1.4, assume that
If (A,q)∈IndObj(B), then q admits an (Epi,
StrongMono)-factorization q=h∘q′,
the morphisms (q′⊗q′)∘ψ2(B,B) and ψ0 are epimorphisms.
Then, IndAlge(B) is a weakly coreflective subcategory of IndAlg(B). As a consequence IndAlg(B) and IndAlge(B) have the same initial objects.
Proof.
Our hypotheses guarantee that we can apply Proposition 3.12 to get that IndObje(B) is a weakly E(B)-coreflective subcategory of IndObj(B). Moreover, by Lemma 3.14, the functor V:IndAlg(B)→IndObj(B) is an E(B)-fibration. Therefore, we can apply Proposition 2.7 to the diagram in Remark 3.7 to get that IndAlge(B) is a weakly coreflective subcategory of IndAlg(B). This, together with Lemma 3.13 imply that we can apply Proposition 2.5 to conclude.
∎
3.5. Comparing all of the Initial objects
Next aim is to obtain Theorem 3.21, where we compare the initial objects in the categories IndObje(B), IndObj(B), IndAlge(B) and IndAlg(B) altogether. First we need some lemmata.
Given an induced algebra (E,q) of B,
the next lemma shows that, under mild assumptions, Coim(q)=(E′,q′) becomes an induced algebra
of B.
Lemma 3.16**.**
Let (L:B→A,ψ2,ψ0) be a colax monoidal functor. Let q:LB→A
me a morphism that admits two (Epi, StrongMono)-factorizations q=h∘q′ and q=h′∘q′′. We have that
(q′⊗q′)∘ψ2(B,B)* is an
epimorphism if and only if so is (q′′⊗q′′)∘ψ2(B,B);*
(q′⊗q′⊗q′)∘(LB⊗ψ2(B,B))∘ψ2(B,B⊗B)* is an
epimorphism if and only if so is (q′′⊗q′′⊗q′′)∘(LB⊗ψ2(B,B))∘ψ2(B,B⊗B).*
Proof.
Denote by P′ the domain of h and by P′′ the
domain of h′. By uniqueness of the (Epi,
StrongMono)-factorizations, we have an isomorphism w:P′→P′′ such that w∘q′=q′′. Hence
(q′′⊗q′′)∘ψ2(B,B)=(w⊗w)∘(q′⊗q′)∘ψ2(B,B) from which the first item follows. Similarly one treats the second one.
∎
Lemma 3.17**.**
In the Setting 1.4, assume that ψ0 is an epimorphism and let (A,q)∈IndAlge(B) be such that q admits an (Epi,StrongMono)-factorization q=h∘q′.
- 1)
If (q′⊗q′)∘ψ2(B,B) is an epimorphism, then so is (q⊗q)∘ψ2(B,B).
2. 2)
If (q′⊗q′⊗q′)∘(LB⊗ψ2(B,B))∘ψ2(B,B⊗B) is an epimorphism, then so is (q⊗q⊗q)∘(LB⊗ψ2(B,B))∘ψ2(B,B⊗B).
Proof.
We just prove 1), the argument for 2) being similar. Since q is an epimorphism, then q=Id∘q is (Epi, StrongMono)-factorization. Since (q′⊗q′)∘ψ2(B,B) is an epimorphism, by Lemma 3.16, so is (q⊗q)∘ψ2(B,B).
∎
Lemma 3.18**.**
Let (L:B→A,ψ2,ψ0) be a colax monoidal functor and let B∈Alg(B). Let (A,q) and (A′,q′) be in IndAlg(B). Assume that (q⊗q)∘ψ2(B,B) and ψ0 are epimorphisms. Then any morphism h:A→A′ such that h∘q=q′ becomes a morphism h:(A,q)→(A′,q′) in IndAlg(B).
Proof.
We compute
[TABLE]
so that, in view of the assumptions, we deduce that mA′∘(h⊗h)=h∘mA and h∘uA=uA′
i.e. that h becomes an algebra morphism h:A→A′ such that Ωh=h. Since Ωh∘q=q′ we get that h is a morphism in IndAlg(B).
∎
Lemma 3.19**.**
In the Setting 1.4, assume that
If (A,q)∈IndAlge(B), then q admits an (Epi,
StrongMono)-factorization q=h∘q′,
the morphisms (q′⊗q′)∘ψ2(B,B) and ψ0 are epimorphisms.
Then the functor U:IndAlge(B)→IndObje(B) of Remark 3.7 is fully faithful.
Proof.
By construction U is faithful. Let (A,q),(A′,q′)∈IndAlge(B) and let h:(A,q)→(A′,p) be a morphism in IndObje(B). Then h∘q=p. By Lemma 3.17 1), we have that (q⊗q)∘ψ2(B,B) is an epimorphism so that we can apply Lemma 3.18 to get an algebra morphism h such that Ωh=h. Therefore Ωh∘q=p and hence we have a morphism h:(A,q)→(A′,p) in IndAlge(B) whose image through U is h.
∎
The next aim is to reduce to the case where epi-induced object are epi-induced
algebras.
Lemma 3.20**.**
Let (L:B→A,ψ2,ψ0) be a colax monoidal functor and let B∈Alg(B).
Let (A,q)∈IndObje(B) be such that (q⊗q⊗q)∘(LB⊗ψ2(B,B))∘ψ2(B,B⊗B) is an epimorphism. Then (A,q)∈IndAlge(B).
Proof.
Let (E,q:LB→E)∈IndObje(B). One easily verifies that
[TABLE]
[TABLE]
Since mB is associative and (ψ2(B,B)⊗LB)∘ψ2(B⊗B,B)=(LB⊗ψ2(B,B))∘ψ2(B,B⊗B)
and (q⊗q⊗q)∘(LB⊗ψ2(B,B))∘ψ2(B,B⊗B) is
an epimorphism, we deduce that mE is associative too. Note that
[TABLE]
and hence, since q is an epimorphism, we deduce that (ψ0⊗q)∘ψ2(\mathdsI,B) is an
epimorphism too. Using naturality of ψ2, we have
[TABLE]
so that mE∘(uE⊗E)=lE. Similarly one
proves that mE∘(E⊗uE)=rE.
Then E is an algebra so that (E,q)∈IndAlge(B).
∎
We are now able to prove the announced result.
Theorem 3.21**.**
In the Setting 1.4, assume that
if (A,q)∈IndObj(B), then q admits an (Epi,
StrongMono)-factorization q=h∘q′,
the morphisms (q′⊗q′)∘ψ2(B,B) and ψ0 are epimorphisms,
the morphism (q′⊗q′⊗q′)∘(LB⊗ψ2(B,B))∘ψ2(B,B⊗B) is an epimorphism.
The following assertions are equivalent.
- (1)
(P,p)* is an initial object in IndObj(B).*
2. (2)
(P,p)* is an initial object in IndObje(B).*
3. (3)
(P,p)* is an initial object in IndAlg(B).*
4. (4)
(P,p)* is an initial object in IndAlge(B).*
Proof.
(1)⇔(2). This follows from is Proposition 3.12.
(3)⇔(4). This follows from is Proposition 3.15.
(2)⇔(4). By Lemma 3.19, the functor U:IndAlge(B)→IndObje(B) of Remark 3.7 is fully faithful. By construction U is also injective on objects. In order to conclude we check that it is also surjective on objects whence a category isomorphism. Let (A,q)∈IndObje(B).
By Lemma 3.17 and the assumptions, we have that (q⊗q⊗q)∘(LB⊗ψ2(B,B))∘ψ2(B,B⊗B) is an epimorphism. By Lemma 3.20, we have (A,q)∈IndAlge(B).
∎
3.6. Constructing the Initial object in IndObje(B)
By Theorem 3.21, under the relevant assumptions, to have an initial object in IndObje(B) is equivalent to having an initial object in IndAlg(B). By Proposition 3.4, this is equivalent to having a colimit for (12), yielding then an explicit description LB. For this reason it is worthwhile to provide a construction of an initial object in IndObje(B). To this aim we first need to prove the following result.
Lemma 3.22**.**
Let I be a set and let (Ei,qi)i∈I be a family of objects in IndObj(B). Assume that the family (Ei)i∈I
has a product (E,(pt)t∈I) in A and let q:LB→E be the unique morphism
such that qi=pi∘q for every i. Then E induces a tern E=(E,mE,uE) such that ((E,q),(pt)t∈I) is the product of the family (Ei,qi)i∈I in IndObj(B).
Proof.
By the universal property of the product, there are unique morphisms q:LB→E, mE:E⊗E→E and uE:\mathdsI→E such that pi∘q=qi, pi∘mE=mEi∘(pi⊗pi) and pi∘uE=uEi, for every i∈I. Set E=(E,mE,uE). We have
[TABLE]
By the uniqueness in the universal property of the product, we get that
[TABLE]
This proves that (E,q) belongs to IndObj(B). Let us check it defines the desired product. From the equality qt=pt∘q, we get that pt:E→Et yields the projection pt:(E,q)→(Et,qt) in IndObj(B). Given, for every t∈I, a morphism ht:(A,p)→(Et,qt) in IndObj(B), by the universal property of (E,(pt)t∈I), there is a unique morphism h:A→E such that pt∘h=ht. Since pt∘h∘p=ht∘p=qt, the uniqueness implies h∘p=q so that we get a morphism h:(A,p)→(E,q) that composed by the projection yields ht:(A,p)→(Et,qt). Its uniqueness follows from the universal property of (E,(pt)t∈I).
∎
Proposition 3.23**.**
In the Setting 1.4, assume that
if (A,q)∈IndObj(B), then q admits an (Epi,
StrongMono)-factorization q=h∘q′;
the morphisms (q′⊗q′)∘ψ2(B,B) and ψ0 are epimorphisms;
there is set SB of objects of IndObje(B) such that each object in IndObje(B) is isomorphic to an element in SB;
in A there exists the product E of the family (D)(D,δD)∈SB.
Then there is (C,δC)∈SB which is an initial object in IndObje(B) such that (C,δC)=Coim(δ) where δ:LB→E is the diagonal
morphism of the family (δD)(D,δD)∈SB.
Proof.
By Lemma 3.11 and Proposition 3.12, IndObje(B) is a replete posetal weakly coreflective subcategory of IndObj(B). Since the elements in SB are, in particular objects in IndObj(B), by Lemma 3.22, the object E:=(D,δD)∈SB∏D induces a tern E=(E,mE,uE) such that ((E,δ),(pD)(D,δD)∈SB) is the product of the objects of SB in IndObj(B). By Corollary 2.3 applied to the set SB, we get that (E,δ)⋆ is an initial object in IndObje(B). By Proposition 3.12, we know that (E,δ)⋆=(E′,δ′) where (E′,δ′)=Coim(δ). Since (E′,δ′)=(E,δ)⋆∈IndObje(B), there is (C,δC)∈SB such that (E′,δ′)≅(C,δC) as objects IndObje(B). Thus also (C,δC) is an initial object in IndObje(B) and (C,δC)=Coim(δ).
∎
Proposition 3.24**.**
In the Setting 1.4, assume that
the tensor products in A preserve epimorphisms;
ψ0* and the components of ψ2 are epimorphisms in A;*
if (E,q)∈IndObj(B), then q admits an
(Epi,StrongMono)-factorization;
there is set SB of objects of IndObje(B) such that each object in IndObje(B) is isomorphic to an element in SB;
in A there exists the product E of the family (D)(D,δD)∈SB.
Then there is (C,δC)∈SB which is an initial object in IndObje(B) such that (C,δC)=Coim(δ) where δ:LB→E is the diagonal
morphism of the family (δD)(D,δD)∈SB.
Finally, if the above assumptions hold for every algebra B in B, then R has a left adjoint L explicitly given by LB=C.
Proof.
Proposition 3.23 ensures that there is (C,δC)∈SB, as in the statement, which is an initial object in IndObje(B). By Theorem 3.21, this is also an initial object in IndAlg(B). By Theorem 3.5, we conclude.
∎
Setting 3.25*.*
For our purposes it is convenient to write Proposition 3.24 in case A=Cop for a covariant functor L:B→Cop regarded as a contravariant functor (−)◊:B→C such that LB=(B◊)op and Lf=(f◊)op, for a morphism f. To this aim let us rewrite in C the notion of induced object in A=Cop of an algebra B=(B,mB,uB) in B. It consists of a pair (E,e:E→B◊), where E=(E,ΔE,εE) with E an object in C and ΔE:E→E⊗E,εE:E→\mathdsI
and e morphisms in C such that
[TABLE]
where φ2(B,B):B◊⊗B◊→(B⊗B)◊ and φ0:\mathdsI→\mathdsI◊ are determined by φ2(B,B)op=ψ2(B,B) and φ0op=ψ0 respectively. In this case we will say that (E,e:E→B◊) is a good object of B◊ in C.
Note that the induced object of B in Cop corresponding to (E,e:E→B◊) is an epi-induced object if and only if eop is an epimorphism in Cop that is e is a monomorphism in C. In this case we will say that (E,e:E→B◊) is a good subobject of B◊ in C. A morphism of good (sub)objects h:(E,e:E→B◊)→(E′,e′:E′→B◊) is a morphism h:E→E′ such that e′∘h=e. This way we get the category of good (sub)objects of B◊ in C which turns out to be anti-isomorphic to the category of (epi-)induced objects of B in Cop.
Invisible: This defines the category GoodObj(B◊) of good objects.
Let us construct a category anti-isomorphism
[TABLE]
Given h:(E,e:E→B◊)→(E′,e′:E′→B◊), we have that e′∘h=e so that hop∘(e′)op=eop and hence we get a morphism hop:((E′op,Δ′op,ε′op),e′op))→((Eop,Δop,εop),eop)). As a consequence GoodObj(B◊)≅IndObj(B)op and hence an initial object in IndObj(B) yields a terminal object in GoodObj(B◊).
Proposition 3.26**.**
Let C and B be monoidal categories and let R:Cop→B be a lax monoidal functor with a left adjoint L,
unit η and counit ϵ. In the Setting 3.25, assume that the functor ℧:Coalg(C)→C has a right adjoint and that
the tensor products in C preserve monomorphisms;
ψ0* and the components of ψ2 are monomorphisms in C;*
if (E,e:E→B◊) is a good
object of B◊ in C, then the morphism e admits an
(StrongEpi,Mono)-factorization in C;
there is a set SB of good subobjects of B◊ in C such that each good subobjects of B◊ in C is isomorphic to an element in SB;
in C there exists the coproduct of the family (D)(D,eD)∈SB.
Then there is (B⧫,θB:B⧫→B◊)∈SB which is a terminal good subobject of B◊ in C such that (B⧫,θB) is the sum of the family of subobjects (D,eD)(D,eD)∈SB of B◊.
Finally, if the above assumptions hold for every algebra B in B, then R has a left adjoint L explicitly given by LB=(B⧫)op.
In the next section, we put all of the above developed theory to work to
explicitly compute lifted auto-adjunctions on categories of so-called
“color bialgebras”.
4. Application: the group-graded case
This section is devoted to investigate the case of group-graded vector spaces. To this aim we first need to recall some auxiliary results connected to the notion of pre-rigid category.
4.1. Pre-rigid monoidal categories
In order to discuss the examples of liftable functors of our concern, we recall the following notion appeared in its original form in [GV, 4.1.3].
Definition 4.1**.**
Following [AGM, Definition 2.1], a monoidal category (C,⊗,\mathdsI) is
called pre-rigid if for every object X there exists an object X∗ and a morphism evX:X∗⊗X→\mathdsI (the evaluation at X) with the following universal property: For every morphism t:T⊗X→\mathdsI there is a
unique morphism t†:T→X∗ such that t=evX∘(t†⊗X). Equivalently the map
[TABLE]
is bijective for every object T in C.
One has that a (right) closed monoidal category is pre-rigid (cf. [AGM, Proposition 2.5]). Notice that the converse is not true: the category
of bialgebras over a field k for instance is pre-rigid monoidal [AGM, Examples 2.19.3], but not closed.
The following corollary will be applied to C=VecG.
Proposition 4.2**.**
Let C be a pre-rigid braided monoidal
category. Assume that the forgetful functor ℧:Coalg(C)→C has a right adjoint. Assume also that Coalg(C) has equalizers.
Then ((−)∗:C→Cop,(−)∗:Cop→C) is a
liftable pair of adjoint functors.
Proof.
Let R=(−)∗:A→B where A:=Cop and B:=C. By the assumptions on C, the category A=Cop fulfills the requirements of Theorem 1.5
and hence R=Alg(R):Alg(A)→Alg(B) has a left adjoint L. We conclude by [AGM, Corollary 4.7]. ∎
If a pre-rigid monoidal category is also braided, we can construct on it an adjunction that under relevant assumptions results in a liftable pair of functors. More precisely we have the following results, which we record here for further use.
Proposition 4.3**.**
(cf. [AGM, Proposition 4.4])
When C is a pre-rigid braided monoidal
category, the assignment X↦X∗ induces a functor R=(−)∗:Cop→C with a left adjoint L=Rop=(−)∗:C→Cop.
Moreover there are ϕ2,ϕ0 such that (R,ϕ2,ϕ0) is lax monoidal and, the induced colax monoidal structure on L by (3) and (6) is specifically (ϕ2op,ϕ0op).
Explicitly, ϕ0:\mathdsI→\mathdsI∗ is uniquely defined by ev\mathdsI∘(ϕ0⊗\mathdsI)=m\mathdsI and ϕ2(Xop,Yop):=φ2(X,Y):X∗⊗Y∗→(X⊗Y)∗ by
[TABLE]
Moreover, for every X in C, the unit ηX and the counit ϵXop=(jX)op of the adjunction (L,R) are uniquely defined by the equalities
[TABLE]
Remark 4.4*.*
We have noticed in Subsection 1.2 that a liftable pair induces an adjunction at the level of bialgebras in case the right adjoint is also braided. In case of Proposition 4.3, the lax monoidal functor (R,ϕ2,ϕ0) is braided if and only if the following diagram commutes
[TABLE]
that is if and only if the following diagram commutes
[TABLE]
Set f:=(cX,Y−1)∗∘φ2(X,Y). We compute
[TABLE]
so that f=φ2(Y,X)∘cY∗,X∗−1 i.e. (cX,Y−1)∗∘φ2(X,Y)=φ2(Y,X)∘cY∗,X∗−1.
As a consequence, (R,ϕ2,ϕ0) is a braided monoidal functor if and only if φ2(Y,X)∘cX∗,Y∗=φ2(Y,X)∘cY∗,X∗−1 for all objects X,Y in C. Equivalently one has to ask that φ2(Y,X)∘cX∗,Y∗∘cY∗,X∗=φ2(Y,X) for all objects X,Y in C. In particular, if φ2 is a monomorphism on components, this is equivalent to ask that cX∗,Y∗∘cY∗,X∗=1Y∗⊗X∗ which is quite close to requiring that C is symmetric.
Proposition 4.3 suggests a suitable context to obtain examples of liftable pairs of functors, as the following result shows.
Proposition 4.5**.**
[AGM, Proposition 4.6]**
For a monoidal category C, suppose a lax monoidal functor (R,ϕ2,ϕ0):Cop→C has a left adjoint L=Rop. If the induced colax monoidal structure on L by (3) and (6) is specifically (ϕ2op,ϕ0op), then R=(L)op. Moreover, if R has a left adjoint,
then (L,R) is liftable.
Remark 4.6*.*
Keeping the hypotheses of Proposition 4.5 and
assuming that A=Cop, the functor ℧:Coalg(C)→C has a right
adjoint and Coalg(C) has equalizers, then, by Theorem 1.5, the functor R has a left adjoint L which we will now describe.
We have
[TABLE]
By assumption, (R,ϕ2,ϕ0) is lax monoidal and it has a left adjoint L=Rop. Moreover, the induced colax monoidal structure (ψ2,ψ0) on L by (3) and (6) is required to be specifically (ϕ2op,ϕ0op). As in the Setting 3.25 we can regard L as a contravariant functor (−)◊:C→C and define φ2(B,B):B◊⊗B◊→(B⊗B)◊ and φ0:\mathdsI→\mathdsI◊ by setting φ2(B,B)op=ψ2(B,B) and φ0op=ψ0 respectively.
Note that, in view of the requirement (ψ2,ψ0)=(ϕ2op,ϕ0op), we also have φ2(B,B):=ϕ2(Bop,Bop) and φ0=ϕ0.
Assume further that
the tensor products preserve monomorphisms in C;
ϕ0:\mathdsI→\mathdsI◊ is invertible and
the components of \varphi_{2}\are monomorphisms;
for every X,Y∈C, any morphism X→Y◊ in
C has a (StrongEpi,Mono)-factorization;
for every algebra B in B, there is a set SB of good subobjects of B◊ in C such that each good subobjects of B◊ in C is isomorphic to an element in SB.
Since ϕ0 is invertible, (15) rewrites as εE=ϕ0−1∘(uB)◊∘e, so that εE is completely determined and can
be ignored in the definition of good object. Thus it suffices to consider terns (E,ΔE,e) such that (14) is fulfilled.
All the above assumptions permit to apply Proposition 3.26.
Then there is (B⧫,θB:B⧫→B◊)∈SB which is a terminal good subobject of B◊ in C such that (B⧫,θB) is the sum of the family of subobjects (D,eD)(D,eD)∈SB of B◊.
Finally R has a left adjoint L explicitly given by LB=(B⧫)op.
The following result is a pre-rigid version of
[PS, Proposition 8]. Note that, given a closed monoidal category (C,⊗,\mathdsI), the right adjoint [−,\mathdsI]r of the functor (−)⊗\mathdsI induces the functor R=[−,\mathdsI]r:Cop→C. The authors therein call R=Alg(R) the dual monoidal functor and prove it has a left adjoint in case C is locally presentable. Note also that a closed monoidal category is in particular pre-rigid with pre-dual given by (−)∗:=[−,\mathdsI]r.
Corollary 4.7**.**
*Let C be a pre-rigid braided monoidal
category. Assume that C is locally presentable and that the
tensor products preserve directed colimits.
Then ((−)∗:C→Cop,(−)∗:Cop→C) is a
liftable pair of adjoint functors.*
Proof.
Since C is monoidal and locally presentable and since the tensor
products preserve directed colimits, by the proof of [Por2, page 8]
(which does not use the symmetry assumption present in the definition of
admissible category), we have that Coalg(C) is locally
presentable and comonadic over C. In particular the functor ℧:Coalg(C)→C has a right adjoint. By [AR, Corollary 1.28], the category Coalg(C) is complete
so that it has equalizers. We conclude by Proposition 4.2.
∎
Remark 4.8*.*
In the setting of Corollary 4.7, since C is a locally presentable category, it has (StrongEpi, Mono)-factorization of morphisms.
Thus, part of the conditions of Remark 4.6 are automatically satisfied.
VecG is an example of a locally presentable category by [Por1, Theorem 10]. Since the tensor product in VecG is ⊗k, it preserves directed colimits. Thus one can also apply
Corollary 4.7 to this category. Indeed locally presentability is even too much to gain the liftability of the adjunction induced by the pre-dual because, as we will see, the hypotheses of Proposition 4.2 are sufficient.
4.2. A group-graded version of Sweedler’s finite dual
We now take a closer look at two examples, by first taking C=Vec, then by taking C=VecG which is our case of main
interest.
The vector space case. Let us consider the case of vector spaces, putting C=Vec, which is a pre-rigid braided monoidal category, the pre-dual of a vector space V being given by the linear dual V∗:=Homk(V,k). By Proposition 4.3, we have a functor R=(−)∗:Cop→C,X↦X∗ with left adjoint L=Rop. The maps φ2 and ϕ0 of Proposition 4.3 are defined by
[TABLE]
Note that all the requirements of Remark 4.6 are satisfied (in particular all epimorphisms are regular whence strong), where, given
an algebra B=(B,mB,uB) in C, we let SB be the set of all good
subspaces of B∗ (we will use the word subspace when the monomorphism
is an inclusion). As a consequence,
LB=(B∘)op where B∘ is the sum of all good
subspaces of B∗.
By [Mic, pages 19-20] we know that B∘ is
exactly the Sweedler’s finite dual of B.
The group-graded case. Let G be an abelian group, with neutral element e and
let VecG be the category whose objects are vector spaces (over
a field k) graded by the group G. For objects V=⊕g∈GVg,W=⊕g∈GWg∈VecG, the set of morphisms in VecG (i.e. degree-preserving k-linear maps) will be denoted as Hom(V,W). The category VecG admits a monoidal structure,
which we now briefly recall. If V,W∈VecG, then V⊗W:=⨁g(⊕xy=gVx⊗kWy) becomes an object in VecG. The unit object is k=ke. Taking associativity and unit
constraints to be trivial, (VecG,⊗,k) indeed becomes a
monoidal category.
Note that the monoidal category VecG is (right) closed. In fact we can consider the right adjoint to the endofunctor (−)⊗V of VecG (tensor product of graded vector spaces) and denote this
adjoint by HOM(V,−).
Since G is abelian, we have that HOM(V,W)=⊕g∈GHOM(V,W)g where
[TABLE]
for
any V,W∈VecG.
As we already mentioned that a (right) closed monoidal category is pre-rigid, we get that VecG is pre-rigid. To avoid confusion with the
usual (non-graded) linear dual of a vector space, the pre-dual of a G-graded vector space V=⊕gVg in VecG will be denoted by V◊. Thus V◊:=HOM(V,k). We can write explicitly the graduation of V◊ as
[TABLE]
In order to discuss braided structures on VecG, recall that a
bicharacter on G is a map α:G×G→k∖{0} such that
[TABLE]
Letting α be a bicharacter, we can define a braiding cα on VecG, given on homogeneous objects by
[TABLE]
We notice that, in order for cα to be a morphism in VecG, we need that G is abelian. Remark also that cα is a symmetry if and only if moreover holds that α(g,h)α(h,g)=1, ∀g,h∈G. In this case we say that α is skew-symmetric. We shall denote the
thus-obtained braided monoidal category as VecGα.
Since VecGα is a braided and pre-rigid monoidal category, we can use Proposition 4.3
to get that
[TABLE]
is a self-adjoint lax monoidal functor, for any bicharacter α.
Now, using [AI, Corollary 4.6] (note that VecG can be regarded as the category of comodules over the
group-algebra kG), the forgetful functor ℧:Coalg(VecG)→VecG
has a right adjoint. Moreover any parallel pair f,g:C→D in Coalg(VecG) has equalizer given by
[TABLE]
where we are using Sweedler’s notation for the comultiplication333note that it coincides with the equalizer of the same pair in Coalg(Vec), see e.g. [Ag, Remark 1.2]..
As a consequence, by Proposition 4.2 we can conclude that the adjoint pair
of functors (L,R) introduced above is liftable.
Although it does not seem to appear in
literature, the left adjoint L of R=Alg(R) -whose existence is part of the definition of a liftable pair of adjoint functors- can be described explicitly. It is our purpose here to do so. Indeed, it is shown below that, given an algebra B=(B,mB,uB) in VecG, the object LB can be identified with the biggest “good” G-graded
subspace of B◊. More precisely, LB=(B⧫)op where
[TABLE]
ξB:B◊=HOM(B,k)→Homk(B,k)=B∗
denoting the canonical injection and IBf being the set of
finite-codimensional G-graded ideals of B.
Remark 4.9*.*
Note that, if we take G to be the trivial group in the
above discussion, we recover the case of vector spaces. When taking G=⟨g∣g2=e⟩, the cyclic group of order two, and α
trivial everywhere except for α(g,g)=−1, one obtains the super vector
space case; this incorporates [GV, Remark 3.1].
Let us proceed with the details of the computation of LB.
Note that, given objects T and X in VecG, for every morphism t:T⊗X→k, the map t†:T→X◊ of Definition 4.1 is uniquely determined by the equality t=evX∘(t†⊗X) i.e. t†(a)=t(a⊗−) for a∈T.
Let us start by describing explicitly some of the maps given in Proposition 4.3.
Lemma 4.10**.**
The map φ2(X,Y):X◊⊗Y◊→(X⊗Y)◊ is given, for f∈(X◊)a,g∈(Y◊)b, by φ2(X,Y)(f⊗g):=α(a,b)mk(f⊗g). The map ϕ0:k→k◊ is given, for λ∈k, by the
equality ϕ0(λ)=λ1k. In particular ϕ0 is invertible and the components of φ2 are monomorphisms.
Proof.
By
Proposition 4.3, φ2(X,Y) is given, for f∈(X◊)a,g∈(Y◊)b, by the equality
[TABLE]
Given x∈Xc,y∈Yd, we have f(x)=δca,ef(x) and g(y)=δdb,eg(y) so that
[TABLE]
Thus φ2(X,Y)(f⊗g):=α(a,b)mk(f⊗g).
On the other hand ϕ0 is uniquely determined, for λ∈k, by the
equality ϕ0(λ)=mk(λ⊗−)=λ1k.
∎
Remark 4.11*.*
We already noticed that the lax monoidal functor R:=(−)◊:(VecGα)op→VecGα induced by the pre-dual is part of a liftable adjoint pair
of functors (L,R). Moreover, by Lemma 4.10 we know that the components of φ2 are monomorphisms. Thus, in view of Remark 4.4, we have that R is braided if and only if cX∗,Y∗α∘cY∗,X∗α=1Y∗⊗X∗ for all objects X,Y in C. In particular this holds if cα is a symmetry, which happens if and only if α is skew-symmetric. In this case, we get an induced auto-adjunction (L,R) on the category of
bialgebras in VecGα, i.e. “color bialgebras” (in the
sense of [AAB, Section 1.4] e.g.), for any such a bicharacter α.
Note that all the requirements of Remark 4.6 are satisfied, by
the discussion above where we chose SB to be the set of all good G-graded subspaces of B◊ (as in case of Vec, we will use the word subspace when the monomorphism
is an inclusion).
Thus, given an algebra B=(B,mB,uB) in C=VecG, we get that LB can be identified with the biggest good G-graded
subspace of B◊. Explicitly, there is (B⧫,θB:B⧫→B◊)∈SB, where
θB:B⧫→B◊ is the canonical inclusion, which is a terminal good G-graded subspace of B◊ such that (B⧫,θB) is the sum of the family of G-graded subspaces (D,eD)(D,eD)∈SB of B◊.
Finally L is given by LB=(B⧫)op.
To round off this example, let us further refine the description of (B⧫,θB).
To this aim denote by SBf the set of
finite-dimensional good G-graded subspaces of B◊.
Lemma 4.12**.**
(B⧫,θB)* is the sum of the family of finite-dimensional G-graded subspaces (D,eD)(D,eD)∈SBf of B◊.*
Proof.
Let (E,ΔE,e) be a good G-graded subspace of B◊, where e:E→B◊ denotes the canonical
inclusion. Then the right-hand side square in the following diagram commutes by (14).
[TABLE]
Consider a subcoalgebra (C,ΔE,εE,γ:C→E). Hence the external diagram above commutes. This means that (C,ΔE,e∘γ) is a good G-graded subspace of B◊. This proves that a subcoalgebra of a good G-graded subspace of
B◊ is a good subspace of B◊.
Given (D,eD)∈SB, we know that D becomes a G-graded coalgebra, cf. the dual result of Lemma 3.20. Hence we can apply [AI, Theorem 4.5] to get that each D is sum of finite-dimensional G-graded subcoalgebras.
Since a subcoalgebra of a good subspace of B◊ is again a good
subspace of B◊, we can write (B⧫,θB) as the desired sum. ∎
In order to describe the elements in SBf, we first need the following lemma, which further specifies other maps involved in Proposition 4.3.
Lemma 4.13**.**
The morphisms ηX,jX:X→X◊◊ are given, for x∈Xa, f∈(X◊)b, by
[TABLE]
Moreover these ηX and jX are both injective.
Proof.
By Proposition 4.3, for x∈Xa, f∈(X◊)b, we have
[TABLE]
Let us check the injectivity. Let x∈Xa be nonzero. If we complete x to a basis of X we can
consider the map λx∈Homk(X,k) such
that λx(x)=1 and λx vanishes on the
other elements of the basis. By construction λx∈HOM(X,k)a−1. Thus we can compute ηX(x)(λx)=α(a,a)−1λx(x)=α(a,a)−1=0. This proves that (ηX)a is injective and hence ηX is injective. Similarly
one gets that jX is injective.
∎
We are now ready to provide the promised description of B⧫.
Proposition 4.14**.**
We have that B⧫={f∈B◊∣ξB(f) vanishes on some I∈IBf}, where IBf denotes the set of
finite-codimensional G-graded ideals of B and ξB:B◊→B∗ is the canonical injection.
Proof.
Let (E,ΔE,e) be a finite-dimensional good G-graded subspace of
B◊. Since E is finite-dimensional we have that E◊=HOM(E,k)=Hom(E,k)=E∗ (see [NV, Lemma
3.3.2]). Thus in this case ηE,jE:E→E◊◊=E∗∗. Since, by Lemma 4.13, these maps
are injective maps between spaces with the same dimension, we deduce that ηE,jE are invertible.
Since (B⧫,θB:B⧫→B◊)∈SB is a terminal good G-graded subspace of B◊, there is a G-graded coalgebra map f:E→B⧫ such that θB∘f=e. Thus we get the algebra morphism (f)op:(B⧫)op→(E)op. If we regard (E,e) as the epi-induced object (Eop=Eop,eop) of B, we can rewrite this morphism as fop:LB→Eop where fop=(f)op. Then, if we recall that the canonical projection p:LB→ΩLB is just p=θBop and we apply to fop:LB→Eop the following adjunction, where Aop=B=VecGα,
[TABLE]
we get the algebra morphism τB:=Rfop∘ηB:B→REop. To get a better description of this morphism, recall that the unit η of (L,R) is given by ΩηB=R′κB∘ηB′ where R′:=RΩ and η′:=RαL∘η (see the proofs of Proposition 1.2 and Theorem 1.5). Moreover, by Proposition 3.4, the morphism p:LB→ΩLB can be written in terms of κB:TLB→LB as p=ΩκB∘αLB. Therefore we get
[TABLE]
and hence
[TABLE]
Since τB is a G-graded algebra map, then the kernel of the map τB, say I, is obviously a G-graded ideal
of B. Consider the following exact sequence
[TABLE]
Since it is a sequence in VecG -which is a semisimple
category- applying the contravariant functor (−)◊,
we get the exact sequence
[TABLE]
Since I=Ker(τB), there is a G-graded algebra injection λI:IB→E◊ such that
[TABLE]
Since E is finite-dimensional, so is E◊ and hence B/I is, too. This
shows that I has finite codimension whence I∈IBf. Define the map
[TABLE]
Note that χB is surjective as jE is invertible and (λI)◊ is surjective. We compute
[TABLE]
so that the following diagram commutes
[TABLE]
From this diagram, since e is an inclusion, we deduce that χB is injective. Since we already know that χB is surjective, we get that χB is invertible and hence E=Im(e)=Im(pI◊). This
proves, in view of Lemma 4.12, that B⧫⊆∑I∈IBfIm(pI◊).
Conversely, let I∈IBf and let us check that Im(pI◊) belongs to SBf. Note that φ2(B/I,B/I):(B/I)◊⊗(B/I)◊→(B/I⊗B/I)◊ is an
injective map between spaces with the same dimension as (B/I)◊=(B/I)∗ and (B/I⊗B/I)◊=(B/I⊗B/I)∗, B/I being finite-dimensional. As a consequence φ2(B/I,B/I) is
invertible. Thus we can define a unique Δ(B/I)◊ such that the following diagram commutes
[TABLE]
By using the definition of Δ(B/I)◊ and the naturality of φ2, one obtains that
[TABLE]
This means that ((B/I)◊,Δ(B/I)◊,pI◊)
is a good G-graded vector space of B◊and hence Im(pI◊) is a good G-graded subspace of B◊. Thus Im(pI◊) becomes an object in SBf.
Summing up we proved that B⧫=∑I∈IBfIm(pI◊).
In order to arrive at our goal, we now give another description of Im(pI◊). Let ξX:X◊→X∗ denote the
canonical injection. Note that, by the commutativity of the following
diagram
[TABLE]
and the injectivity of ξI, we get the following alternative
description
[TABLE]
Therefore
[TABLE]
where in (∗) we are using that {Ker(iI∗)∣I∈IBf} is a direct set of subobjects of B∗ i.e., given I,J∈IBf, there is K∈IBf such that Ker(iI∗)⊆Ker(iK∗)⊇Ker(iJ∗), namely K=I∩J, see [Pop, Theorem 8.6(4)] .
Invisible:
Note that the map
[TABLE]
is injective and hence I∩J is finite-codimensional whenever I and J are. Moreover
[TABLE]
so that Ker(iI∗)⊆Ker(iI∩J∗), Similarly one has Ker(iJ∗)⊆Ker(iI∩J∗).
Let {Xi∣i∈I} be a direct set of subobjects. Then ∑i∈IXi=∪i∈IXi. In fact given x∈∑i∈IXi there are i1,…,in∈I such that x=xi1+⋯+xin. Since the set is direct there is k∈I such that Xi1,…,Xin⊂Xk and hence x∈Xi1+⋯+Xin⊆Xk. Therefore ∑i∈IXi⊆∪i∈IXi. The other inclusion is always true.
In conclusion, noting that ξB(f)∈Ker(iI∗) if and only if ξB(f) vanishes on I, we get
B⧫={f∈B◊∣ξB(f) vanishes on some I∈IBf}.
∎
In conclusion, we got an explicit analogue of Sweedler’s finite dual in VecG. More generally, having in mind that VecG can be regarded as the category of comodules over the group-algebra kG, we expect that
one could carry out computations as in VecG for
the category of comodules over a coquasi-bialgebra.