The algebra of Boolean matrices, correspondence functors, and simplicity

Serge Bouc, Jacques Thévenaz
2020
Journal paper

Abstract

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence functor. The method uses the theory of such functors developed in previous papers, as well as some new ingredients in the theory of finite lattices.

Official source

https://infoscience.epfl.ch/record/261193?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts

Related publications

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. We determine exactly which simple correspondence functors are projective. We also determine which simple modules are projective for the algebra of all relations on a finite set. Moreover, we analyze the occurrence of such simple projective functors inside the correspondence functor F associated with a finite lattice and we deduce a direct sum decomposition of F.

2019

Correspondence functors and lattices

Serge Bouc, Jacques Thévenaz

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. A main tool for this study is the construction of a correspondence 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 and complete results.

2019

The representation theory of finite sets and correspondences

Serge Bouc, Jacques Thévenaz

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.

2015