Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology definitions deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nforum nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorTodd_Trimble
    • CommentTimeApr 5th 2015

    I just feel like bringing up a trap I fell into recently. A model of ETCS is a well-pointed topos EE with natural numbers object NN and satisfying AC, right? Being well-pointed, the terminal object 11 is (externally) projective and connected; I’m assuming here that the meta-logic is classical, as needed.

    The trap I’d been falling into is thinking that projectivity and connectedness is the same as saying hom(1,):ESet\hom(1, -): E \to Set is right exact, i.e., preserves finite colimits. I don’t think that can be right, because it would imply that hom(1,):ESet\hom(1, -): E \to Set preserves the natural numbers object, since natural numbers objects in toposes can be characterized in terms of finite colimits (famous result due to Freyd). If that were the case, then there can be no “nonstandard” elements 1N1 \to N in EE (taking \mathbb{N} in SetSet as our “standard”).

    So far I haven’t found a spot in the nLab where there is an outright error, but I do think there are spots that are at least misleading. Over at Freyd cover, Theorem 1, it says “The terminal object in the initial topos 𝒯\mathcal{T} is connected and projective, i.e., Γ=hom(1,):𝒯Set\Gamma = \hom(1, -) \colon \mathcal{T} \to Set preserves finite colimits.” Actually we do prove the stronger result that Γ\Gamma is right exact, but it’s that “i.e.” which seems a little misleading.

    Lawvere does make a far-sighted remark on this in his ETCS paper (the TAC version), where he observes (Remark 8, page 31) that Γ\Gamma preserves coequalizers of kernel pairs = equivalence relations, but “it seems unlikely that it is necessary that [Γ][\Gamma] be right exact, since as remarked above, the construction of the RST [reflective symmetric transitive] hull involves NN and by Gödel’s theorems the nature of the object NN may vary from one model [E][E] of any theory to another model.” I call this far-sighted because I don’t think he was in possession of Freyd’s theorem (1972) or even of topos theory when that was first written.

    • CommentRowNumber2.
    • CommentAuthorMike Shulman
    • CommentTimeApr 6th 2015

    That’s a good point and should be emphasized somewhere (everywhere)? I might have fallen into that trap myself on occasion. All finite colimits can be constructed from finite coproducts and coequalizers, and all coequalizers can be constructed from quotients of equivalence relations, but the latter requires some “infinitary” construction (either internal, by using an NNO, or external, by using countable unions/coproducts). Thus, a functor which preserves finite coproducts and epimorphisms, hence also quotients of equivalence relations, still may not preserve all coequalizers.

    • CommentRowNumber3.
    • CommentAuthorTodd_Trimble
    • CommentTimeApr 6th 2015

    Thanks for the comment, Mike – I don’t think I was aware of the remark that preservation of finite coproducts and epis implies preservation of quotients of equivalence relations. I’m trying to think of a good place to put some of the information under discussion.

    • CommentRowNumber4.
    • CommentAuthorMike Shulman
    • CommentTimeApr 7th 2015

    Hmm, possibly I meant to say that preservation of finite limits (as any representable does) and also epis is what implies preservation of quotients. Possibly that requires the domain and codomain to be regular categories. I don’t remember the exact statement, but I think something like that is true.

    • CommentRowNumber5.
    • CommentAuthorZhen Lin
    • CommentTimeApr 7th 2015

    A functor that preserves pullbacks and regular epimorphisms will also preserve effective quotients of equivalence relations. So if the domain is an effective regular category, then such a functor preserves all quotients of equivalence relations.

    • CommentRowNumber6.
    • CommentAuthorMike Shulman
    • CommentTimeApr 7th 2015

    That’s it, thanks. Here we’re in a topos, so no problem.