Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: learning: questions

Topic: Profunctor and Categorified Linear Algebra


view this post on Zulip Peva Blanchard (Mar 10 2024 at 10:03):

I am still "meditating" on this article on n-category café by @Simon Willerton

The article motivates the definition of the nucleus of a profunctor by building up from basic linear algebra.

Linear algebra

We have two (finite) sets AA and BB, and a matrix M:A×BRM : A \times B \rightarrow \mathbb{R} (a set function). By curryfication, and definition of free vector spaces, we get two functions (linear maps)

M:RARBM:RBRAM^* : \mathbb{R}^A \rightarrow \mathbb{R}^B \\ M_* : \mathbb{R}^B \rightarrow \mathbb{R}^A

and they are adjoint

Mp,q=p,Mq=a,bM(a,b)p(a)q(b)\langle M^* p , q \rangle = \langle p, M_* q \rangle = \sum_{a,b} M(a,b)p(a)q(b)

Then, we can consider the eigenvectors with eigenvalue 11 of Δ=MM\Delta = M^*M_*

Fix(Δ)={qΔq=q}Fix(\Delta) = \{ q | \Delta q = q \}

Profunctor

The analogy consists in having AA and BB be VV-enriched category, and M:Aop×BVM : A^{op} \times B \rightarrow V a profunctor. By a very similar construction, we get functors

M:VAop(VB)opM:(VB)opVAopM^* : V^{A^{op}} \rightarrow (V^B)^{op} \\ M_* : (V^B)^{op} \rightarrow V^{A^{op}}

and they are adjoint

(VB)op(Mp,q)VAop(p,Mq)a,b[p(a)q(b),M(a,b)](V^B)^{op}(M^* p, q ) \simeq V^{A^{op}}(p, M_* q) \simeq \int_{a,b} [p(a) \otimes q(b), M(a,b)]

The nucleus of the profunctor can be described as the subcategory spanned by the "fixed points" of the associated monad Δ=MM\Delta = M^*M_*

Fix(Δ)={qΔqq}Fix(\Delta) = \{ q | \Delta q \simeq q \}

Question

The direct analog of the nucleus of the profunctor in the linear algebra world would be the space of eigenvectors of Δ\Delta with eigenvalue 11.

However, I feel left hungry for more, because we may think as the space EλE_{\lambda} of eigenvectors with eigenvalue λ\lambda as being a fixed point of the action of Δ\Delta on subspaces.

But I have trouble making the analogy exact: can we have all the eigenspaces of Δ\Delta being the nucleus of a well-chosen profunctor?

view this post on Zulip Peva Blanchard (Mar 10 2024 at 10:27):

ps: the analogy is quite fascinating, because in graph theory, when MM is the incidence matrix, then Δ\Delta is the graph laplacian

view this post on Zulip John Baez (Mar 10 2024 at 16:55):

It sounds like you're wanting to the take the analogy between profunctors and linear maps and turn it into a functor, following the principle "every analogy is yearning to become a functor". So we could hope for a functor that sends (perhaps enriched) profunctors to linear maps, or a functor that sends linear maps to (perhaps enriched) profunctors.

view this post on Zulip John Baez (Mar 10 2024 at 17:02):

I mainly know a functor that sends spans of finite groupoids to linear maps between finite-dimensional vector spaces - it's called degroupoidification. But @Todd Trimble has recently described a functor from spans of groupoids to profunctors between groupoids. (I'm not claiming it's new, just that he recently wrote about it.) So while none of this proves it, there might be an interesting way to convert profunctors between finite groupoids (or more general categories) into linear maps between vector spaces.

view this post on Zulip Peva Blanchard (Mar 10 2024 at 18:36):

Great, thank you for the references!

view this post on Zulip Peva Blanchard (Mar 10 2024 at 23:17):

Ok, this is impressive, I was not expecting such a fascinating relation between spans of groupoids, combinatorics and quantum mechanics. This forum is really amazing!

view this post on Zulip Peva Blanchard (Mar 17 2024 at 11:11):

I've continued on the "functor chasing" path. I realized that I was not really after a functor from profunctor to linear maps, but more after a functor between "ways to build an adjunction pair". E.g., on the linear algebra side, from any matrix I get two adjoint linear maps; and the profunctor side, from the VV hom profunctor, I get the Isbell adjunction.

So I tried to put together the pattern into, let's call it, an "Isbell situation". That would be a category CC with

This data should have satisfy just enough laws so that I can replay the construction of the Isbell adjunction. I.e., the following proposition should hold.

For any "matrix data" R:YXVR : Y^{\star} \otimes X \rightarrow V, we obtain two arrows

R:[Y,V][X,V]R:[X,V][Y,V] R^{\star} : [Y^{\star}, V] \rightarrow [X, V]^{\star} \\ R_{\star} : [X, V]^{\star} \rightarrow [Y^{\star}, V]

that are adjoints, i.e., for every ϕ:A[Y,V]\phi : A \rightarrow [Y^{\star}, V] and ψ:A[X,V]\psi: A \rightarrow [X,V]^{\star},

Rϕ,ψ=ϕ,Rψ \langle R^{\star}\phi, \psi \rangle = \langle \phi, R_{\star} \psi \rangle

as arrows AVA \rightarrow V.

view this post on Zulip Peva Blanchard (Mar 17 2024 at 11:23):

For instance, the Isbell adjunction occurs with CC being the category of VV-enriched categories

The linear algebra case occurs with CC as follows

view this post on Zulip Peva Blanchard (Mar 17 2024 at 11:24):

Then I can consider, I guess, the category of "Isbell situations" and see how different instances relate to each other.

view this post on Zulip Peva Blanchard (Mar 17 2024 at 11:26):

Quite funnily, in the linear algebra case, the two operators μ\mu and σ\sigma are really the same, which is quite special.

view this post on Zulip Peva Blanchard (Mar 17 2024 at 11:55):

For instance, let's consider the Isbell situation associated with BoolBool-Cat (boolean enriched categories, i.e., preorders). If I take XX and YY two discrete preorders, then [X,Bool][X, Bool]^{\star} is the set of subsets of XX ordered by containment, and [Y,Bool]=[Y,Bool][Y^{\star}, Bool] = [Y, Bool] is the set of subsets of YY ordered by inclusion.
Then, μ\mu and σ\sigma are clearly not the same:

μ(ϕx)xX=(AX)xAϕxσ(ψy)yY=(BY)yBψy \mu (\phi_x)_{x \in X} = (A \subseteq X) \mapsto \bigcap_{x \in A} \phi_x \\ \sigma(\psi_y)_{y \in Y} = (B \subseteq Y) \mapsto \bigcup_{y \in B} \psi_y

view this post on Zulip Peva Blanchard (Mar 25 2024 at 16:43):

I understood that what I am looking for is not really a functor from profunctors to linear maps, but a "functor" from "ways of doing things in the profunctor world" to "ways of doing things in the linear algebra world" (or vice-versa).

I tried to factor out the common pattern (I actually deleted my previous response because of a big mistake of mine). After much wandering, I stumbled upon the notion of equipment, which I think is the setting I was looking for. There is the equipment of VV-profunctors, and the equipment (I think) of finite dimensional linear relations. And my question becomes: Is there a "functor" between these two equipments (or variants of them)? Can the nucleus of a proarrow be defined in an equipment, and how this "functor" acts on nuclei?

I should put double quotes everywhere in the previous paragraph, because equipment, double categories and related stuff make a lot of things to absorb for me, so I'm not 100% confident in my reading. But I find the quest very exciting.

ps: there is actually a short thread of comments under the mentioned article, by @John Baez and @Mike Shulman, discussing the analogy. It was 15 years ago! so I guess some things have been sorted out by now.