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 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 sheaves 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.
    • CommentAuthorHarry Gindi
    • CommentTimeJun 6th 2010
    • (edited Jun 6th 2010)

    The last non-yoneda step of the proof over at presheaf is that lim Y(V)FC FB(V)Hom [C op,Set](F,B)\lim_{Y(V)\to F\in C_F}B(V)\cong Hom_{[C^{op},Set]}(F,B), which it says follows by inspection. I feel like an idiot, but how exactly does that follow?

    I’m worse off not knowing than looking like a fool =(.

    Hmm… I think I’ve got it. By the definition of a limit, we’ve got lim Y(V)FC FB(V)=Hom [C F op,Set](pt,B)\lim_{Y(V)\to F\in C_F}B(V)=Hom_{[C_F^{op}, Set]}(pt,B), then for each element of Hom [C F op,Set](pt,B)Hom_{[C_F^{op}, Set]}(pt,B), for each object of Y(V)FC FY(V)\to F\in C_F, we pick out an element of B(V)B(V), that is, by Yoneda, for each element of F(V)F(V), we pick an element of B(V)B(V), that is to say, a function F(V)B(V)F(V)\to B(V). The naturality of this assignment is guaranteed by the naturality of the map ptBpt\to B.

    But there must be a much easier way, no? If not, I’ll add the paragraph above to the proof, since that’s where the actual work seems to be.

    • CommentRowNumber2.
    • CommentAuthorFinnLawler
    • CommentTimeJun 6th 2010
    • (edited Jun 6th 2010)

    [Edit: crossed with your edit.]

    There may be an easier way than this, but:

    The category C F=Y/FC_F = Y/F is the category of elements of FF, with objects (VC,xFV)(V \in C, x \in F V) and the obvious arrows. You can write the limit lim (V,x)BA\lim_{(V,x)} B A as a subset of a product Π V,xFVBV\Pi_{V,x \in F V} B V, and this is the set of maps Vxα V(x)BVV \mapsto x \mapsto \alpha_V(x) \in B V, so it’s the set of non-natural transformations α\alpha from FF to BB. Then the limit is the equalizer of the two maps

    Π xFVΠ f:(U,y)(V,x)BU \Pi_{x \in F V} \rightrightarrows \Pi_{f \colon (U,y) \to (V,x)} B U

    where the top arrow takes α\alpha to α U(y)\alpha_U(y) and the bottom α\alpha to Bf(α V(x))B f(\alpha_V(x)). But because the right-hand product is over all ff such that Ff(x)=yF f(x) = y, the equalizer contains precisely those α\alpha such that α U(Ff(x))=Bf(α V(x))\alpha_U(F f(x)) = B f(\alpha_V(x)), i.e. the set Nat(F,B)\mathrm{Nat}(F, B).

    I have this proof in some notes of mine, though I’m pretty sure I found something like it somewhere on nLab (maybe the page you’re talking about).

    I’m worse off not knowing than looking like a fool =(.

    Asking intelligent questions never makes anyone look like a fool. :)

    • CommentRowNumber3.
    • CommentAuthorHarry Gindi
    • CommentTimeJun 6th 2010
    • (edited Jun 6th 2010)

    Yes, my proof is easier than the one you gave since it uses the slick definition of the limit =).

    Usually when a step in the proof is something like “the proof follows by inspection”, one doesn’t expect the majority of the argument to be covered by that (hence my despair!).

    Perhaps it would be more honest to say, “the proof follows by introspection”! Not to be too much of a complainer, but there’s nothing (apart from confusing typos) that is more annoying than having the main body of the argument left with something like “immediate” or “obvious” or “by inspection”. You might as well leave the whole thing as an exercise =(.

    I mean, that last part isn’t hard, but it’s harder than the stupid part of the proof where you just flip the colimit out and apply Yoneda.

    • CommentRowNumber4.
    • CommentAuthorFinnLawler
    • CommentTimeJun 6th 2010

    Right: you should add your proof to the page.

    Maybe an even slicker proof is to note that we’re calculating the weighted limit lim FBlim^F B, so the whole lot follows by enriched nonsense as at ibid. (though I think the coends there should be ends).

    • CommentRowNumber5.
    • CommentAuthorHarry Gindi
    • CommentTimeJun 6th 2010
    • (edited Jun 6th 2010)

    Alright, added it. By the way, to prove that it’s the weighted limit would be exactly the same, since we’re switching from taking limits over the comma category vs taking limits with a weight.

    • CommentRowNumber6.
    • CommentAuthorUrs
    • CommentTimeJun 6th 2010

    Thanks, Harry.

    I edited it slightly, for instance added formal proposition/proof environments and a link to co-Yoneda lemma.

    Also added a remark that the proof is a special case for the formula of left Kan extension: the co-Yoneda lemma is the formula for the left Kan extension along the identity functor.

    • CommentRowNumber7.
    • CommentAuthorHarry Gindi
    • CommentTimeJun 6th 2010

    Thanks!

    • CommentRowNumber8.
    • CommentAuthorTodd_Trimble
    • CommentTimeJun 6th 2010

    Here’s the way I view this: to show that a presheaf F:C opSetF: C^{op} \to Set is canonically presented as a colimit of representables, we exhibit a natural isomorphism

    c:CF(c)×hom C(,c)F\int^{c: C} F(c) \times \hom_C(-, c) \cong F

    By the definition of coend, maps cF(c)×hom C(,c)G()\int^c F(c) \times \hom_C(-, c) \to G(-) are in natural bijection with families of maps F(c)×hom C(d,c)G(d)F(c) \times \hom_C(d, c) \to G(d) extranatural in cc and natural in dd. Those are in natural bijection with families of maps F(c)hom(hom C(d,c),G(d))F(c) \to \hom(\hom_C(d, c), G(d)) natural in cc and extranatural in dd. These are in natural bijection with families of maps F(c)Nat(hom C(,c),G)G(c)F(c) \to Nat(\hom_C(-, c), G) \cong G(c) (natural in cc), by Yoneda. Thus we have exhibited a natural isomorphism

    Nat( cF(c)×hom C(,c),G)Nat(F,G)Nat(\int^c F(c) \times \hom_C(-, c), G) \cong Nat(F, G)

    (natural in GG). By Yoneda again, this gives cF(c)×hom C(,c)F\int^c F(c) \times \hom_C(-, c) \cong F.

    The more conceptual way of viewing this is in terms of bimodules (aka profunctors), but I won’t go into this here.

    • CommentRowNumber9.
    • CommentAuthorHarry Gindi
    • CommentTimeJun 7th 2010
    • (edited Jun 7th 2010)

    I still know basically nothing about ends and coends since Mac Lane’s treatment is really dry (as is all of Categories Work. I really dislike that book.), so whenever I see them, I immediately run in the opposite direction.

    Do you know of a better source to learn about them?

    • CommentRowNumber10.
    • CommentAuthorUrs
    • CommentTimeJun 7th 2010

    Do you know of a better source to learn about them?

    As we recently dicussed elsewhere, a standard reference is Kelly’s “Basic concepts of enriched category theory”. (use Google.)

    • CommentRowNumber11.
    • CommentAuthorTodd_Trimble
    • CommentTimeJun 7th 2010

    That’s too bad. Have you had better luck looking around nLab pages? Some people seem to like the discussion which I think is at extranatural transformation. If that’s under your belt, then coends/ends are just universal examples of extranatural wedges.

    I like Cats Work (grew up on it, really), but I don’t think the section on ends/coends is one of the stronger efforts in that book. I remember struggling with them myself, wondering what they were really about. Anyway, staring down your fears over ends/coends is well worth the effort (I think Urs would agree with that!).

    • CommentRowNumber12.
    • CommentAuthorHarry Gindi
    • CommentTimeJun 7th 2010
    • (edited Jun 7th 2010)

    [redacted]