What exactly are the `size issues' preventing formation of presheaves being a left adjoint to some forgetful functor?Are Indizations cocompleteco-Yoneda lemma and representable functorsSifted colimits of models of a Lawvere theory.All $mathsfSet$-valued presheaves on a cocomplete category are representableFlat Modules are Filtered Colimits of Free ModulesNaturality can be detected on a dense subcategoryHow to use adjointness properties of sheafification to show limits/colimits are preservedFree cocompletion and preservation of colimitsEvery presheaf is a colimit of representables using point-wise computation of colimits

What are the branches of statistics?

Why is beatboxing called 「ヒューマンビートボックス」?

Is it plausible that an interrupted Windows update can cause the motherboard to fail?

"A tin of biscuits" vs "A biscuit tin"

"Distance" vs "a distance"

What is it called when you use wrong but smart arguments?

How to protect my Wi-Fi password from being displayed by Android phones when sharing it with QR code?

Can there be an atomic nucleus where there are more protons than neutrons?

Does an excessive table violate normalization rules?

Why does b+=(4,) work and b = b + (4,) doesn't work when b is a list?

Legality of creating a SE replica using SE's content

I got this nail stuck in my tire, should I plug or replace?

Incorrect mmap behavior when assembly files in included in the project

"Are you happy?" as a greeting

Some interesting and elementary topics with connections to the representation theory?

Retrieve background color in ubuntu mate

What is the name for a fluid transition between two tones? When did it first appear?

Can you take an Immortal Phoenix out of the game?

'provocative' vs 'sexy'

A fast aquatic predator with multiple eyes and pupils. Would these eyes be possible?

Trying to add electrical outlets off of a junction box but the junction box has a lot more wires than Ive been shown so which ones to run it off?

How to get the SMILES of all compounds on PubChem?

Translate "Everything burns" into classical Latin

"inuendo" in a piano score



What exactly are the `size issues' preventing formation of presheaves being a left adjoint to some forgetful functor?


Are Indizations cocompleteco-Yoneda lemma and representable functorsSifted colimits of models of a Lawvere theory.All $mathsfSet$-valued presheaves on a cocomplete category are representableFlat Modules are Filtered Colimits of Free ModulesNaturality can be detected on a dense subcategoryHow to use adjointness properties of sheafification to show limits/colimits are preservedFree cocompletion and preservation of colimitsEvery presheaf is a colimit of representables using point-wise computation of colimits






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty
margin-bottom:0;

.everyonelovesstackoverflowposition:absolute;height:1px;width:1px;opacity:0;top:0;left:0;pointer-events:none;








3














$begingroup$


In my category theory course lecture notes the following theorem:



Theorem: Every presheaf (of sets) on a small category $mathcalC$ is a colimit of representables. More precisely, for each presheaf $F$ we have an isomorphism:
$$ F cong textcolim_(astRightarrow F)^op P $$
for $(ast Rightarrow F)$ the comma category and $P(x, y) := Hom(-, x)$.



is followed up by the following note and theorem:



Note: One says that the presheaf category is the ''free cocompletion'' of $mathcalC$. It is not true that the formation of presheaves is a left adjoint to some forgetful functor due to size issues. [Italics mine]. We do however have:



Theorem: Let $mathcalC$ be a small category and $mathcalD$ a category with all small colimits. Then there is an equivalence of categories:
$$Fun^colim(Preshvs(mathcalC), mathcalD) cong Fun(mathcalC, mathcalD)$$
where the catgeory on the left is the full subcategory of functors preserving small colimits.




What is the statement in italics supposed to mean, and how is the theorem following it supposed to be some sort of weakening of the statement? I cannot seem to get a concrete answer in my head.










share|cite|improve this question









$endgroup$






















    3














    $begingroup$


    In my category theory course lecture notes the following theorem:



    Theorem: Every presheaf (of sets) on a small category $mathcalC$ is a colimit of representables. More precisely, for each presheaf $F$ we have an isomorphism:
    $$ F cong textcolim_(astRightarrow F)^op P $$
    for $(ast Rightarrow F)$ the comma category and $P(x, y) := Hom(-, x)$.



    is followed up by the following note and theorem:



    Note: One says that the presheaf category is the ''free cocompletion'' of $mathcalC$. It is not true that the formation of presheaves is a left adjoint to some forgetful functor due to size issues. [Italics mine]. We do however have:



    Theorem: Let $mathcalC$ be a small category and $mathcalD$ a category with all small colimits. Then there is an equivalence of categories:
    $$Fun^colim(Preshvs(mathcalC), mathcalD) cong Fun(mathcalC, mathcalD)$$
    where the catgeory on the left is the full subcategory of functors preserving small colimits.




    What is the statement in italics supposed to mean, and how is the theorem following it supposed to be some sort of weakening of the statement? I cannot seem to get a concrete answer in my head.










    share|cite|improve this question









    $endgroup$


















      3












      3








      3





      $begingroup$


      In my category theory course lecture notes the following theorem:



      Theorem: Every presheaf (of sets) on a small category $mathcalC$ is a colimit of representables. More precisely, for each presheaf $F$ we have an isomorphism:
      $$ F cong textcolim_(astRightarrow F)^op P $$
      for $(ast Rightarrow F)$ the comma category and $P(x, y) := Hom(-, x)$.



      is followed up by the following note and theorem:



      Note: One says that the presheaf category is the ''free cocompletion'' of $mathcalC$. It is not true that the formation of presheaves is a left adjoint to some forgetful functor due to size issues. [Italics mine]. We do however have:



      Theorem: Let $mathcalC$ be a small category and $mathcalD$ a category with all small colimits. Then there is an equivalence of categories:
      $$Fun^colim(Preshvs(mathcalC), mathcalD) cong Fun(mathcalC, mathcalD)$$
      where the catgeory on the left is the full subcategory of functors preserving small colimits.




      What is the statement in italics supposed to mean, and how is the theorem following it supposed to be some sort of weakening of the statement? I cannot seem to get a concrete answer in my head.










      share|cite|improve this question









      $endgroup$




      In my category theory course lecture notes the following theorem:



      Theorem: Every presheaf (of sets) on a small category $mathcalC$ is a colimit of representables. More precisely, for each presheaf $F$ we have an isomorphism:
      $$ F cong textcolim_(astRightarrow F)^op P $$
      for $(ast Rightarrow F)$ the comma category and $P(x, y) := Hom(-, x)$.



      is followed up by the following note and theorem:



      Note: One says that the presheaf category is the ''free cocompletion'' of $mathcalC$. It is not true that the formation of presheaves is a left adjoint to some forgetful functor due to size issues. [Italics mine]. We do however have:



      Theorem: Let $mathcalC$ be a small category and $mathcalD$ a category with all small colimits. Then there is an equivalence of categories:
      $$Fun^colim(Preshvs(mathcalC), mathcalD) cong Fun(mathcalC, mathcalD)$$
      where the catgeory on the left is the full subcategory of functors preserving small colimits.




      What is the statement in italics supposed to mean, and how is the theorem following it supposed to be some sort of weakening of the statement? I cannot seem to get a concrete answer in my head.







      category-theory limits-colimits adjoint-functors






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question



      share|cite|improve this question










      asked May 2 at 18:20









      NethesisNethesis

      1,9861 gold badge9 silver badges26 bronze badges




      1,9861 gold badge9 silver badges26 bronze badges























          2 Answers
          2






          active

          oldest

          votes


















          6
















          $begingroup$

          The problem is that you cannot choose a domain and codomain for such a putative adjunction consistently and simultaneously. The statement that we have is that the category of presheaves on $C$ is the free cocomplete category on $C$ when $C$ is small. However, the forgetful functor from cocomplete categories to categories does not land in small categories-every cocomplete category which is not a preorder is large.



          So, you might want an improved adjunction between large categories and cocomplete categories. However, the category of presheaves on a large category is even larger than large! What this means depends on your foundations. If we work with universes so that a small category is $U_1$-small, then presheaves on a small category are small with respect to the next biggest universe $U_2$. Now presheaves on a $U_2$-small category only have the appropriate universal property if we can them to be presheaves of $U_2$-small sets, and such presheaves are not $U_2$-small.



          So the presheaves-forgetful functor pair cannot form an adjunction, because the desired left adjoint moves us up a universe every time we apply it. Thus in particular we cannot get around this straightforwardly by using universes.



          There are a couple of partial solutions to this problem. The simplest is to regard the formation of the presheaf category as a relative left adjoint to the forgetful functor from cocomplete categories to (possibly) large categories. In other words, it behaves like a left adjoint, but is only partially defined. This is a rephrasing of the theorem you quote-the formation of presheaves behaves like a left adjoint when its input is small.



          A more technical approach is to ask the question: even if the formation of presheaves cannot be left adjoint to the forgetful functor from cocomplete categories to large categories, does this forgetful functor have any left adjoint at all? In fact it does; for instance, it satisfies a 2-categorical version of the general adjoint functor theorem. This left adjoint sends a category $K$ to the subcategory of presheaves on $K$ formed by the colimits of small diagrams of representable presheaves. However, this category of small presheaves is not nearly as well behaved as the presheaf category. It needn't even be a topos in general.



          So to summarize, this is a real issue which cannot be eradicated by any level of generous assumptions on the foundations. It's the go-to example of why size issues cannot be completely ignored in category theory.






          share|cite|improve this answer












          $endgroup$














          • $begingroup$
            I like this answer, too, because it shows that even with universes we cannot obviously and immediately get around the problem - thank you!
            $endgroup$
            – Nethesis
            May 2 at 19:19


















          4
















          $begingroup$

          It's tempting to say that we have an adjunction $mathrmPsh dashv U$ between functors $mathbfCat rightleftarrows mathbfCat_textcolim$, where $mathbfCat_textcolim$ is the category of all cocomplete categories and cocontinuous functors. But in order to make sense of the definition of 'adjunction', we need to refer to hom sets, meaning that $mathbfCat$ and $mathbfCat_mathrmcolim$ to be locally small.



          So really $mathbfCat$ is the category of all small categories, and likewise for $mathbfCat_mathrmcolim$.



          However, even if we restricted the statement to small cocomplete categories $mathcalD$, the category $mathrmPsh(mathcalC)$ is not small in general, and so $mathrmPsh$ is not a functor $mathbfCat to mathbfCat_mathrmcolim$.



          However, for fixed small $mathcalC$ and locally small cocomplete $mathcalD$, it makes sense to ask whether there is a bijection between the respective hom sets (or, in this case, an equivalence between hom categories), without requiring the constructions $mathrmPsh$ and $U$ to be functors between categories. So that's the result that is proved in your notes.



          You could hack it using a hierarchy of Grothendieck universes, but I wouldn't recommend it.






          share|cite|improve this answer












          $endgroup$














          • $begingroup$
            Yeah "size issues" always confuse me a bit, because I tend to just think its all relative to your universe anyway. I can see that doing so freely might cause subtle issues and complication to pop up, though. This makes sense, though, so thank you.
            $endgroup$
            – Nethesis
            May 2 at 19:18












          Your Answer








          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "69"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/4.0/"u003ecc by-sa 4.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );














          draft saved

          draft discarded
















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3211339%2fwhat-exactly-are-the-size-issues-preventing-formation-of-presheaves-being-a-le%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown


























          2 Answers
          2






          active

          oldest

          votes








          2 Answers
          2






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          6
















          $begingroup$

          The problem is that you cannot choose a domain and codomain for such a putative adjunction consistently and simultaneously. The statement that we have is that the category of presheaves on $C$ is the free cocomplete category on $C$ when $C$ is small. However, the forgetful functor from cocomplete categories to categories does not land in small categories-every cocomplete category which is not a preorder is large.



          So, you might want an improved adjunction between large categories and cocomplete categories. However, the category of presheaves on a large category is even larger than large! What this means depends on your foundations. If we work with universes so that a small category is $U_1$-small, then presheaves on a small category are small with respect to the next biggest universe $U_2$. Now presheaves on a $U_2$-small category only have the appropriate universal property if we can them to be presheaves of $U_2$-small sets, and such presheaves are not $U_2$-small.



          So the presheaves-forgetful functor pair cannot form an adjunction, because the desired left adjoint moves us up a universe every time we apply it. Thus in particular we cannot get around this straightforwardly by using universes.



          There are a couple of partial solutions to this problem. The simplest is to regard the formation of the presheaf category as a relative left adjoint to the forgetful functor from cocomplete categories to (possibly) large categories. In other words, it behaves like a left adjoint, but is only partially defined. This is a rephrasing of the theorem you quote-the formation of presheaves behaves like a left adjoint when its input is small.



          A more technical approach is to ask the question: even if the formation of presheaves cannot be left adjoint to the forgetful functor from cocomplete categories to large categories, does this forgetful functor have any left adjoint at all? In fact it does; for instance, it satisfies a 2-categorical version of the general adjoint functor theorem. This left adjoint sends a category $K$ to the subcategory of presheaves on $K$ formed by the colimits of small diagrams of representable presheaves. However, this category of small presheaves is not nearly as well behaved as the presheaf category. It needn't even be a topos in general.



          So to summarize, this is a real issue which cannot be eradicated by any level of generous assumptions on the foundations. It's the go-to example of why size issues cannot be completely ignored in category theory.






          share|cite|improve this answer












          $endgroup$














          • $begingroup$
            I like this answer, too, because it shows that even with universes we cannot obviously and immediately get around the problem - thank you!
            $endgroup$
            – Nethesis
            May 2 at 19:19















          6
















          $begingroup$

          The problem is that you cannot choose a domain and codomain for such a putative adjunction consistently and simultaneously. The statement that we have is that the category of presheaves on $C$ is the free cocomplete category on $C$ when $C$ is small. However, the forgetful functor from cocomplete categories to categories does not land in small categories-every cocomplete category which is not a preorder is large.



          So, you might want an improved adjunction between large categories and cocomplete categories. However, the category of presheaves on a large category is even larger than large! What this means depends on your foundations. If we work with universes so that a small category is $U_1$-small, then presheaves on a small category are small with respect to the next biggest universe $U_2$. Now presheaves on a $U_2$-small category only have the appropriate universal property if we can them to be presheaves of $U_2$-small sets, and such presheaves are not $U_2$-small.



          So the presheaves-forgetful functor pair cannot form an adjunction, because the desired left adjoint moves us up a universe every time we apply it. Thus in particular we cannot get around this straightforwardly by using universes.



          There are a couple of partial solutions to this problem. The simplest is to regard the formation of the presheaf category as a relative left adjoint to the forgetful functor from cocomplete categories to (possibly) large categories. In other words, it behaves like a left adjoint, but is only partially defined. This is a rephrasing of the theorem you quote-the formation of presheaves behaves like a left adjoint when its input is small.



          A more technical approach is to ask the question: even if the formation of presheaves cannot be left adjoint to the forgetful functor from cocomplete categories to large categories, does this forgetful functor have any left adjoint at all? In fact it does; for instance, it satisfies a 2-categorical version of the general adjoint functor theorem. This left adjoint sends a category $K$ to the subcategory of presheaves on $K$ formed by the colimits of small diagrams of representable presheaves. However, this category of small presheaves is not nearly as well behaved as the presheaf category. It needn't even be a topos in general.



          So to summarize, this is a real issue which cannot be eradicated by any level of generous assumptions on the foundations. It's the go-to example of why size issues cannot be completely ignored in category theory.






          share|cite|improve this answer












          $endgroup$














          • $begingroup$
            I like this answer, too, because it shows that even with universes we cannot obviously and immediately get around the problem - thank you!
            $endgroup$
            – Nethesis
            May 2 at 19:19













          6














          6










          6







          $begingroup$

          The problem is that you cannot choose a domain and codomain for such a putative adjunction consistently and simultaneously. The statement that we have is that the category of presheaves on $C$ is the free cocomplete category on $C$ when $C$ is small. However, the forgetful functor from cocomplete categories to categories does not land in small categories-every cocomplete category which is not a preorder is large.



          So, you might want an improved adjunction between large categories and cocomplete categories. However, the category of presheaves on a large category is even larger than large! What this means depends on your foundations. If we work with universes so that a small category is $U_1$-small, then presheaves on a small category are small with respect to the next biggest universe $U_2$. Now presheaves on a $U_2$-small category only have the appropriate universal property if we can them to be presheaves of $U_2$-small sets, and such presheaves are not $U_2$-small.



          So the presheaves-forgetful functor pair cannot form an adjunction, because the desired left adjoint moves us up a universe every time we apply it. Thus in particular we cannot get around this straightforwardly by using universes.



          There are a couple of partial solutions to this problem. The simplest is to regard the formation of the presheaf category as a relative left adjoint to the forgetful functor from cocomplete categories to (possibly) large categories. In other words, it behaves like a left adjoint, but is only partially defined. This is a rephrasing of the theorem you quote-the formation of presheaves behaves like a left adjoint when its input is small.



          A more technical approach is to ask the question: even if the formation of presheaves cannot be left adjoint to the forgetful functor from cocomplete categories to large categories, does this forgetful functor have any left adjoint at all? In fact it does; for instance, it satisfies a 2-categorical version of the general adjoint functor theorem. This left adjoint sends a category $K$ to the subcategory of presheaves on $K$ formed by the colimits of small diagrams of representable presheaves. However, this category of small presheaves is not nearly as well behaved as the presheaf category. It needn't even be a topos in general.



          So to summarize, this is a real issue which cannot be eradicated by any level of generous assumptions on the foundations. It's the go-to example of why size issues cannot be completely ignored in category theory.






          share|cite|improve this answer












          $endgroup$



          The problem is that you cannot choose a domain and codomain for such a putative adjunction consistently and simultaneously. The statement that we have is that the category of presheaves on $C$ is the free cocomplete category on $C$ when $C$ is small. However, the forgetful functor from cocomplete categories to categories does not land in small categories-every cocomplete category which is not a preorder is large.



          So, you might want an improved adjunction between large categories and cocomplete categories. However, the category of presheaves on a large category is even larger than large! What this means depends on your foundations. If we work with universes so that a small category is $U_1$-small, then presheaves on a small category are small with respect to the next biggest universe $U_2$. Now presheaves on a $U_2$-small category only have the appropriate universal property if we can them to be presheaves of $U_2$-small sets, and such presheaves are not $U_2$-small.



          So the presheaves-forgetful functor pair cannot form an adjunction, because the desired left adjoint moves us up a universe every time we apply it. Thus in particular we cannot get around this straightforwardly by using universes.



          There are a couple of partial solutions to this problem. The simplest is to regard the formation of the presheaf category as a relative left adjoint to the forgetful functor from cocomplete categories to (possibly) large categories. In other words, it behaves like a left adjoint, but is only partially defined. This is a rephrasing of the theorem you quote-the formation of presheaves behaves like a left adjoint when its input is small.



          A more technical approach is to ask the question: even if the formation of presheaves cannot be left adjoint to the forgetful functor from cocomplete categories to large categories, does this forgetful functor have any left adjoint at all? In fact it does; for instance, it satisfies a 2-categorical version of the general adjoint functor theorem. This left adjoint sends a category $K$ to the subcategory of presheaves on $K$ formed by the colimits of small diagrams of representable presheaves. However, this category of small presheaves is not nearly as well behaved as the presheaf category. It needn't even be a topos in general.



          So to summarize, this is a real issue which cannot be eradicated by any level of generous assumptions on the foundations. It's the go-to example of why size issues cannot be completely ignored in category theory.







          share|cite|improve this answer















          share|cite|improve this answer




          share|cite|improve this answer



          share|cite|improve this answer








          edited May 2 at 19:04

























          answered May 2 at 18:53









          Kevin CarlsonKevin Carlson

          36.2k3 gold badges37 silver badges78 bronze badges




          36.2k3 gold badges37 silver badges78 bronze badges














          • $begingroup$
            I like this answer, too, because it shows that even with universes we cannot obviously and immediately get around the problem - thank you!
            $endgroup$
            – Nethesis
            May 2 at 19:19
















          • $begingroup$
            I like this answer, too, because it shows that even with universes we cannot obviously and immediately get around the problem - thank you!
            $endgroup$
            – Nethesis
            May 2 at 19:19















          $begingroup$
          I like this answer, too, because it shows that even with universes we cannot obviously and immediately get around the problem - thank you!
          $endgroup$
          – Nethesis
          May 2 at 19:19




          $begingroup$
          I like this answer, too, because it shows that even with universes we cannot obviously and immediately get around the problem - thank you!
          $endgroup$
          – Nethesis
          May 2 at 19:19













          4
















          $begingroup$

          It's tempting to say that we have an adjunction $mathrmPsh dashv U$ between functors $mathbfCat rightleftarrows mathbfCat_textcolim$, where $mathbfCat_textcolim$ is the category of all cocomplete categories and cocontinuous functors. But in order to make sense of the definition of 'adjunction', we need to refer to hom sets, meaning that $mathbfCat$ and $mathbfCat_mathrmcolim$ to be locally small.



          So really $mathbfCat$ is the category of all small categories, and likewise for $mathbfCat_mathrmcolim$.



          However, even if we restricted the statement to small cocomplete categories $mathcalD$, the category $mathrmPsh(mathcalC)$ is not small in general, and so $mathrmPsh$ is not a functor $mathbfCat to mathbfCat_mathrmcolim$.



          However, for fixed small $mathcalC$ and locally small cocomplete $mathcalD$, it makes sense to ask whether there is a bijection between the respective hom sets (or, in this case, an equivalence between hom categories), without requiring the constructions $mathrmPsh$ and $U$ to be functors between categories. So that's the result that is proved in your notes.



          You could hack it using a hierarchy of Grothendieck universes, but I wouldn't recommend it.






          share|cite|improve this answer












          $endgroup$














          • $begingroup$
            Yeah "size issues" always confuse me a bit, because I tend to just think its all relative to your universe anyway. I can see that doing so freely might cause subtle issues and complication to pop up, though. This makes sense, though, so thank you.
            $endgroup$
            – Nethesis
            May 2 at 19:18















          4
















          $begingroup$

          It's tempting to say that we have an adjunction $mathrmPsh dashv U$ between functors $mathbfCat rightleftarrows mathbfCat_textcolim$, where $mathbfCat_textcolim$ is the category of all cocomplete categories and cocontinuous functors. But in order to make sense of the definition of 'adjunction', we need to refer to hom sets, meaning that $mathbfCat$ and $mathbfCat_mathrmcolim$ to be locally small.



          So really $mathbfCat$ is the category of all small categories, and likewise for $mathbfCat_mathrmcolim$.



          However, even if we restricted the statement to small cocomplete categories $mathcalD$, the category $mathrmPsh(mathcalC)$ is not small in general, and so $mathrmPsh$ is not a functor $mathbfCat to mathbfCat_mathrmcolim$.



          However, for fixed small $mathcalC$ and locally small cocomplete $mathcalD$, it makes sense to ask whether there is a bijection between the respective hom sets (or, in this case, an equivalence between hom categories), without requiring the constructions $mathrmPsh$ and $U$ to be functors between categories. So that's the result that is proved in your notes.



          You could hack it using a hierarchy of Grothendieck universes, but I wouldn't recommend it.






          share|cite|improve this answer












          $endgroup$














          • $begingroup$
            Yeah "size issues" always confuse me a bit, because I tend to just think its all relative to your universe anyway. I can see that doing so freely might cause subtle issues and complication to pop up, though. This makes sense, though, so thank you.
            $endgroup$
            – Nethesis
            May 2 at 19:18













          4














          4










          4







          $begingroup$

          It's tempting to say that we have an adjunction $mathrmPsh dashv U$ between functors $mathbfCat rightleftarrows mathbfCat_textcolim$, where $mathbfCat_textcolim$ is the category of all cocomplete categories and cocontinuous functors. But in order to make sense of the definition of 'adjunction', we need to refer to hom sets, meaning that $mathbfCat$ and $mathbfCat_mathrmcolim$ to be locally small.



          So really $mathbfCat$ is the category of all small categories, and likewise for $mathbfCat_mathrmcolim$.



          However, even if we restricted the statement to small cocomplete categories $mathcalD$, the category $mathrmPsh(mathcalC)$ is not small in general, and so $mathrmPsh$ is not a functor $mathbfCat to mathbfCat_mathrmcolim$.



          However, for fixed small $mathcalC$ and locally small cocomplete $mathcalD$, it makes sense to ask whether there is a bijection between the respective hom sets (or, in this case, an equivalence between hom categories), without requiring the constructions $mathrmPsh$ and $U$ to be functors between categories. So that's the result that is proved in your notes.



          You could hack it using a hierarchy of Grothendieck universes, but I wouldn't recommend it.






          share|cite|improve this answer












          $endgroup$



          It's tempting to say that we have an adjunction $mathrmPsh dashv U$ between functors $mathbfCat rightleftarrows mathbfCat_textcolim$, where $mathbfCat_textcolim$ is the category of all cocomplete categories and cocontinuous functors. But in order to make sense of the definition of 'adjunction', we need to refer to hom sets, meaning that $mathbfCat$ and $mathbfCat_mathrmcolim$ to be locally small.



          So really $mathbfCat$ is the category of all small categories, and likewise for $mathbfCat_mathrmcolim$.



          However, even if we restricted the statement to small cocomplete categories $mathcalD$, the category $mathrmPsh(mathcalC)$ is not small in general, and so $mathrmPsh$ is not a functor $mathbfCat to mathbfCat_mathrmcolim$.



          However, for fixed small $mathcalC$ and locally small cocomplete $mathcalD$, it makes sense to ask whether there is a bijection between the respective hom sets (or, in this case, an equivalence between hom categories), without requiring the constructions $mathrmPsh$ and $U$ to be functors between categories. So that's the result that is proved in your notes.



          You could hack it using a hierarchy of Grothendieck universes, but I wouldn't recommend it.







          share|cite|improve this answer















          share|cite|improve this answer




          share|cite|improve this answer



          share|cite|improve this answer








          edited May 2 at 18:40

























          answered May 2 at 18:32









          Clive NewsteadClive Newstead

          55k4 gold badges75 silver badges139 bronze badges




          55k4 gold badges75 silver badges139 bronze badges














          • $begingroup$
            Yeah "size issues" always confuse me a bit, because I tend to just think its all relative to your universe anyway. I can see that doing so freely might cause subtle issues and complication to pop up, though. This makes sense, though, so thank you.
            $endgroup$
            – Nethesis
            May 2 at 19:18
















          • $begingroup$
            Yeah "size issues" always confuse me a bit, because I tend to just think its all relative to your universe anyway. I can see that doing so freely might cause subtle issues and complication to pop up, though. This makes sense, though, so thank you.
            $endgroup$
            – Nethesis
            May 2 at 19:18















          $begingroup$
          Yeah "size issues" always confuse me a bit, because I tend to just think its all relative to your universe anyway. I can see that doing so freely might cause subtle issues and complication to pop up, though. This makes sense, though, so thank you.
          $endgroup$
          – Nethesis
          May 2 at 19:18




          $begingroup$
          Yeah "size issues" always confuse me a bit, because I tend to just think its all relative to your universe anyway. I can see that doing so freely might cause subtle issues and complication to pop up, though. This makes sense, though, so thank you.
          $endgroup$
          – Nethesis
          May 2 at 19:18


















          draft saved

          draft discarded















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3211339%2fwhat-exactly-are-the-size-issues-preventing-formation-of-presheaves-being-a-le%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown









          Popular posts from this blog

          Tamil (spriik) Luke uk diar | Nawigatjuun

          Align equal signs while including text over equalitiesAMS align: left aligned text/math plus multicolumn alignmentMultiple alignmentsAligning equations in multiple placesNumbering and aligning an equation with multiple columnsHow to align one equation with another multline equationUsing \ in environments inside the begintabularxNumber equations and preserving alignment of equal signsHow can I align equations to the left and to the right?Double equation alignment problem within align enviromentAligned within align: Why are they right-aligned?

          Training a classifier when some of the features are unknownWhy does Gradient Boosting regression predict negative values when there are no negative y-values in my training set?How to improve an existing (trained) classifier?What is effect when I set up some self defined predisctor variables?Why Matlab neural network classification returns decimal values on prediction dataset?Fitting and transforming text data in training, testing, and validation setsHow to quantify the performance of the classifier (multi-class SVM) using the test data?How do I control for some patients providing multiple samples in my training data?Training and Test setTraining a convolutional neural network for image denoising in MatlabShouldn't an autoencoder with #(neurons in hidden layer) = #(neurons in input layer) be “perfect”?