The representation theory of finite sets and correspondences
Abstract
We investigate correspondence functors, namely 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 . In such a case, has finite length. Also, if is noetherian, then any subfunctor of a finitely generated functor is finitely generated. When is a field, we give a description of all the simple functors and we determine the dimension of their evaluations at any finite set.A main tool is the construction of a functor associated to any finite lattice . We prove for instance that this functor is projective if and only if the lattice is distributive. Moreover, it has quotients which play a crucial role in the analysis of simple functors. The special case of total orders yields some more specific results. Several other properties are also discussed, such as projectivity, duality, and symmetry.In an appendix, all the lattices associated to a given poset are described.
Keywords
Cite
@article{arxiv.1510.03034,
title = {The representation theory of finite sets and correspondences},
author = {Serge Bouc and Jacques Thévenaz},
journal= {arXiv preprint arXiv:1510.03034},
year = {2019}
}
Comments
This long paper is replaced by the following series of articles: - Correspondence functors and finiteness conditions, J. of Algebra 495 (2018), 150-198 - Correspondence functors and lattices, J. of Algebra 518 (2019), 453-518 - The algebra of Boolean matrices, correspondence functors, and simplicity, submitted preprint, 2018 - Tensor product of correspondence functors, submitted preprint, 2018