Mackey functors on compact closed categories
Ross Street, Elango Panchadcharam

TL;DR
This paper develops a categorical framework for Mackey functors on lextensive categories, showing their monoidal structure and relation to Green functors, thus providing a structural foundation for numerical group equations.
Contribution
It extends the theory of Mackey functors using enriched category theory and characterizes their properties and relations to Green functors in a categorical setting.
Findings
The category of Mackey functors is monoidal.
Green functors are monoids within this category.
Provides an explicit description of objects in the Cauchy completion of monoidal functors.
Abstract
We develop and extend the theory of Mackey functors as an application of enriched category theory. We define Mackey functors on a lextensive category and investigate the properties of the category of Mackey functors on . We show that it is a monoidal category and the monoids are Green functors. Mackey functors are seen as providing a setting in which mere numerical equations occurring in the theory of groups can be given a structural foundation. We obtain an explicit description of the objects of the Cauchy completion of a monoidal functor and apply this to examine Morita equivalence of Green functors.
Peer Reviews
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.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Algebraic structures and combinatorial models · Advanced Topology and Set Theory
Mackey functors on compact closed categories
Elango Panchadcharam
and
Ross Street
{elango, street}@maths.mq.edu.au
Centre of Australian Category Theory, Macquarie University, New South Wales, 2109, Australia
Dedicated to the memory of Saunders Mac Lane
Abstract.
We develop and extend the theory of Mackey functors as an application of enriched category theory. We define Mackey functors on a lextensive category and investigate the properties of the category of Mackey functors on . We show that it is a monoidal category and the monoids are Green functors. Mackey functors are seen as providing a setting in which mere numerical equations occurring in the theory of groups can be given a structural foundation. We obtain an explicit description of the objects of the Cauchy completion of a monoidal functor and apply this to examine Morita equivalence of Green functors.
The authors are grateful for the support of the Australian Research Council Discovery Grant DP0450767, and the first author for the support of an Australian International Postgraduate Research Scholarship, and an International Macquarie University Research Scholarship.
1. Introduction
Groups are used to mathematically understand symmetry in nature and in mathematics itself. Classically, groups were studied either directly or via their representations. In the last 40 years, arising from the latter, groups have been studied using Mackey functors.
Let be a field. Let be the category of -linear representations of the finite group . We will study the structure of a monoidal category where the objects are called Mackey functors. This provides an extension of ordinary representation theory. For example, can be regarded as a full reflective sub-category of ; the reflection is strong monoidal (= tensor preserving). Representations of are equally representations of the group algebra ; Mackey functors can be regarded as representations of the ”Mackey algebra” constructed from . While is compact closed (= autonomous monoidal), we are only able to show that is star-autonomous in the sense of [Ba].
Mackey functors and Green functors (which are monoids in ) have been studied fairly extensively. They provide a setting in which mere numerical equations occurring in group theory can be given a structural foundation. One application has been to provide relations between - and -invariants in Iwasawa theory and between Mordell-Weil groups, Shafarevich-Tate groups, Selmer groups and zeta functions of elliptic curves (see [BB]).
Our purpose is to give the theory of Mackey functors a categorical simplification and generalization. We speak of Mackey functors on a compact (= rigid = autonomous) closed category . However, when is the category of spans in a lextensive category , we speak of Mackey functors on . Further, when is the category (topos) of finite -sets, we speak of Mackey functors on .
Sections 2-4 set the stage for Lindner’s result [Li1] that Mackey functors, a concept going back at least as far as [Gr], [Dr] and [Di] in group representation theory, can be regarded as functors out of the category of spans in a suitable category . The important property of the category of spans is that it is compact closed. So, in Section 5, we look at the category of additive functors from a general compact closed category (with direct sums) to the category of -modules. The convolution monoidal structure on is described; this general construction (due to Day [Da1]) agrees with the usual tensor product of Mackey functors appearing, for example, in [Bo1]. In fact, again for general reasons, is a closed category; the internal hom is described in Section 6. Various convolution structures have been studied by Lewis [Le] in the context of Mackey functors for compact Lie groups mainly to provide counter examples to familiar behaviour.
Green functors are introduced in Section 7 as the monoids in . An easy construction, due to Dress [Dr], which creates new Mackey functors from a given one, is described in Section 8. We use the (lax) centre construction for monoidal categories to explain results of [Bo2] and [Bo3] about when the Dress construction yields a Green functor.
In Section 9 we apply the work of [Da4] to show that finite-dimensional Mackey functors form a -autonomous [Ba] full sub-monoidal category of .
Section 11 is rather speculative about what the correct notion of Mackey functor should be for quantum groups.
Our approach to Morita theory for Green functors involves even more serious use of enriched category theory: especially the theory of (two-sided) modules. So Section 12 reviews this theory of modules and Section 13 adapts it to our context. Two Green functors are Morita equivalent when their -enriched categories of modules are equivalent, and this happens, by the general theory, when the -enriched categories of Cauchy modules are equivalent. Section 14 provides a characterization of Cauchy modules.
2. The compact closed category
Let be a finitely complete category. Then the category can be defined as follows. The objects are the objects of the category and morphisms U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V are the isomorphism classes of spans from to in the bicategory of spans in in the sense of [Bé]. (Some properties of this bicategory can be found in [CKS].) A span from to , in the sense of [Bé], is a diagram of two morphisms with a common domain , as in
[TABLE]
An isomorphism of two spans (s_{1},S,s_{2}):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V and (s^{\prime}_{1},S^{\prime},s^{\prime}_{2}):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V is an invertible arrow h:S\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces S^{\prime} such that and .
[TABLE]
The composite of two spans (s_{1},S,s_{2}):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V and (t_{1},T,t_{2}):V\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces W is defined to be (s_{1}\circ{\text{proj}}_{1},T\circ S,t_{2}\circ{\text{proj}}_{2}):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces W using the pull-back diagram as in
[TABLE]
This is well defined since the pull-back is unique up to isomorphism. The identity span (1,U,1):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces U is defined by
[TABLE]
since the composite of it with a span (s_{1},S,s_{2}):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V is given by the following diagram and is equal to the span (s_{1},S,s_{2}):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V
[TABLE]
This defines the category . We can write where square brackets denote the isomorphism classes of morphisms.
becomes a monoidal category under the tensor product
[TABLE]
defined by
[TABLE]
[TABLE]
This uses the cartesian product in yet is not the cartesian product in . It is also compact closed; in fact, we have the following isomorphisms: and . The second isomorphism can be shown by the following diagram
[TABLE]
3. Direct sums in
Now we assume is lextensive. References for this notion are [Sc], [CLW], and [CL]. A category is called lextensive when it has finite limits and finite coproducts such that the functor
[TABLE]
is an equivalance of categories for all objects and . In a lextensive category, coproducts are disjoint and universal and [math] is strictly initial. Also we have that the canonical morphism
[TABLE]
is invertible. It follows that
In the object is the direct sum of and This can be shown as follows (where we use lextensivity):
[TABLE]
and so . Also in the category , [math] is the zero object (both initial and terminal):
[TABLE]
and so . It follows that is a category with homs enriched in commutative monoids.
The addition of two spans (s_{1},S,s_{2}):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V and (t_{1},T,t_{2}):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V is given by (\nabla\circ(s_{1}+t_{1}),S+T,\nabla\circ(s_{2}+t_{2})):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V as in
[TABLE]
Summarizing, is a monoidal commutative-monoid-enriched category.
There are functors (-)_{*}:\mathscr{E}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Spn}(\mathscr{E}) and (-)^{*}:\mathscr{E}^{\text{op}}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Spn}(\mathscr{E}) which are the identity on objects and take f:U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces V to and , respectively.
For any two arrows \textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{f}$$\textstyle{V\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{g}$$\textstyle{W} in , we have as we see from the following diagram
[TABLE]
Similarly .
4. Mackey functors on
A Mackey functor from to the category of -modules consists of two functors
[TABLE]
such that:
- (1)
for all in 2. (2)
for all pullbacks
[TABLE]
in , the square (which we call a Mackey square)
[TABLE]
commutes, and 3. (3)
for all coproduct diagrams
[TABLE]
in , the diagram
[TABLE]
is a direct sum situation in . (This implies .)
A morphism \theta:M\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces N of Mackey functors is a family of morphisms \theta_{U}:M(U)\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces for in which defines natural transformations \theta_{*}:M_{*}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces N_{*} and \theta^{*}:M^{*}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces N^{*}.
Proposition 4.1**.**
(Lindner [Li1]) The category of Mackey functors, from a lextensive category to the category of -modules, is equivalent to , the category of coproduct-preserving functors.
Proof.
Let be a Mackey functor from to . Then we have a pair such that M_{*}:\mathscr{E}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k}, M^{*}:\mathscr{E}^{\text{op}}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k} and . Now define a functor M:\mathbf{Spn}(\mathscr{E})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k} by and
[TABLE]
We need to see that is well-defined. If h:S\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces S^{\prime} is an isomorphism, then the following diagram
[TABLE]
is a pull back diagram. Therefore and . This gives, . So if h:(s_{1},S,s_{2})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces(s^{\prime}_{1},S^{\prime},s^{\prime}_{2}) is an isomorphism of spans, we have the following commutative diagram.
[TABLE]
Therefore we get
[TABLE]
From this definition becomes a functor, since
[TABLE]
where and and are the projections 1 and 2 respectively, so that
[TABLE]
The value of at the identity span (1,U,1):U\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces U is given by
[TABLE]
Condition (3) on the Mackey functor clearly is equivalent to the requirement that M:\mathbf{Spn}(\mathscr{E})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k} should preserve coproducts.
Conversely, let M:\mathbf{Spn}(\mathscr{E})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k} be a functor. Then we can define two functors and , referring to the diagram
[TABLE]
by putting and . The Mackey square is obtained by using the functoriality of on the composite span
[TABLE]
The remaining details are routine. ∎
5. Tensor product of Mackey functors
We now work with a general compact closed category with finite products. It follows (see [Ho]) that has direct sums and therefore that is enriched in the monoidal category of commutative monoids. We write for the tensor product in , write for the unit, and write for the dual. The main example we have in mind is as in the last section where and . A Mackey functor on is an additive functor M:\mathscr{T}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k}.
Let us review the monoidal structure on the category of commutative monoids; the binary operation of the monoids will be written additively. It is monoidal closed. For the commutative monoid
[TABLE]
with pointwise addition, provides the internal hom and there is a tensor product satisfying
[TABLE]
The construction of the tensor product is as follows. The free commutative monoid on a set is
[TABLE]
For any ,
[TABLE]
We regard and as -categories. Every -functor \mathscr{T}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k} preserves finite direct sums. So is the -category of -functors.
For each and an object of a -category , we write for the object (when it exists) satisfying
[TABLE]
-naturally in . Also the coend we use is in the -enriched sense: for the functor T:\mathscr{C}^{\text{op}}\otimes\mathscr{C}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{X}, we have a coequalizer
[TABLE]
when the coproducts and tensors exist.
The tensor product of Mackey functors can be defined by convolution (in the sense of [Da1]) in since is a monoidal category. For Mackey functors and , the tensor product can be written as follows:
[TABLE]
the last two isomorphisms are given by the Yoneda lemma.
The Burnside functor is defined to be the Mackey functor on taking an object of to the free -module on . The Burnside functor is the unit for the tensor product of the category .
This convolution satisfies the necessary commutative and associative conditions for a symmetric monoidal category (see [Da1]). is also an abelian category (see [Fr]).
When and are understood, we simply write for this category .
6. The Hom functor
We now make explicit the closed structure on . The Hom Mackey functor is defined by taking its value at the Mackey functors and to be
[TABLE]
functorially in . To see that this hom has the usual universal property with respect to tensor, notice that we have the natural bijections below (represented by horizontal lines).
[TABLE]
We can obtain another expression for the hom using the isomorphism
[TABLE]
which shows that we have adjoint functors
[TABLE]
Since and are Mackey functors on we obtain a diagram
[TABLE]
and an equivalence of natural transformations
[TABLE]
Therefore, the Hom Mackey functor is also given by
[TABLE]
7. Green functors
A Green functor on is a Mackey functor (that is, a coproduct preserving functor A:\mathscr{T}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k}) equipped with a monoidal structure made up of a natural transformation
[TABLE]
for which we use the notation for , , and a morphism
[TABLE]
whose value at we denote by 1. Green functors are the monoids in . If A,B:\mathscr{T}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k} are Green functors then we have an isomorphism
[TABLE]
Referring to the square
[TABLE]
we write this more precisely as
[TABLE]
The Burnside functor and (for any Mackey functor ) are monoids in and so are Green functors.
We denote by the category of Green functors on . When and are understood, we simply write this as consisting of the monoids in .
8. Dress construction
The Dress construction ([Bo2], [Bo3]) provides a family of endofunctors of the category , indexed by the objects of . The Mackey functor defined as the composite
[TABLE]
is denoted by for ; so . We then define the Dress construction
[TABLE]
by . The -category is monoidal via the pointwise structure:
[TABLE]
Proposition 8.1**.**
The Dress construction
[TABLE]
is a strong monoidal -functor.
Proof.
We need to show that ; that is, . For this we have the calculation
[TABLE]
Clearly we have . The coherence conditions are readily checked. ∎
We shall analyse this situation more fully in Remark 8.5 below.
We are interested, after [Bo2], in when the Dress construction induces a family of endofunctors on the category of Green functors. That is to say, when is there a natural structure of Green functor on if is a Green functor? Since is the composite
[TABLE]
with monoidal, what we require is that should be monoidal (since monoidal functors compose). For this we use Theorem 3.7 of [DPS]:
if is a monoid in the lax centre of then -\otimes Y:\mathscr{T}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{T} is canonically monoidal.
Let be a monoidal category. The lax centre of is defined to have objects the pairs where is an object of and is a natural family of morphisms u_{B}:A\otimes B\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces B\otimes A such that the following two diagrams commute
[TABLE]
Morphisms of are morphisms in compatible with the . The tensor product is defined by
[TABLE]
where . The centre of consists of the objects of with each invertible.
It is pointed out in [DPS] that, when is cartesian monoidal, an object of is merely an object of together with a natural family A\times X\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces X. Then we have the natural bijections below (represented by horizontal lines) for cartesian closed:
[TABLE]
Therefore we obtain an equivalence
The internal hom in , the category of finite -sets for the finite group , is which is the set of functions r:X\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces Y with . The -set is defined by
[TABLE]
with .
Lemma 8.2**.**
The -set is isomorphic to , which is the set made a -set by conjugation action.
Proof.
Take . Then we have the commutative square
[TABLE]
where for . So we see that is determined by and
[TABLE]
∎
As a consequence of this Lemma, we have where is the category of crossed -sets of Freyd-Yetter ([FY1], [FY2]) who showed that is a braided monoidal category. Objects are pairs where is a -set and |~{}|:X\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces G_{c} is a -set morphism (“equivariant function”) meaning for , . The morphisms f:(X,|~{}|)\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces(Y,|~{}|) are functions such that the following diagram commutes.
[TABLE]
That is, .
Tensor product is defined by
[TABLE]
where .
Proposition 8.3**.**
[DPS, Theorem 4.5]** The centre of the category is equivalent to the category of crossed -sets.
Proof.
We have a fully faithful functor \mathcal{Z}(\mathscr{E})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathcal{Z}_{l}(\mathscr{E}) and so \mathcal{Z}(\mathscr{E})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{E}/G_{c}. On the other hand, let |~{}|:A\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces G_{c} be an object of ; so . Then the corresponding object of is where
[TABLE]
with
[TABLE]
However this is invertible since we see that
[TABLE]
This proves the proposition. ∎
Theorem 8.4**.**
[Bo3, Bo2]** If is a monoid in and is a Green functor for over then is a Green functor for over , where .
Proof.
We have , so is a monoid in . This implies -\times Y:\mathscr{E}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{E} is a monoidal functor (see Theorem 3.7 of [DPS]). It also preserves pullbacks. So -\times Y:\mathbf{Spn}(\mathscr{E})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Spn}(\mathscr{E}) is a monoidal functor . If is a Green functor for over then A:\mathbf{Spn}(\mathscr{E})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k} is monoidal. Then we get A_{Y}=A\circ(-\times Y):\mathbf{Spn}(\mathscr{E})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mod}_{k} is monoidal and is indeed a Green functor for over . ∎
Remark 8.5*.*
The reader may have noted that Proposition 8.1 implies that takes monoids to monoids. A monoid in is a pair where is a monoid in and is a Green functor; so in this case, we have that is a Green functor. A monoid in is certainly a monoid in . Since is cartesian monoidal (and so symmetric), each monoid in gives one in the centre. However, not every monoid in the centre arises in this way. The full result behind Proposition 8.1 and the centre situation is: the Dress construction
[TABLE]
is a strong monoidal -functor; it is merely monoidal when the centre is replaced by the lax centre.
It follows that is a Green functor whenever is a Green functor and is a monoid in the lax centre of .
9. Finite dimensional Mackey functors
We make the following further assumptions on the symmetric compact closed category with finite direct sums:
- •
there is a finite set of objects of such that every object of can be written as a direct sum
[TABLE]
with in ; and
- •
each hom is a finitely generated commutative monoid.
Notice that these assumptions hold when where is the category of finite -sets for a finite group . In this case we can take to consist of a representative set of connected (transitive) -sets. Moreover, the spans S:X\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces Y with generate the monoid .
We also fix to be a field and write in place of .
A Mackey functor M:\mathscr{T}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Vect} is called finite dimensional when each is a finite-dimensional vector space. Write for the full subcategory of consisting of these.
We regard as a full subcategory of . The inclusion functor \mathscr{C}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{T} is dense and the density colimit presentation is preserved by all additive M:\mathscr{T}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Vect}. This is shown as follows:
[TABLE]
That is,
[TABLE]
Proposition 9.1**.**
The tensor product of finite-dimensional Mackey functors is finite dimensional.
Proof.
Using the last isomorphism, we have
[TABLE]
If and are finite dimensional then so is the vector space (since is finitely generated). Also the coend is a quotient of a finite direct sum. So is finite dimensional. ∎
It follows that is a monoidal subcategory of (since the Burnside functor is certainly finite dimensional under our assumptions on ).
The promonoidal structure on represented by this monoidal structure can be expressed in many ways:
[TABLE]
Following the terminology of [DS1], we say that a promonoidal category is -autonomous when it is equipped with an equivalence S:\mathscr{Ms}^{\text{op}}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{Ms} and a natural isomorphism
[TABLE]
A monoidal category is -autonomous when the associated promonoidal category is.
As an application of the work of Day [Da4] we obtain that is -autonomous. We shall give the details.
For , define so that S:\mathbf{Mky}_{\textit{fin}}^{\text{op}}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mky}_{\textit{fin}} is its own inverse equivalence.
Theorem 9.2**.**
The monoidal category of finite-dimensional Mackey functors on is -autonomous.
Proof.
With defined as above, we have the calculation:
[TABLE]
∎
10. Cohomological Mackey functors
Let be a field and be a finite group. We are interested in the relationship between ordinary -linear representations of and Mackey functors on .
Write for the category of finite -sets as usual. Write for the category of finite -dimensional -linear representations of .
Each -set determines a -linear representation of by extending the action of linearly on . This gives a functor
[TABLE]
We extend this to a functor
[TABLE]
where , as follows. On objects , define
[TABLE]
For a span (u,S,v):X\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces Y in , the linear function k_{*}(S):kY\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces kX is defined by
[TABLE]
this preserves the -actions since
[TABLE]
Clearly preserves coproducts.
By the usual argument (going back to Kan, and the geometric realization and singular functor adjunction), we obtain a functor
[TABLE]
defined by
[TABLE]
which we shall write as R^{-}:\mathscr{T}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Vect}_{k}. So
[TABLE]
with the effect on the span (u,S,v):X\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces Y transporting to the linear function
[TABLE]
which takes \tau:X\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces R to \tau_{S}:Y\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces R where
[TABLE]
The functor has a left adjoint
[TABLE]
defined by
[TABLE]
where runs over a full subcategory of consisting of a representative set of connected -sets.
Proposition 10.1**.**
The functor \widetilde{k_{*}}:\mathbf{Rep}_{k}(G)\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mky}(G) is fully faithful.
Proof.
For , a morphism \theta:R_{1}^{-}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces R_{2}^{-} in is a family of linear functions such that the following square commutes for all spans (u,S,v):X\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces Y in .
[TABLE]
Since (with multiplication action) forms a full dense subcategory of , it follows that we obtain a unique morphism f:R_{1}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces R_{2} in such that
[TABLE]
(where \hat{r}:G\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces R is defined by for ); this is a special case of Yoneda’s Lemma. Clearly is linear since is. By taking and v=1_{G}:G\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces G, commutativity of the above square yields
[TABLE]
that is, . ∎
An important property of Mackey functors in the image of is that they are cohomological in the sense of [We], [Bo4] and [TW]. First we recall some classical terminology associated with a Mackey functor on a group .
For subgroups of , we have the canonical -set morphism \sigma^{H}_{K}:G/K\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces G/H defined on the connected -sets of left cosets by . The linear functions
[TABLE]
are called restriction and transfer (or trace or induction).
A Mackey functor on is called cohomological when each composite \lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces M(G/H) is equal to multiplication by the index of in . We supply a proof of the following known example.
Proposition 10.2**.**
For each -linear representation of , the Mackey functor is cohomological.
Proof.
With and , notice that the function
[TABLE]
takes to where
[TABLE]
and runs over the distinct with ; the number of distinct with is of course . So . ∎
Lemma 10.3**.**
The functor k_{*}:\mathscr{T}^{\text{op}}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{R} is strong monoidal.
Proof.
Clearly the canonical isomorphisms
[TABLE]
show that k:\mathscr{E}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{R} is strong monoidal. All that remains to be seen is that these isomorphisms are natural with respect to spans (u_{1},S_{1},v_{1}):X_{1}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces Y_{1},(u_{2},S_{2},v_{2}):X_{2}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces Y_{2}. This comes down to the bilinearity of tensor product:
[TABLE]
∎
We can now see that the adjunction
[TABLE]
fits the situation of Day’s Reflection Theorem [Da2] and [Da3, pages 24 and 25]. For this, recall that a fully faithful functor \Phi:\mathscr{A}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{X} into a closed category is said to be closed under exponentiation when, for all in and in , the internal hom is isomorphic to an object of the form for some in .
Theorem 10.4**.**
The functor \textit{colim}(-,k_{*}):\mathbf{Mky}(G)_{\text{fin}}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{R} is strong monoidal. Consequently, \widetilde{k_{*}}:\mathscr{R}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Mky}(G)_{\text{fin}} is monoidal and closed under exponentiation.
Proof.
The first sentence follows quite formally from Lemma 10.3 and the theory of Day convolution; the main calculation is:
[TABLE]
The second sentence then follows from [Da2, Reflection Theorem]. ∎
In fancier words, the adjunction
[TABLE]
lives in the -category of monoidal categories, monoidal functors and monoidal natural transformations (all enriched over ).
11. Mackey functors for Hopf algebras
In this section we provide another example of a compact closed category constructed from a Hopf algebara (or quantum group). We speculate that Mackey functors on this will prove as useful for Hopf algebras as usual Mackey functors have for groups.
Let be a braided (semisimple) Hopf algebra (over ). Let denote the category of left -modules which are finite dimensional as vector spaces (over ). This is a compact closed braided monoidal category.
We write for the category obtained from the bicategory of that name in [DMS] by taking isomorphisms classes of morphisms. Explicitly, the objects are comonoids in . The morphisms are isomorphism classes of comodules S:\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 4.93124pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-4.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 12.43124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\scriptstyle{\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@stopper}}}}}}}}}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{D}}}}}}}}\ignorespaces}}}}\ignorespaces from to ; such an is equipped with a coaction \delta:S\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces C\otimes S\otimes D satisfying the coassociativity and counity conditions; we can break the two-sided coaction into a left coaction \delta_{l}:S\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces C\otimes S and a right coaction \delta_{r}:S\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces S\otimes D connected by the bicomodule condition. Composition of comodules S:\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 4.93124pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-4.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 12.43124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\scriptstyle{\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@stopper}}}}}}}}}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{D}}}}}}}}\ignorespaces}}}}\ignorespaces and T:\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 5.27847pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-5.27847pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{D\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 12.77847pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\scriptstyle{\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@stopper}}}}}}}}}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 20.27847pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 20.27847pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{E}}}}}}}}\ignorespaces}}}}\ignorespaces is defined by the (coreflexive) equalizer
[TABLE]
The identity comodule of is C:\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 4.93124pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-4.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 12.43124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\scriptstyle{\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@stopper}}}}}}}}}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{C}}}}}}}}\ignorespaces}}}}\ignorespaces. The category is compact closed: the tensor product is just that for vector spaces equipped with the extra structure. Direct sums in are given by direct sum as vector spaces. Consequently, is enriched in the monoidal category of commutative monoids: to add comodules S_{1}:\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 4.93124pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-4.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 12.43124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\scriptstyle{\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@stopper}}}}}}}}}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{D}}}}}}}}\ignorespaces}}}}\ignorespaces and S_{2}:\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 4.93124pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-4.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 12.43124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\scriptstyle{\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@stopper}}}}}}}}}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 19.93124pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{D}}}}}}}}\ignorespaces}}}}\ignorespaces, we take the direct sum with coaction defined as the composite
[TABLE]
We can now apply our earlier theory to the example . In particular, we call a -enriched functor M:\mathbf{Comod}(\mathscr{R})\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Vect}_{k} a Mackey functor on .
In the case where is the group algebra (made Hopf by means of the diagonal kG\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces k(G\times G)\cong kG\otimes_{k}kG), a Mackey functor on is not the same as a Mackey functor on . However, there is a strong relationship that we shall now explain.
As usual, let denote the cartesian monoidal category of finite -sets. The functor k:\mathscr{E}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{R} is strong monoidal and preserves coreflexive equalizers. There is a monoidal equivalence
[TABLE]
so k:\mathscr{E}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{R} induces a strong monoidal -functor
[TABLE]
With as usual and with , we obtain a functor
[TABLE]
defined by pre-composition with . Proposition 1 of [DS2] applies to yield:
Theorem 11.1**.**
The functor has a strong monoidal left adjoint
[TABLE]
The adjunction is monoidal.
The formula for is
[TABLE]
On the other hand, we already have the compact closed category of finite-dimensional representations of and the strong monoidal functor
[TABLE]
Perhaps should be our candidate for rather than the more complicated . The result of [DS2] applies also to to yield a monoidal adjunction
[TABLE]
Perhaps then, additive functors \mathscr{R}^{\text{op}}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathbf{Vect} would provide a suitable generalization of Mackey functors in the case of a Hopf algebra . These matters require investigation at a later time.
12. Review of some enriched category theory
The basic references are [Ke], [La] and [St].
Let denote the -category whose objects are cocomplete -categories and whose morphisms are (weighted-) colimit-preserving -functors; the -cells are -natural transformations.
Every small -category determines an object of . Let
[TABLE]
denote the Yoneda embedding: .
For any object of , we have an equivalence of categories
[TABLE]
defined by restriction along . This is expressing the fact that is the free cocompletion of . It follows that, for small -categories and , we have
[TABLE]
The way this works is as follows. Suppose F:\mathscr{C}^{\text{op}}\otimes\mathscr{D}\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces\mathscr{V} is a (-) functor. We obtain a colimit-preserving functor
[TABLE]
by the formula
[TABLE]
where and . Conversely, given G:[\mathscr{C},\mathscr{V}]\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 1.0pt\hbox{\ignorespaces\ignorespaces\ignorespaces\hbox{\vtop{\kern 0.0pt\offinterlineskip\halign{\entry@#!@&&\entry@@#!@\cr&\crcr}}}\ignorespaces{\hbox{\kern-1.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces}}}}}}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces{}{\hbox{\lx@xy@droprule}}\ignorespaces{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\lx@xy@tip{1}\lx@xy@tip{-1}}}}}}{\hbox{\lx@xy@droprule}}{\hbox{\lx@xy@droprule}}{\hbox{\kern 16.0pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise 0.0pt\hbox{\hbox{\kern 1.0pt\raise 0.0pt\hbox{\textstyle{}}}}}}}}\ignorespaces}}}}\ignorespaces[\mathscr{D},\mathscr{V}], define
[TABLE]
by
[TABLE]
The main calculations proving the equivalence are as follows:
[TABLE]
and,
[TABLE]
Next we look how composition of s is transported to the s. Take
[TABLE]
so that and