Simple and projective correspondence functors
Serge Bouc, Jacques Th\'evenaz

TL;DR
This paper characterizes simple projective correspondence functors and explores their occurrence within functors associated with finite lattices, leading to a decomposition result.
Contribution
It precisely identifies which simple correspondence functors are projective and analyzes their role in lattice-based functors, providing a decomposition.
Findings
Characterization of simple projective correspondence functors
Decomposition of lattice-associated correspondence functors
Identification of simple projectives within specific functors
Abstract
A correspondence functor is a functor from the category of finite sets and correspondences to the category of -modules, where is a commutative ring. We determine exactly which simple correspondence functors are projective. Moreover, we analyze the occurrence of such simple projective functors inside the correspondence functor associated with a finite lattice and we deduce a direct sum decomposition of .
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.
Simple and projective correspondence functors
Serge Bouc
and
Jacques Thévenaz
Abstract.
A correspondence functor is a functor from the category of finite sets and correspondences to the category of -modules, where is a commutative ring. We determine exactly which simple correspondence functors are projective. Moreover, we analyze the occurrence of such simple projective functors inside the correspondence functor associated with a finite lattice and we deduce a direct sum decomposition of .
Key words and phrases:
Keywords: finite set, correspondence, functor category, simple functor, poset, lattice
1991 Mathematics Subject Classification:
AMS Subject Classification: 06B05, 06B15, 06D05, 06D50, 16B50, 18B05, 18B10, 18B35, 18E05
1. Introduction
In the present paper, we continue to develop the theory of correspondence functors, namely functors from the category of finite sets and correspondences to the category of -modules, where is a commutative ring. Assuming that is a field, we showed in [BT2] how to parametrize the simple correspondence functors by means of a finite set , an order relation on , and a simple -module (up to isomorphism). Here, we determine which of them are projective (or equivalently injective).
We say that a poset is a pole poset if it is obtained by stacking posets having either cardinality one or cardinality two with two incomparable elements (see Section 2 for details).
1.1. Theorem.* Let be a field and let be the simple correspondence functor parametrized by a finite set , an order relation on , and a simple -module . The following conditions are equivalent :*
- (a)
* is projective.* 2. (b)
The poset is a pole poset and is a projective -module. 3. (c)
Either is a totally ordered poset or is a pole poset and the characteristic of is different from 2.
Since the group of automorphisms of a pole poset is a 2-group, (b) and (c) are easily seen to be equivalent. However, it requires much more work to prove that (a) implies (b), and also that (b) implies (a) (see Section 4). In the case when is totally ordered, the projectivity of was already proved in Corollary 11.11 of [BT3].
Every simple functor has a precursor , called the fundamental functor associated with the poset (see Proposition 3). This functor has the advantage of being defined over any commutative base ring . In analogy with the theorem above, we prove in Section 5 that is projective if and only if is a pole poset.
Associated with a finite lattice , there is a correspondence functor which is defined over an arbitrary commutative ring and which plays a crucial role in the theory, see [BT3, BT4]. We know in particular that is projective if and only if the lattice is distributive, for instance if is a pole lattice. Also, the assignment is known to be a fully faithful functor by [BT3].
If is arbitrary, we show that has direct summands corresponding to pole lattices appearing inside , by means of suitably constructed idempotents in . Actually, most of the work is done in (where morphisms between lattices are defined to be -linear combinations of join-morphisms), and then corresponding results for are obtained using the fully faithful functor . The construction of idempotents in is quite technical (see Section 6) but it provides an explicit description of the part of which corresponds to pole lattices (see Section 7).
In Section 8, we analyze the special case when is a pole lattice (see Theorem 8 for details).
1.2. Theorem.* Let be a pole lattice. Then is isomorphic to a direct sum of matrix algebras*
[TABLE]
where varies among pole lattices inside and is some explicit integer.
From this, we obtain a decomposition of as a direct sum of projective functors (Theorem 8) and each summand is also simple when is a field (Corollary 8). Finally, if is an arbitrary finite lattice, we describe a projective direct summand of corresponding to all pole lattices which appear inside (Theorem 8).
2. Pole posets, pole lattices, and opposite morphisms
We first recall some standard facts about lattices and fix the terminology and the notation. If is a finite lattice, we denote by its join, its meet, and its order relation. When the context is clear, we simply write instead of . The unique minimal element is written and the unique maximal element . We let denote the opposite lattice, such that
[TABLE]
A join-irreducible element in is simply called irreducible. We write for the full subposet of irreducible elements of . Recall that is an empty join, hence is not irreducible. Similarly is an empty meet. If is irreducible, then the half-open interval has a unique maximal element, written . In other words, . Similarly, if is meet-irreducible (i.e. irreducible in the opposite lattice ), then we define . Any finite poset is isomorphic to the full subposet of irreducible elements of a lattice, e.g. the lattice of all subsets of closed under taking smaller elements.
Now we want to introduce one of the main concepts for the present a paper. Let and be two finite posets. Define to be the poset whose underlying set is the disjoint union and whose order relation is the union of the order relation of , the order relation of , and the requirement that for all and . If are finite posets, then is defined inductively.
A pole poset is a poset of the form where each either has cardinality one, or consists of exactly two incomparable elements. If , then clearly has height (with the usual convention that the minimal elements, that is, those in , have height 0). The definition implies that there are two types of elements in a pole poset :
- (a)
If has cardinality one, then is comparable to every element of . 2. (b)
If has cardinality two, then is comparable to every element of . In that case, will be called the twin of and written . In particular, .
Notice that a totally ordered poset is a pole poset (with no twins). We write for the set of elements of the first type (the ‘totally ordered’ part of ) and for the set of elements of the second type (the ‘twin’ part of ).
A pole lattice is a lattice whose underlying poset is a pole poset. Whenever and are incomparable elements of height in a pole lattice , then they are both join-irreducible and meet-irreducible. In this case, there is a single element of height , namely , and a single element of height , namely . Clearly and . Also, is the unique element of height 0 and is the unique element of maximal height.
2.1. Lemma.*
Let be a pole lattice
and let .
Then is the set of irreducible elements of .*
**Proof : **This is easy and is left to the reader.
We want to show that pole posets can be characterized by a condition which will be useful later in Section 4. Recall that a relation on a set is a subset and that the opposite relation is defined by :
[TABLE]
Moreover, the product of two relations and is the relation defined by
[TABLE]
Let be the symmetric group of all permutations of . Associated with a permutation , there is the relation
[TABLE]
In particular, we write for the identity morphism of the object . The map is a monoid homomorphism and is invertible for every . The symmetric group acts on relations by conjugation : we write and .
2.2. Proposition.*
Let be a finite poset and let be its order relation (i.e. ).
Let .
The following are equivalent :*
- (a)
* is pole poset.* 2. (b)
There exists a permutation of such that
[TABLE] 3. (c)
There exists a permutation of such that .
Moreover, if (b) holds, then can be chosen to be an automorphism of the poset and, in that case, it is unique and it satisfies for all twins .
**Proof : **First note that the equivalence of (b) and (c) follows immediately from the definitions, because
[TABLE]
while we always have .
Suppose that (a) holds and define to be the permutation that preserves heights and satisfies for all twins . Let such that . If is the unique element of its height, then is comparable to all elements of and . It follows that . If and are distinct elements of the same height, i.e. twins, then is comparable to every element of . Therefore, if , then , hence also , while if , then . This proves that we get in all cases, hence (b) holds.
We assume now that (b) holds and we want to prove (a). We proceed by induction on the size of , starting from the obvious case when . Suppose first that has at least two distinct maximal elements and . Since , we have by (b), hence by maximality of . Similarly, . Now if , then by (b), hence , so that . In other words, if and , then . Similarly, if and , then . Therefore and are the unique maximal elements of and , where .
If and , then by (b). But the permutation exchanges and , so it restricts to a permutation of . Therefore (b) holds for the poset and, by induction, is a pole poset. It follows that is a pole poset, as required.
Suppose now that has a single maximal element . If , then by maximality, hence by (b). If , then restricts to a permutation of and again we are done by induction.
So we assume now that our single maximal element satisfies . The condition obtained above means that is the unique maximal element of . Assume by induction that and that is the unique maximal element of , for every . Then if , we have , hence by (b). But , otherwise which is impossible by our induction assumption. Therefore, either is the unique maximal element of and we continue our induction argument, or .
Our induction argument must stop and we let be the smallest integer such that . Then and is the unique maximal element of , for every . Moreover, setting , we obtain
[TABLE]
and must be invariant under . By our main induction procedure, is a pole poset. It follows that is a pole poset. This proves (a) and we are done.
In order to prove our additional statement, we continue the analysis of the permutation , as above. In the case when has two maximal elements and , then we have seen that . Moreover restricts to a permutation of . By induction, can be replaced uniquely by an automorphism of the pole poset such that exchanges all the twins of . Extending to by requiring that exchanges and (as it must, as we have seen for ), we obtain an automorphism of having the additional required properties.
In the case when has a single maximal element , then we have seen that permutes cyclically the subset for some , and it restricts to a permutation of . By induction, can be replaced uniquely by an automorphism of the pole poset such that exchanges all the twins. Extending by the identity on , we obtain an automorphism of having the additional required properties.
A join-morphism from a lattice to a lattice is a map which commutes with joins, i.e. such that
[TABLE]
for any subset of . Similarly, a meet-morphism is a map which commutes with meets. It is easy to see that a join-morphism is order-preserving, by considering the join in the case where in the lattice . Moreover, the case shows that a join-morphism maps to . The following result is well-known.
2.3. Lemma.*
Let and be finite lattices.
Suppose that is distributive and let .
Then any order-preserving map extends uniquely to a join-morphism .*
**Proof : **For any , we can write uniquely
[TABLE]
and then define the extension of by
[TABLE]
To check that is a join-morphism, we use the fact that, for any and , we have
[TABLE]
This is because, if , then, by distributivity, hence by irreducibility, either , i.e., , or , i.e., .
2.4. Notation.**
- (a)
We let be the category whose objects are the finite lattices and where, for any finite lattices and , is the set of all join-morphisms from to . 2. (b)
We denote by the set of all injective join-morphisms . 3. (c)
We denote by the set of all surjective join-morphisms .
Recall from Section 8 of [BT3] that, for any join-morphism , there is an opposite morphism defined by
[TABLE]
2.5. Lemma.*
Let and be finite lattices and let be a join-morphism.*
- (a)
* is a join-morphism. In other words, for any subset of ,*
[TABLE]
(because the meet is the join in the opposite lattice). 2. (b)
If is a join-morphism, then . 3. (c)
. 4. (d)
If is surjective, then . In particular, is injective and, for any ,
[TABLE] 5. (e)
If is injective, then . In particular, is surjective. 6. (f)
Passing to the opposite induces bijections and .
**Proof : **(a), (b) and (c) are proved in Section 8 of [BT3].
(d) Let . The equality follows from the fact that is surjective and order-preserving. Moreover, it is clear that \displaystyle\bigvee_{f(t)=p}t=\sup\big{(}f^{-1}(p)\big{)} because is a join-morphism. Finally because f\big{(}\sup\big{(}f^{-1}(p)\big{)}\big{)}=p.
(e) This follows from (b), (c), and (d) by passing to opposite morphisms.
(f) This follows from (d) and (e).
For later use, we now prove a specific result in the case when is a pole lattice.
2.6. Lemma.*
Let be a finite lattice and let be a pole lattice. Then there is a bijection between and .*
**Proof : **Associated with the pole lattice , there is the set
[TABLE]
consisting of all the twins , indexed in such a way that . Here is a positive integer (which is zero whenever is totally ordered). We define
[TABLE]
and we also set and . Just above the pair of twins , there is a totally ordered interval . Also, we have a totally ordered interval below the pair , and a totally ordered interval above the pair . Note that we may have .
Let . We want to define an injective meet-morphism associated with . First we set
[TABLE]
Since is a join-morphism, we have
[TABLE]
Note also that
[TABLE]
We have to define on each interval , , and there are two cases for each .
If , either or . In the first case, we simply set
[TABLE]
while in the second, we set
[TABLE]
where denotes the shift upwards in the totally ordered interval , that is, .
Similarly, if , either or . In the first case, we simply set
[TABLE]
while in the second, we set
[TABLE]
It is easy to see that is order-preserving and injective, and moreover
[TABLE]
In view of the structure of pole lattices, this means that is a meet-morphism, or in other words a join-morphism . Therefore and this defines a map
[TABLE]
In the other direction, we proceed as follows. The same construction, applied to and , defines a map
[TABLE]
and it is elementary to check that maps to , because the shift upwards in the opposite of a totally ordered interval corresponds to the shift downwards in the original interval . In other words the composite is the identity. Similarly, is the identity and it follows that is a bijection.
Now it suffices to compose with the bijection of Lemma 2 to obtain a bijection between and .
3. Correspondence functors
We recall the basic facts we need about correspondence functors and we refer to Sections 2–4 of [BT2] and Section 2 of [BT3] for more details. We denote by the category of finite sets and correspondences. Its objects are the finite sets and the set of morphisms from to (using a reverse notation which is convenient for left actions) is the set of all correspondences from to , namely all subsets of . A correspondence from to is also called a relation on . Given two correspondences and , their composition is defined by
[TABLE]
and this generalizes the product of relations, defined in Section 2.
For any commutative ring , we let be the -linearization of . The objects are again the finite sets and is the free -module with basis . A correspondence functor is a -linear functor from to . We let be the category of all correspondence functors (for some fixed commutative ring ). We define a minimal set for a correspondence functor to be a finite set of minimal cardinality such that . For a nonzero functor, such a minimal set always exists and is unique up to bijection.
The first instances of correspondence functors are the representable functors , where is a finite set, and more generally the functors
[TABLE]
where is a left -module. Actually, the functor is left adjoint of the evaluation functor
[TABLE]
The correspondence functor has a subfunctor defined on any finite set by
[TABLE]
We shall work with the functor for some specific choices of -modules .
Recall from [BT1] that, for a suitable two-sided ideal , there is a quotient algebra , called the algebra of permuted orders because it has a -basis consisting of all relations on of the form , where runs through the symmetric group and is an order relation on . The product of two order relations and in is the transitive closure of if this closure is an order relation, and zero otherwise. This product, together with the conjugation action of permutations on relations, describes completely the algebra structure of .
Among the -modules, there is the fundamental module , associated with a poset , where is a finite set and denotes the order relation on which defines the poset structure. Here is a suitable idempotent in , depending on , and is the left ideal generated by . The main thing we need to know about the fundamental module is its structure as a bimodule. This is described in the next result, which combines Corollary 7.3 and Proposition 8.5 of [BT1].
3.1. Proposition.*
Let be a finite set and an order relation on .*
- (a)
The fundamental module is a -bimodule and the right action of is free. 2. (b)
* is a free -module with a -basis consisting of the elements , where runs through the group of all permutations of .* 3. (c)
The action of the algebra of relations on the module is given as follows. For any relation ,
[TABLE]
Moreover, is unique in the first case.
Using the bimodule structure on , we define
[TABLE]
where is any -module. Then is a left -module for the action induced from the action of on described in Proposition 3 above. The main thing we need to know about is the following result, which is part of Theorem 8.1 in [BT1].
3.2. Proposition.* Assume that is a field. If is a simple -module, then is a simple -module.*
Associated with the above -modules, we can now define, as in [BT2] and [BT3], some specific correspondence functors. Using the fundamental module , we define
[TABLE]
and we call it the fundamental functor associated with the poset . Using the module , we define
[TABLE]
Note that and , for any permutation . Our next result is Proposition 2.6 in [BT3].
3.3. Proposition.**
- (a)
The set is a minimal set for and as left -modules. 2. (b)
The set is a minimal set for and as left -modules. 3. (c)
If is a field and is a simple -module, then is a simple correspondence functor.
It is proved in Theorem 4.7 of [BT2] that, when is a field, any simple functor has the form for some triple and that 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 relation on , and is a simple -module.
We note that the fundamental functor is a precursor of , in the sense of the following result.
3.4. Proposition.*
Suppose that is a simple -module, hence in particular generated by a single element .*
- (a)
Consider the surjective morphism of correspondence functors
[TABLE]
induced by the surjective homomorphism of -modules
[TABLE]
Then induces a surjective morphism of correspondence functors
[TABLE] 2. (b)
* induces an isomorphsim*
[TABLE]
**Proof : **(a) is Lemma 2.7 in [BT3], while (b), which is far from being obvious, is Theorem 6.10 in [BT4].
In short, it it is possible to recover from by simply tensoring with . Consequently, the fundamental functors play a crucial role throughout our work.
Another important construction of correspondence functors is obtained from finite lattices (see [BT3] for details).
3.5. Definition.*
If is a finite lattice and is a finite set, define , the free -module on the set of all functions .
Given and a correspondence , then is defined by the formula*
[TABLE]
Then becomes in this way a correspondence functor.
We want to recall two main properties of this construction but we first need some notation. Let be the category of finite lattices and join-morphisms, as in Notation 2. The -linearization of has the same objects and is the free -module with basis . The composition of morphisms in is the -bilinear extension of the composition in . The following results appear in Theorems 4.8 and 4.12 of [BT3].
3.6. Theorem.**
- (a)
The assignment extends to a -linear functor . Moreover, is fully faithful. 2. (b)
If is a finite lattice, then is projective in if and only if is distributive. In particular, if is a pole lattice, then is projective.
Our next lemma gives another realization of the functor in a special case. Let be a finite set and an order relation on (i.e. is a finite poset). As in [BT3], let be the lattice of all subsets of closed under taking smaller elements with respect to . Then is isomorphic to the poset of irreducible elements of via the map . Notice that in the lattice .
3.7. Lemma.*
Let be a finite poset and let .
For any finite set , define a map*
[TABLE]
where is any basis element in . Then this induces an isomorphism of correspondence functors .
**Proof : **The result can be obtained by combining Proposition 4.5 and Remark 8.7 in [BT3], using the isomorphism, via complementation, . We provide instead a direct proof.
Since is a subset of , it is an element of . It is right invariant by because if , i.e. , and if , then because (otherwise we would have since is closed under taking smaller elements). Hence . It is elementary to check that is a morphism of functors. Moreover, it is an isomorphism because there is an inverse morphism mapping to the function defined by
[TABLE]
The fact that is right invariant by implies that is closed under taking smaller elements. Details are left to the reader.
There is a direct connection between the functors associated with lattices and the fundamental functors. This is Theorem 6.5 in [BT3].
3.8. Theorem.*
Let be a finite poset.
There is a unique surjective morphism*
[TABLE]
mapping the inclusion map to .
We now recall another main result from [BT3], which will be used in Section 4 and Section 5. Let and, as in Section 9 of [BT3], consider the element
[TABLE]
Here is the map defined by
[TABLE]
with values in the lattice , but viewed as elements of .
3.9. Theorem.*
Let be a finite poset and let .
The subfunctor of generated by is isomorphic to the fundamental functor .
Moreover, the isomorphism*
[TABLE]
maps to .
**Proof : **The first statement is Theorem 9.5 in [BT3]. The second statement can be traced in the proof of that theorem. More precisely, if denotes the inclusion map, it is shown that is the image of under a morphism
[TABLE]
On the other hand, by Theorem 3 above, there is a surjective morphism
[TABLE]
mapping the inclusion map to . Both morphisms and are proved to have the same kernel and this induces the required isomorphism . It follows that this isomorphism maps to .
4. Characterization of simple projective functors
Throughout this section, assume that the base ring is a field and let be a finite poset. Our aim is to characterize the triples such that the simple correspondence functor is projective.
Since is isomorphic to a quotient of the fundamental functor (see Proposition 3), we shall actually work with the latter. We have by Theorem 3, where and is defined by (3.8). We let
[TABLE]
be the inclusion morphism. We also let
[TABLE]
be the isomorphism of correspondence functors described in Lemma 3 and we define
[TABLE]
In view of the isomorphism , the subfunctor of generated by is isomorphic to , hence to . We shall work with and we first need its precise description as a linear combination of relations.
4.1. Lemma.*
Let , where is defined by (3.8).*
- (a)
, where and . 2. (b)
. 3. (c)
. 4. (d)
* and .*
**Proof : **Throughout this proof, we write for .
(a) By Lemma 3, we have
[TABLE]
But . If , we need to add to the element , because . Therefore , as required.
(b) This follows from (a) and the fact that .
(c) Since , we have an inclusion
[TABLE]
In order to prove the reverse inclusion, we let . Then there exists such that and .
If , that is, , then , otherwise we would have . Therefore .
If , then and there are two cases. If , then . If , then , hence , that is, .
This completes the proof that , hence equality.
(d) It follows from (b) and (c) that , hence also because is an isomorphism mapping to . The latter equality was also proved in Lemma 9.3 of [BT3].
We also need some technical computations involving .
4.2. Lemma.*
As above, consider .
Let (that is, and ).*
- (a)
* if and only if there exists a permutation such that .* 2. (b)
If and , then there exists an automorphism such that . 3. (c)
If is a pole poset and if , then
[TABLE]
where is the automorphism of satisfying for all (the twin part of ) and for all (the totally ordered part of ).
**Proof : **(a) The condition is equivalent to by Theorem 3. By Proposition 3, we obtain
[TABLE]
using the equalities and (by transitivity and reflexivity of ). Conversely, if , then, by Lemma 4, we obtain
[TABLE]
because since it generates a nonzero subfunctor.
(b) We have by (a) and since , we obtain , or in other words , where . Since , we get , hence because both relations have the same cardinality. This means that commutes with , that is, is an automorphism of the poset .
(c) By (b) applied to (which satisfies by Lemma 4), we have
[TABLE]
for some automorphism . Since is a pole poset, is the identity on and interchanges some of the twins , so in particular .
If and is its twin, then , hence . Therefore and , that is . This shows that cannot be equal to , i.e. . Thus interchanges all the twins, that is, it is equal to the automorphism of the statement.
If , then and , so . If conversely , then and , that is, . This cannot hold if , because , and therefore . It follows that
[TABLE]
the third equivalence using the fact that because . This shows that and completes the proof.
One of the key part of the proof of the main result is contained in the next lemma, which will also be used again in Section 5.
4.3. Lemma.*
Suppose that is a field.
Let be the fundamental functor associated with a finite poset and let be a direct summand of .
If is projective, then is a pole poset.*
**Proof : **Since by Theorem 3, we can view as a direct summand of and we let be the inclusion morphism. As above, we let be the inclusion morphism and be the isomorphism of correspondence functors described in Lemma 3. Finally let
[TABLE]
be the composite .
Since is projective and the base ring is a field, is also injective, by Theorem 10.6 in [BT2]. Therefore the injective morphism splits, that is, there exists a surjective morphism
[TABLE]
such that . Thus is an idempotent endomorphism of . Since is a generator of , its image is a generator of . Now generates , so we can write for some . We know that by Lemma 4 and therefore . Replacing by , we can assume that and we do so. Thus . Note that , hence .
Now for any , we have
[TABLE]
where as in Lemma 4. In particular, using the fact that (because ), we obtain
[TABLE]
Since is nonzero, so is its image under the injective morphism and therefore
[TABLE]
from which it follows that .
Summarizing, we have proved that, under the assumption that is projective, the element satisfies :
[TABLE]
Our aim is to show that (4.3) implies that is a pole poset.
The condition implies that there exists a relation (in the expression of as a linear combination of relations) such that . In particular , hence for some , by Lemma 4. In view of the expression of obtained in Lemma 4, there exists a subset such that
[TABLE]
Again, this implies that the relation has the form
[TABLE]
for some , by Lemma 4. Since the left hand side is invariant under left multiplication by (by Lemma 4), part (b) of Lemma 4 implies that commutes with (i.e. ). It follows that
[TABLE]
In particular, we deduce that
[TABLE]
By the characterization of Proposition 2, this implies that is a pole poset, as was to be shown.
4.4. Theorem.*
Let be a field and let be the simple correspondence functor parametrized by a finite set , an order relation on ,
and a simple -module .
The following conditions are equivalent.*
- (a)
The simple correspondence functor is projective. 2. (b)
* is a pole poset and is a projective -module.* 3. (c)
Either is a totally ordered poset or is a pole poset and the characteristic of is different from 2.
**Proof : **(b) (c). For a pole poset , the group is a 2-group (elementary abelian), generated by all the possible transpositions of twins. In case is totally ordered, this group is trivial and the unique simple -module is automatically projective. In case is a pole poset but is not totally ordered, then is nontrivial and the characteristic of comes into play. If , then all simple -module are projective (by Maschke’s theorem). If , then the unique simple -module is the trivial module, which is not projective (by the converse of Maschke’s theorem).
(a) (b). Since is projective by assumption and isomorphic to a quotient of the fundamental functor by Proposition 3, it is isomorphic to a direct summand of . Therefore Lemma 4 can be applied and it follows that is a pole poset.
We also have to prove that is a projective -module. Let
[TABLE]
be the simple -module appearing in the definition . By adjunction, there is an isomorphism
[TABLE]
and this is a skew field by Schur’s lemma (it is actually the field ). This has no nontrivial idempotent and so is indecomposable. But the surjective morphism
[TABLE]
is split because is projective by assumption. Therefore is an isomorphism, by indecomposability of , hence is projective.
Evaluating this projective functor at the finite set , we obtain a -module
[TABLE]
which must be projective, by Lemma 10.1 in [BT2]. Now is actually a module for the quotient algebra (see Section 3). It follows that is a projective module for the algebra , because of the splitting of the composition of surjective homomorphisms
[TABLE]
Finally, by Theorem 7.5 in [BT1], there is an isomorphism of algebras
[TABLE]
for some integers , where runs over all order relations on up to isomorphism. Thus there is a Morita equivalence
[TABLE]
and the bimodule inducing the equivalence is (see Remark 7.6 in [BT1]). Therefore corresponds to the -module under this equivalence. Since projectivity is preserved by a Morita equivalence, is a projective -module, as required.
(b) (a). We assume that is a pole poset and, as before, we write for . Our aim is to compute and show that it is an idempotent. In view of the expression of in Lemma 4, we have to consider terms of the form . By Lemma 4, this can be nonzero only if and , where is the automorphism exchanging all twins and fixing pointwise.
Thus is the only term which can come into play and we now show that it is indeed equal to . For any , we have and , hence . Therefore . Since is a pole poset, Proposition 2 implies that , using the fact that is an automorphism of . So we obtain
[TABLE]
In order to prove the reverse inclusion, we let (since ) and , i.e. . If , then , hence . Then , that is, . If , then , hence . If , then , while if , then , hence , that is, . This shows the required reverse inclusion and therefore
[TABLE]
as claimed. In particular by Lemma 4. Therefore
[TABLE]
Since permutes all the subsets and preserves their cardinality, we have . Consequently
[TABLE]
so we obtain an idempotent.
Right multiplication by this idempotent defines an idempotent endomorphism of the correspondence functor (notice that both and commute with ). The image of this endomorphism is the subfunctor generated by the element , that is, the subfunctor generated by because is invertible. But we know that is isomorphic to the fundamental functor . Therefore is isomorphic to a direct summand of , hence a direct summand of because is idempotent. Since is a projective functor by Yoneda’s lemma, we conclude that is projective.
Our assumption (b) also says that the -module is projective. By Proposition 3, is isomorphic to , which is in turn a direct summand of . Therefore is projective, proving (a).
Another proof of the implication (b) (a) will be given later in Corollary 8.
5. Projectivity of fundamental functors
Given a poset , we know from Proposition 3 that every simple functor has a precursor , called the fundamental functor associated with the poset . This is actually defined over any commutative base ring . The main result of this section is analogous to Theorem 4.
5.1. Theorem.*
Let be a finite poset. Then is a projective functor if and only if is a pole poset.*
**Proof : **Assume first that is a projective functor. We allow the base ring to vary and we write a superscript to emphasize that a functor belongs to the category of correspondence functors defined over the base ring . Let be a maximal ideal of and let be the corresponding field. The scalar extension functor
[TABLE]
is left adjoint of the scalar ‘restriction’ functor, which is obviously exact. Therefore, scalar extension sends projective objects to projective objects. In particular, we see that is projective.
By Theorem 5.6 in [BT4], the evaluation at a finite set has an explicit -basis . This basis is defined independently of , so that it remains a -basis for any ring extension . Therefore, the natural surjection
[TABLE]
is an isomorphism. Since this holds for any , we have and it follows that is projective. Now the functor satisfies the assumptions of Lemma 4 and this lemma then asserts that is a pole poset, as was to be shown.
For the converse, we use the proof of (b) (a) in Theorem 4. This proof (except the last paragraph) tells us precisely that, whenever is a pole poset, the fundamental functor is projective.
Another proof of the projectivity of whenever is a pole poset will be given later (see Remark 8).
6. Morphisms and idempotents corresponding to pole lattices
In this section, we continue our analysis of the category of finite lattices, where is a commutative ring. We construct morphisms involving a finite lattice and a pole lattice . Assuming that is nonempty, we fix a surjective join-morphism , from which we will construct an idempotent endomorphism of to the effect that can be viewed as a sort of ‘direct summand’ of . By means of the fully faithful functor , we deduce that a certain quotient of is a direct summand of . We will see later in Section 8 how to deduce information about projective direct summands of the correspondence functor .
Our results generalize those obtained in [BT3] in the special case of totally ordered lattices. We follow the same line of development, but with many necessary additions and technical adaptations.
Recall that denotes the subset of elements such that is comparable to every element of , while denotes the subset consisting of all twins. Let be the set of irreducible elements of , described in Lemma 2. We write and (so that in fact ).
6.1. Notation.*
We define a notation associated with the surjective join-morphism .*
- (a)
For every , let b_{p}^{\pi}=\pi^{op}(p)=\sup\big{(}\pi^{-1}(p)\big{)}. Whenever is fixed, we write simply . 2. (b)
. Notice that is a subposet of which is join-closed, hence a subposet of which is meet-closed and isomorphic to . 3. (c)
For every , let and , where . 4. (d)
For every and if is the twin of , let and , where .
6.2. Remark. The definition in (c) and (d) is not uniform since we have in one case and in the other. This strange behavior will be explained in Remark 6, where a uniform explanation will be given.
For every , choose (where the subscript emphasizes that the interval is taken within the lattice ). This defines a family with the following property.
6.3. Lemma.*
Let be a family of elements of such that for every .
Then, whenever ,*
[TABLE]
**Proof : **If and with , then and therefore
[TABLE]
The other cases are easier and are left to the reader.
By Lemma 2, since is a distributive lattice, the order-preserving map , , extends to a join-morphism
[TABLE]
Explicitly, we have and whenever with twin (these are the only non-irreducible elements of by Lemma 2). Note that is not necessarily a section of (see the beginning of the proof of Proposition 6).
Define the family and write
[TABLE]
where denotes the Möbius function of the lattice . Allowing the family to vary (i.e. varies in for each ), define
[TABLE]
This is a -linear combination of join-morphisms, hence an element of . The morphisms have remarkable properties, in particular when is composed with the surjection . We are going to explore those properties in a series of propositions. We first start with a lemma.
6.4. Lemma.*
Let and be two families as above and fix some .
Suppose that for all . Then the following are equivalent :*
- (a)
* for all .* 2. (b)
If , then where is the twin of .
**Proof : **Suppose that (b) holds. If , then by assumption, that is, . If , then . If now and , then for some , by the definition of a pole lattice. If , then
[TABLE]
If , then the assumption (b) implies that
[TABLE]
proving (a).
Assume conversely that (a) holds. If , then condition (b) is empty and there is nothing to prove. So suppose that . Then
[TABLE]
proving (b).
6.5. Definition.* Associated with the subset , there is a subfunctor of defined as follows. For any finite set , the evaluation is the -submodule of generated by all functions such that .*
This subfunctor is important in the theory of correspondence functors (see Section 5 of [BT3] for details).
6.6. Proposition.*
Let and let be the morphism defined in (6.3).*
- (a)
For any finite set and any function such that , we have . 2. (b)
* induces a morphism vanishing on , hence induces in turn a morphism*
[TABLE]
**Proof : **Since (b) immediately follows from (a), it suffices to prove (a). We have
[TABLE]
For a fixed , we have to prove that the inner sum over is zero. If this inner sum is empty, then the sum is zero and we are done. Otherwise, we can choose such that . Let be such that . Then we can modify the family into , by changing only the image into , with the extra condition that in case . The point of such a modification is that it is precisely the only kind which does not change the equality , by Lemma 6. We set and and we let
[TABLE]
which we extend to a join morphism . We obtain
[TABLE]
where the inner sum runs over all , with the extra condition that in case .
If , then the sum runs over all and this is zero by the definition of the Möbius function (because ). If , then the extra condition is equivalent to (because ), so runs over the interval with the condition that its join with the fixed element is equal to the top element . By a well-known property of the Möbius function (Corollary 3.9.3 in [St]), the corresponding sum
[TABLE]
is zero, provided the fixed element is not equal to the bottom element . But this is indeed the case since , the latter inequality coming from the fact that . It follows that the coefficient of every is zero, hence .
Now we want to compute the composite . For any subset of , we define
[TABLE]
It is easy to see that is order-preserving (because, if , , and , then , while the other cases are easier). Therefore, by Lemma 2, extends to a join-morphism because the pole lattice is distributive. Note that for any . This is clear if . Otherwise for some by Lemma 2 and
[TABLE]
forcing equality and .
6.7. Proposition.*
Let and let be the morphism defined in (6.3).*
- (a)
, where is defined by (6.6). 2. (b)
If , then .
**Proof : **For simplicity, we write instead of and instead of .
(a) If and in , then because . Thus if , we get , hence . Similarly, if and , then . It follows that
[TABLE]
We see that for a suitable subset and therefore
[TABLE]
For a fixed subset , in order to realize the condition , we have the following possibilities :
If , then can run freely in . 2.
If , then must be equal to . 3.
If , then must be equal to . 4.
If , then can run freely in .
It follows that the coefficient is equal to
[TABLE]
using the fact that
[TABLE]
This shows that
[TABLE]
as required.
(b) Suppose that is a proper subset of and let be maximal such that . We want to prove that . We let and we prove that .
If , then and , while if , then .
Assume now that and . Then and .
Assume now that and . Then either or , the twin of .
If and , then . If and , then . But is reducible since , while is irreducible. Therefore , hence .
If , then and is either or . But neither nor is equal to .
We have proved that in all cases, as was to be shown.
6.8. Remark.*
*In the special case when and , we find that is a linear combination of the maps .
It turns out that is actually an avatar of the element which is defined in (3.8), where .
We know that the element plays an important role throughout the theory of correspondence functors
(see Section 9 of [BT3] and Section 4 of the present paper).
The advantage of is that it has a uniform definition, contrary to (as observed in Remark 6).
To make this explicit, let , viewed as a subposet of and , viewed also as a subposet of (so that it is actually which is the subposet of irreducible elements of ). Since is a distributive lattice, it is isomorphic to the lattice of all subsets of closed under taking smaller elements. The passage to complements induces an isomorphism , where is the lattice of all subsets of closed under taking greater elements. On restriction to , this induces an order-preserving isomorphism , which turns out to map to (in the totally ordered part) and to its twin (in the twin part).
Now is a linear combination of maps and we precompose it with , where exchanges all the twins and fixes all the other elements. We obtain a linear combination of maps and, after an explicit computation, it turns out that
[TABLE]
the sign being actually . (This computation appears explicitly in the proof of Theorem 8, using a bijection which is actually the inverse of .) The definition of in (6.6) was not uniform and, accordingly, has a rather strange behavior. However, by means of the isomorphism , the translation of all this in terms of becomes uniform.
Unfortunately, we need to work with rather than . The reason is that is a linear combination of maps , whereas, after composing with , we obtain order-preserving maps which are extendible to endomorphisms (because is a distributive lattice, see Lemma 2). The key fact is that endomorphisms are better because they can be composed, in particular it makes sense to consider idempotent endomorphisms. **
We can now prove a main result concerning the composite and obtain consequences for the correspondence functor associated with the pole lattice .
6.9. Proposition.*
Let and let be the morphism defined in (6.3).
Let be the canonical surjection, where is defined by (6).*
- (a)
* is an idempotent endomorphism of .* 2. (b)
The composite of and is the identity morphism of . 3. (c)
* is injective and embeds as a direct summand of .* 4. (d)
* is an idempotent endomorphism of whose image is isomorphic to .*
**Proof : **(a) This follows from (d), which is proved below, because the functor is fully faithful by Theorem 3. Alternatively, it is not difficult to compute directly
[TABLE]
because if by Proposition 6, hence by Proposition 6. Then the equality implies that is an idempotent.
(b) By Proposition 6, for any finite set and any function ,
[TABLE]
But if by Proposition 6, hence . In other words, , so that
[TABLE]
Composing with the canonical map and writing , we obtain
[TABLE]
as was to be shown.
(c) This follows immediately from (b).
(d) This follows immediately from (b) and the obvious equality .
One of our aims is to show that the idempotents are orthogonal. In order to understand the product of two idempotents and we need to have more information about . This is the purpose of our next three propositions, but we first need a lemma.
6.10. Lemma.*
Let be a pole lattice, let , and let be an interval in .
For every , define*
[TABLE]
Let and assume that is not reduced to the singleton . Then for each , we have .
**Proof : **The result is obvious if , so we assume that is nonempty. Since all elements of have the same image under , so has their join and therefore has a supremum
[TABLE]
Now we have and, by assumption, is a nontrivial interval, so that
[TABLE]
This is the starting point of an induction argument. We fix and we assume by induction that for every such that . Then we obtain
[TABLE]
using the induction assumption. This completes the proof.
6.11. Proposition.*
Let and , where and are pole lattices,
and let be the morphism defined in (6.3).
Suppose that . Then the restriction of to the subset is injective.
In particular, .*
**Proof : **Let . By the definition of , we have
[TABLE]
Now fix some morphism and, for every and every , define
[TABLE]
Here, we write , as before. Then, since a join-morphism from is entirely determined on , we have
[TABLE]
In particular, if appears in the expression of , then for every . It follows now that the coefficient of is, up to sign, equal to
[TABLE]
Suppose that is not injective. Then we want to prove that the coefficient of is zero. This is the case if for some , because we get an empty sum, which is zero. So we assume that for every . The noninjectivity of implies that there exist two adjacent elements in such that . There are three cases.
Case 1. and . Then and . Choosing , we obtain
[TABLE]
hence . Since , it follows that the whole interval is mapped to under , that is, . But then
[TABLE]
by the definition of the Möbius function (because ). Therefore the coefficient of is zero.
Case 2. and . Then and . Choosing , we obtain
[TABLE]
hence . Since , it follows that the whole interval is mapped to under , that is, . But then
[TABLE]
and the coefficient of is zero.
Case 3. and . Let be the twin of , so that . Since , we have and
[TABLE]
Letting , we see that contains both the minimal element of the interval and another element , because . Thus the assumption of Lemma 6 is satisfied and it follows that
[TABLE]
Again the coefficient of is zero and we are done.
This completes the proof of the injectivity of . Since is injective (by Lemma 2), its image has cardinality and therefore .
6.12. Proposition.*
Let and , where and are pole lattices.
Suppose that .*
- (a)
There exists a unique isomorphism of lattices such that
[TABLE] 2. (b)
Moreover, , for all (where , as before).
**Proof : **We assume that , and in particular . Let and write first
[TABLE]
Let be a map appearing with a nonzero coefficient in the expression of and let be such that . Since , we can also assume that is such that . Proposition 6 implies that the function must satisfy . Since is a join-morphism and generates , the map must be surjective. By Proposition 6, implies that . Therefore . It follows that is a bijective join-morphism, hence an isomorphism of lattices.
Proposition 6 also asserts that the map is injective. Since , it is a bijection and therefore there is a unique isomorphism such that
[TABLE]
For any , we have for some . If , then , hence
[TABLE]
Therefore , so that because is an automorphism of , hence height-preserving. Similarly, if , then , hence
[TABLE]
so that and . This shows that , hence . Therefore, whenever is such that , then . It follows that the functions which appear with a nonzero coefficient in the expression of are and maps in the kernel of .
In the situation of Proposition 6, we can replace by and by . The effect of this is that we are reduced to the case where and , that is,
[TABLE]
For simplicity, we use this reduction in our final result, which is the key for understanding the composition of the morphisms we have introduced.
6.13. Proposition.*
Let , where is a pole lattice.
Suppose that for all (where , as before).*
- (a)
If , then . 2. (b)
We have
[TABLE]
**Proof : **(a) By Proposition 6, we have , because the automorphism is the identity by assumption. Moreover, as in the proof of the previous propositions, the coefficient of in the expression of is equal to
[TABLE]
where we write simply
[TABLE]
Since the coefficient of in the expression of is nonzero (it is 1), every sum is nonzero, and in particular .
As in the proof of Lemma 6, has a supremum . We also define
[TABLE]
so that , because any satisfies , hence either or . There are two cases.
Case A. . Then . The nonzero sum forces , hence .
Case B. . Then again must have a supremum , so that and . In that case, we obtain
[TABLE]
because the sum over is zero since . Therefore
[TABLE]
and this forces , hence .
By assumption, we know that for all , hence . If , then , hence . This forces to be in case and therefore we obtain :
Case A. if .
If , then , hence . This forces to be in case with moreover . Since , we get :
Case B. if .
Let c_{p}=\theta^{op}(p)=\sup\big{(}\theta^{-1}(p)\big{)} (that is, using Notation 6). Since we assume that , we have for all . We now prove that by descending induction in the lattice , starting from the obvious equality . For simplicity, we write and for the order relation in . Suppose now that and for every . We have to discuss three cases.
Assume that with . Then , hence (Case B). But , so . Therefore .
Assume that . Then
[TABLE]
Therefore (Case A). Since , we have , hence .
Assume now that where with twin . Then and . Thus we obtain
[TABLE]
as was to be shown. We have now covered all cases, completing the proof that for all .
Now we obtain for all , hence . Passing to the opposite, it follows that , as was to be shown.
(b) We now know by (a) that whenever . Moreover, in that case, Proposition 6 implies that is the sum of and morphisms in the kernel of , using our assumption that , for all . Applying , it follows that .
Keeping our fixed finite lattice , we now allow the pole lattice to vary.
6.14. Notation.**
- (a)
* is a set of representatives of isomorphism classes of pole lattices such that is nonempty (hence in particular , so that is finite).* 2. (b)
For any , the group acts on (by composition) and we let be a fixed chosen set of representatives of the orbits. 3. (c)
If and , we define
[TABLE]
In particular, is the idempotent of Proposition 6.
6.15. Remark.**
- (a)
Let be the image of under the action of , for some . Then . This is proved by going back to Notation 6 and using the associated elements , respectively
[TABLE]
from which the associated morphism , respectively , is constructed, as in (6.3). It is then elementary to check that . 2. (b)
Changing the choice of orbit representatives has the following effect. Let and , where . It follows from (a) that we obtain . 3. (c)
In particular, is independent of the choice of in its -orbit.
Now we come to the crucial relations among the endomorphisms .
6.16. Theorem.*
Let be a finite lattice and let .*
- (a)
Let and . Let also and . Then
[TABLE] 2. (b)
When varies in and varies in , the idempotents are pairwise orthogonal.
**Proof : **Let , so that , by Remark 6. If , there is no isomorphism between and , by our choice of . Therefore we obtain , by Proposition 6. It follows that
[TABLE]
So we now assume that . Suppose that . In particular, , that is, . By Proposition 6, there is a unique isomorphism such that . Let and , hence . Then we obtain
[TABLE]
Moreover, since with , we have . Therefore
[TABLE]
The uniqueness of the automorphism in Proposition 6 also implies that we have for all (where , as before).
We are now in the assumptions of Proposition 6 for , , and . We deduce that , so that and belong to the same orbit under the action of . But and belong to a chosen system of representatives . Thus we must have and .
It now follows that we can write , where , that is, . Therefore
[TABLE]
as was to be shown.
(b) This follows from (a).
7. Subalgebras corresponding to pole lattices
In this section, we show how the results of Section 6 imply some precise information about the structure of the endomorphism algebra of a finite lattice , where is a commutative ring. This generalizes the results obtained in [BT3] for the special case of totally ordered lattices.
We continue to use Notation 6, so is a pole lattice running through the set and denotes a set of representatives of -orbits in . Let denote the matrix algebra of size , with rows and columns indexed by the set , and coefficients in the group algebra . If and , we let denote the elementary matrix having coefficient in position and zero elsewhere.
7.1. Theorem.*
Let be a finite lattice.
For each , let be a set of representatives of the orbits for the action of the group on
and let .*
- (a)
The map
[TABLE]
is an algebra homomorphism (without unit elements). 2. (b)
* is injective.* 3. (c)
The image of is equal to the subalgebra (without unit element) of having a -basis consisting of all join-morphisms whose image is a pole lattice.
**Proof : **(a) Let . If , then and are not in the same block, so their product is 0, while the product is also zero. If , then the relations of Theorem 6 are the standard relations within a matrix algebra of size with coefficients in the group algebra .
(b) Since the elements form a -basis of , it suffices to prove that their images are -linearly independent. Suppose that
[TABLE]
where . Multiplying on the left by and on the right by , we are left with the terms for which and . Therefore we obtain
[TABLE]
Now, by Definition 6.3, is a linear combination of distinct maps , one of them being , appearing with coefficient , where we use Notation 6 and set . We claim that the functions are pairwise distinct when varies. This implies that each coefficient must be zero, proving the required linear independence.
To prove the claim, we write for simplicity and we allow to vary. The group is isomorphic to , where each acts by exchanging two twin elements of and fixing the others (where , as before). So we consider some and we let be its twin. Then we get
[TABLE]
We see that the functions are pairwise distinct when varies, proving the claim.
(c) It is clear that is a subalgebra. Moreover, every map is a join-morphism, where is a family as in Lemma 6. Therefore is a join-morphism whose image is a pole lattice, by construction. It follows that belongs to and hence .
Now has a -basis consisting of all morphisms described as follows. First we fix and we let
[TABLE]
where , , , and where denotes a set of representatives of -orbits in . Then
[TABLE]
is a -basis of the submodule generated by all endomorphisms whose image is isomorphic to . Allowing to vary in , we deduce that
[TABLE]
is a -basis of .
On the other hand, it follows from (a) and (b) that
[TABLE]
is a -basis of . By Lemma 2, there is a bijection between and . We can also choose representatives to obtain a bijection between and , because acts freely on each side. Therefore and have the same cardinality. In other words and are free -modules of the same rank. We want to prove that the inclusion is an equality (which is obvious if is a field since the dimensions are equal).
We now allow the base ring to vary and we write a superscript to emphasize the dependence on . Thus we have an injective algebra homomorphism
[TABLE]
and we let , so that we have a short exact sequence
[TABLE]
where is the inclusion map and the canonical surjection. In the case of the ring of integers , we see that is a finite abelian group, because and are free -modules of the same rank. Tensoring with is right exact, so we obtain an exact sequence
[TABLE]
Using the canonical bases and of and respectively, we see that
[TABLE]
Moreover the map corresponds, under these isomorphisms, to the inclusion map . In particular, considering the prime field for any prime number , we obtain an exact sequence
[TABLE]
Since is a field and the dimensions are equal, the inclusion map is an equality. Therefore and this holds for every prime . Thus we must have , because is finite, so that the inclusion map is an equality. Tensoring with , it follows that the inclusion map is an equality as well, as required.
7.2. Remark. Let and be the two bases of described in the proof. The change of basis from to is not obvious. By construction, every map belongs to , but beware of the fact that if and belong to , then may be a composite for some pole lattice smaller than . This is because, in the construction of , the family does not necessarily consist of distinct elements (where as before).
The image under of the identity element of is an idempotent of and is an identity element of . We now prove more.
7.3. Theorem.*
For every finite lattice , let be the subalgebra of appearing in Theorem 7,
and let be the identity element of .*
- (a)
. 2. (b)
For any finite lattice and any morphism , we have . In other words, the family of idempotents , for , is a natural transformation of the identity functor . 3. (c)
* is a central idempotent of .* 4. (d)
The subalgebra is a direct product factor of , that is, there exists a subalgebra such that (where is identified with and with , as usual).
**Proof : **(a) The identity element of is equal to
[TABLE]
Taking its image under yields the required formula.
(b) We have seen in the proof of Theorem 7 that every element of the canonical basis of has the form , where , and . Passing to the opposite, we obtain
[TABLE]
with and . It follows that the opposite of the canonical basis element of is the canonical basis element of . Therefore, the opposite of the identity element of must belong to . Moreover, it must be the identity element of , because taking opposites behaves well with respect to composition. Therefore .
Now if is a join-morphism (i.e. is in ), then the image of a pole sublattice of is a pole sublattice of . It follows that composition with maps to a linear combination of join-morphisms with a pole lattice as an image, hence invariant under the idempotent element . In other words, we have
[TABLE]
Applying this equation to , , and the morphism , we obtain . Passing to opposites and using the above equality , we get
[TABLE]
The two displayed equations yield . This holds as well if is replaced by a -linear combination of join-morphisms (i.e. is in ), as was to be shown.
(c) This is a special case of (b).
(d) This follows immediately from (c).
8. Correspondence functors for pole lattices
In this section, we first consider the special case of the endomorphism algebra of a pole lattice . We determine completely the structure of this algebra. Applying the fully faithful functor , we deduce a direct sum decomposition of the correspondence functor , providing an explicit description of for any pole lattice . In particular, when is a field of characteristic different from 2, is semi-simple. At the end the section, we return to an arbitrary finite lattice and describe direct summands of corresponding to pole lattices inside . The results are generalizations of those obtained in [BT3] in the special case of totally ordered lattices.
8.1. Theorem.* Let be a pole lattice.*
- (a)
The homomorphism of -algebras of Theorem 7
[TABLE]
is an isomorphism. 2. (b)
In particular, if is a field and if either is totally ordered or if is a field of characteristic different from 2, then is semi-simple.
**Proof : **(a) Since any join-morphism has an image which is a pole lattice, the subalgebra of appearing in Theorem 7 is the whole of . Therefore, the homomorphism is surjective. By Theorem 7, is injective, hence an isomorphism.
(b) If is totally ordered, then so is each and is the trivial group. Thus we get matrix algebras . If is not totally ordered, then each is a 2-group (and at least one of them is nontrivial, namely ). The group algebra is semi-simple when the characteristic of is different from 2 (Maschke’s theorem). Therefore any matrix algebra is semi-simple and it follows that the direct sum is semi-simple as well.
Now we consider the central idempotents of corresponding to the above decomposition into matrix algebras.
8.2. Notation.*
For any pole lattice , set*
[TABLE]
In particular, when , then and is a singleton which can be chosen to be . We then define
[TABLE]
using Proposition 6, with and defined by (6.6).
8.3. Proposition.*
The elements , for , are orthogonal central idempotents of , and their sum is equal to the identity.
In particular, the central idempotent satisfies*
[TABLE]
**Proof : **For every , the inverse image of under the algebra isomorphism of Theorem 8 is the matrix of the component indexed by . Summing over all , it follows that the inverse image of under is the identity element of . The first statement follows.
In the case , we know that is a singleton, so that the corresponding matrix algebra has size 1. The inverse image of under is the identity element of the component . Clearly .
We want to use the fully-faithful functor (see Theorem 3) to deduce information on the correspondence functor . We already know that is projective, because the pole lattice is distributive (see Theorem 3). We apply the functor to the map defined in (6.3), where . By Proposition 6 we obtain a morphism
[TABLE]
which vanishes on , where is defined by (6). By Proposition 6, this induces an injective morphism
[TABLE]
which embeds as a direct summand of , corresponding to the idempotent . In particular, for , we have and we obtain an idempotent endomorphism of with kernel .
8.4. Theorem.*
Let be a pole lattice and define , where is defined by (6).*
- (a)
* is a projective correspondence functor.* 2. (b)
There are isomorphisms of correspondence functors
[TABLE]
**Proof : **(a) Since the pole lattice is distributive, is projective (Theorem 3). Therefore so is its direct summand .
(b) Since the functor is fully faithful (Theorem 3), it induces an isomorphism of -algebras
[TABLE]
Now the idempotents of , for and , are orthogonal and their sum is equal to the identity, by Theorem 8. It follows that the endomorphisms of are orthogonal idempotents, and their sum is the identity. Hence we obtain a decomposition of correspondence functors
[TABLE]
By surjectivity of , the image of is equal to the image of . Therefore F_{f_{\pi,\operatorname{id}\nolimits_{P},\pi}}\big{(}F_{Q}\big{)}=F_{j^{\pi}}\big{(}F_{P}\big{)}. By Proposition 6, the image F_{j^{\pi}}\big{(}F_{P}\big{)} is isomorphic to and it follows that
[TABLE]
Taking and , we obtain the first isomorphism . Summing over all for a fixed , we obtain the second isomorphism. Finally, summing over all and all , we obtain the third isomorphism.
8.5. Corollary.* Let and be pole lattices. Then*
[TABLE]
**Proof : **Since , the case follows from Proposition 8. Now if , it is easy to choose a large enough pole lattice such that and . Using the central idempotents and of Proposition 8, we obtain
[TABLE]
Since and are central idempotents of , and since they are orthogonal if , it follows that if , hence .
8.6. Remark.* *Corollary 8 actually holds for the fundamental functors associated with any two finite posets. This more general result will be proved in another paper. **
Now we prove that the functor is actually isomorphic to a fundamental functor and we compute the ranks of all its evaluations.
8.7. Theorem.* Let be a pole lattice and let be the order relation on the set of irreducible elements of . Let .*
- (a)
* is isomorphic to the fundamental functor .* 2. (b)
For any finite set , the -module is free of rank
[TABLE]
**Proof : **(a) We use the element defined in (3.8), where . By a well-known result of lattice theory (Theorem 6.2 in [Ro]), the distributive lattice is isomorphic to , where is the order relation on viewed as a subset of , so that is the poset of irreducible elements in . Note that the isomorphism can also be checked easily and directly because is a pole lattice. Recall that
[TABLE]
where denotes the same map as and is defined by
[TABLE]
because in the lattice is equal to in the lattice .
Now we define by
[TABLE]
and we notice that is actually a bijection between and , because in a pole lattice we have and (by an easy application of Lemma 2). Then and when we apply the idempotent we claim that we obtain
[TABLE]
The definition of (see Notation 8) yields
[TABLE]
The definition of in (6.6) splits into two cases. If , then
[TABLE]
If now , then
[TABLE]
For each , we define by
[TABLE]
Thus we have decompositions
[TABLE]
and runs through all subsets of when runs through all subsets of . If , then
[TABLE]
while if , then
[TABLE]
Therefore the two cases merge into one and we obtain
[TABLE]
so that .
As far as the signs are concerned, we have
[TABLE]
hence
[TABLE]
It now follows that
[TABLE]
This proves Claim 8.7 above.
Now is generated by , because it is generated by (where is the inclusion), hence also by any injection from the set to , by composing with a bijection between and . Since is an idempotent endomorphism of the correspondence functor , we see that is generated by . In other words, in view of Claim 8.7 above, is generated by . Now Theorem 3 asserts that the subfunctor of generated by is isomorphic to , where is the poset of irreducible elements in . But via the map described above. Therefore, using the isomorphism of Theorem 8, we obtain
[TABLE]
(b) By Definition 6, the canonical -basis of is the set of all maps such that . Therefore is free of rank . The number of maps in has been computed in Lemma 8.1 of [BT2] and the formula is actually well-known. The formula asserts that this rank is equal to
[TABLE]
as required.
8.8. Remark. In view of the projectivity of (Theorem 8), the isomorphism provides another proof of the projectivity of the fundamental functor whenever is a pole poset. This was first proved in Theorem 5.
8.9. Remark. The formula for the rank in Theorem 8 is a special case of the general formula proved in [BT4] for the rank of the evaluation of any fundamental functor. We have given here a direct proof in the case of a pole lattice because it is easy, while the proof in the general case is much more elaborate.
When is a field, we get even more.
8.10. Corollary.*
Let be a field. Let be a pole lattice and let be the poset of irreducible elements in .*
- (a)
For any simple -module , the functor is simple, isomorphic to . 2. (b)
The correspondence functor is projective and injective. 3. (c)
If either is trivial (which occurs if is totally ordered) or if the characteristic of is different from 2, the correspondence functor is simple, projective, and injective. 4. (d)
Under the assumption of (c), decomposes as a direct sum of simple (and projective) functors
[TABLE]
where runs over simple -modules up to isomorphism. 5. (e)
Under the assumption of (c), decomposes as a direct sum of simple (and projective) functors
[TABLE]
where denotes the poset of irreducible elements in and where runs over simple -modules up to isomorphism.
**Proof : **(a) Using Lemma 2, it is easy to check that , so is a -module. Recall that the fundamental correspondence functor has a right -module structure (in the sense that each evaluation is a right -module, in a compatible way with all morphisms, which act on the left). Moreover, by Proposition 3, we know that the simple functor is obtained from the fundamental functor by simply tensoring with :
[TABLE]
as required.
(b) is projective by Theorem 8. Since is a field, it is also injective by Theorem 10.6 in [BT2].
(c) When either is trivial or the characteristic of is different from 2, is semi-simple and every simple -module is projective. Moreover, every simple -module has dimension 1 because is an elementary abelian 2-group (the only roots of unity needed are ). Therefore we have an isomorphism of -modules
[TABLE]
where runs over all simple -modules up to isomorphism. It follows that
[TABLE]
Since is projective and injective by (b), so is each of its simple direct summands .
(d) The decomposition of was proved above.
(e) The decomposition of follows immediately from (d) and Theorem 8.
In the special case of totally ordered lattices, the results of Corollary 8 were already obtained in Corollary 11.11 of [BT3]. Also, notice that (c) provides another proof of the implication (b) (a) in Theorem 4.
Our last purpose in this section is to find, for any finite lattice , all the direct summands of isomorphic to a functor corresponding to a pole lattice . Recall that denotes the central idempotent of which is an identity element for the subalgebra (see Theorem 7).
8.11. Theorem.*
Let be a finite lattice.
For every finite set , let be the -submodule of generated by all the maps such that is a pole subposet of .*
- (a)
* and this is a subfunctor of .* 2. (b)
* is a projective direct summand of , isomorphic to*
[TABLE] 3. (c)
If is a pole lattice, the image of a join-morphism is contained in . In particular, any subfunctor of isomorphic to the functor is contained in . 4. (d)
\operatorname{Hom}\nolimits_{{\mathcal{F}}_{k}}\big{(}F_{T}^{\rm pole},F_{\operatorname{id}\nolimits-e_{T}}(F_{T})\big{)}=\{0\}* and \operatorname{Hom}\nolimits_{{\mathcal{F}}_{k}}\big{(}F_{\operatorname{id}\nolimits-e_{T}}(F_{T}),F_{T}^{\rm pole}\big{)}=\{0\}.* 5. (e)
The splitting of the surjection is natural in .
**Proof : **(a) Let be a map such that is a pole subposet of . Let be the join-closure of , so that , where and where is the inclusion map. It is easy to see that is a join-closed pole lattice. Thus and so because is the identity morphism by Theorem 8. Now by Theorem 7, hence . Therefore
[TABLE]
proving that .
Conversely, if , then we can write for some map . Since is, by construction, a linear combination of maps whose image is a pole poset, so is , proving that .
This shows that and the latter is a subfunctor of .
(b) As in the proof of Theorem 8, we apply the fully faithful functor defined by . There is a direct sum decomposition of functors
[TABLE]
The idempotent is the sum of the orthogonal idempotents of , for and . It follows that the endomorphisms of are orthogonal idempotents with sum . Hence we obtain a direct sum decomposition of correspondence functors
[TABLE]
By Proposition 6, the image of is isomorphic to and is projective by Theorem 8, proving the result.
(c) Let be a morphism of correspondence functors where is a pole lattice. Since the functor is full, is the image of a morphism in , which is in turn a linear combination of join-morphisms . Any such has an image which is a pole subposet of . Therefore, for any function , the image of is a pole subposet of . It follows that the image of the map is contained in . Therefore, the image of the map is contained in and so the image of is contained in .
The special case follows from the fact that is a subfunctor of , by Theorem 8.
(d) The first statement is a consequence of (b) and (c), while the second one follows from a dual argument. Details are left to the reader.
(e) By Theorem 7, the family of idempotents , for , is a natural transformation of the identity functor . Therefore the family of idempotents , for , is a natural transformation of the identity functor .
8.12. Corollary.* Let be a correspondence functor and let be the sum of all the images of morphisms , where varies among pole lattices.*
- (a)
The subfunctor is the image of an idempotent natural transformation , so that is a direct summand of . 2. (b)
\operatorname{Hom}\nolimits_{{\mathcal{F}}_{k}}\big{(}F^{\rm pole},(\operatorname{id}\nolimits-\varepsilon_{F})(F)\big{)}=\{0\}. 3. (c)
The idempotent is natural in . In other words, when varies among correspondence functors, the family of idempotents is a natural transformation of the identity functor .
**Proof : **We only sketch the main arguments of the proof. By Yoneda’s lemma applied to a set of generators of , there is some index set and a surjective morphism from a direct sum of representable functors
[TABLE]
and each is projective. Moreover, is isomorphic to for some distributive lattice (by Lemma 3). It follows that there is an exact sequence
[TABLE]
where is again a distributive lattice for each in some index set . Let us write for the direct sum of the idempotent endomorphisms of Theorem 8, independently of the lattices involved. Thus we have a commutative diagram
[TABLE]
where is induced by . It is easy to check that is an idempotent morphism and that , because and this is the image under of correspondence functors associated to pole lattices, by Theorem 8. Moreover, any pole lattice is distributive, so is projective. Therefore any morphism lifts to a morphism whose image must be contained in . Thus is contained in .
The proofs of (b) and (c) are similar.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BT 1] S. Bouc, J. Thévenaz. The algebra of essential relations on a finite set, J. reine angew. Math. 712 (2016), 225–250.
- 2[BT 2] S. Bouc, J. Thévenaz. Correspondence functors and finiteness conditions, J. Algebra 495 (2018), 150–198.
- 3[BT 3] S. Bouc, J. Thévenaz. Correspondence functors and lattices, J. Algebra 518 (2019), 453–518.
- 4[BT 4] S. Bouc, J. Thévenaz. The algebra of Boolean matrices, correspondence functors, and simplicity, preprint, 2018.
- 5[Ro] S. Roman. Lattices and ordered sets , Springer, New York, 2008.
- 6[St] R. P. Stanley. Enumerative Combinatorics, Vol. I , Second edition, Cambridge studies in advanced mathematics 49, Cambridge University Press, 2012.
