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.
What is a good way to prove that there is no monadic functor Set x Set ---> Set? I am currently writing down a proof but I am not happy how it evolves, probably I miss something easy.
Why isn't such a functor? It preserves reflexive coequalizers, right, as in crude monadicity?
The product functor is not monadic since it's not conservative.
I think the category of algebras of that monad is equivalent to the full subcategory of such that neither or both of the sets are empty.
It looks like doesn't have a [[separator]], so it can't be monadic over .
It has a separator, namely the pair .
I think that a category monadic over has a single object separator.
Ahh that makes sense! I was about to propose a more complicated proof using projective objects, but that's easier!
My argument would have been that the poset-reflection of the subcategory of projectives in a Set-monadic category can have at most two elements since every projective object is a retract of a free object. But in Set x Set, every object is projective, and the poset reflection of SetxSet has four elements.
Now this got me confused, I always thought that when a category has a separating set and coproducts, then it has a separating object. But I was wrong. It only works in special categories, for example those with zero morphisms.
Jonas Frey said:
The product functor is not monadic since it's not conservative.
Oh, yeah, I think I've made that mistake before.
Ok since I now need to erase everything I was believing about generators ... I don't even know anymore if the category of simplicial sets has a generator :D (of course it has a generating set)
(generator = "single" separator, generating set = separating family)
ok Lemma: Let be a generating set in a category. Assume that between any two objects there is at least one morphism, and assume that the coproduct of the objects in exists. Then this coproduct is a generator.
In particular, should be a generator in sSet.
Proof that has no generator: Assume that is a generator. Of course, and cannot be both empty. Assume w.l.o.g. that is non-empty. Then there is no morphism , but there are two different morphisms .
Corollary: there is no monadic functor .
Can we classify the Grothendieck topoi that have a generator?
We can try! Based on Jonas' comment, we can observe that any generator must have support (the morphism to 1 must be epic). If its support (image of the terminal map) were some properly subterminal object then the generator couldn't distinguish the two pushout injections .
The conclusion is that the topos must be 2-valued, or equivalent hyperconnected over Set: 0 and 1 are the only subterminal objects.
Conveniently, any non-initial object in a hyperconnected topos is well-supported. If the axiom of choice holds in our category of sets(!), the product of any generating set of objects will not be initial and all of the projections will be epimorphisms, so that object will be a generator. Two-valuedness is necessary and sufficient!