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: Matrix Product From Monoidal Grothendieck


view this post on Zulip Jade Master (Oct 31 2020 at 18:23):

Does anyone recognize this matrix product? Let R be a ring equipped with a nice poset structure. You can construct a functor
F:SetopMonCatF : \mathsf{Set}^{op} \to \mathsf{MonCat}
by:

:F×FF. \oplus : \int F \times \int F \to \int F.

I am wondering about what this monoidal product actually is. I think I have it worked out in terms of Kronecker product \otimes. If (X,m:X×XR)(X, m: X \times X \to R) and (Y,n:Y×YR)(Y,n: Y \times Y \to R) are objects in F\int F, then
(X,m)(Y,n)=(X×Y,(m1(Y))(n1(X)))(X,m) \oplus (Y,n) = (X \times Y, (m \otimes 1(Y) ) * (n \otimes 1(X)))
where 1(X)1(X) and 1(Y)1(Y) are the square matrices on XX and YY containing only 1's and * is the ordinary matrix product.

view this post on Zulip Jade Master (Oct 31 2020 at 18:24):

One thing to note is that m and n are on the same set then
(X,m:X×XR)(X,n,X×XR)=(X×X,(m1(X))(n1(X)))=mn1(X)1(X)(X,m: X \times X \to R) \oplus (X, n, X\times X \to R) = (X \times X, (m \otimes 1(X)) * (n \otimes 1(X))) = m*n \otimes 1(X) * 1(X)
because the Kronecker product satisfies the interchange law with respect to matrix multiplication. So in this sense it starts to look like more like generalizing ordinary matrix multiplication.

view this post on Zulip Jade Master (Oct 31 2020 at 18:29):

By the way, you can find a description of the fibrewise monoidal Grothendieck construction in @Mike Shulman 's

view this post on Zulip Morgan Rogers (he/him) (Nov 02 2020 at 09:50):

In the first bullet point, are you saying that the monoidal product on your poset of matrices is given by matrix multiplication? Because if so, you might have a problem with how multiplication interacts with the order :grimacing:

view this post on Zulip Morgan Rogers (he/him) (Nov 02 2020 at 09:53):

For example, I would consider R\mathbb{R} to be a pretty standard example of a "ring equipped with a nice poset structure", but taking XX to be a one-element set so that MatR(X)\mathsf{Mat}_{\mathbb{R}}(X) is just R\mathbb{R} with multiplication, I have 21-2 \leq -1 and 131 \leq 3 but 2≰3-2 \not\leq -3, so that I can't tensor the morphisms in the poset.

view this post on Zulip Jade Master (Nov 02 2020 at 15:53):

[Mod] Morgan Rogers said:

For example, I would consider R\mathbb{R} to be a pretty standard example of a "ring equipped with a nice poset structure", but taking XX to be a one-element set so that MatR(X)\mathsf{Mat}_{\mathbb{R}}(X) is just R\mathbb{R} with multiplication, I have 21-2 \leq -1 and 131 \leq 3 but 2≰3-2 \not\leq -3, so that I can't tensor the morphisms in the poset.

Right I see the issue. I think that I actually need R to be a rig...something which only has an additive commutative monoid rather than an additive abelian group. Probably I will end up needing R to be a quantale in the end...

view this post on Zulip Morgan Rogers (he/him) (Nov 02 2020 at 16:13):

That seems more sensible; removing negatives seems to be necessary and sufficient to fix the problem I was pointing to :+1: