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: Bimodules vs Spans: Puzzle 3


view this post on Zulip Eric Forgy (Jan 14 2021 at 11:39):

(Note: This stream was split from Bimodules vs Spans: Puzzle 1 and Bimodules vs Spans: Puzzle 2. Some comments here refer to those streams and contains links to the respective posts.)

Puzzle 3: What’s a bimodule of a pair of monoid objects in Setop\mathsf{Set^{op}}?

[Edit: This solution is completely wrong. See Attempt #2 below.]

A bimodule would be a set XX with compatible left and right actions.

Let
{}
L=End(X)×X\sout{L = \mathsf{End}(X)\times X}
{}
and
{}
R=Endop(X)×X\sout{R = \mathsf{End^{op}}(X)\times X}
{}
so that the actions can be written
{}
αL:LXandαR:RX.\sout{\alpha_L: L\to X\quad\text{and}\quad\alpha_R: R\to X.}
{}

Together, the actions form a cospan
{}
LXR\sout{L\rightarrow X\leftarrow R}
{}
and pulling this back enforces their compatibility resulting in a span
{}
LL×XRR.\sout{L\leftarrow L\times_X R\rightarrow R.}
{}
We can go one step further by forming the spans
{}
End(X)LX\sout{\mathsf{End}(X)\leftarrow L\rightarrow X}
{}
XREndop(X)\sout{X\leftarrow R\rightarrow \mathsf{End^{op}}(X)}
{}
so that the composition of these two spans is
{}
End(X)L×XREndop(X).\sout{\mathsf{End}(X)\leftarrow L\times_X R\rightarrow\mathsf{End^{op}}(X).}

view this post on Zulip Morgan Rogers (he/him) (Jan 14 2021 at 11:49):

Ahh Eric, check what monoidal product is in play in Setop\mathbf{Set}^{\mathrm{op}}!! A "monoid object in [monoidal category C\mathcal{C} with monoidal product \otimes and monoidal unit II]" needs maps MMMM \otimes M \to M and IMI \to M

view this post on Zulip Morgan Rogers (he/him) (Jan 14 2021 at 11:50):

John Baez said:

A set is a monoid object in the monoidal category (Setop,+)(\mathsf{Set}^{\mathrm{op}}, +).

We can define bimodules for monoid objects in any monoidal category.

A span of sets is a bimodule in (Setop,+)(\mathsf{Set}^{\mathrm{op}},+).

John mentioned already what monoidal product you should be using here in the message quoted above :wink:

view this post on Zulip Eric Forgy (Jan 14 2021 at 11:53):

Hi Morgan :wave:

I'm afraid I don't follow :thinking:

I was going by what the original post said:

Let’s work in the category Setop\mathsf{Set^{op}}, where a morphism f:STf:S→T is a function from TT to SS. This is a monoidal category with ×× as its tensor product. So, we can talk about monoid objects in Setop\mathsf{Set^{op}}.

view this post on Zulip Oscar Cunningham (Jan 14 2021 at 11:58):

Hmmm, does ×\times there mean the product in Set\mathbf{Set} or in Setop\mathbf{Set}^\mathrm{op}?

view this post on Zulip Eric Forgy (Jan 14 2021 at 12:15):

I certainly made some mistakes (and hope to learn from them), but I don't think I got that wrong :sweat_smile:

This comment makes me think we really want ×\times for Setop.\mathsf{Set^{op}}.

view this post on Zulip Eric Forgy (Jan 14 2021 at 12:17):

So I was using (Setop,×,)(\mathsf{Set^{op}}, \times, *) (where ={}* = \{\bullet\}, i.e. the terminal set).

The dual problem with (Set,,)(\mathsf{Set},\sqcup,\emptyset) is also interesting :blush:

view this post on Zulip John Baez (Jan 14 2021 at 15:52):

Eric Forgy said:

Puzzle 1: What’s a monoid object in Setop\mathsf{Set^{op}}?

The "object" is a set XX, but for this to be a monoid object, we need a multiplication

μ:X×XX.\mu: X\times X\to X.

and a unit

η:X\eta: *\to X

satisfying the conditions. I don't think the answer is complete without specifying those :thinking:


Attempt #1: Before looking at Puzzle #2

I think a multiplication X×XXX\times X\to X in Setop\mathsf{Set^{op}} is a function XX×XX\to X\times X in Set\mathsf{Set} and the only function that would make sense to me is
{}
x(x,x)X×X.x\mapsto (x,x)\in X\times X.
{}
A unit X*\to X in Setop\mathsf{Set^{op}} is a function XX\to * in Set\mathsf{Set} and that is unique since * is terminal.

A quick doodle confirms these satisfy associativity and unit laws.

Right! And the really cool part is that this is the only possible choice of maps μ:XX×X\mu: X \to X \times X and η:X1\eta: X \to 1 obeying (co)associativity and the (co)unit laws. (We usually put the word "co" in here since the maps are going backwards.) So while in Set\mathsf{Set} you need to specify μ\mu and η\eta to say how we are treating our set XX as a monoid, in Setop\mathsf{Set}^{\mathrm{op}} you don't: there's only one choice!

view this post on Zulip John Baez (Jan 14 2021 at 15:57):

Morgan Rogers (he/him) said:

John Baez said:

A set is a monoid object in the monoidal category (Setop,+)(\mathsf{Set}^{\mathrm{op}}, +).

We can define bimodules for monoid objects in any monoidal category.

A span of sets is a bimodule in (Setop,+)(\mathsf{Set}^{\mathrm{op}},+).

John mentioned already what monoidal product you should be using here in the message quoted above :wink:

But my remark was probably confusing, because the coproduct + in Setop\mathsf{Set}^{\mathrm{op}} is exactly what we usually call the product ×\times in Set\mathsf{Set}. Anyway, this is the monoidal product I want: the coproduct in Setop\mathsf{Set}^{\mathrm{op}}, which we should probably write as ×\times because it's the familiar set

X×Y={(x,y):xX,yY}X \times Y = \{(x,y) : x \in X, y \in Y\}

which is the product in Set\mathsf{Set}.

view this post on Zulip Morgan Rogers (he/him) (Jan 14 2021 at 16:00):

It was my mistake, then, not Eric's! Thanks for clarifying.

view this post on Zulip John Baez (Jan 14 2021 at 16:06):

Sure!

Anyway, Eric was completely correct in his first attempt to solve Puzzle 1.

Here's a more general way to think about this puzzle. In any monoidal category where the monoidal structure is given by coproduct, every object xx becomes a monoid in a unique way.

The unit η:0x\eta: 0 \to x is unique because 00 is initial. The left and right unit laws force μ:x+xx\mu: x + x \to x to be the codiagonal or 'fold' map :x+xx\nabla: x + x \to x.

view this post on Zulip John Baez (Jan 14 2021 at 16:11):

Δ\Delta is associative so xx becomes a monoid this way. In fact it's commutative.

view this post on Zulip John Baez (Jan 14 2021 at 16:12):

Even better, the maps η\eta are Δ\Delta are natural, every morphism in our category becomes a morphism of commutative monoids.

view this post on Zulip Eric Forgy (Jan 14 2021 at 22:22):

Btw, I've the split the original stream into 3 streams, one for each puzzle, so this is now the stream for Puzzle 3 :blush:

view this post on Zulip Eric Forgy (Jan 14 2021 at 23:18):

My answer above for Puzzle 3 is completely wrong, so starting over :face_palm:

Given a monoid object AA, i.e. a set, a left AA-module is a set XX together with a function
{}
αL:A×XX.\sout{\alpha_L: A\times X\to X.}
{}
Similarly, a right BB-module is a set XX together with a function
{}
αR:X×BX.\sout{\alpha_R:X\times B\to X.}


Attempt #2

Given monoid objects AA and BB, an (A,B)(A,B)-bimodule is a set XX together with compatible functions
{}
αL:A×XX.\sout{\alpha_L: A\times X\to X.}
{}
and
{}
αR:X×BX.\sout{\alpha_R:X\times B\to X.}
{}
These functions form a cospan
{}
A×XXX×B\sout{A\times X\rightarrow X\leftarrow X\times B}
{}
that can be pulled back (enforcing compatibility) forming a span
{}
A×X(A×X)×X(X×B)X×B.\sout{A\times X\leftarrow (A\times X)\times_X (X\times B)\rightarrow X\times B.}
{}
Hence, an (A,B)(A,B)-bimodule XX in Setop\mathsf{Set^{op}} is a span
{}
A×X(A×X)×X(X×B)X×B.\sout{A\times X\leftarrow (A\times X)\times_X (X\times B)\rightarrow X\times B.}


view this post on Zulip Eric Forgy (Jan 14 2021 at 23:47):

Note this means the answer to Puzzle #2 is also a span of sets.

Let B=B = *, then
{}
×BB\sout{*\times B\cong B}
{}
and
{}
S×XXS\sout{S\times_X X\cong S}
{}
so that a (A,)(A,*)-bimodule is a span
{}
A×XidA×XαLX,\sout{A\times X\overset{\mathsf{id}}{\leftarrow} A\times X\overset{\alpha_L}\rightarrow X,}
{}
but this is a left AA-module so a left AA-module is an (A,)(A,*)-bimodule.

Similarly, a right BB-module is a (,B)(*,B)-bimodule.

Furthermore, an (A,B)(A,B)-bimodule is the composition of a left AA-module, i.e. (A,)(A,*)-bimodule, with a right BB-module, i.e. (,B)(*,B)-bimodule.

view this post on Zulip Eric Forgy (Jan 14 2021 at 23:51):

image.png