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.
So -condensed sets can be defined for a regular cardinal . For example, the -pyknotic sets are defined to be -condensed sets for an inaccessible cardinal . And the light condensed sets are the -condensed sets.
What are the -condensed sets?
Sheaves on the category of finite sets with the coherent coverage, no? But this implies that a sheaf is determined by its value on a point, by preservation of finite coproducts. And then one needs that surjections are sent to equalisers.
At least, the value of the sheaf on objects is determined by where it sends the point. The arrow component of the functor is determined by where it sends the map {1,2}->*. I'm guessing the final category you're after is just equivalent to Set, but I'm checking it in a low-brow way.
Ok, and the value of the functor on {a,b}->* is the diagonal map, so, yes, the sheaf is specified completely by the choice of a single set.
I know there's abstract characterisations of the sheaf cat as a cocompletion, so the answer is going to end up being Set. But it's sometimes fun to get one's hands dirty...
To be concrete, every aleph0-condensed set is Set(—,X):FinSet^op-->Set for some arbitrary set X.
I had a hunch there was something degenerate about -condensed sets but wasn't exactly sure what the degeneracy was going to be.
Next thing I wonder is, given two regular cardinals , do the -condensed sets embed into the -condensed sets? Because if so than the embedding of -condensed sets into other condensed sets provides a way of representing the "uncondensed" sets in condensed sets. (If not then never mind.)
Actually, I think that -condensed sets already embed into -condensed sets for , since I believe -condensed sets form a local topos over Set.
At least -condensed -groupoids form a local -topos over modulo size issues, and I think everything still holds when we 0-truncate everything.
I think you need strong limit or something, not regular, to get a ff functor.
Hmm, Proposition 2.9 in https://www.math.uni-bonn.de/people/scholze/Condensed.pdf does the case where both cardinals are uncountable strong limit. So you just need to consider kappa=aleph_0 and lambda a strong limit.
so essentially, it is the pyknotic sets that embed in larger cardinal pyknotic sets.
Strong limit≠inaccessible, though.
Aleph_0 is still strong limit
Yes but Scholze used uncountable strong limits, so excluding .
unless there are other uncountable strong limits that aren't inaccessible that I'm forgetting off the top of my head
On the other hand, I don't think there is any barrier to adaping Scholze's proof to the case of .
There is a cofinal sequence of uncountable strong limit cardinals in ZFC
Scholze deliberately avoided assuming the existence of inaccessibles
Ah okay.
Regarding adapting Scholze's proof, the aleph_0-small extremally disconnected sets are the finite discrete spaces, and the claims in the first paragraph should be immediate, no? I don't quite see instantly why the unit of the adjunction should be an iso, but I assume that's not a problem at all.
Finite discrete spaces are a full subcat of lambda-small extremally disconnected spaces for all (strong limit) lambda, so it should be easy.
BTW, beth_{alpha+omega} is always strong limit, for all ordinals alpha, just so you have a concrete example!
Thanks
The point is that one _can_ use regular cardinals instead of strong limit, but the characterisations as different kinds of sheaves might not work.
Unfortunately the example I was really interested in was the relationship between -condensed sets and light condensed sets, the latter which I believe are not from a strong limit cardinal.
That is, freely passing between the sites of kappa-small profinite sets, kappa-small extremally disconnected spaces, and compact hausdorff spaces is not so cheap.
One needs to use the 'real' definition, not a characterisation.
Possibly using the opposite of countable boolean algebras as the site of definition for light condensed sets, and the opposite of finite boolean algebras for aleph_0-small condensed sets...
Though the latter feels weird! Since those are all very specific sizes.
And yes, aleph_1 is not strong limit.
isn't the opposite of finite boolean algebras just finite sets?
no, I think it's the other way around - the opposite of finite sets is finite boolean algebras
The equivalence is via the contravariant powerset functor, I believe.
but the op functor in Cat is an involution so maybe the opposite of finite boolean algebras is finite sets
In particular, Scholze uses only the countable boolean alg site, the profinite sets that are countable _sequential_ limits, and the profinite sets that are countable limits, not extremally disconnected stuff.
From memory. It was a long time ago I watched the lectures!
In this paper the author uses all countable limits, not just the sequential limits, in defining light profinite sets:
Definition 1. A light profinite set is a topological space that arises as a countable limit of finite discrete sets.
but I've seen it defined using countable sequential limits, countable cofiltered limits, etc
but every finite set is a light profinite set because it is the sequential limit of the constant sequential diagram involving the identity function on the finite set.
so it might be possible to show that finite sets embed fully faithfully in light profinite sets and then maybe use that to show that -condensed sets embed fully faithfully in light condensed sets.
Scholze proved the equivalence of the sequential/non-sequential in his lectures, I recall. Or at least stated it...
https://youtu.be/_4G582SIo28?feature=shared at 14:40 is where the relevant material starts
Finite sets manifestly embed fully faithfully in (light) profinite sets, as the constant sequential diagrams, for example.
In fact at 25:00 he defines a light profinite set in such a way it includes finite sets. Namely via countable, not just countable infinite boolean algebras.
The equivalence with sequential profinite is about 39:10
The definition of light condensed set is around 1:00:40