Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

Presenting Functors

(draft)

The main theorem is that a functor on a variety (in the sense of universal algebra) has a presentation by operations and equations if and only if the functor preserves sifted colimits.

The theory of sifted colimits is well explained in Adamek-Rosicky-Vitale. We only cover some highlights.

In all of the following A\mathcal A is a variety in the sense of univeral algebra, that is, a category of algebras specified (finitary) operations equations. (We will assume all operations to be finitary in the following, even if we drop the qualifier.)

Sifted Colimits

Filtered categories are precisely categories D\mathcal D such that colimits over D\mathcal D commute with finite limits in Set. There is also a characterization of filtered categories independent of sets – a category D\mathcal D is filtered if and only if the diagonal functor DDI\mathcal D \to \mathcal D^\mathcal I is final for each finite category I\mathcal I.

Sifted categories are the categories D\mathcal D such that colimits over D\mathcal D commute with finite products. These categories are characterized by the property that the diagonal functor DD×D\mathcal D \to \mathcal D \times \mathcal D is final.

Facts:

An object AA of a category C\mathcal C is finitely presentable if its hom-functor hom(A,):CSethom(A, −) : \mathcal C → Set preserves filtered colimits. A category C\mathcal C is locally finitely presentable (lfp) if it is cocomplete and has a set X\mathcal X of finitely presentable objects such that each object of C\mathcal C is a filtered colimit of objects from X\mathcal X.

An object AA is strongly finitely presentable if its hom-functor hom(A,):CSethom(A,−) : \mathcal C → Set preserves sifted colimits. A category C\mathcal C is strongly locally finitely presentable (slfp) if it is cocomplete and has a set X\mathcal X of strongly finitely presentable objects such that each object of C\mathcal C is a sifted colimit of objects from X\mathcal X.

Let A\mathcal A be a variety in the sense of universal algebra.

Facts:

Let Alg(L)Alg(L) be the categories of algebras for the functor L:AAL:\mathcal A\to\mathcal A.

Theorem: If A\mathcal A is a variety and L:AAL:\mathcal A\to \mathcal A preserves sifted colimits then Alg(L)Alg(L) is a variety.

Proposition:

Presenting Functors on Varieties

Introduction

Given an adjunction LR:CXL\dashv R:\mathcal C\to \mathcal X such that the right-adjoint RR is monadic (or of descent type) all objects ACA\in\mathcal C have a presentation “by generators and relations”

LRLRALRAA.LRLRA\rightrightarrows LRA \to A.

In words, AA is the quotient of the free algebra LRALRA over generators RARA by equations in LRLRALRLRA.

We apply this “monadic presentation” now to the situation where AA is an endofunctor. In fact, we apply it twice and combine two representations:

Step 1: We represent a sifted colimit preserving endofunctor on a variety A\mathcal A such that the “generators” and “relations” are given by sifted colimit preserving endofunctors on Set.

Step 2: We represent a sifted colimit on Set as the quotient of polynomial functor.

Preliminaries

Let S(C)S(\mathcal C) be the category of sifted colimit preserving functors CC\mathcal C\to\mathcal C.

Fact: The category S(C)S(\mathcal C) is slfp if C\mathcal C is.

A functor H:ABH : \mathcal A \to \mathcal B between slfp categories is called algebraically exact provided that it preserves limits and sifted colimits.

Fact: If HH is algebraically exact it has a left adjoint.

Step 1

Let U:ASetU:\mathcal A\to Set be a variety and FUF\dashv U. Define

Ψ:S(A)S(Set)\Psi:S(\mathcal A)\to S(Set)

via ΨL=ULF\Psi L = ULF and

Φ:S(Set)S(A)\Phi: S(Set) \to S(\mathcal A)

via ΦT=FTU\Phi T = FTU.

Fact: Ψ\Psi is algebraically exact and ΦΨ\Phi\dashv\Psi.

After the first step, we obtain a quotient FULFULFULFU\to L. Here, FULFUFULFU results from applying the free construction Φ=FU\Phi=F-U to the Set-functor ULFULF. What we need next is a presentation by operations and equations of ULFULF.

Step 2

Every sifted colimit preserving on SetSet (=filtered colimit preserving functor=finitary functor) can be presented as the quotient of a polynomial functor.

Indeed, if T:SetSetT:Set\to Set is finitary then we have a natural transformation

nNTn×XnqXTX(σ,v)  T(v)(σ)\begin{align} \coprod_{n\in\mathbb N} Tn\times X^n & \stackrel {q_X} \longrightarrow TX \\ (\sigma,v) & \ \mapsto \ T(v)(\sigma) \end{align}

with each qXq_X being surjective (even for infinite sets XX).

Note that vv can be seen both as a tuple (x1,xn)(x_1,\ldots x_n) and as a function nXn\to X. Hence we can evaluate the term σ(x1,xn)\sigma(x_1,\ldots x_n) by applying Tv:TnTXTv:Tn\to TX to σ\sigma.

This gives us a representation of TT as a functor by operations and equations where the set of nn-ary operations is TnTn and the set of equations in nn variables is the kernel of qnq_n.

The Presentation

Theorem: A functor on a variety has a presentation by operations and equations iff the functor preserves sifted colimits.

To prove “if”, one shows that every sifted colimit preserving functor LL on a variety is a quotient

FGUAqALAFGUA\stackrel {q_A} \longrightarrow LA

where GX=nNULFn×XnGX=\coprod_{n\in\mathbb N}ULFn\times X^n.

In particular the (σ,v:nUA)(\sigma,v:n\to UA) are modal formulas

Δ(a1,an)\Delta(a_1,\ldots a_n)

where Δ=σ\Delta=\sigma and ai=v(i)a_i=v(i).

The set Σ\Sigma of operations and the set EE of equations constitute the presentation ΣL,EL\langle\Sigma_L,E_L\rangle of LL.

Theorem: Let AAlg(ΣA,EA)\mathcal A \cong Alg(Σ_\mathcal A, E_\mathcal A) be a variety and ΣL,EL\langle \Sigma_L, E_L\rangle a presentation of L:AAL : \mathcal A \to \mathcal A. Then Alg(ΣA+ΣL,EA+EL)Alg(Σ_\mathcal A + \Sigma_L, E_\mathcal A+E_L) is isomorphic to Alg(L), where equations in EAE_\mathcal A and ELE_L are understood as equations over ΣA+ΣL\Sigma_\mathcal A + \Sigma_L.

Example: The variety of modal algebras is presented by the operations and equations of Boolean algebra plus a unary operation \Box and two equations specifying that \Box preserves finite meets.

References

Kurz-Rosicky: Strongly Complete Logics for Coalgebras, 2012.

Footnotes
  1. Note that (σ,v:nUA)(\sigma,v:n\to UA) is a modal formula Δ(a1,an)\Delta(a_1,\ldots a_n) where Δ=σ\Delta=\sigma and ai=v(i)a_i=v(i).