Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
1 to 32 of 32
Note that this might be called a ’soft question’, as they say on MO.
This is to do with the answer [http://mathoverflow.net/questions/45927/a-conceptual-proof-that-local-fibrations-over-paracompact-spaces-are-global-fibra/46248#46248](here on MO) by Steven Gubkin. I quote
Note that the axiom of choice is really a local to global principle for sets without any added structure: Given a surjection of sets it is easy to find local sections (i.e. you do not need to invoke choice to find an element of any particular fiber), but we need a new axiom to say that we can actually patch these local sections together to give a global section.
I don’t know if this is constructively true as stated. Given a surjection, can we choose an element of a given fibre? I suppose if ’surjection’ is defined in a constructive manner it means ’every fibre is inhabited’ or similar, but I’d like to clarify this. How much can we patch together these ’local sections’ in a constructive setting?
It is constructively true as stated, as you surmise: “surjection” means “every fiber is inhabited,” and so no choice is necessary to choose an element of any particular fiber. (BTW, I would prefer to phrase your question as “are singleton sets projective?” – see the comments at choice object.) The question of how much we can patch these local sections together is essentially the question of to what extent the axiom of choice holds.
Post more!
Steven, nice to see you contributing to the discussions! Tip: When posting you can choose different formatting options including Markdown+iTeX. iTeX is needed to display the LaTeX if you want to display equations as equations.
@Mike - of course, ’projective’ is what I meant. As to the later question, I imagine that we can, for each finite set and surjection (in the constructive sense), pick a local section . With countable choice we should be able to extend this to countable and so on. So in this weak setting, we could work with ’covers’ by finite (or countable as appropriate) sets. This would have applications to Steven’s question, perhaps.
@Steven, Thanks for that Blass paper! I quite like it. Especially this bit:
(Irrelevant exercise: Formulate the definition of Cech cohomology for general spaces so that it makes sense without the axiom of choice. The difficulty lies in passing from a cover to a refinement without being able to choose, for each set in the refinement, a superset in the original cover.)
which with anafunctors (and WISC, perhaps) I think would be do-able. (Only need to show that WISC in Set implies it in Top. At present we know Choice in Set implies WISC in Top, but not the stronger statement)
Formulate the definition of Cech cohomology for general spaces so that it makes sense without the axiom of choice.
I don’t see where the standard definition even uses choice: there is a poset of covers and we take a colimit over that. This does not need to choose any refinements (and make choices for that).
Of course the question is if in a the given exotic setup, this algorithm still computes what it is supposed to compute. That’s always an issue with Cech cohomology, that it is just an algorithm meant to compute some cohomology and not a guaranteed construction of that cohomology.
Hi Steven, welcome! I will take a look at that paper, I have not seen it before. I suspect that the presentation axiom might be relevant to the discussion as well.
Hi David, Mike answered your question for me, but there is still a point of interest, which is discussed at well-pointed category. In a foundational setting such as ETCS, one can prove that the terminal object of is projective, using excluded middle and the axiom that is well-pointed (as usually stated). Without excluded middle, we need an extra axiom to explicitly state that is projective. Mike and I decided that this really should be part of the definition of ‘well-pointed’ in a constructive theory.
Like Urs, I don’t understand what Andreas Blass means by his “irrelevant exercise.” If a cover refines a cover , then by definition, for every there exists a with . Given a Cech cocycle for the cover , consisting of elements which are pairwise compatible (), we want to define a Cech cocycle for the cover , and the obvious way to do it is to “choose” for each some with and define .
However, pairwise compatibility of the family implies that the resulting is independent of whichever we choose. So whether or not we can simultaneously choose a for each , we can still prove something like “for any , there exists a unique such that whenever then .” Then the “axiom of non-choice,” aka function comprehension, lets us define the family .
@Mike That does not look quite right, but I see what you mean.
There is a neat fact that if you use the nerves of covers to build the simplest form of Cech complex, (it is something like) choosing a refinement function at the level of the covers is enough to make the Cech complex a homotopy coherent diagram, i.e. all the higher homotopies can be derived just from that one family of choices. If this sounds interesting to someone then I can expand on it. The proof was hinted at by Andy Tonks but actually written down by a Bangor PhD student in his thesis some time later.
@Tim: Can you explain further? What’s not right?
@Mike. I reread what you wrote and withdraw the comment. I misunderstood something.
okay. I don’t understand your comment about “making the Cech complex a homotopy coherent diagram” either – isn’t the Cech complex automatically a strictly commutative simplicial object? Or do I not understand what you mean by “Cech complex”?
If you take the classical definition of the Cech complex, it gives a simplicial complex attached to each open cover. The maps corresponding to the refinements are only defined up to ’contiguity’. This means that the ’prosimplicial set’ that is the result lives in ProHo(sSet). What I was saying is that there is an explicit rectification of that diagram to a hocoh diagram and hence to an object in Ho(pro(sSet)).
Ah. That sounds kind of like the Artin-Mazur sort of thing we were talking about in the other thread.
Steven Gubkin has posted an answer on Math Overflow to Mike’s question about small complete categories in a Grothendieck topos. Also, he pointed out to me an error on the page geometric morphism that I’ve now corrected (it said every topos has a geometric morphism to ; I inserted the qualifier “Grothendieck”).
That my name is in the subject header made me read this again, and there is potentially still something that David might wonder about from his beginning question.
As Mike’s answer noted, the usual definition of “surjective” is precisely a function whose every fibre is inhabited, so there is no difficulty there. However, as category theorists, we might prefer to define “surjection” as an epimorphism in , and the question is how we prove that every fibre is inhabited.
An easy method to prove this for is to look at the two functions , where is the set of truth values, where is constant to truth and is the characteristic function of the image of (details left to the reader). This proof is constructive in a weak sense, but it is not predicative constructive; that is, it only works in a situation (such as in any topos) where the set actually exists. However, you can instead use the functions in the pushout square
(details again left to the reader). This proof generalises to any well-pointed pretopos. (Check that the pushout actually exists by writing down the relevant equivalence relation on .)
Can’t we prove that just using the fact that Set is well-pointed, and that in particular 1 is projective?
Yes, but I think that this involves a subtle redefinition of David’s question.
First, David asked whether is a “choice set”. This is terminology used in foundations for a set such that any entire relation out of contains a function, or equivalently (by an elementary argument) such that any surjection to splits. You invited David to say “projective set” instead, since “choice object” is used in topos theory for the internal version of the converse notion: a set such that any entire relation into contains a function. OK, but literally “projective set” means a projective object in , which is (a priori) a stronger condition.
David’s original question can be understood as asking whether any epimorphism to in splits. If so interpreted, then your answer implicitly uses this argument:
But (1) was never proved. (Nor did it have to be, since David’s question can also be understood as asking whether any surjection to splits, in which case (2) is sufficient.) So I decided to throw in a proof of (1).
Now, if we assume that is a projective object, then it’s easy to prove (1). But that’s begging the question; that is projective is (a priori even stronger than) the question being asked. So really, we should prove (1) without using that is projective.
I muddied things by adding that my proof of (1) works in any well-pointed pretopos. Of course, is projective in a well-pointed pretopos, but we really shouldn’t use that. It’s my fault for suggesting such a strong hypothesis.
Okay, I think I see… you were intending to start from some membership-based set theory. It was your comment about well-pointed pretopoi that confused me.
Not necessarily a material set theory, but also not a structural set theory so explicitly categorial as ETCS (or CETCS). My comment (except for the bit about well-pointed pretoposes, which wasn’t really relevant and just confused things) would also be wanted in SEAR (or CSEAR). I expect that it would be wanted in most foundations of (possibly constructive) mathematics, material or structural (or even non-set-based); only a foundation in the style of (C)ETCS would explicitly state as an axiom that is projective.
this is the proof which establishes, in the internal logic of a (pre)topos, that 1 is projective.
I don’t think I agree with that. I think the internal logic is fundamentally a categorial set theory like ETCS. Toby’s argument makes sense when you are starting from a non-categorial notion of set and constructing a category of sets, but in the internal logic it is the category of sets that’s given to you.
Here’s how I would prove that 1 is projective in the internal logic. The statement “1 is projective” is equivalent to “every epimorphism with target 1 splits” (whenever epimorphisms are stable under pullback), which in turn is an abbreviation of “for any epimorphism , there exists a morphism such that .” If you interpret this in the internal logic using Kripke-Joyal / stack semantics, it becomes “for any object X and any epimorphism , there exists an epimorphism and a morphism such that .” But this is obviously true since we can take and let be the diagonal.
If you prefer representing subobjects to Kripke-Joyal, then the argument is even easier: we have an object with an epimorphism and we want to prove that “there exists an element of A.” But validity of “there exists an element of A” just means that the image of the projection is all of , which is equivalent to saying that is epic.
Okay, that’s all certainly true, but I would argue that if “epi ≠ regular epi” then the sensible definition of “projective” refers to regular epis, not to ordinary ones. Thus, I wouldn’t regard a proof that “all epis are regular” as a proof that 1 is projective, but rather as just a proof that all epis are regular. As a corollary, projectivity of 1 (with respect to regular epis, which is the sensible definition in general) implies the corresponding property for plain epis.
My intention behind the proof was Mike’s (current) interpretation, to establish that is projective in an (unspecified but) non-categorial foundation of (possibly predicative constructive) mathematics. Whether that can be shown more quickly (say, in , the predicative version with disjoint unions and quotient sets but not power sets) and whether the argument shows anything more general, I have no idea that’s not already in the discussion above.
When you say your intention was to establish that 1 is projective, do you mean with respect to regular epis or arbitrary epis?
For arbitrary ones (and thus also for regular ones).
And when you say a non-categorial foundation, what is it about your argument that was non-categorial?
Nothing, but that’s not the point.
Any foundation worth its salt can prove that sets and functions form a category , and this is necessary before even asking whether singletons are projective in . However, the foundation need not start with the assumption that sets and functions form a category. This is important since such foundations may (like in fact does) take as an axiom that singletons are projective (as part of the axiom that is well-pointed).
Of course, even in a categorial foundation, one might conceivably do things in such a way that there is no axiom that singletons are projective, and the quickest proof of that fact might still use my argument. (I once wrote out such a foundation as an exercise here, although it was a gross copyright violation and is no longer online.) So really, instead of a non-categorial foundation, I should have simply specified a foundation in which this is not an axiom (or a simple consequence of one, as it is in classical ), but really requires reasoning about sets and functions.
it seemed to me that you were presenting an argument that arbitrary epis are surjections …
It does prove this, since it’s obvious (and Mike said at the very beginning) that is -projective (where is the class of surjections), so now we have a proof that is -projective (where is the class of arbitrary epimorphisms).
… in the predicative categorial framework of pretoposes
That wasn’t part of my intention, although I said something in the epilogue that kind of sounded like that.
1 to 32 of 32