2015arXiv (Cornell University)Open access

The representation theory of finite sets and correspondences

Serge Bouc, Jacques Thévenaz

Open full text 6 citations

Abstract

We investigate correspondence functors, namely 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 functors.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$. In such a case, $F$ has finite length. Also, if $k$ is noetherian, then any subfunctor of a finitely generated functor is finitely generated. When $k$ 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 $T$. We prove for instance that this functor is projective if and only if the lattice $T$ 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.

Open-access reader

About this research paper

What this paper is about

We investigate correspondence functors, namely 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 functors.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$. In such a case, $F$ has finite length. Also, if $k$ is noetherian, then any subfunctor of a finitely generated functor is finitely generated. When $k$ 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 $T$. We prove for instance that this functor is projective if and only if the lattice $T$ 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.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We investigate correspondence functors, namely 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 functors.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$. In such a case, $F$ has finite length. Also, if $k$ is noetherian, then any subfunctor of a finitely generated functor is finitely generated. When $k$ 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 $T$. We prove for instance that this functor is projective if and only if the lattice $T$ 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.

Key concepts: Functor, Mathematics, Pure mathematics, Natural transformation, Noetherian, Exact functor, Functor category, Adjoint functors

Related papers

Back to paper searchBrowse research topicsOriginal source
The representation theory of finite sets and correspondences — Research Paper | ScholarLens