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.
Let be a (possibly infinite) set. Then what is the structure of , if we care about the operations of union, intersection, and set difference?
It is not a Boolean algebra because it doesn't include . It is like a semiring in measure theory.
We could equivalently say that the operations we care about are intersection and symmetric difference. Then it is a -algebra. But that's not enough! We also need the multiplication to be associative, commutative, and idempotent. Is that enough?
We could also say that it is a join-semilattice with a "difference" operation that we define somehow -- does this have a name?
Is there some better way to describe this structure?
I may be mixed up, but I think is the free [[join-semilattice]] on the set . There's a monad on Set for join-semilattices, since they can be described using operations obeying equations, i.e. not mentioning the order structure. See the link for how.
The link talks more about the free join-semilattice on a poset, but I think this can be specialized to prove the result I just claimed, thinking of a set as a discrete poset.
Yes that is true! But what if you want to consider set difference and/or symmetric difference part of the structure?
As a matter of fact, how do you even get binary intersections this way?
I don't have a canonical reference for this but I would call it a "locally Boolean algebra", meaning roughly that the elements that are for some fixed form a Boolean algebra (and so in particular an element has a complement within this algebra, from which we can build the other operations you mention).
@Joshua Meyers It's just dumb luck that the free join-semilattice turns out to be a distributive lattice, basically. Well, maybe an explanation is that any finite number of elements live in a finite bounded sub-join-semilattice, and such a thing always also has meets, by, if you want to be annoying, the adjoint functor theorem.
The general example of a "locally Boolean algebra" should be the compact open (hence clopen) subsets of a locally compact Hausdorff totally disconnected space. In the case of your example, that space is with the discrete topology.
Hmm, I wonder if it's important that the full downsets are boolean algebras, rather than just that you've got a certain kind of filtered colimit of finite boolean algebras.
It's a bit tricky to say how the "locally Boolean algebra" is built from the various downsets , because the inclusion of one in a bigger one doesn't preserve the negation.
Which is also why I didn't give a real definition.
I got it!
The structure I'm looking for is "commutative associative idempotent (not-necessarily unital) -algebra!
(inspired by https://ncatlab.org/nlab/show/Boolean+ring)
Joshua Meyers said:
I got it!
The structure I'm looking for is "commutative associative idempotent (not-necessarily unital) -algebra!
These are fun :blush:
But unfortunately, the free such structure on a set is not but rather , where is the set of indecomposable regions on a fully generic Venn diagram with one circle for each . More formally, .
Wait this only works for finite
I wish there was some way to specify that the generators are disjoint
Kinda related to this thread.
Joshua Meyers said:
Yes that is true! But what if you want to consider set difference and/or symmetric difference part of the structure?
As a matter of fact, how do you even get binary intersections this way?
Those are good questions! But those operations are not natural with respect to the obvious covariant functor sending to , right? So they're inherently different from finitary unions.
I guess I'm suggesting that the categorical viewpoint on "the operations possessed by " should consider the question about how these operations get along with maps.
By the way, we can make into both a covariant and a contravariant functor from to , via images and inverse images. This complicates the discussion in fascinating ways. only gets to be a covariant functor from to , not a contravariant one, since the inverse image of a finite subset under a function needn't be finite. But you can make it into a contravariant functor from to .
It can also be a contravariant functor on the category with sets as objects and functions with finite fibers as morphisms. This is almost by definition so it (the category equipped with the contravariant functor) probably has some nice universal property with regard to on ...
It's almost the opposite of the Kleisli category