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.
I was learning a little about measures. The definition of a measure kind of looks a bit like a functor (?), in the sense that the measure of a disjoint union of two sets is the sum of the measure of the two sets. Is a measure "just" a functor between some appropriate categories?
For easy reference here is the definition of a measure I'm working with:
measure
(image from the book "Measure Theory and Probability Theory")
Yes, they are maps of quantales, i.e. cocomplete ordered monoids
The 'functoriality' is in the order-preserving property, and then you ask them to also preserve the quantale operation (set union on the algebra, + on the positive reals)
The two are closely related here
In fact from these you can derive that a measure is also cocontinuous, i.e. it sends the union of a 'growing' sequence of sets to the supremum (= join operation on the positive reals) of their union
Mmh actually... Maybe this is not enough to get a map of quantales bc that preserves arbitrary unions, not just directed ones
So maybe 'map of ordered monoid' with a bunch of extra niceness is the best you can do
What do Markov kernels correspond to in this picture?
Profunctors, I guess..?
Matteo Capucci (he/him) said:
In fact from these you can derive that a measure is also cocontinuous, i.e. it sends the union of a 'growing' sequence of sets to the supremum (= join operation on the positive reals) of their union.
Mmh actually... Maybe this is not enough to get a map of quantales bc that preserves arbitrary unions, not just directed ones
It preserves countable directed colimits.
The theory of measurable cardinals introduces a fun variation on the standard concept of measure. You consider a set and a map from the power set to , and you require that this is monotone and sends disjoint unions of collections of size to sums:
Here addition in is defined by , so it's just "or" for booleans.
And here is some cardinal, that you get to choose.
Matteo Capucci (he/him) said:
Yes, they are maps of quantales, i.e. cocomplete ordered monoids
I've never heard of quantales before! I have heard of monoids, but what does it mean for a monoid to be "ordered"?
Wikipedia says: "An ordered semigroup is a semigroup (S,•) together with a partial order ≤ that is compatible with the semigroup operation. An ordered monoid and an ordered group are, respectively, a monoid or a group that are endowed with a partial order that makes them ordered semigroups."
I'm wondering how this corresponds to a category - what are the objects and morphisms?
It means the monoid has an order and the multiplication is order-preserving (in each variable and jointly). Quantales are additionally cocomplete and the multiplication preserves sups (in each variable separately).
I don't think it is helpful to think of monoids as one-object categories in this case, but if you insist, then these are one-object categories enriched over cocomplete join semilatticse.
Zhen Lin Low said:
I don't think it is helpful to think of monoids as one-object categories in this case, but if you insist, then these are one-object categories enriched over cocomplete join semilatticse.
What might be a more helpful categorical perspective (if there is one)?
At any rate, thanks for the clarification!
Matteo Capucci (he/him) said:
The 'functoriality' is in the order-preserving property, and then you ask them to also preserve the quantale operation (set union on the algebra, + on the positive reals)
I'm not quite following this. What order is being preserved here? I am guessing we order the sets of the algebra by inclusion, but how is this being preserved?
Maybe the idea is if , then for any measure .
Let me see if I can figure out what the monoids mentioned here are.
The sets of the algebra could form a monoid as follows:
-We have a category with a single object, and
-... where each morphism is a set of the algebra
-...where composition of morphisms corresponds to taking the union of sets
The real numbers form a monoid, where the morphisms are the real numbers and composition corresponds to addition.
At the risk of getting a scolding from certain people, let me put forward the suggestion that there is no such thing as a "helpful categorical perspective" without qualification. Whether a perspective is helpful or not depends entirely on who needs it. "A quantale is a one-object category enriched over CSL" is not going to be helpful if you don't know enriched category theory, and maybe only marginally helpful if you are not familiar with the special features of categories enriched over CSL. "A quantale is a monoid in the monoidal category CSL" is not going to be helpful if you don't know about monoids in monoidal categories, and certainly not helpful if you have not worked with non-cartesian monoidal categories. etc.
I think we can make the algebra into an ordered monoid like this:
-The morphisms are the sets of the algebra, with composition corresponding to taking unions
-The ordering corresponds to inclusion, so
If then I believe . So it seems that composition preserves the ordering.
Similarly for the real numbers:
-The morphisms are the real numbers, with composition corresponding to addition
-The ordering is the usual ordering on the real numbers
If for , then for any . So composition again preserves the ordering.
What about _nullary_ unions?
I thought the empty set corresponded to the identity morphism in the monoid corresponding to the algebra. So, .
For a quantale the multiplication preserves sups. That includes the empty sup. So you can't have a quantale that way.
I'm not really following you, unfortunately. Although, I can try to figure out what you just said, it will probably take me a while.
What does it mean for multiplication to "preserve sups"?
You can say "preserves colimits" if you prefer category theory language.
That helps some, but let me try to make an example to understand better. Say and are morphisms in an ordered monoid, and we have their supremum . Now we want to perform some kind of multiplication and ask if this supremum is "preserved" in some sense.
Is the idea to require ?
No. I mean (among many other equations).
Oh, I see!
The empty supremum would correspond to the colimit of an empty diagram, which should be the smallest morphism of the ordered monoid (I think).
Yes.
The smallest morphism for the ordered monoid on the sets of the algebra is the empty set, I believe. So this should be the empty supremum.
Yes.
Excellent!
Now, to understand what it would mean to preserve the empty supremum under multiplication.
This is a little different than the case above . That described how multiplication was preserved with respect to the supremum of two morphisms.
We have above where stands for "colimit".
Maybe we want now: .
So, we would need for any set , working in the ordered monoid described above
But, the above is not a true statement. Maybe this is what @Zhen Lin Low meant about us not getting a quantale.
Hmmm. I would be interested in any hints on how to describe an algebra of sets as a quantale.
Well, as you see, union doesn't work as multiplication. There is something else that does.
Maybe we can try intersection as multiplication.
Consider an algebra of sets, we want to make this in to an ordered monoid, and hopefully eventually in to a quantale.
Let the morphisms of the monoid be the sets, and let composition of two morphisms (sets) yield their intersection.
We can order sets by inclusion, so .
Let be sets. Do we have ?
That would correspond to , which I believe is true.
We also need , which corresponds to , which is true.
This seems like it might be working (?).
Yes, that works. Incidentally, a quantale in which the multiplication is intersection is called a frame.
John Baez said:
It preserves countable directed colimits.
I've been working too much with the quotient under null sets and I forgot the basics :face_palm:
Another thought on directed monoids... In the directed monoid described above, the sets sort of live in two categories at once. In one category (the monoid), they are the morphisms. In the other category (the ordering), they are the objects. It seems like we have a kind of ladder going on:
Level 1 [monoid]: object = *, morphisms (sets)
Level 2 [ordering]: objects = , ordering morphisms
It might be interesting to consider higher order "ladders" like this 3-level ladder:
Level 1: objects , morphisms
Level 2: objects , morphisms
Level 3: objects , morphisms
Does this sort of nested "morphisms become objects" structure have a name?
That's the essence of higher categories.
Categories, functors and natural transformations fit into a similar ascending pattern - functors are morphisms between categories in but functors are themselves the objects in a category whose morphisms are natural transformations