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.
Hello. I've been going in circles trying to understand this and can use some help :pray:
Although scary to admit (because the general topic is over my head), I'm trying to study bicategories and Not in their full generality, but a special case.
In particular, when I look at a span and a span , their composite is a span .
Similarly, when I look at a bimodule and a bimodule , their composite is a bimodule
The similarities between the two notations cannot be a coincidence. I'm trying to understand this.
The notation makes me want to think of bimodules as spans (or cospans), where is a pullback (or push out) somehow.
More specifically, I'm thinking of endomorphisms in , a.k.a. directed graphs, and endomorphisms in
An endomorphism span composes with itself times giving the span
An endomorphism bimodule composes with itself times giving the bimodule
Given a set , there two ways to obtain algebras:
In this comment, John nicely (even I understood :sweat_smile:) explained that with , we have a functor
so we are getting cospans instead of spans. In a prior comment, he also showed how to construct a functor
(Note: Wow. Writing all this down actually gets me some way toward understanding what I'm actually trying to do :sweat_smile: )
Now, if my CT kung fu were a little better, I should be able to make the last connection and relate
My gut tells me there should be some forgetful functor
If so, there should be functors (free to the right and forgetful to the left)
Unfortunately, this is a little beyond what I'm capable of figuring out on my own at the moment and I need this step to make progress on an applied / engineering paper I'm writing.
Any ideas? :pray:
PS: I came across this (unpublished) note from Urs:
It looks helpful, but it ends abrutly just when it was getting interesting :sweat_smile:
Just for clarity, what exactly is the category ?
Hi Fawzi :wave:
is a bicategory with
This does not answer your question but (small) profunctors are bimodules in spans of sets
Cole Comfort said:
This does not answer your question but (small) profunctors are bimodules in spans of sets
Yeah. I'm trying to read up on profunctors, but it is pushing the limits of my poor brain :sweat_smile:
I also found this on the nLab:
Let and let . Then the hom functor is a bimodule. Bimodules can be thought of as a kind of generalized hom, giving a set of morphisms (or object of ) between an object of and an object of .
Cole Comfort said:
This does not answer your question but (small) profunctors are bimodules in spans of sets
If I could understand this statement, it would certainly help. Care to elaborate a little? :pray:
A found this fact to be pretty cool...
A category internal to some category is the same as a monad in .
So anywhere I see "category internal to ", I can think "monad in "
From the nLab:
Here is the slick definition: let be a category with pullbacks. Then the bicategory of internal categories, profunctors and transformations in is defined to be , the category of monads and bimodules in , the bicategory of spans in .
So an internal profunctor between internal categories and is a bimodule from to . An internal presheaf on is a right -module, or equivalently a bimodule , where is the discrete category on the terminal object of (as long as has one, of course).
Regarding profunctors, I'll just point you to this.
The basic idea is that, the same way 2 plays the role of truth values on Set, Set plays the role of truth values in CAT.
Eric Forgy said:
Hello. I've been going in circles trying to understand this and can use some help :pray:
Although scary to admit (because the general topic is over my head), I'm trying to study bicategories and Not in their full generality, but a special case.
In particular, when I look at a span and a span , their composite is a span .
Similarly, when I look at a bimodule and a bimodule , their composite is a bimodule
The similarities between the two notations cannot be a coincidence. I'm trying to understand this.
The notation makes me want to think of bimodules as spans (or cospans)...
I believe you're stuck because bimodules are not a special case of spans. Spans (of sets, for example) are a special case of bimodules.
I explained it here:
When you understand this you'll be happy. I tried to explain it here on Zulip a while back, but you probably weren't desperate enough back then.
At the same time though, bimodules of sets (aka binary relations) are a special case of spans of sets.
Anyway, Eric needs to understand what I wrote. I was quite excited when I wrote it:
I always thought bimodules and spans should be related, but only recently did I learn exactly how, thanks to Paul-André Melliès.
So I was exactly where Eric is now, until Paul-André explained what's going on here.
Hi :wave:
I'm coming back to this stream after putting a lot of elbow grease into:
There, we learned that in :
Yes, that's a nice summary!
So: spans are a special case of the general theory of bimodules.
Then you can have some fun as follows:
Given monoidal categories and , and a monoidal functor , maps monoid objects in to monoid objects in in an obvious way, and bimodules to bimodules in an obvious way, preserving composition up to isomorphism. (Details left as an exercise.)
So, we can use a monoidal functor
to turn monoid objects in , which are just sets, to monoid objects in , which are just algebras, and turn bimodules in , which are just spans of sets, to monoid objects in , which are just bimodules, in a manner preserving composition.
I'm a little confused here, but I think it works better to use finite sets, since I think I know a very nice monoidal functor
which does not extend to infinite sets. This monoidal functor sends any finite set to , where is the field we're using to define , and it sends a function to the pullback linear map . Note this contravariance is what we need, to deal with the "op".
I believe this is a very nice way to turn spans of finite sets into bimodules, in such a way that composition is preserved up to isomorphism. I think you want to use this in your work.
If you need to use infinite sets I think things get a bit tricky.
Cool! That is so awesome! :smiley:
In terms of size, I'd like to be able to work with denumerable sets like Is that possible?
I think your (lax) functor should be fine with sets indexed by
An element can be written as an infinite sum:
I think that is nicely enough behaved so that we can write
right? I hope so :sweat_smile: :pray:
If not, I might need some kind of "finite support" condition or something.
I said finite and meant finite; countably infinite doesn't work the same.
Ok. Then I think I might need to get into some of the tricky stuff :thinking:
The point is this: for finite sets we have
but if both and are infinite this is false.
Thus, one can show the contravariant functor sending a finite set to and a function to is monoidal, giving a monoidal functor
but this procedure does not give a monoidal functor
Various attempted workarounds seem to have various problems, which I could explain.
You've explained to me a couple times how there are two ways to get a vector space from a set, i.e. and . Does the other way, i.e. suffer the same restriction to finite sets? In that case, we want
There is a covariant functor sending any set to , the free vector space on and any function to a certain obvious linear map . This construction obeys
for any pair of sets or , so we get a monoidal functor
but note: the "op" is not there now! So this sends monoids in - that is, ordinary monoids - to algebras.
We can also think of the above functor as a monoidal functor
This sends sets (monoid objects in ) to coalgebras (monoid objects in ).
I see :thinking: Thank you :pray:
There are also other tricks one can play, but I'm getting tired and none of them instantly stand out as a panacea.
Sure. Understandable. Thank you. This is already a huge help :pray:
I will say this: a lot of times when people naively think they need algebras, it turns out coalgebras would work. Finite-dimensional algebras are practically the same as finite-dimensional coalgebras, since the dual of the former is the latter and vice versa, and dualizing twice gets you back where you started. That fails in the infinite-dimensional case. So the need for coalgebras becomes more visible in the infinite-dimensional case, which is exactly the problem we're running up against now.
I'm thinking that starting with sets (not restricted to finite sets), we can obtain vectors / coalgebras following the second approach with and then I can look at the dual space of that. This is analogous to the vectors / coalgebras being the "space" and then I look at "differential forms" on those spaces. I know that is vague and imprecise, but I'm just trying to convey a vague idea.
Yeah, that was one of the "other tricks one can play". But you have to play a few moves of that game before you see if you win or get check-mated.
Roughly, I'm thinking along the lines of sets -> chains -> cochains.
Those are good thoughts to have. Ultimately it should all make loads of sense.
John Baez said:
Yeah, that was one of the "other tricks one can play". But you have to play a few moves of that game before you see if you win or get check-mated.
Yeah. I can imagine. The dual space will need some niceness properties (I've seen the word "Fredholm" that seems relevant).
No, "Fredholm" is not relevant, that's more about analysis, like Hilbert spaces.
This is just algebra here.
Well, I do want Hilbert spaces out of this at the end of the day.
Ugh, well, that's a whole other level of math.
Yeah. One step at a time :sweat_smile:
The good news is, nothing in math fails that deserves to work. And nothing in math works that deserves to fail.
That is why I liked working with the 1-category . It is a dagger category, which makes the road ahead to Hilbert spaces more clear.
I think most of the "Bimodules vs Span" discussion can be converted to a discussion about (or maybe or something).
A bimodule is a morphism in (guessing :sweat_smile: )
Why guess stuff? I thought we just showed that a bimodule in is the same as as a morphism in the bicategory .
(Note if you want a mere category of spans you need to take isomorphism classes of spans, which will correspond to isomorphism classes of bimodules. I prefer to go bicategorical and avoid the "isomorphism class" stuff.)
True, but in this case I kind of think of it like and are the "same" :thinking:
Btw, you might like this talk I gave, advocating the use of spans in quantum mechanics:
Of course. I love all your stuff :blush:
Eric Forgy said:
True, but in this case I kind of think of it like and are the "same" :thinking:
So I think I am actually ok with thinking of isomorphism classes of bimodules, but I might change my mind when I get a little more enlightened :blush:
This is awesome too:
It's okay with working with isomorphism classes of bimodules until you want to talk about something like an element of a bimodule, or a homomorphism between bimodules.
There's no such thing as an element of an isomorphism classes of bimodules. There's no such thing as a homomorphism between isomorphism classes of bimodules. For these you need actual bimodules.
An isomorphism class is like a slippery greased pig twisting around so fast you can't grab any individual part of it. All you can say is "yup, it's a pig".
I'll try to do it the right way :muscle: (and forget isomorphism classes)
Through out all of this, I still have the functor in mind, so I have to tie this together somehow :thinking:
So I will start treating as the bicategory that it is.
Eric Forgy said:
This is awesome too:
This is also awesome:
Thanks, I was actually looking for that one when I found the des Treilles talk.
Good morning :coffee:
Unlearning things you thought you knew is tough business :hurt:
Some things I've (un)learned recently:
Thanks to John's puzzles, I now know one important relationship between spans and bimodules.
Some definitions:
is a bicategory where
is a bicategory where
Then,
In other words:
(Note: We never discussed 2-morphisms or bicategories, but I have enough faith in the beauty of the universe to feel fairly confident this has to be the case.)
Some corrections: "the tensor product of modules is a coproduct". It's true that (for example) the tensor product of commutative rings has, for its underlying additive abelian group, the tensor product of the additive groups of the given rings. And similarly for commutative -algebras over a commutative ring : you take the tensor product of their underlying (additive) -modules. But that's saying something else.
On bicategories of spans: the input data needs to be a category with pullbacks. Those are what allow you to compose morphisms = 1-cells. But if you want to do all the things you mention, you will need finite products as well. So you may as well assume is finitely complete.
There's a pretty big iceberg of stuff that lies beyond...
I'm probably only going to respond intermittently (if at all). John has been heroically guiding you through this -- I don't have the time myself.
Todd Trimble said:
I'm probably only going to respond intermittently (if at all). John has been heroically guiding you through this -- I don't have the time myself.
Thanks Todd :pray: Understood. For what its worth, I consider any intermittent comment from you as golden and very much welcome / appreciated :raised_hands:
Todd Trimble said:
On bicategories of spans: the input data needs to be a category with pullbacks. Those are what allow you to compose morphisms = 1-cells. But if you want to do all the things you mention, you will need finite products as well. So you may as well assume is finitely complete.
What I defined above, i.e. is a little more restrictive than the usual because I require to be cartesian ( Note, the first bullet in my definition. ). Is that sufficient?
How do you define the composition of spans?
I think I see. Thanks. If I require to be finitely complete, then it has finite products AND pullbacks.
[Edit: From the nLab, I see that if a category has a terminal object and pullbacks, then it is finitely complete. Since a cartesian monoidal category has a terminal object, then a cartesian monoidal category with pullbacks is finitely complete :+1: ]
I revised the definition to say "cartesian monoidal category with pullbacks (i.e. finitely complete)". Thank you for pointing out my mistake :pray:
Well, I could try to play John here and probe further why pullbacks are important here, and is composition associative, and a whole bunch of other things, but you were in the middle of talking about something else I think.
I can kind of see how some ambiguity around the term "cartesian category" arises. If a category has a terminal object and pullbacks, then it is cartesian monoidal, but more because it has all finite limits. A cartesian monoidal category has a terminal object and finite products, but might not have pullbacks and hence may not be finitely complete.
Todd Trimble said:
Well, I could try to play John here and probe further why pullbacks are important here, and is composition associative, and a whole bunch of other things, but you were in the middle of talking about something else I think.
Yeah, I was hoping to summarize (correctly - so thank you for your corrections :pray: ) what I learned in John's puzzles so I can move on to something else related that I'm thinking about. Hopefully what I said about and is correct now :pray:
Eric Forgy said:
I can kind of see how some ambiguity around the term "cartesian category" arises. If a category has a terminal object and pullbacks, then it is cartesian monoidal, but more because it has all finite limits. A cartesian monoidal category has a terminal object and finite products, but might not have pullbacks and hence may not be finitely complete.
Incidentally, do you know how to show a category is finitely complete if it has pullbacks and a terminal object? (If it's not an immediate yes, then it's not a bad idea to see whether you can form products and equalizers and establish their universal properties, without going to the nLab or anything else.)
It is not immediately obvious to me and that does sound like good exercise to try :+1: I will think about it. Thanks :pray:
[Edit: I tried it here.]
Getting back to this :pray:
Some definitions:
is a bicategory where
is a bicategory where
Then,
This is pretty cool and gives us important relationships between spans and bimodules, but there are additional relationships I need to understand and those will probably turn out to be related to these :point_of_information:
"Bimodules" are a lot lot lot more general than is apparent from this context. Really pursuing this would lead to profunctors. But, all in good time.
Some background info...
Back in November, I decided to try to rewrite my old preprint with Urs:
(as part of a desire to apply for engineering faculty positions, but I'm pretty sure I am too late for that by now :pensive:) in the language of CT in an attempt to simplify the presentation, add some exposition and extend it with some recent new results that I'm excited about.
Back in November, I roughly - very roughly - knew what a bimodule was. I thought of it as a slight generalization of vector spaces with left and right actions by commutative algebras. The bimodules I was working with were clearly related to directed graphs, but I had no idea how to make that connection precise although I knew it was there. I had heard the word "span", but had never knowingly used it in any work I was doing.
I've learned a lot these past couple months thanks to John, Todd and several others. Thank you :pray:
Now, I understand a directed graph (for my purposes) to be an endomorphism in and I understand that and are both important examples of bicategories, so if I want to express my work in the language of CT, it will involve bicategories. That is real progress :muscle:
Initially, I wanted to treat as a 1-category and I was happy with my new favorite functor
where is a category with one object and morphisms labelled by natural numbers with composition = addition, i.e. This is cool because
This seems like it is related to "nerve", but is more suitable to my purposes.
Now, John has convinced me to NOT do that so I am rethinking things keeping as a bicategory, but then that forces me to rethink my favorite functor :thinking:
What I'm thinking about now is closer to i.e. functors
but I still need to think it through. Work in progress.
What I'm trying to think about now is the relationships among and
For example, we have a contravariant functor
given by on objects and on spans gives:
and we have a covariant functor
given by on objects and on spans gives:
I see. This is cool :heart_eyes: is cartesian, but is cocartesian so we have
and
so that
and
[Edit: Was missing the when I first posted this.]
so the second diagram is better thought of as
Covariant
This gives some solid justification for what I knew should somehow be true :+1:
It is actually quite beautiful. Thank you for nudging (dragging?) me through the puzzles. It was worth it :pray:
Great! Yes, this was the goal of my remarks.
I won't apologize for the :heart: emoji. Thank you. Really :blush:
However, I think there's a mistake in here, connected to contravariance. is a contravariant functor and I think you neglected the effect of that contravariance on what you were doing. But is covariant.
I'd have to think about this again to see exactly what's going on...
For what it's worth. I didn't neglect contravariance, but it is completely possible that I made a mistake keeping track of it.
Yep. I believe you are right. I was missing the in I editted it now :+1:
By the way, is equivalent to , where means the category of finite-dimensional vector spaces.
So if you restrict to finite sets and finite-dimensional vector spaces, certain things get nicer.
John Baez said:
So if you restrict to finite sets and finite-dimensional vector spaces, certain things get nicer.
Ok, but I don't want to do that. The simplest example I want to work with is :thinking:
It's amazing that you can count up to infinity.
I spent a few minutes looking at the bicategory . It is kind of cool.
It is defined as follows:
Composition of cospans is as usual via pushout
2-morphisms
are defined only if
Just like my favorite functor
is a classifier of endomorphisms in a category ,
seems to play a similar role for bicategories.
is cocartesian monoidal so we have
and my favorite functor becomes
This definitely feels like I'm on track :+1:
Now, I think I can pose a question I raised above more correctly:
Is it possible that
?
Eric Forgy said:
Now, I think I can pose a question I raised above more correctly:
Is it possible that
?
Between shifus John and Todd, I think I might have learned enough CT kung fu that I might actually be able to take at stab at this :muscle:
Consider the following diagram
The action of a functor
is shown on the left and on the right sides of the commuting box. The horizontal arrows connecting the left and right sides are components of a natural transformation.
The action of a functor
is again shown on the left and on the right sides of the commuting box. The horizontal arrows connecting the left and right sides are components of a natural transformation.
However, we can insert another functor resulting in the following diagram
This looks like a span of functors, i.e. one functor in the middle with functors on either side and natural transformations connecting them, so I think it might actually be possible that
I know this doesn't count as a proof, but I think it might be a reasonable sketch of the beginning of a proof (with possible modifications) :blush:
Note: In the diagram, I introduced a new shorthand notation
so that
and
This is exactly what I needed to make CT contact with discrete differential geometry :+1:
This also helps justify defining a set
which, I think (still need to verify, but its looking good) gets mapped to bimodules
I like it :blush: