Not signed in (Sign In)

Start a new discussion

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-categories 2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry bundles calculus categories category category-theory chern-weil-theory cohesion cohesive-homotopy-theory cohesive-homotopy-type-theory cohomology colimits combinatorics comma complex-geometry computable-mathematics computer-science constructive cosmology definitions deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry differential-topology digraphs duality education elliptic-cohomology enriched fibration finite foundations functional-analysis functor galois-theory gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck 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 infinity integration integration-theory k-theory lie-theory limit limits linear linear-algebra locale localization logic manifolds mathematics measure-theory modal-logic model model-category-theory monads monoidal monoidal-category-theory morphism motives motivic-cohomology newpage noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory 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 string string-theory subobject superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory 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.
    • CommentAuthorUrs
    • CommentTimeNov 7th 2012

    while adding to representable functor a pointer to representable morphism of stacks I noticed a leftover discussion box that had still be sitting there. So hereby I am moving that from there to here:


    [ begin forwarded discussion ]

    +–{+ .query} I am pretty unhappy that all entries related to limits, colimits and representable things at nlab say that the limit, colimit and representing functors are what normally in strict treatment are just the vertices of the corresponding universal construction. A representable functor is not a functor which is naturally isomorphic to Hom(-,c) but a pair of an object and such isomorphism! Similarly limit is the synonym for limiting cone (= universal cone), not just its vertex. Because if it were most of usages and theorems would not be true. For example, the notion and usage of creating limits under a functor, includes the words about the behaviour of the arrow under the functor, not only of the vertex. Definitions should be the collections of the data and one has to distinguish if the existence is really existence or in fact a part of the structure.–Zoran

    Mike: I disagree (partly). First of all, a functor FF equipped with an isomorphism Fhom C(,c)F\cong hom_C(-,c) is not a representable functor, it is a represented functor, or a functor equipped with a representation. A representable functor is one that is “able” to be represented, or admits a representation.

    Second, the page limit says “a limit of a diagram F:DCF : D \to C … is an object limFlim F of CC equipped with morphisms to the objects F(d)F(d) for all dDd \in D…” (emphasis added). It doesn’t say “such that there exist” morphisms. (Prior to today, it defined a limit to be a universal cone.) It is true that one frequently speaks of “the limit” as being the vertex, but this is an abuse of language no worse than other abuses that are common and convenient throughout mathematics (e.g. “let GG be a group” rather than “let (G,,e)(G,\cdot,e) be a group”). If there are any definitions you find that are wrong (e.g. that say “such that there exists” rather than “equipped with”), please correct them! (Thanks to your post, I just discovered that Kan extension was wrong, and corrected it.)

    Zoran Skoda I fully agree, Mike that “equipped with” is just a synonym of a “pair”. But look at entry for limit for example, and it is clear there that the limiting cone/universal cone and limit are clearly distinguished there and the term limit is used just for the vertex there. Unlike for limits where up to economy nobody doubt that it is a pair, you are right that many including the very MacLane representable take as existence, but then they really use term “representation” for the whole pair. Practical mathematicians are either sloppy in writing or really mean a pair for representable. Australians and MacLane use indeed word representation for the whole thing, but practical mathematicians (example: algebraic geometers) are not even aware of term “representation” in that sense, and I would side with them. Let us leave as it is for representable, but I do not believe I will ever use term “representation” in such a sense. For limit, colimit let us talk about pairs: I am perfectly happy with word “equipped” as you suggest.

    Mike: I’m not sure what your point is about limits. The definition at the beginning very clearly uses the words “equipped with.” Later on in the page, the word “limit” is used to refer to the vertex, but this is just the common abuse of language.

    Regarding representable functors, since representations are unique up to unique isomorphism when they exist, it really doesn’t matter whether “representable functor” means “functor such that there exists an isomorphism Fhom C(,c)F\cong hom_C(-,c)” or “functor equipped with an isomorphism Fhom C(,c)F\cong hom_C(-,c).” (As long as it doesn’t mean something stupid like “functor equipped with an object cc such that there exists an isomorphism Fhom C(,c)F\cong hom_C(-,c).”) In the language of stuff, structure, property, we can say that the Yoneda embedding is fully faithful, so that “being representable” is really a property, rather than structure, on a functor.

    [ continued in next comment ]


    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeNov 7th 2012

    [ continued forwarded discussion ]


    Zoran Skoda For limit look at the section Unwrapping. This section clearly distiguishes between the limiting cone and the limit. It says roughly if we have a limit then we can define a special cone, and then it is called limiting cone. So it strongly suggests that the limiting cone is something different from a limit, but in fact they are synonyms, except that it is common to abuse the language and say a limit for the vertex only: however one does not do that abuse when introducing the notion. Then one has to be clear that it is the same thing. Even it uses a terminology “universal limiting cone” what is double notation as limiting cone and universal cone and universal initial cone and initial cone and limit are equivalent terms. One allows “universal initial” because sometimes one says “universal terminal”.

    For representable I agreed, though I will of course continue using it with the structure whenever needed.

    Mike: Actually, that page has not defined limits using cones, but using an isomorphism of hom-sets. This is, of course, equivalent, but the section “Unwrapping” is about that equivalence. So when it says “if the limit limFClim F\in C of FF exists, then it singles out a special cone” it means that given an object limFlim F equipped with an isomorphism Hom(c,limF)Hom(pt,Hom(c,F))Hom(c,lim F)\cong Hom(pt,Hom(c,F-)) natural in cc, there exists a particular cone and so on. On the next line it defines that cone, using the isomorphism with which limF\lim F is equipped.

    That is, a limit is an object equipped with data which makes it a limit. That data might be a limiting cone, or it might be a certain natural isomorphism; it doesn’t matter since either can be constructed from the other.

    I don’t think anyone would argue, though, that that page is a work in progress. It’s certainly not all that clear which parts are the definitions, which parts are alternate definitions, and which parts are theorems.

    Toby: Hum … If you think of mathematics as done in type theory with the ’propositions as types’ paradigm, then there is no literal difference between ’such that there exists’ and ’equipped with’. At best, you can distinguish these as locutions for describing what the notion of equality is (or what the morphisms are) between the things being described (in which case ’equipped with’ is what you usually want), but in definitions one ought to be explicit about that too.

    I would normally say ’equipped with’ (or just ’with’), and I think that you, Zoran, should feel free to change ’such that there exists’ to ’equipped with’ when you find it appropriate. But I also think that mathematicians should learn to read ’such that there exists’ to mean ’equipped with’ unless it's explicitly stated that one is using a more loose notion of equality (or morphism).

    Mike: Perhaps unsurprisingly, I disagree. In all the working mathematics I have ever seen, types and propositions are not the same. The set of all XXs is not the same as the property of existence of XXs; the latter is the image of the former. It’s fine and fun to view your types as propositions and propositions as types and there are real insights to be gained in that way, but I think that when applied to ordinary mathematics, one should use a type theory in which propositions (aka (-1)-types) are distinguished from types (aka 0-types).

    Toby: It's fine and fun to have a hierarchy of nn-types (although 11-types should be types, of course), but this is just terminology to handle the equalities/isomorphisms/equivalences automatically, so it doesn't really disagree with me. Each convention is an abuse of language with respect to the other (and each is used, often thoughtlessly, in practice) that disappears when one is more explicit. =–


    [ end of forwarded discussion ]

    • CommentRowNumber3.
    • CommentAuthorzskoda
    • CommentTimeNov 7th 2012

    I put the permalink into the bibliography of the entry.

    • CommentRowNumber4.
    • CommentAuthorTobyBartels
    • CommentTimeNov 13th 2012

    FWIW, I'm not sure that I still endorse my remarks at the end there.

    • CommentRowNumber5.
    • CommentAuthorRodMcGuire
    • CommentTimeApr 9th 2019

    fixed nForum link from

    http://nforum.mathforge.org/discussion/4497/representable-functor/?Focus=36753#Comment_36753

    to

    https://nforum.ncatlab.org/discussion/4497/representable-functor/

    diff, v49, current

Add your comments
  • Please log in or leave your comment as a "guest post". If commenting as a "guest", please include your name in the message as a courtesy. Note: only certain categories allow guest posts.
  • To produce a hyperlink to an nLab entry, simply put double square brackets around its name, e.g. [[category]]. To use (La)TeX mathematics in your post, make sure Markdown+Itex is selected below and put your mathematics between dollar signs as usual. Only a subset of the usual TeX math commands are accepted: see here for a list.

  • (Help)