Correspondence functors and finiteness conditions
Serge Bouc (LAMFA), Jacques Th\'evenaz

TL;DR
This paper studies the representation theory of finite sets through correspondence functors, revealing conditions under which these functors are finitely generated and have finite length, with implications for their structural properties.
Contribution
It characterizes when correspondence functors are finitely generated and have finite length, providing new insights into their structural and finiteness properties.
Findings
Finitely generated correspondence functors grow exponentially in dimension.
Such functors have finite length.
Subfunctors of finitely generated functors are also finitely generated when the ring is noetherian.
Abstract
We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties which do not hold for other types of func-tors. In particular, if k is a field and if F is a correspondence functor, then F is finitely generated if and only if the dimension of F (X) grows exponentially in terms of the cardinality of the finite set X. Moreover, in such a case, F has actually finite length. Also, if k is noetherian, then any subfunctor of a finitely generated functor is finitely generated.
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 · Rings, Modules, and Algebras · Algebraic structures and combinatorial models
Correspondence functors and finiteness conditions
Serge Bouc
and
Jacques Thévenaz
Abstract.
We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of -modules, where is a commutative ring. They have various specific properties which do not hold for other types of functors. In particular, if is a field and if is a correspondence functor, then is finitely generated if and only if the dimension of grows exponentially in terms of the cardinality of the finite set . Moreover, in such a case, has actually finite length. Also, if is noetherian, then any subfunctor of a finitely generated functor is finitely generated.
Key words and phrases:
Keywords: finite set, correspondence, functor category, simple functor, finite length, poset
1991 Mathematics Subject Classification:
AMS Subject Classification: 06B05, 06B15, 06D05, 06D50, 16B50, 18B05, 18B10, 18B35, 18E05
1. Introduction
Representations of categories have been used by many authors in different contexts. The present paper is the first in a series which develops the theory in the case of the category whose objects are all finite sets and morphisms are all correspondences between finite sets.
For representing a category of finite sets, there are several possible choices. Pirashvili [Pi] treats the case of pointed sets and maps, while Church, Ellenberg and Farb [CEF] consider the case where the morphisms are all injective maps. Putman and Sam [PS] use all -linear splittable injections between finite-rank free -modules (where is a commutative ring). Here, we move away from such choices by using all correspondences as morphisms. The cited papers are concerned with applications to cohomological stability, while we develop our theory without any specific application in mind. The main motivation is provided by the fact that finite sets are basic objects in mathematics. Moreover, the theory turns out to have many quite surprising results, which justify the development presented here.
Let be the category of finite sets and correspondences. We define a correspondence functor over a commutative ring to be a functor from to the category of all -modules. As much as possible, we develop the theory for an arbitrary commutative ring . However, let us start with the case when is a field. If is a correspondence functor over a field , we prove that is finitely generated if and only if the dimension of grows exponentially in terms of the cardinality of the finite set (Theorem 8). In such a case, we also prove the striking fact that has finite length (Theorem 9). This result was obtained independently by Gitlin [Gi] (for a field of characteristic zero, or algebraically closed), using a criterion proved by Wiltshire-Gordon [WG]. Moreover, for finitely generated correspondence functors, we show that the Krull-Remak-Schmidt theorem holds (Proposition 6) and that projective functors coincide with injective functors (Theorem 10).
Suppose that is a field. By well-known results about representations of categories, simple correspondence functors can be classified. In our case, they are parametrized by triples , where is a finite set, is a partial order relation on , and is a simple -module (Theorem 4). This is the first indication of the importance of posets in our work. However, if is the simple functor parametrized by , then it is quite hard to describe the evaluation at a finite set . We will achieve this in a future paper [BT3] by giving a closed formula for its dimension.
A natural question when dealing with a commutative ring is to obtain specific results when is noetherian. We follow this track in Section 11 and show for instance that any subfunctor of a finitely generated correspondence functor is again finitely generated (Corollary 11). Also, we obtain stabilization results for and between correspondence functors evaluated at large enough finite sets (Theorem 12).
This article uses essentially only standard facts from algebra and representation theory, with the following exceptions. A few basic results in Section 2 have been imported from elsewhere, but the main exception is the algebra of essential relations on a finite set . This algebra has been analyzed in [BT1] and all its simple modules have been classified there. This uses the fundamental module associated to a finite poset and there is an explicit description of the action of relations on . All the necessary background on this algebra of essential relations is recalled in Section 4. It follows that our approach of the parametrization of simple functors is based on [BT1] since it uses the fundamental modules in an important way.
2. The representation theory of categories
Before introducing the category of finite sets and correspondences, we first recall some standard facts from the representation theory of categories. Let be a category and let and be two objects of . We adopt a slightly unusual notation by writing for the set of all morphisms from to . We reverse the order of and in view of having later a left action of morphisms behaving nicely under composition.
We assume that is small (or more generally that a skeleton of is small). This allows us to talk about the set of natural transformations between two functors starting from .
Throughout this paper, denotes a commutative ring. It will sometimes be noetherian and sometimes a field, but we shall always emphasize when we make additional assumptions.
2.1. Definition.* The -linearization of a category , where is any commutative ring, is defined as follows :*
- •
The objects of are the objects of .
- •
For any two objects and , the set of morphisms from to is the free -module with basis .
- •
The composition of morphisms in is the -bilinear extension
[TABLE]
of the composition in .
2.2. Definition.* Let be a category and a commutative ring. A -representation of the category is a -linear functor from to the category of -modules.*
We could have defined a -representation of as a functor from to , but it is convenient to linearize first the category (just as for group representations, where one can first introduce the group algebra).
If is a -representation of and if is an object of , then will be called the evaluation of at . Morphisms in act on the left on the evaluations of by setting, for every and for every morphism ,
[TABLE]
We often use a dot for this action of morphisms on evaluation of functors. With our choice of notation, if , then
[TABLE]
The category of all -representations of is an abelian category. We need a small skeleton of in order to have sets of natural transformations, which are morphisms in , but we will avoid this technical discussion. A sequence of functors
[TABLE]
is exact if and only if, for every object , the evaluation sequence
[TABLE]
is exact. Also, a -representation of is called simple if it is nonzero and has no proper nonzero subfunctor.
For any object of , consider the representable functor (which is a projective functor by Yoneda’s lemma). Its evaluation at an object is the -module , which has a natural structure of a -bimodule by composition.
2.3. Notation.* Let be an object of and let be a -module. We define*
[TABLE]
This is a -representation of .
This satisfies the following adjunction property.
2.4. Lemma.*
Let be the category of all -representations of
and let be an object of .*
- (a)
The functor
[TABLE]
is left adjoint of the evaluation functor
[TABLE]
In other words, for any -representation and any -module , there is a natural isomorphism
[TABLE]
Moreover as -modules. In particular, there is a -algebra isomorphism . 2. (b)
The functor is right exact. It maps projective modules to projective functors, and indecomposable modules to indecomposable functors.
**Proof : **Part (a) is straightforward and is proved in Section 2 of [Bo1]. Part (b) follows because this functor is left adjoint of an exact functor and satisfies the property .
Our next result is a slight extension of the first lemma of [Bo1].
2.5. Lemma.*
Let be an object of and let be a -module.
For any object of , let*
[TABLE]
- (a)
* is the unique subfunctor of which is maximal with respect to the condition that it vanishes at .* 2. (b)
If is a simple module, then is the unique maximal subfunctor of and is a simple functor.
**Proof : **The proof is sketched in Lemma 2.3 of [BST] in the special case of biset functors for finite groups, but it extends without change to representations of an arbitrary category .
Lemma 2 is our main tool for dealing with simple functors. We first fix the notation.
2.6. Notation.* Let be an object of and let be a -module. We define*
[TABLE]
If is a simple -module, then is a simple functor.
We emphasize that and are defined for any -module and any commutative ring . Note that we always have because if , then .
Therefore, we have isomorphisms of -modules
[TABLE]
2.7. Proposition.*
Let be a simple -representation of and let be an object of such that .*
- (a)
* is a simple -module.* 2. (b)
. 3. (c)
* is generated by , that is, for all objects . More precisely, if , then .*
**Proof : **(c) Given , let for all objects . This clearly defines a nonzero subfunctor of , so by simplicity of .
(a) This follows from (c).
(b) By the adjunction of Lemma 2, the identity corresponds to a non-zero morphism . Since is simple, must be surjective. But is the unique simple quotient of , by Lemma 2 and Notation 2, so .
It should be noted that a simple -representation has many possible realizations as above, where . However, if there is a notion of unique minimal object, then one can parametrize simple functors by setting , where is the unique minimal object such that (see Theorem 4 for the case of correspondence functors).
Our next proposition is Proposition 3.5 in [BST] in the case of biset functors, but it holds more generally and we just recall the proof of [BST].
2.8. Proposition.*
Let be a simple -representation of and let be an object of such that .
Let be any -representation of . Then the following are equivalent:*
- (a)
* is isomorphic to a subquotient of .* 2. (b)
The simple -module is isomorphic to a subquotient of the -module .
**Proof : **It is clear that (a) implies (b). Suppose that (b) holds and let , be submodules of such that and . For , let be the subfunctor of generated by . Explicitly, for any object of , . Then and . The isomorphism induces, by the adjunction of Lemma 2, a nonzero morphism . Since is simple, has a unique maximal subfunctor , by Lemma 2, and , by Proposition 2. Let and . Since , we obtain
[TABLE]
showing that is isomorphic to a subquotient of .
(Actually, as observed by Hida and Yagita in Lemma 3.1 of [HY], we have an equality , because both subfunctors are generated by their commun evaluation at .)
3. Correspondence functors
Leaving the general case, we now prepare the ground for the category we are going to work with.
3.1. Definition.* Let and be sets.*
- (a)
A correspondence from to is a subset of the cartesian product . Note that we have reversed the order of and for the reasons mentioned at the beginning of Section 2. 2. (b)
A correspondence is often called a relation but we use this terminology only when , in which case we say that a subset of is a relation on . 3. (c)
If is a permutation of , then there is a corresponding relation on which we write
[TABLE]
In particular, when , we also write
[TABLE]
3.2. Definition.* Let denote the following category :*
- •
The objects of are the finite sets.
- •
For any two finite sets and , the set is the set of all correspondences from to .
- •
The composition of correspondences is as follows. Given and , then is defined by
[TABLE]
The identity morphism is the diagonal subset (in other words the equality relation on ).
3.3. Definition.* Let be the linearization of the category , where is any commutative ring (see Definition 2).*
- (a)
A correspondence functor (over ) is a -representation of the category , that is, a -linear functor from to the category of -modules. 2. (b)
We let be the category of all such correspondence functors (an abelian category).
In part (b), we need to restrict to a small skeleton of in order to have sets of natural transformations, which are morphisms in , but we avoid this technical discussion. It is clear that has a small skeleton, for instance by taking the full subcategory having one object for each cardinality.
For any finite set , we define
[TABLE]
the -algebra of the monoid of all relations on , in other words the algebra of the semigroup of Boolean matrices of size . The representable functor (sometimes called Yoneda functor) is the very first example of a correspondence functor. By definition, it is actually isomorphic to the functor , see Notation 2. If is an -module generated by a single element (for instance a simple module), then the functor is isomorphic to a quotient of via the surjective homomorphism
[TABLE]
The representable functor is projective (by Yoneda’s lemma).
Our next result is basic, but has several important corollaries.
3.4. Lemma.* Let and be finite sets with . There exist correspondences and such that .*
**Proof : **Since , there exists an injective map . Let denote the correspondence
[TABLE]
and denote the correspondence
[TABLE]
As is injective, one checks easily that , that is, .
In other words, this lemma says that the object of behaves like a direct summand of the object whenever .
3.5. Corollary.* Let and be finite sets with . The representable functor is isomorphic to a direct summand of the representable functor .*
**Proof : **Right multiplication by defines a homomorphism of correspondence functors
[TABLE]
and right multiplication by defines a homomorphism of correspondence functors
[TABLE]
Their composite is the identity of , because .
3.6. Corollary.* Let and be finite sets with . The left -module is projective.*
**Proof : **By Corollary 3, is isomorphic to a direct summand of , which is free.
3.7. Corollary.* Let and be finite sets with . Let be a correspondence functor. If , then .*
**Proof : **For any , we have . But , so . Therefore .
3.8. Corollary.* Let and be finite sets with . For every finite set , composition in the category *
[TABLE]
is an isomorphism.
**Proof : **The inverse of is given by
[TABLE]
Composing with , we obtain , so . On the other hand, if and , then belongs to and therefore
[TABLE]
showing that .
Now we move to direct summands of representable functors, given by some idempotent. If is an idempotent in , then is a direct summand of , hence projective again. In particular, if is a preorder on , that is, a relation which is reflexive and transitive, then is idempotent (because by reflexivity and by transitivity). There is an equivalence relation associated with , defined by
[TABLE]
Then induces an order relation on the quotient set such that
[TABLE]
where denotes the equivalence class of under .
3.9. Lemma.*
Let be a finite set and let be a preorder on . Let be the corresponding order
on the quotient set and write for the quotient map .
The correspondence functors and
are isomorphic via the isomorphism*
[TABLE]
where for any correspondence , the correspondence is defined by
[TABLE]
**Proof : **It is straightforward to check that is well-defined. If , then and it follows that . Surjectivity is easy and injectivity follows from the definition of .
This shows that it is relevant to consider the functors where is an order on . We will see later that they play an important role in connection with simple functors.
We end this section with the definition of duality.
3.10. Proposition.* Let and be finite sets. If , let denote the opposite correspondence, defined by*
[TABLE]
Then the assignment induces an isomorphism from to the opposite category , which extends to an isomorphism from to .
**Proof : **Let , , be finite sets, and . One checks easily that .
We use opposite correspondences to define dual functors. The notion will be used in Section 10.
3.11. Definition.* Let be a correspondence functor over . The dual of is the correspondence functor defined on a finite set by*
[TABLE]
If is a finite set and , then the map is defined by
[TABLE]
4. The parametrization of simple correspondence functors
In order to study simple modules or simple functors, it suffices to work over a field , by standard commutative algebra. If we assume that is a field, then the evaluation at a finite set of a representable functor, or of a simple functor, is always a finite-dimensional -vector space. As before, we continue to work with an arbitrary commutative base ring and assume that it is a field when necessary.
4.1. Definition.* A minimal set for a correspondence functor is a finite set of minimal cardinality such that . For a nonzero functor, such a minimal set always exists and is unique up to bijection.*
Our next task is to describe the parametrization of simple correspondence functors. This uses the algebra
[TABLE]
of all relations on . This algebra was studied in [BT1] and we use this approach. A relation on is called essential if it does not factor through a set of cardinality strictly smaller than . In other words, has maximal Schein rank in the sense of Section 1.4 of [Ki]. The -submodule generated by the set of inessential relations is a two-sided ideal
[TABLE]
and the quotient
[TABLE]
is called the essential algebra. A large part of its structure has been elucidated in [BT1].
The following parametrization theorem is similar to Proposition 2 in [Bo1] or Theorem 4.3.10 in [Bo2]. The context here is different, but the proof is essentially the same.
4.2. Theorem.* Assume that is a field.*
- (a)
Let be a simple correspondence functor, let be a minimal set for , and let . Then is a simple module for the essential algebra (with acting by zero) and . 2. (b)
Let be a finite set and let be a simple module for the essential algebra , viewed as a module for the algebra by making act by zero on . Then is a minimal set for . Moreover, (as -modules). 3. (c)
The set of isomorphism classes of simple correspondence functors is parametrized by the set of isomorphism classes of pairs where is a finite set and is a simple -module.
**Proof : **(a) Since if , we have
[TABLE]
so is a module for the essential algebra . Now the identity of corresponds by adjunction to a nonzero homomorphism , where (see Lemma 2). This homomorphism is surjective since is simple. But has a unique simple quotient, namely , hence .
(b) Suppose that . Then , so there exists a correspondence and such that . By definition of , this means that there exists a correspondence such that . Since is a module for the essential algebra , we have . But factorizes through , so we must have . Thus is a minimal set for . The isomorphism is a general fact mentioned before.
(c) This follows from (a) and (b).
Theorem 4 reduces the classification of simple correspondence functors to the question of classifying all simple modules for the essential algebra . Fortunately, this has been achieved in [BT1]. An alternative path would be to use the classical approach to simple -modules via idempotents in the semigroup and Green’s theory of -classes (see the textbook [CP], or the recent article [GMS] for a modern point of view). We do not follow this approach because we need later in an important way a fundamental module, defined below, which is not part of the classical approach, but is the key for the classification in [BT1].
The simple -modules are actually modules for a quotient where is a nilpotent ideal defined in [BT1]. We call the algebra of permuted orders, because it has a -basis consisting of all relations on of the form , where runs through the symmetric group of all permutations of , and is an order on . By an order, we always mean a partial order relation. The product of two orders and in is the transitive closure of if this transitive closure is an order, and zero otherwise.
We let be the set of all orders on and the stabilizer of the order under the action of the symmetric group by conjugation. For the description of simple -modules, we need the following new basis of (see Theorem 6.2 in [BT1] for details).
4.3. Lemma.**
- (a)
There is a set of orthogonal idempotents of whose sum is 1, such that has a -basis consisting of all elements of the form , where and . 2. (b)
For any , we have , where for any . In particular, if . 3. (c)
For any order on , we have :
[TABLE]
For the description of simple -modules and then simple correspondence functors, we will make use of the left -module . This module is actually defined without assuming that is a field.
4.4. Definition.* Let be a finite poset (i.e. is a finite set and is an order on ). We call the fundamental module for the algebra , associated with the poset .*
We now describe its structure.
4.5. Proposition.*
Let be a finite poset*
- (a)
The fundamental module is a left module for the algebra , hence also a left module for the essential algebra and for the algebra of relations . 2. (b)
* is a free -module with a -basis consisting of the elements , where runs through the group of all permutations of .* 3. (c)
* is a -bimodule and the right action of is free.* 4. (d)
The action of the algebra of relations on the module is given as follows. For any relation ,
[TABLE]
where is the diagonal of , and {\,{}^{\sigma}\!R}=\big{\{}\big{(}\sigma(e),\sigma(f)\big{)}\mid(e,f)\in R\big{\}} (recall that is unique in the first case).
**Proof : **See Corollary 7.3 and Proposition 8.5 in [BT1].
The description of all simple -modules is as follows (see Theorem 8.1 in [BT1] for details).
4.6. Theorem.* Assume that is a field and let be a finite set.*
- (a)
Let be an order on and let be the corresponding fundamental module. If is a simple -module, then
[TABLE]
is a simple -module (hence also a simple -module). 2. (b)
Every simple -module is isomorphic to a module as in (a). 3. (c)
For any permutation , we have , where is the conjugate order and is the conjugate module. 4. (d)
The set of isomorphism classes of simple -modules is parametrized by the set of conjugacy classes of pairs where is an order on and is a simple -module.
Putting together Theorem 4 and Theorem 4, we finally obtain the following parametrization, which is essential for our purposes.
4.7. Theorem.* Assume that is a field. The set of isomorphism classes of simple correspondence functors is parametrized by the set of isomorphism classes of triples where is a finite set, is an order on , and is a simple -module.*
**Proof : **By Theorem 4, the isomorphism classes of simple correspondence functors are parametrized by pairs , where is a finite set and is a simple -module. Now by Theorem 4, the isomorphism classes of simple -modules are parametrized by pairs , where is an order on and is a simple -module. Hence the pairs become triples .
4.8. Notation.*
Let be a finite poset.*
- (a)
If is a simple -module, we denote by the simple correspondence functor parametrized by the triple . Explicitly,
[TABLE] 2. (b)
More generally, for any commutative ring and any -module , we define the -module (hence also an -module)
[TABLE]
and the correspondence functor
[TABLE]
We end this section with a basic result concerning the correspondence functors , where is any commutative ring and is any -module.
4.9. Lemma.* Let be a finite poset and let be any -module.*
- (a)
* is a minimal set for .* 2. (b)
* as -modules.*
**Proof : **Both and are left modules for the essential algebra . Therefore, the argument given in part (b) of Theorem 4 shows again that is a minimal set for . Moreover, since vanishes on evaluation at , we have
[TABLE]
as required.
When is a field and is simple, we recover the simple module of Theorem 4.
5. Small examples
In this section, we describe two small examples.
**5.1. Example. ** Let be the empty set and consider the representable functor . Then is a singleton for any finite set , so . Moreover, any correspondence is sent to the identity map from to . This functor deserves to be called the constant functor. We will denote it by .
Assume that is a field. The algebra has a unique simple module . It is then easy to check that and . Therefore
[TABLE]
the simple functor indexed by . Here the second denotes the only relation on the empty set, while is the only simple module for the group algebra , where is the symmetric group of the empty set. Note that is projective, because it is a representable functor.
**5.2. Example. ** Let be a set with one element and consider the representable functor . Then is in bijection with the set of all subsets of , because . It is easy to see that a correspondence is sent to the map
[TABLE]
where . Thus is a correspondence functor such that is a free -module with basis and rank for every finite set .
The functor has a subfunctor isomorphic to the constant functor , because contains the element which is mapped to by any correspondence. We claim that, if is a field, the quotient is a simple functor.
Assume that is a field. The algebra has dimension 2, actually isomorphic to with two primitive idempotents and . The essential algebra is a one-dimensional quotient and its unique simple module is one-dimensional and corresponds to the pair , where is the only order relation on and is the only simple module for the group algebra , with the symmetric group of . Thus there is a simple functor .
The kernel of the quotient map
[TABLE]
is the constant subfunctor mentioned above, because can be written , with the second empty set belonging to , thus acting by zero on . Now we know that and we are going to show that . It then follows that is simple and isomorphic to , proving the claim above.
In order to prove that , we let , which can be written
[TABLE]
where is a generator of and for all . Since the empty set acts by zero on , the sum actually runs over nonempty subsets . Then if and only if, for all , we have
[TABLE]
Since acts by zero and acts as the identity, we obtain
[TABLE]
This yields the condition
[TABLE]
We prove by induction that for every nonempty . Subtracting the condition for and for , we obtain
[TABLE]
If is a singleton, we obtain and this starts the induction. In the general case, we obtain by induction for , so we are left with . Therefore and so .
There is a special feature of this small example, namely that the exact sequence
[TABLE]
splits. This is because there is a retraction defined by
[TABLE]
which is easily checked to be a homomorphism of functors. Since is projective (because it is a representable functor), its direct summand is projective.
5.3. Remark. In both Example 5 and Example 5, there is a unique order relation on , which is a total order. Actually, these examples are special cases of the general situation of a total order, which is studied in [BT2].
6. Finite generation
In this section, we analyze the property of finite generation for correspondence functors.
6.1. Definition.* Let be a family of finite sets indexed by a set and, for every , let . A correspondence functor is said to be generated by the set if for every finite set and every element , there exists a finite subset such that*
[TABLE]
In the case where is finite, is said to be finitely generated.
We remark that, in the sum above, each decomposes as a finite -linear combination where . Therefore, every decomposes further as a (finite) -linear combination
[TABLE]
6.2. Example.*
If is a finite set, the representable functor is finitely generated. It is actually generated by a single element, namely .*
6.3. Lemma.* Let be a finitely generated correspondence functor over . Then, for every finite set , the evaluation is a finitely generated -module. In particular, if is a field, then is finite-dimensional.*
**Proof : **Let be a finite set of generators of , with . Let . By definition and by the remark above, every element of is a -linear combination of elements of . But is a finite set, so is finitely generated. If is a field, this means that is finite-dimensional.
It follows that, in order to understand finitely generated correspondence functors, we could assume that all their evaluations are finitely generated -modules. But we do not need this for our next characterizations.
6.4. Proposition.* Let be a correspondence functor over . The following conditions are equivalent :*
- (a)
* is finitely generated.* 2. (b)
* is isomorphic to a quotient of a functor of the form for some finite sets ().* 3. (c)
* is isomorphic to a quotient of a functor of the form for some finite set and some finite index set .* 4. (d)
There exists a finite set and a finite subset of such that is generated by .
**Proof : **(a) (b). Suppose that is generated by the set , where . It follows from Yoneda’s lemma that there is a morphism
[TABLE]
mapping to the element , hence mapping to . Their sum yields a morphism
[TABLE]
For any and any , we have for some , hence , proving the surjectivity of .
(b) (c). Suppose that is isomorphic to a quotient of a functor of the form . Let be the largest of the sets . By Corollary 3, each is a direct summand of . Therefore, is also isomorphic to a quotient of the functor .
(c) (d). By Example 6, is generated by . Let having zero components everywhere, except the -th equal to . Since is a quotient of , it is generated by the images of the elements . This is a finite set because is finite by assumption.
(d) (a). Since is generated by , it is finitely generated.
We apply this to the functors and defined in Lemma 2 and Notation 2.
6.5. Corollary.* Let be a finitely generated -module, where is a finite set and is the algebra of relations on . Then and are finitely generated correspondence functors.*
**Proof : **Let be a finite set of generators of as an -module. There is a morphism mapping to . Therefore, we obtain a surjective morphism
[TABLE]
showing that is finitely generated. Now is a quotient of , so it is also finitely generated.
6.6. Proposition.* Let be a noetherian ring.*
- (a)
For any finitely generated correspondence functor over , the algebra is a finitely generated -module. 2. (b)
For any two finitely generated correspondence functors and , the -module is finitely generated. 3. (c)
If is a field, the Krull-Remak-Schmidt theorem holds for finitely generated correspondence functors over .
**Proof : **(a) Since is finitely generated, there exists a finite set and a surjective morphism for some finite set (Proposition 6). Denote by the subalgebra of \operatorname{End}\nolimits_{\mathcal{F}_{k}}\big{(}\bigoplus\limits_{i\in I}k\mathcal{C}(-,E)\big{)} consisting of endomorphisms such that . The algebra is isomorphic to a -submodule of \operatorname{End}\nolimits_{\mathcal{F}_{k}}\big{(}\bigoplus\limits_{i\in I}k\mathcal{C}(-,E)\big{)}, which is isomorphic to a matrix algebra of size over the -algebra (because \operatorname{End}\nolimits_{{\mathcal{F}}_{k}}\big{(}k\mathcal{C}(-,E)\big{)}\cong k\mathcal{C}(E,E) by Yoneda’s lemma). This matrix algebra is free of finite rank as a -module. As is noetherian, it follows that is a finitely generated -module.
Now by definition of , any induces an endomorphism of such that . This yields an algebra homomorphism , which is surjective, since the functor is projective. It follows that is also a finitely generated -module.
(b) The functor is finitely generated, hence is a finitely generated -module, by (a). Since embeds in , it is also a finitely generated -module.
(c) If moreover is a field, then is a finite dimensional -vector space, by (a). Finding decompositions of as a direct sum of subfunctors amounts to splitting the identity of as a sum of orthogonal idempotents. Since is a finite dimensional algebra over the field , the standard theorems on decomposition of the identity as a sum of primitive idempotents apply. Thus can be split as a direct sum of indecomposable functors, and such a decomposition is unique up to isomorphism.
After the Krull-Remak-Schmidt theorem, we treat the case of projective covers. Recall (see 2.5.14 in [AF] for categories of modules) that in an abelian category , a subobject of an object is called superfluous if for any subobject of , the equality implies . Similarly, an epimorphism in is called superfluous if is superfluous in , or equivalently, if for any morphism in , the composition is an epimorphism if and only if is an epimorphism. A projective cover of an object of is defined as a pair , where is projective and is a superfluous epimorphism from to .
6.7. Proposition.*
Let be a finitely generated correspondence functor over a commutative ring .*
- (a)
Suppose that is generated by where is a finite. If is a projective cover of in , then is a projective cover of in , where is obtained from by the adjunction of Lemma 2. 2. (b)
If is a field, then admits a projective cover. 3. (c)
In particular, when is a field, let be a finite set, let be an order relation on , and let be a simple -module. Let moreover be a projective cover of in . Then is a projective cover of the simple correspondence functor .
**Proof : **(a) (This was already proved in Lemme 2 of [Bo1].) By Lemma 2, the functor maps projectives to projectives. So the functor is projective. Since is generated by , and since the evaluation at of the morphism is equal to , it follows that is surjective. If is any subfunctor of such that , then in particular and p\big{(}N(E)\big{)}=M(E). Since is superfluous, it follows that , hence since is generated by its evaluation at .
(b) The algebra is a finite dimensional algebra over the field . Hence any finite dimensional -module admits a projective cover. Therefore (b) follows from (a).
(c) The evaluation of the simple functor at is the simple -module . Hence (c) follows from (a) and (b).
7. Bounded type
In this section, we analyze a notion which is more general than finite generation.
7.1. Definition.* Let be a commutative ring and let be a correspondence functor over .*
- (a)
We say that has bounded type if there exists a finite set such that is generated by . 2. (b)
We say that has a bounded presentation if there are projective correspondence functors and of bounded type and an exact sequence of functors
[TABLE]
Such a sequence is called a bounded presentation of .
Suppose that has bounded type and let be a finite set such that is generated by . It is elementary to see that is finitely generated if and only if is a finitely generated -module (using Example 6 and Lemma 6). Thus an infinite direct sum of copies of a simple functor has bounded type (because it generated by its evaluation at ) but is not finitely generated. Also, a typical example of a correspondence functor which does not have bounded type is a direct sum of simple functors , where for each . This is because cannot be generated by a set of cardinality .
7.2. Lemma.* Let be a commutative ring and let be a correspondence functor over . Suppose that has bounded type and let be a finite set such that is generated by . For any finite set with , the functor is generated by .*
**Proof : **Let and be as in Lemma 3, so that . Saying that is generated by amounts to saying that is equal to , for any finite set . It follows that
[TABLE]
hence , i.e. is generated by .
We are going to prove that any correspondence functor having a bounded presentation is isomorphic to some functor . We first deal with the case of projective functors.
7.3. Lemma.*
Suppose that a correspondence functor has bounded type and let be a finite set such that is generated by .
If is projective, then for any finite set with , the -module is projective, and the counit morphism is an isomorphism.*
**Proof : **By Lemma 7, is generated by . Choosing a set of generators of as an -module (e.g. ), we see that is also generated by . As in the beginning of the proof of Proposition 6, we can apply Yoneda’s lemma and obtain a surjective morphism . Since is projective, this morphism splits, and its evaluation at also splits as a map of -modules. Hence is isomorphic to a direct summand of a free -module, that is, a projective -module.
By adjunction (Lemma 2), there is a morphism which, evaluated at , gives the identity map of . As is generated by , it follows that is surjective, hence split since is projective. Let be a section of . Since, on evaluation at , we have , the equation implies that, on evaluation at , we get . Therefore . Now corresponds by adjunction to
[TABLE]
Therefore must be the identity. It follows that and are mutual inverses. Thus .
We now prove that any functor with a bounded presentation is an , and conversely. In the case of a noetherian base ring , this result will be improved in Section 11.
7.4. Theorem.**
- (a)
Suppose that a correspondence functor has a bounded presentation
[TABLE]
Let be a finite set such that is generated by and is generated by . Then for any finite set with , the counit morphism
[TABLE]
is an isomorphism. 2. (b)
If is a finite set and is an -module, then the functor has a bounded presentation. More precisely, if
[TABLE]
is a projective resolution of as an -module, then
[TABLE]
is a bounded presentation of .
**Proof : **(a) Consider the commutative diagram
[TABLE]
where the vertical maps are obtained by the adjunction of Lemma 2. This lemma also asserts that the first row is exact. By Lemma 7, for any finite set with , the vertical morphisms and are isomorphisms. Since the rows of this diagram are exact, it follows that is also an isomorphism.
(b) We use the adjunction of Lemma 2. Applying the right exact functor to the exact sequence gives the exact sequence
[TABLE]
By Lemma 2, and are projective functors, since and are projective -modules. They all have bounded type since they are generated by their evaluation at .
Given a finite set and an -module , we define an induction procedure as follows. For any finite set , we define the -module
[TABLE]
Notice that, by the definition of , we have . To end this section, we mention the behavior of the functors under induction.
7.5. Proposition.* Let be a finite set and be an -module. If is a finite set with , the equality induces an isomorphism of correspondence functors*
[TABLE]
**Proof : **Let . Then by Theorem 7, there exists a bounded presentation
[TABLE]
where is generated by and is generated by . Hence by Theorem 7, for any finite set with , the counit morphism
[TABLE]
is an isomorphism. In other words is an isomorphism.
8. Exponential behavior and finite length
In this section, we give a lower bound estimate for the dimension of the evaluations of a simple functor , which is proved to behave exponentially. We also prove that the exponential behavior is equivalent to finite generation.
We first need a well-known combinatorial lemma.
8.1. Lemma.* Let be a finite set and let be a finite set containing .*
- (a)
For any finite set , the number of surjective maps is equal to
[TABLE]
or equivalently
[TABLE] 2. (b)
More generally, for any finite set , the number of all maps such that is equal to
[TABLE]
**Proof : **(a) Up to multiplication by , the number is known as a Stirling number of the second kind. Either by Formula (24a) in Section 1.4 of [St], or by a direct application of Möbius inversion (i.e. inclusion-exclusion principle in the present case), we have
[TABLE]
Setting , the first formula in (a) follows.
(b) Applying (a) to each subset such that , we obtain
[TABLE]
But the inner sum is zero unless . Therefore
[TABLE]
where the last equality follows by setting . This proves part (b).
Now we prove our main lower bound estimate for the dimensions of the evaluations of a simple functor.
8.2. Theorem.*
Suppose that is a field and let be a simple correspondence functor, where is a finite set,
is an order on , and is a simple -module.
There exists a positive integer and a positive real number such that, for any finite set of cardinality at least , we have*
[TABLE]
**Proof : **Recall that where denotes the -module
[TABLE]
Since is simple, it is generated by a single element . Since for any , it follows that the -module is generated by the single element . Therefore, we have a surjective morphism of correspondence functors
[TABLE]
Since is a quotient of , we obtain a surjective morphism of correspondence functors
[TABLE]
where, for any , the element denotes the class of .
We first prove the upper bound. This is easy and holds for every finite set . Since is isomorphic to a quotient of , we have
[TABLE]
In order to find a lower bound, for some finite set , we introduce the set of all surjective maps . The symmetric group acts (on the left) on by composition. Since consists of surjections onto , this action is free, that is, the stabilizer of each is trivial. We consider the subgroup of and we let be a set of representatives of the set of left orbits .
For any , we define
[TABLE]
We claim that and . Since , we always have . Conversely, if , then there exists such that and , that is, and . It follows that by transitivity of , that is, . Thus and equality follows. The proof for is similar.
Now we consider the set
[TABLE]
We want to prove that the image of this set in is linearly independent, from which we will deduce that |A|\leq\dim\big{(}S_{E,R,V}(X)\big{)}. Suppose that is mapped to zero in , where for every . In other words,
[TABLE]
The definition of implies that, for every ,
[TABLE]
Choosing in particular and , we obtain :
[TABLE]
By Proposition 4, the action of the relation on is given by
[TABLE]
In the first case, is unique.
We claim that
[TABLE]
If the left hand side holds, then multiply on the right by and use the fact that to obtain , hence . Conversely, if the right hand side holds, then , hence
[TABLE]
by transitivity and reflexivity of . In particular, by reflexivity again,
[TABLE]
so that, for any , there exists with and . By antisymmetry of , it follows that and therefore , so that . This shows that the left hand side holds, proving the claim.
We can now rewrite (8.2) as follows :
[TABLE]
Write with and , where denotes some set of representatives of cosets . Since for every and since the tensor product is over , we obtain
[TABLE]
By Proposition 4, is a -bimodule with a -basis consisting of the elements , for . Therefore,
[TABLE]
and it follows that
[TABLE]
Since the sum is direct and since because the right action of on is free, each inner sum in (8.2) is zero. In particular, taking (which we may choose in ), we get :
[TABLE]
Let us analyze the condition . For any given , we can choose and and we obtain and , hence , that is, . In other words, if we write simply for the partial order , we obtain . This holds for every and we define
[TABLE]
Therefore the condition implies that .
Now we prove that the relation is a partial order on the set . It is reflexive, by taking simply . It is transitive because if and for all , then
[TABLE]
using the fact that . Finally, the relation is antisymmetric because if and , then
[TABLE]
from which it follows that
[TABLE]
where is the order of in the group . But this implies that , hence
[TABLE]
and therefore . Thus and belong to the same orbit under the action of . This forces because and belong to our chosen set of representatives of the set of left orbits .
In view of proving the linear independence we are looking for, suppose that the coefficients are not all zero. Choose maximal (with respect to ) such that . In the sum (8.2), the condition implies, as we have seen above, that . Since is maximal, the sum over actually runs over the single element and reduces to
[TABLE]
But the condition implies that because , hence , that is, , which can only occur if . It follows that there is a single term in the whole sum (8.2), namely . Since , we obtain , which is impossible since was chosen nonzero in . This contradiction shows that all coefficients are zero, proving the linear independence of the image of in . Therefore |A|\leq\dim\big{(}S_{E,R,V}(X)\big{)}.
Now we need to estimate and, for simplicity, we write and . Since is a set of representatives of orbits in under the free action of , we have , so we need to estimate . By Lemma 8, we have
[TABLE]
Note that the second sum is negative because the number of surjective maps is smaller than the number of all maps . We can rewrite
[TABLE]
Since , the sum can be made as small as we want, provided is large enough. Therefore there exists a positive integer and a positive real number such that whenever . In other words, for any finite set of cardinality at least , we have
[TABLE]
giving the required lower bound for \dim\big{(}S_{E,R,V}(X)\big{)}.
We can now characterize finite generation in terms of exponential behavior.
8.3. Theorem.*
Let be a correspondence functor over a field . The following are equivalent :*
- (a)
* is finitely generated.* 2. (b)
There exists positive real numbers such that for every finite set with .
**Proof : **(a) (b). Let be a quotient of for some finite set and some finite index set . For every finite set , we have
[TABLE]
(b) (a). Let and be subfunctors of such that and simple, hence for some triple . We claim that is bounded above. Indeed, for large enough, we have
[TABLE]
for some , by Theorem 8, and
[TABLE]
by assumption. Therefore, whenever for some , we have
[TABLE]
Since , this forces otherwise \displaystyle a\big{(}\frac{b}{|E|}\big{)}^{|X|} is as small as we want. This shows the bound , proving the claim.
For each set with , we choose a basis of and we use Yoneda’s lemma to construct a morphism such that, on evaluation at , we have . Starting from the direct sum of copies of , we obtain a morphism
[TABLE]
such that, on evaluation at , the morphism is surjective, because the basis of is in the image. Now the sum of all such morphisms yields a morphism
[TABLE]
which is surjective on evaluation at every set with .
Let and suppose ab absurdo that . Let be a minimal set such that . Since is surjective on evaluation at every set with , we must have . Now is a module for the finite-dimensional algebra and, by minimality of , inessential relations act by zero on . Let be a simple submodule of as a module for the essential algebra . Associated with , consider the simple functor . (Actually, is parametrized by a pair and (see Theorem 4), but we do not need this.) Now the module is isomorphic to a subquotient of . By Proposition 2, is isomorphic to a subquotient of . By the claim proved above, we obtain . This contradiction shows that , that is, is surjective. Therefore is isomorphic, via , to a quotient of . By Proposition 6, is finitely generated.
9. Finite length
Using the exponential behaviour proved in the previous section, we now show that, if our base ring is a field, then every finitely generated correspondence functor has finite length. We first need a lemma.
9.1. Lemma.*
Let be a field and let be a finitely generated correspondence functor over .*
- (a)
* has a maximal subfunctor.* 2. (b)
Any subfunctor of is finitely generated.
**Proof : **(a) Since is finitely generated, is generated by for some finite set (Proposition 6). Let be a maximal submodule of as a -module. Note that exists because is finite-dimensional by Lemma 6. Then is a simple -module. By Proposition 2, there exist two subfunctors such that is simple, , and . Since is generated by and , we have . Therefore, is a maximal subfunctor of .
(b) Let be a subfunctor of . Since is finitely generated, there exist positive numbers such that, for every large enough finite set , we have
[TABLE]
by Theorem 8. The same theorem then implies that is finitely generated.
Lemma 9 fails for other categories of functors. For instance, in the category of biset functors, the Burnside functor is finitely generated and has a maximal subfunctor which is not finitely generated (see [Bo1] or [Bo2]).
We now come to one of the most important properties of the category of correspondence functors, namely an artinian property. As for the previous lemma, the theorem is a specific property of the category of correspondence functors.
9.2. Theorem.*
Let be a field and let be a finitely generated correspondence functor over .
Then has finite length (that is, has a finite composition series).*
**Proof : **By Lemma 9, has a maximal subfunctor and is again finitely generated. Then has a maximal subfunctor and is again finitely generated. We construct in this way a sequence of subfunctors
[TABLE]
such that is simple whenever . We claim that the sequence is finite, that is, for some .
Let be one simple subquotient, hence for some triple . By Theorem 8, since is finitely generated, there exist positive numbers such that, for every large enough finite set , we have
[TABLE]
Therefore . By Theorem 8, there exists some constant such that for large enough. So we obtain for large enough, hence . This implies that the simple functor belongs to a finite set of isomorphism classes of simple functors, because there are finitely many sets with and, for any of them, finitely many order relations on , and then in turn finitely many -simple modules (up to isomorphism).
Therefore, if the series (9.2) of subfunctors was infinite, then some simple functor would occur infinitely many times (up to isomorphism). But then, on evaluation at , the simple -module would occur infinitely many times in . This is impossible because is finite-dimensional by Lemma 6.
Theorem 9 was obtained independently by Gitlin [Gi] (for a field of characteristic zero, or algebraically closed), using a criterion for finite length proved recently by Wiltshire-Gordon [WG].
10. Projective functors and duality
This section is devoted to projective correspondence functors, mainly in the case where is a field. An important ingredient is the use of duality.
Recall that, by Lemma 7, if a projective correspondence functor is generated by , then is a projective -module, for every set with . Recall also that, by Lemma 7 again, a projective correspondence functor is isomorphic to whenever is generated by . Thus if we work with functors having bounded type, we can assume that projective functors have the form for some -module . In such a case, we can also enlarge because whenever (see Proposition 7).
10.1. Lemma.* Let be a commutative ring and consider the correspondence functor for some finite set and some -module .*
- (a)
* is projective if and only if is a projective -module.* 2. (b)
* is finitely generated projective if and only if is a finitely generated projective -module.* 3. (c)
* is indecomposable projective if and only if is an indecomposable projective -module.*
**Proof : **(a) If is projective, then is projective by Lemma 7. Conversely, if is projective, then is projective by Lemma 2.
(b) If is a finitely generated -module, then is finitely generated by Corollary 6. If is finitely generated, then its evaluation is finitely generated by Lemma 6.
(c) By the adjunction property of Lemma 2, , so is indecomposable if and only if is indecomposable.
Our main duality result has two aspects, which we both include in the following theorem. The notion of symmetric algebra is standard over a field and can be defined over any commutative ring as in [Br].
10.2. Theorem.* Let be a finite set.*
- (a)
The representable functor is isomorphic to its dual. 2. (b)
Let be the -algebra of relations on . Then is a symmetric algebra. More precisely, let be the -linear form defined, for all basis elements , by the formula
[TABLE]
Then is a symmetrizing form on , in the sense that the associated bilinear form is symmetric and induces an isomorphism of -bimodules between and its dual .
**Proof : **(a) For every finite set , consider the symmetric bilinear form
[TABLE]
defined, for all basis elements , by the formula
[TABLE]
Then, whenever , , and , we have
[TABLE]
It follows that \big{\langle}U^{op}R,S\big{\rangle}_{X}=\big{\langle}R,US\big{\rangle}_{Y}. In view of the definition of dual functors (Definition 3), this implies that the associated family of linear maps
[TABLE]
defines a morphism of correspondence functors .
To prove that is an isomorphism, we fix and we use the complement , for any . Notice that the matrix of relative to the canonical basis and its dual is the product of two matrices and , where if and 0 otherwise, while is the adjacency matrix of the order relation . This is because if and only if . Clearly is invertible (it has order 2) and is unitriangular, hence invertible. Therefore is an isomorphism.
(b) Let . Then is equal to 1 if , and otherwise. Now
[TABLE]
Therefore t(RS)=\big{\langle}R,S^{op}\big{\rangle}, where \big{\langle}-,-\big{\rangle}_{E} is the bilinear form on defined in (a). Since this bilinear form induces an isomorphism with the dual and since the map is an isomorphism (it has order 2), the bilinear form associated with induces also an isomorphism with the dual.
Since and , we have for any relations and on , hence the bilinear form is symmetric. It is clear that the associated -linear map is a morphism of -bimodules.
10.3. Corollary.*
If is a field, then the correspondence functor is both projective and injective.*
**Proof : **Since passing to the dual reverses arrows and since is projective, its dual is injective. But is isomorphic to its dual, so it is both projective and injective.
10.4. Remark. Corollary 10 holds more generally when is a self-injective ring.
10.5. Remark. If is an order relation on , then there is a direct sum decomposition
[TABLE]
With respect to the bilinear forms defined in the proof of Theorem 10, we have
[TABLE]
because
[TABLE]
It follows that
[TABLE]
and therefore the bilinear forms \big{\langle}-,-\big{\rangle}_{X} induce perfect pairings
[TABLE]
Thus \big{(}k{\mathcal{C}}(-,E)R\big{)}^{\scriptscriptstyle\natural}\cong k{\mathcal{C}}(-,E)R^{op}.
By the Krull-Remak-Schmidt theorem (which holds when is a field by Proposition 6), it is no harm to assume that our functors are indecomposable.
10.6. Theorem.* Let be a field and be a finitely generated correspondence functor over . The following conditions are equivalent:*
- (a)
The functor is projective and indecomposable. 2. (b)
The functor is projective and admits a unique maximal (proper) subfunctor. 3. (c)
The functor is projective and admits a unique minimal (nonzero) subfunctor. 4. (d)
The functor is injective and indecomposable. 5. (e)
The functor is injective and admits a unique maximal (proper) subfunctor. 6. (f)
The functor is injective and admits a unique minimal (nonzero) subfunctor.
**Proof : **(a) (b). Suppose first that is projective and indecomposable. Then for some finite set and some indecomposable projective -module (Lemma 7). Since is a finite dimensional algebra over , the module has a unique maximal submodule . If is a subfunctor of , then is a submodule of , so there are two cases: either , and then , because is generated by , or , and then for any finite set , where
[TABLE]
One checks easily that the assignment is a subfunctor of , such that after the identification . (This subfunctor is similar to the one introduced in Lemma 2.) In particular is a proper subfunctor of . It follows that is the unique maximal proper subfunctor of , as it contains any proper subfunctor of .
(b) (a). Suppose that admits a unique maximal subfunctor . If splits as a direct sum of two nonzero subfunctors and , then and are finitely generated. Let be a maximal subfunctor of , and be a maximal subfunctor of . Such subfunctors exist by Lemma 9. Then and are distinct maximal subfunctors of . This contradiction proves that is indecomposable.
(a) (d). If is a finitely generated projective functor, then there exists a finite set such that is isomorphic to a quotient, hence a direct summand, of for some finite set (Proposition 6). Since is a field, is an injective functor (Corollary 10), hence so is the direct sum and its direct summand .
(d) (a). If is a finitely generated injective functor, then its dual is projective, hence injective, and therefore is projective.
(a) (c). For a finitely generated functor , the duality between and induces an order reversing bijection between the subfunctors of and the subfunctors of . If is projective and indecomposable, then so is , that is, (a) holds for . Thus (b) holds for and the functor has a unique maximal subfunctor. Hence has a unique minimal subfunctor.
(c) (a). If is projective and admits a unique minimal subfunctor, then is also injective, and its dual is projective and admits a unique maximal subfunctor. Hence is indecomposable, so is indecomposable.
It is now clear that (e) and (f) are both equivalent to (a), (b), (c) and (d).
Finally, we prove that the well-known property of indecomposable projective modules over a symmetric algebra also holds for correspondence functors. Recall that is the largest semi-simple quotient of and that is the largest semi-simple subfunctor of .
10.7. Theorem.* Let be a field.*
- (a)
Let be a finitely generated projective correspondence functor over . Then . 2. (b)
Let and be finitely generated correspondence functors over . If is projective, then .
**Proof : **(a) By Proposition 6, we can assume that is indecomposable. In this case, by Theorem 10, both and are simple functors. By Proposition 6, there is a finite set such that is a quotient, hence a direct summand, of for some finite set . Since , the dual is a direct summand of , and both and are generated by their evaluations at . Thus and , by Lemma 7. As is a direct summand of and is indecomposable, is a direct summand of , by the Krull-Remak-Schmidt Theorem (Proposition 6). So there is a primitive idempotent of k{\mathcal{C}}(E,E)\cong\operatorname{End}\nolimits_{{\mathcal{F}}_{k}}\!\big{(}k{\mathcal{C}}(-,E)\big{)} such that , and we can assume that .
If is a finite dimensional -vector space, and is a subspace of , set
[TABLE]
If is a subfunctor of , the assignment sending a finite set to defines a subfunctor of , and moreover is an order reversing bijection between the set of subfunctors of and the set of subfunctors of . In particular . Hence \operatorname{Soc}\nolimits(M)^{\perp}(E)=\big{(}\operatorname{Soc}\nolimits(M)(E)\big{)}^{\perp}=\operatorname{Rad}\nolimits(M^{\scriptscriptstyle\natural})(E).
Now , and is generated by . Hence . It follows that . Then , and is a left ideal of . It follows that is not contained in the kernel of the map defined in Theorem 10, that is t\big{(}\operatorname{Soc}\nolimits(M)(E)\big{)}\neq 0. Hence
[TABLE]
and in particular . Since
[TABLE]
there is a nonzero morphism from to , hence a nonzero morphism from to . Since and are simple, it is an isomorphism.
(b) First, by Proposition 6, both and are finite dimensional -vectors spaces.
Now we can again assume that is an indecomposable projective and injective functor. For a finitely generated functor , set and . If is a short exact sequence of finitely generated functors, then because is projective, and because is injective. So, in order to prove (b), as has finite length, it is enough to assume that is simple. In that case if , and otherwise. Similarly if , and otherwise. Hence (b) follows from (a).
11. The noetherian case
In this section, we shall assume that the ground ring is noetherian, in which case we obtain more results about subfunctors. For instance, we shall prove that any subfunctor of a finitely generated functor is finitely generated. It would be interesting to see if the methods developed recently by Sam and Snowden [SS] for showing noetherian properties of representations of categories can be applied for proving the results of this section.
Our first results hold without any assumption on .
11.1. Notation.* Let be a commutative ring, let be a finite set, and let be a correspondence functor over . We set*
[TABLE]
where the sum runs over proper subsets of .
Note that if is any set of cardinality smaller than , then there exists a bijection , where is a proper subset of . It follows that , where is the graph of .
Note also that is a left module for the essential algebra , because the ideal of the algebra acts by zero on .
11.2. Lemma.* Let be a commutative ring, and let be a finite set. Let be a correspondence functor over . If is a prime ideal of , denote by the localization of at , defined by for every finite set .*
- (a)
* is a correspondence functor over the localization .* 2. (b)
If is finitely generated over , then is finitely generated over . 3. (c)
For each finite set , there is an isomorphism of -modules
[TABLE]
**Proof : **(a) This is straightforward.
(b) If is a finite set, then clearly , because this the localization of a free module (on every evaluation). If is finitely generated, then there is a finite set such that is a quotient of for some finite set . Then is a quotient of the functor , hence it is a finitely generated functor over .
(c) Since localization is an exact functor, the exact sequence of -modules
[TABLE]
gives the exact sequence of -modules
[TABLE]
Now clearly \big{(}k{\mathcal{C}}(E,E^{\prime})M(E^{\prime})\big{)}_{\mathfrak{p}}=k_{\mathfrak{p}}{\mathcal{C}}(E,E^{\prime})M(E^{\prime})_{\mathfrak{p}}=k_{\mathfrak{p}}{\mathcal{C}}(E,E^{\prime})M_{\mathfrak{p}}(E^{\prime}) for each . Hence we get an exact sequence
[TABLE]
and it follows that .
11.3. Proposition.* Let be a commutative ring, let be a finite set, and let be a correspondence functor such that .*
- (a)
There exists a prime ideal of such that . 2. (b)
If moreover is a finitely generated -module, then there exist subfunctors and of such that , and a simple module for the essential algebra of over such that , where . 3. (c)
In this case, there exist positive numbers and such that
[TABLE]
whenever is a finite set such that .
**Proof : **(a) This follows from the well-known fact that the localization map is injective, and from the isomorphism of Lemma 11.
(b) Set where is the prime ideal obtained in (a). Then is a correspondence functor over . Suppose that . Then
[TABLE]
Since is a finitely generated -module, is a finitely generated -module, and Nakayama’s lemma implies that
[TABLE]
that is, . This contradicts (a) and shows that .
Now is a nonzero module for the essential algebra of over , and it is finite dimensional over (because is a finitely generated -module). Hence it admits a simple quotient as -module. Then can be viewed as a simple -module by inflation, and it is also a quotient of . By Proposition 2, there exist subfunctors of such that is isomorphic to the simple functor , proving (b).
(c) By (b) and Theorem 8, there exist positive numbers and such that
[TABLE]
whenever is a finite set such that . Assertion (c) follows.
Now we assume that is noetherian and we can state the critical result.
11.4. Theorem.* Let be a commutative noetherian ring. Let be a subfunctor of a correspondence functor over . If and are finite sets such that is generated by and , then .*
**Proof : **Since is generated by , choosing a set of generators of yields a surjection . Let . Since induces a surjection , and since is generated by , we can replace by and by . Hence we now assume that is a subfunctor of .
Since , there exists
[TABLE]
Let be the subfunctor of generated by . Then clearly , because
[TABLE]
Moreover is a finitely generated -module, and there is a finite subset of such that . Therefore . Replacing by , we can assume moreover that the set is finite. In other words, there exists an integer such that .
Now by Proposition 11, there exists a prime ideal of such that . Moreover is a submodule of , which is a finitely generated (free) -module. Since is noetherian, it follows that is a finitely generated -module.
By Proposition 11, there exist subfunctors of such that is isomorphic to a simple functor of the form , where is a simple module for the essential algebra of over . In particular is minimal such that , thus .
It follows that , and is a subfunctor of . In other words, replacing by and by , we can assume that is a noetherian local ring, that is the unique maximal ideal of , and that has a subfunctor such that is isomorphic to , where is a simple module for the essential algebra over .
We claim that there exists an integer such that
[TABLE]
Indeed is a submodule of the finitely generated -module . By the Artin-Rees lemma (see Theorem 8.5 in [Ma]), there exists an integer such that for any
[TABLE]
Let be generators of as a -module. Suppose that and that N(Y)=A(Y)+\big{(}\mathfrak{p}^{n}{\mathcal{C}}(Y,E)^{\oplus s}\cap N(Y)\big{)}. Then
[TABLE]
It follows that for each , there exist and scalars , for , such that
[TABLE]
In other words the sequence is the image of the sequence under the matrix , where is the matrix of coefficients , and is the identity matrix of size . Since has coefficients in , the determinant of is congruent to 1 modulo , hence is invertible. It follows that the ’s are linear combinations of the ’s with coefficients in . Hence for , thus . This is a contradiction since . This proves our claim.
We have obtained that N\neq A+\big{(}\mathfrak{p}^{n}{\mathcal{C}}(-,E)^{\oplus s}\cap N\big{)}. Since is simple, it follows that .
Now we reduce modulo and we let respectively and denote the images of and in the reduction . Then
[TABLE]
and this is isomorphic to the simple functor over the field . Hence for any finite set , the module is a -vector space. Moreover, by Proposition 11, there exist positive numbers and such that the dimension of this vector space is larger than whenever .
Now for any finite set , the module is filtered by the submodules , for , and the quotient is a vector space over , of dimension , where . It follows that, for ,
[TABLE]
As tends to infinity, this forces , completing the proof of Theorem 11.
11.5. Corollary.* Let be a commutative noetherian ring and let be a subfunctor of a correspondence functor over .*
- (a)
If is a finite set such that is generated by and if is a finite set with , then is generated by . 2. (b)
If has bounded type, then has bounded type. In particular, over , any correspondence functor of bounded type has a bounded presentation. 3. (c)
If is finitely generated, then is finitely generated. In particular, over , any finitely generated correspondence functor is finitely presented.
**Proof : **(a) Let be a finite set such that is generated by . If is a finite set such that , then , by Theorem 11. For each integer , let and choose a subset of which maps to a generating set of as a -module. Each yields a morphism . Let
[TABLE]
Then by construction the induced map
[TABLE]
is surjective, for any finite set , because either or . Suppose that is not surjective and let be a set of minimal cardinality such that is not surjective. Let . Since the map is surjective, there is an element and elements and , for , such that
[TABLE]
The minimality of implies that the map is surjective for each , so there are elements , for , such that . It follows that l=\Psi_{A}\big{(}q+\sum\limits_{e<|A|}R_{e}q_{e}\big{)}, thus . This contradiction proves that the morphism is surjective.
Now let be a set with . For each , the representable functor is generated by its evaluation at , hence also by its evaluation at , because is a direct summand of by Corollary 3. Therefore is generated by . Since is surjective, it follows that is generated by .
(b) This follows clearly from (a).
(c) If now is finitely generated, then the same argument applies, but we can assume moreover that all the sets appearing in the proof of (a) are finite, since for any finite set , the module is finitely generated, being a submodule of the finitely generated module . It follows that the functor of the proof of (a) is finitely generated and this proves (c).
It follows from (b) and Theorem 7 that, whenever is noetherian, any correspondence functor of bounded type is isomorphic to for some and . We shall return to this in Theorem 12 below.
11.6. Notation.* We denote by the full subcategory of consisting of correspondence functors having bounded type and by the full subcategory of consisting of finitely generated functors.*
11.7. Corollary.* Let be a commutative noetherian ring. Then the categories and are abelian full subcategories of .*
**Proof : **Any quotient of a functor of bounded type has bounded type and any quotient of a finitely generated functor is finitely generated. When is noetherian, any subfunctor of a functor of bounded type has bounded type and any subfunctor of a finitely generated functor is finitely generated, by Corollary 11.
12. Stabilization results
Recall from Lemma 2 that for any finite set and any -module , we have defined a subfunctor of by setting
[TABLE]
Moreover and .
We have seen in Proposition 7 that whenever . The subfunctor vanishes at , hence also at , so that . When is noetherian, we show that this decreasing sequence reaches zero.
12.1. Theorem.* Let be a commutative noetherian ring, let be a finite set, and let be an -module. For any finite set such that , we have .*
**Proof : **Let be a finite set. By Proposition 7, there is an isomorphism . Thus is isomorphic to a subfunctor of . Since , it follows from Corollary 3 that for any finite set with .
We now assume that and we prove that . Let be a set of minimal cardinality such that . Then . Moreover , hence by Theorem 11, because is (isomorphic to) a subfunctor of , which is generated by . It follows that .
We now show that, over a noetherian ring, any correspondence functor of bounded type is isomorphic to for some and , or also isomorphic to for some and (where the symbol refers to Notation 2).
12.2. Theorem.* Let be a commutative noetherian ring. Let be a correspondence functor over generated by , for some finite set .*
- (a)
For any finite set such that , the counit morphism is an isomorphism. 2. (b)
For any finite set such that , we have and , hence .
**Proof : **(a) If is generated by , then there is a set and a surjective morphism . If is a finite set with , then by Corollary 11 the kernel of this morphism is generated by . Then is in turn covered by a projective functor and we have a bounded presentation
[TABLE]
with both and generated by their evaluation at . By Theorem 7, the counit morphism is an isomorphism.
(b) For any finite set such that , we have by (a). For any finite set such that , that is, , we obtain by Theorem 12. It follows that
[TABLE]
Finally, notice that, by the definition of , we have , so we obtain .
Other kinds of stabilizations also occur, as the next theorems show.
12.3. Theorem.* Let be a commutative noetherian ring, let and be correspondence functors over , and let and be finite sets.*
- (a)
If is generated by , then for , the evaluation map at
[TABLE]
is an isomorphism. 2. (b)
If has bounded type, then for any integer , there exists an integer such that the evaluation map
[TABLE]
is an isomorphism whenever .
**Proof : **(a) By Theorem 12, we have an isomorphism for . Hence
[TABLE]
where the last isomorphism comes from the adjunction of Lemma 2, and is given by evaluation at .
(b) This assertion will follow from (a) by décalage and induction on . If is generated by , then there is an exact sequence of correspondence functors
[TABLE]
where is projective and generated by . This gives an exact sequence
[TABLE]
and isomorphisms for .
Now has bounded type by Corollary 11, and is a projective -module by Lemma 7, whenever is large enough. It follows that there is also an exact sequence
[TABLE]
and isomorphisms \operatorname{Ext}\nolimits_{{\mathcal{R}}_{F}}^{i}\!\big{(}M(F),N(F)\big{)}\cong\operatorname{Ext}\nolimits_{{\mathcal{R}}_{F}}^{i-1}\!\big{(}L(F),N(F)\big{)} for , whenever is large enough.
Now by (a), the exact sequences
[TABLE]
and
[TABLE]
are isomorphic for large enough. It follows that
[TABLE]
Similarly, for each , when is large enough (depending on ), there are isomorphisms \operatorname{Ext}\nolimits_{{\mathcal{F}}_{k}}^{i}(M,N)\cong\operatorname{Ext}\nolimits_{{\mathcal{R}}_{F}}^{i}\!\big{(}M(F),N(F)\big{)}.
There is also a stabilization result involving the groups.
12.4. Theorem.* Let be a commutative noetherian ring, and be a finite set. If is a finite set with , then for any finite set and any left -module , we have*
[TABLE]
**Proof : **Let be a left -module and be a surjective morphism of -modules, where is projective. Let denote the kernel of the surjective morphism
[TABLE]
Since is generated by , it follows from Corollary 11 that is generated by whenever is a finite set with . Now by Theorem 12, the counit is an isomorphism whenever is a finite set with . Hence if , we have an exact sequence of correspondence functors
[TABLE]
where , and where the middle term is projective. Evaluating this sequence at , we get the exact sequence of -modules
[TABLE]
where the middle term is projective.
Let be a finite set. Applying the functor to this sequence yields the exact sequence
[TABLE]
because by Corollary 3, as . On the other hand, evaluating at the exact sequence 12.4 gives the exact sequence
[TABLE]
In both latter exact sequences, the maps are exactly the same. It follows that
[TABLE]
as was to be shown.
As a final approach to stabilization, we introduce the following definition.
12.5. Definition.* Let denote the following category:*
- •
The objects of are pairs consisting of a finite set and a left -module .
- •
A morphism in is a morphism of -modules .
- •
The composition of morphisms and is the morphism obtained by composition
[TABLE]
where is the composition in the category .
- •
The identity morphism of is the canonical isomorphism
[TABLE]
resulting from the definition .
One can check easily that is a -linear category.
12.6. Theorem.* Let be a commutative ring. Let be the assignment sending to , and to the morphism associated by adjunction to .*
- (a)
* is a fully faithful -linear functor.* 2. (b)
* is an equivalence of categories if is noetherian.* 3. (c)
* is an abelian category if is noetherian.*
**Proof : **It is straightforward to check that is a -linear functor. It is moreover fully faithful, since
[TABLE]
Finally, if is noetherian, then any correspondence functor of bounded type is isomorphic to a functor of the form , by Theorem 12, for large enough and . Hence is essentially surjective, so it is an equivalence of categories. In particular, is abelian by Corollary 11.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AF] F. W. Anderson, K. R. Fuller. Rings and Categories of Modules , Graduate Texts in Mathematics 13, Springer Verlag, 1992.
- 2[Bo 1] S. Bouc. Foncteurs d’ensembles munis d’une double action, J. Algebra 183 (1996), 664–736.
- 3[Bo 2] S. Bouc. Biset functors for finite groups, Springer Lecture Notes in Mathematics no. 1990 (2010).
- 4[Br] M. Broué. Higman’s criterion revisited, Michigan Math. J. 58 (2009), no. 1, 125–179.
- 5[BST] S. Bouc, R. Stancu, J. Thévenaz. Simple biset functors and double Burnside ring, J. Pure Appl. Alg. 217 (2013), 546–566.
- 6[BT 1] S. Bouc, J. Thévenaz. The algebra of essential relations on a finite set, J. reine angew. Math. 712 (2016), 225–250.
- 7[BT 2] S. Bouc, J. Thévenaz. Correspondence functors and lattices, preprint, 2017.
- 8[BT 3] S. Bouc, J. Thévenaz. The algebra of Boolean matrices, correspondence functors, and simplicity, in preparation.
