The size of sheafificationThe single-plus construction is not the left adjoint of the inclusion of separated presheaves?Is Sheafification Functor Exact?Sheafification via hypercoversSheafification - Why does twice suffice?Sheafification of a presheaf through the etale spacefpqc sheafification and localisationI'll admit it: I don't understand the definition of the Easton product.Sheafification map is surjectiveOn computability of sheafificationOn a weak notion of sheaves on topological spaces

The size of sheafification


The single-plus construction is not the left adjoint of the inclusion of separated presheaves?Is Sheafification Functor Exact?Sheafification via hypercoversSheafification - Why does twice suffice?Sheafification of a presheaf through the etale spacefpqc sheafification and localisationI'll admit it: I don't understand the definition of the Easton product.Sheafification map is surjectiveOn computability of sheafificationOn a weak notion of sheaves on topological spaces













3












$begingroup$


Let $X$ be a small site. Let $aleph$ be an infinite cardinal, such that $|Ob(X)|leq aleph$ and $|Mor(X)|leq aleph$, where $Mor(X)$ is the set of all morphisms.



We define the size of a presheaf $F$ of sets (or abelian groups, or modules, or ...) as
$$
|F|=left|bigsqcup_Uin X F(U)right|
$$



In Flat Covers and Cotorsion Envelopes of Sheaves by Enochs and Oyonarte the authors mention in passing (on the last page) that if $|F|leq aleph$, then $|F^sh|leq aleph^aleph$. I was not able to find a reference, but I seem to have an argument for a much stronger bound. I am curious if and where I made a mistake.



For simplicity let us take presheaves of abelian groups for now.



It is well known that the sheafification can be constructed in two steps via the $(-)^nmid$ funtor defined as
$$
(F^nmid)(U)=textcolim_lbrace U_ito Urbracekerleft(prod F(U_i)to prod F(U_itimes_U U_j)right)
$$

Then for any presheaf $F^nmid$ is separated, and for a separated presheaf $F^nmid$ is a sheaf. In particular $(F^nmid)^nmid$ is always a sheaf.



Now if $|F|leq beth$ we can estimate $|F^nmid|$ as follows. Each kernel can have at most $alephtimes beth$ many elements. The colimit is constructed from the direct sum, which can be estimated from the product, and there are at most $2^alephtimesaleph=2^aleph$ many coverings. So we see
$$
|F^nmid(U)|leq 2^alephtimes beth
$$

and since there are at most $aleph$ objects we conclude $|F^nmid|leq 2^alephtimes beth$. In particular if $aleph=beth$ we find $|F^nmid|leq 2^aleph$ and $|F^sh|leq 2^aleph times2^aleph=2^aleph$, which is stronger than what Enochs and Oyonarte claimed.










share|cite|improve this question











$endgroup$









  • 3




    $begingroup$
    If I am not wrong, you are using that the cardinal is infinite. Using monotonicity in the base, in this case you have $2^aleph <= (aleph)^aleph <= (2^aleph)^aleph = 2^aleph times aleph = 2^aleph$ so that the bound is the same (I haven't checked the proof yet).
    $endgroup$
    – Andrea Marino
    Aug 7 at 12:15










  • $begingroup$
    Yes you are right, I forgot to add that.
    $endgroup$
    – Rene Recktenwald
    Aug 7 at 12:36






  • 1




    $begingroup$
    @Andrea: Weird that you know $aleph$ and $times$ but not $leq$.
    $endgroup$
    – Asaf Karagila
    Aug 7 at 12:47










  • $begingroup$
    @asaf: ahaha lol. Its been a while that I don't tex-write down (I am on holiday)!
    $endgroup$
    – Andrea Marino
    Aug 7 at 13:04















3












$begingroup$


Let $X$ be a small site. Let $aleph$ be an infinite cardinal, such that $|Ob(X)|leq aleph$ and $|Mor(X)|leq aleph$, where $Mor(X)$ is the set of all morphisms.



We define the size of a presheaf $F$ of sets (or abelian groups, or modules, or ...) as
$$
|F|=left|bigsqcup_Uin X F(U)right|
$$



In Flat Covers and Cotorsion Envelopes of Sheaves by Enochs and Oyonarte the authors mention in passing (on the last page) that if $|F|leq aleph$, then $|F^sh|leq aleph^aleph$. I was not able to find a reference, but I seem to have an argument for a much stronger bound. I am curious if and where I made a mistake.



For simplicity let us take presheaves of abelian groups for now.



It is well known that the sheafification can be constructed in two steps via the $(-)^nmid$ funtor defined as
$$
(F^nmid)(U)=textcolim_lbrace U_ito Urbracekerleft(prod F(U_i)to prod F(U_itimes_U U_j)right)
$$

Then for any presheaf $F^nmid$ is separated, and for a separated presheaf $F^nmid$ is a sheaf. In particular $(F^nmid)^nmid$ is always a sheaf.



Now if $|F|leq beth$ we can estimate $|F^nmid|$ as follows. Each kernel can have at most $alephtimes beth$ many elements. The colimit is constructed from the direct sum, which can be estimated from the product, and there are at most $2^alephtimesaleph=2^aleph$ many coverings. So we see
$$
|F^nmid(U)|leq 2^alephtimes beth
$$

and since there are at most $aleph$ objects we conclude $|F^nmid|leq 2^alephtimes beth$. In particular if $aleph=beth$ we find $|F^nmid|leq 2^aleph$ and $|F^sh|leq 2^aleph times2^aleph=2^aleph$, which is stronger than what Enochs and Oyonarte claimed.










share|cite|improve this question











$endgroup$









  • 3




    $begingroup$
    If I am not wrong, you are using that the cardinal is infinite. Using monotonicity in the base, in this case you have $2^aleph <= (aleph)^aleph <= (2^aleph)^aleph = 2^aleph times aleph = 2^aleph$ so that the bound is the same (I haven't checked the proof yet).
    $endgroup$
    – Andrea Marino
    Aug 7 at 12:15










  • $begingroup$
    Yes you are right, I forgot to add that.
    $endgroup$
    – Rene Recktenwald
    Aug 7 at 12:36






  • 1




    $begingroup$
    @Andrea: Weird that you know $aleph$ and $times$ but not $leq$.
    $endgroup$
    – Asaf Karagila
    Aug 7 at 12:47










  • $begingroup$
    @asaf: ahaha lol. Its been a while that I don't tex-write down (I am on holiday)!
    $endgroup$
    – Andrea Marino
    Aug 7 at 13:04













3












3








3





$begingroup$


Let $X$ be a small site. Let $aleph$ be an infinite cardinal, such that $|Ob(X)|leq aleph$ and $|Mor(X)|leq aleph$, where $Mor(X)$ is the set of all morphisms.



We define the size of a presheaf $F$ of sets (or abelian groups, or modules, or ...) as
$$
|F|=left|bigsqcup_Uin X F(U)right|
$$



In Flat Covers and Cotorsion Envelopes of Sheaves by Enochs and Oyonarte the authors mention in passing (on the last page) that if $|F|leq aleph$, then $|F^sh|leq aleph^aleph$. I was not able to find a reference, but I seem to have an argument for a much stronger bound. I am curious if and where I made a mistake.



For simplicity let us take presheaves of abelian groups for now.



It is well known that the sheafification can be constructed in two steps via the $(-)^nmid$ funtor defined as
$$
(F^nmid)(U)=textcolim_lbrace U_ito Urbracekerleft(prod F(U_i)to prod F(U_itimes_U U_j)right)
$$

Then for any presheaf $F^nmid$ is separated, and for a separated presheaf $F^nmid$ is a sheaf. In particular $(F^nmid)^nmid$ is always a sheaf.



Now if $|F|leq beth$ we can estimate $|F^nmid|$ as follows. Each kernel can have at most $alephtimes beth$ many elements. The colimit is constructed from the direct sum, which can be estimated from the product, and there are at most $2^alephtimesaleph=2^aleph$ many coverings. So we see
$$
|F^nmid(U)|leq 2^alephtimes beth
$$

and since there are at most $aleph$ objects we conclude $|F^nmid|leq 2^alephtimes beth$. In particular if $aleph=beth$ we find $|F^nmid|leq 2^aleph$ and $|F^sh|leq 2^aleph times2^aleph=2^aleph$, which is stronger than what Enochs and Oyonarte claimed.










share|cite|improve this question











$endgroup$




Let $X$ be a small site. Let $aleph$ be an infinite cardinal, such that $|Ob(X)|leq aleph$ and $|Mor(X)|leq aleph$, where $Mor(X)$ is the set of all morphisms.



We define the size of a presheaf $F$ of sets (or abelian groups, or modules, or ...) as
$$
|F|=left|bigsqcup_Uin X F(U)right|
$$



In Flat Covers and Cotorsion Envelopes of Sheaves by Enochs and Oyonarte the authors mention in passing (on the last page) that if $|F|leq aleph$, then $|F^sh|leq aleph^aleph$. I was not able to find a reference, but I seem to have an argument for a much stronger bound. I am curious if and where I made a mistake.



For simplicity let us take presheaves of abelian groups for now.



It is well known that the sheafification can be constructed in two steps via the $(-)^nmid$ funtor defined as
$$
(F^nmid)(U)=textcolim_lbrace U_ito Urbracekerleft(prod F(U_i)to prod F(U_itimes_U U_j)right)
$$

Then for any presheaf $F^nmid$ is separated, and for a separated presheaf $F^nmid$ is a sheaf. In particular $(F^nmid)^nmid$ is always a sheaf.



Now if $|F|leq beth$ we can estimate $|F^nmid|$ as follows. Each kernel can have at most $alephtimes beth$ many elements. The colimit is constructed from the direct sum, which can be estimated from the product, and there are at most $2^alephtimesaleph=2^aleph$ many coverings. So we see
$$
|F^nmid(U)|leq 2^alephtimes beth
$$

and since there are at most $aleph$ objects we conclude $|F^nmid|leq 2^alephtimes beth$. In particular if $aleph=beth$ we find $|F^nmid|leq 2^aleph$ and $|F^sh|leq 2^aleph times2^aleph=2^aleph$, which is stronger than what Enochs and Oyonarte claimed.







set-theory sheaf-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 7 at 12:36







Rene Recktenwald

















asked Aug 7 at 12:07









Rene RecktenwaldRene Recktenwald

2781 silver badge8 bronze badges




2781 silver badge8 bronze badges










  • 3




    $begingroup$
    If I am not wrong, you are using that the cardinal is infinite. Using monotonicity in the base, in this case you have $2^aleph <= (aleph)^aleph <= (2^aleph)^aleph = 2^aleph times aleph = 2^aleph$ so that the bound is the same (I haven't checked the proof yet).
    $endgroup$
    – Andrea Marino
    Aug 7 at 12:15










  • $begingroup$
    Yes you are right, I forgot to add that.
    $endgroup$
    – Rene Recktenwald
    Aug 7 at 12:36






  • 1




    $begingroup$
    @Andrea: Weird that you know $aleph$ and $times$ but not $leq$.
    $endgroup$
    – Asaf Karagila
    Aug 7 at 12:47










  • $begingroup$
    @asaf: ahaha lol. Its been a while that I don't tex-write down (I am on holiday)!
    $endgroup$
    – Andrea Marino
    Aug 7 at 13:04












  • 3




    $begingroup$
    If I am not wrong, you are using that the cardinal is infinite. Using monotonicity in the base, in this case you have $2^aleph <= (aleph)^aleph <= (2^aleph)^aleph = 2^aleph times aleph = 2^aleph$ so that the bound is the same (I haven't checked the proof yet).
    $endgroup$
    – Andrea Marino
    Aug 7 at 12:15










  • $begingroup$
    Yes you are right, I forgot to add that.
    $endgroup$
    – Rene Recktenwald
    Aug 7 at 12:36






  • 1




    $begingroup$
    @Andrea: Weird that you know $aleph$ and $times$ but not $leq$.
    $endgroup$
    – Asaf Karagila
    Aug 7 at 12:47










  • $begingroup$
    @asaf: ahaha lol. Its been a while that I don't tex-write down (I am on holiday)!
    $endgroup$
    – Andrea Marino
    Aug 7 at 13:04







3




3




$begingroup$
If I am not wrong, you are using that the cardinal is infinite. Using monotonicity in the base, in this case you have $2^aleph <= (aleph)^aleph <= (2^aleph)^aleph = 2^aleph times aleph = 2^aleph$ so that the bound is the same (I haven't checked the proof yet).
$endgroup$
– Andrea Marino
Aug 7 at 12:15




$begingroup$
If I am not wrong, you are using that the cardinal is infinite. Using monotonicity in the base, in this case you have $2^aleph <= (aleph)^aleph <= (2^aleph)^aleph = 2^aleph times aleph = 2^aleph$ so that the bound is the same (I haven't checked the proof yet).
$endgroup$
– Andrea Marino
Aug 7 at 12:15












$begingroup$
Yes you are right, I forgot to add that.
$endgroup$
– Rene Recktenwald
Aug 7 at 12:36




$begingroup$
Yes you are right, I forgot to add that.
$endgroup$
– Rene Recktenwald
Aug 7 at 12:36




1




1




$begingroup$
@Andrea: Weird that you know $aleph$ and $times$ but not $leq$.
$endgroup$
– Asaf Karagila
Aug 7 at 12:47




$begingroup$
@Andrea: Weird that you know $aleph$ and $times$ but not $leq$.
$endgroup$
– Asaf Karagila
Aug 7 at 12:47












$begingroup$
@asaf: ahaha lol. Its been a while that I don't tex-write down (I am on holiday)!
$endgroup$
– Andrea Marino
Aug 7 at 13:04




$begingroup$
@asaf: ahaha lol. Its been a while that I don't tex-write down (I am on holiday)!
$endgroup$
– Andrea Marino
Aug 7 at 13:04










1 Answer
1






active

oldest

votes


















7












$begingroup$

I'm going to write "$kappa$" for your "$aleph$," to more consistently match set-theoretic usage.



While $2^kappa$ appears a sharper bound than $kappa^kappa$, they are in fact the same (for infinite $kappa$ at least, and I don't think finite $kappa$ are important here). $2^kappalekappa^kappa$ is clear. For the other direction, we have $kappale 2^kappa$, so $$kappa^kappale(2^kappa)^kappa=2^kappatimeskappa=2^kappa.$$ More generally, whenever $kappa$ is infinite and $2<lambda<kappa$ we have $2^kappa=lambda^kappa=kappa^kappa$.






share|cite|improve this answer









$endgroup$

















    Your Answer








    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "504"
    ;
    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/3.0/"u003ecc by-sa 3.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%2fmathoverflow.net%2fquestions%2f337822%2fthe-size-of-sheafification%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    7












    $begingroup$

    I'm going to write "$kappa$" for your "$aleph$," to more consistently match set-theoretic usage.



    While $2^kappa$ appears a sharper bound than $kappa^kappa$, they are in fact the same (for infinite $kappa$ at least, and I don't think finite $kappa$ are important here). $2^kappalekappa^kappa$ is clear. For the other direction, we have $kappale 2^kappa$, so $$kappa^kappale(2^kappa)^kappa=2^kappatimeskappa=2^kappa.$$ More generally, whenever $kappa$ is infinite and $2<lambda<kappa$ we have $2^kappa=lambda^kappa=kappa^kappa$.






    share|cite|improve this answer









    $endgroup$



















      7












      $begingroup$

      I'm going to write "$kappa$" for your "$aleph$," to more consistently match set-theoretic usage.



      While $2^kappa$ appears a sharper bound than $kappa^kappa$, they are in fact the same (for infinite $kappa$ at least, and I don't think finite $kappa$ are important here). $2^kappalekappa^kappa$ is clear. For the other direction, we have $kappale 2^kappa$, so $$kappa^kappale(2^kappa)^kappa=2^kappatimeskappa=2^kappa.$$ More generally, whenever $kappa$ is infinite and $2<lambda<kappa$ we have $2^kappa=lambda^kappa=kappa^kappa$.






      share|cite|improve this answer









      $endgroup$

















        7












        7








        7





        $begingroup$

        I'm going to write "$kappa$" for your "$aleph$," to more consistently match set-theoretic usage.



        While $2^kappa$ appears a sharper bound than $kappa^kappa$, they are in fact the same (for infinite $kappa$ at least, and I don't think finite $kappa$ are important here). $2^kappalekappa^kappa$ is clear. For the other direction, we have $kappale 2^kappa$, so $$kappa^kappale(2^kappa)^kappa=2^kappatimeskappa=2^kappa.$$ More generally, whenever $kappa$ is infinite and $2<lambda<kappa$ we have $2^kappa=lambda^kappa=kappa^kappa$.






        share|cite|improve this answer









        $endgroup$



        I'm going to write "$kappa$" for your "$aleph$," to more consistently match set-theoretic usage.



        While $2^kappa$ appears a sharper bound than $kappa^kappa$, they are in fact the same (for infinite $kappa$ at least, and I don't think finite $kappa$ are important here). $2^kappalekappa^kappa$ is clear. For the other direction, we have $kappale 2^kappa$, so $$kappa^kappale(2^kappa)^kappa=2^kappatimeskappa=2^kappa.$$ More generally, whenever $kappa$ is infinite and $2<lambda<kappa$ we have $2^kappa=lambda^kappa=kappa^kappa$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Aug 7 at 12:26









        Noah SchweberNoah Schweber

        20.7k3 gold badges53 silver badges154 bronze badges




        20.7k3 gold badges53 silver badges154 bronze badges






























            draft saved

            draft discarded
















































            Thanks for contributing an answer to MathOverflow!


            • 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%2fmathoverflow.net%2fquestions%2f337822%2fthe-size-of-sheafification%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

            Category:9 (number) SubcategoriesMedia in category "9 (number)"Navigation menuUpload mediaGND ID: 4485639-8Library of Congress authority ID: sh85091979ReasonatorScholiaStatistics

            Circuit construction for execution of conditional statements using least significant bitHow are two different registers being used as “control”?How exactly is the stated composite state of the two registers being produced using the $R_zz$ controlled rotations?Efficiently performing controlled rotations in HHLWould this quantum algorithm implementation work?How to prepare a superposed states of odd integers from $1$ to $sqrtN$?Why is this implementation of the order finding algorithm not working?Circuit construction for Hamiltonian simulationHow can I invert the least significant bit of a certain term of a superposed state?Implementing an oracleImplementing a controlled sum operation

            Magento 2 “No Payment Methods” in Admin New OrderHow to integrate Paypal Express Checkout with the Magento APIMagento 1.5 - Sales > Order > edit order and shipping methods disappearAuto Invoice Check/Money Order Payment methodAdd more simple payment methods?Shipping methods not showingWhat should I do to change payment methods if changing the configuration has no effects?1.9 - No Payment Methods showing upMy Payment Methods not Showing for downloadable/virtual product when checkout?Magento2 API to access internal payment methodHow to call an existing payment methods in the registration form?