Are there rings with uncountably many irreducible elements (prime elements, if in a PID)?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
2
down vote

favorite












I'm playing around and trying to construct rings with different numbers of irreducible elements, hence the above question.










share|cite|improve this question









New contributor




Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.















  • 1




    Massive overkill: since being irreducible/prime is a first-order condition, take a nontrivial ultrapower of any ring with infinitely many irreducible elements.
    – Noah Schweber
    3 hours ago










  • @NoahSchweber: The term "first-order" is very common but seems to be one used in different branches of mathematics with different meanings. And ultrafilter is also unfamiliar to me. But if a a result in algebra can be proved from other branches I'd be happy to learn more about that branch. Is that logic?
    – P Vanchinathan
    2 hours ago














up vote
2
down vote

favorite












I'm playing around and trying to construct rings with different numbers of irreducible elements, hence the above question.










share|cite|improve this question









New contributor




Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.















  • 1




    Massive overkill: since being irreducible/prime is a first-order condition, take a nontrivial ultrapower of any ring with infinitely many irreducible elements.
    – Noah Schweber
    3 hours ago










  • @NoahSchweber: The term "first-order" is very common but seems to be one used in different branches of mathematics with different meanings. And ultrafilter is also unfamiliar to me. But if a a result in algebra can be proved from other branches I'd be happy to learn more about that branch. Is that logic?
    – P Vanchinathan
    2 hours ago












up vote
2
down vote

favorite









up vote
2
down vote

favorite











I'm playing around and trying to construct rings with different numbers of irreducible elements, hence the above question.










share|cite|improve this question









New contributor




Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











I'm playing around and trying to construct rings with different numbers of irreducible elements, hence the above question.







elementary-set-theory ring-theory






share|cite|improve this question









New contributor




Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 3 hours ago









Andrés E. Caicedo

64k7156239




64k7156239






New contributor




Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 3 hours ago









Federica Zanni

112




112




New contributor




Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Federica Zanni is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







  • 1




    Massive overkill: since being irreducible/prime is a first-order condition, take a nontrivial ultrapower of any ring with infinitely many irreducible elements.
    – Noah Schweber
    3 hours ago










  • @NoahSchweber: The term "first-order" is very common but seems to be one used in different branches of mathematics with different meanings. And ultrafilter is also unfamiliar to me. But if a a result in algebra can be proved from other branches I'd be happy to learn more about that branch. Is that logic?
    – P Vanchinathan
    2 hours ago












  • 1




    Massive overkill: since being irreducible/prime is a first-order condition, take a nontrivial ultrapower of any ring with infinitely many irreducible elements.
    – Noah Schweber
    3 hours ago










  • @NoahSchweber: The term "first-order" is very common but seems to be one used in different branches of mathematics with different meanings. And ultrafilter is also unfamiliar to me. But if a a result in algebra can be proved from other branches I'd be happy to learn more about that branch. Is that logic?
    – P Vanchinathan
    2 hours ago







1




1




Massive overkill: since being irreducible/prime is a first-order condition, take a nontrivial ultrapower of any ring with infinitely many irreducible elements.
– Noah Schweber
3 hours ago




Massive overkill: since being irreducible/prime is a first-order condition, take a nontrivial ultrapower of any ring with infinitely many irreducible elements.
– Noah Schweber
3 hours ago












@NoahSchweber: The term "first-order" is very common but seems to be one used in different branches of mathematics with different meanings. And ultrafilter is also unfamiliar to me. But if a a result in algebra can be proved from other branches I'd be happy to learn more about that branch. Is that logic?
– P Vanchinathan
2 hours ago




@NoahSchweber: The term "first-order" is very common but seems to be one used in different branches of mathematics with different meanings. And ultrafilter is also unfamiliar to me. But if a a result in algebra can be proved from other branches I'd be happy to learn more about that branch. Is that logic?
– P Vanchinathan
2 hours ago










1 Answer
1






active

oldest

votes

















up vote
5
down vote













Take a polynomial ring in a single variable $x$ with coefficients in real numbers (or complex numbers, what is important is the uncountablity). Then all degree one polynomials $(x-alpha)$ are irreducible. Being degree 1 they cannot be products of lower degree polynomials!
This being a PID irreducible, prime are one and the same.






share|cite|improve this answer




















    Your Answer




    StackExchange.ifUsing("editor", function ()
    return StackExchange.using("mathjaxEditing", function ()
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    );
    );
    , "mathjax-editing");

    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',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );






    Federica Zanni is a new contributor. Be nice, and check out our Code of Conduct.









     

    draft saved


    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2977040%2fare-there-rings-with-uncountably-many-irreducible-elements-prime-elements-if-i%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    5
    down vote













    Take a polynomial ring in a single variable $x$ with coefficients in real numbers (or complex numbers, what is important is the uncountablity). Then all degree one polynomials $(x-alpha)$ are irreducible. Being degree 1 they cannot be products of lower degree polynomials!
    This being a PID irreducible, prime are one and the same.






    share|cite|improve this answer
























      up vote
      5
      down vote













      Take a polynomial ring in a single variable $x$ with coefficients in real numbers (or complex numbers, what is important is the uncountablity). Then all degree one polynomials $(x-alpha)$ are irreducible. Being degree 1 they cannot be products of lower degree polynomials!
      This being a PID irreducible, prime are one and the same.






      share|cite|improve this answer






















        up vote
        5
        down vote










        up vote
        5
        down vote









        Take a polynomial ring in a single variable $x$ with coefficients in real numbers (or complex numbers, what is important is the uncountablity). Then all degree one polynomials $(x-alpha)$ are irreducible. Being degree 1 they cannot be products of lower degree polynomials!
        This being a PID irreducible, prime are one and the same.






        share|cite|improve this answer












        Take a polynomial ring in a single variable $x$ with coefficients in real numbers (or complex numbers, what is important is the uncountablity). Then all degree one polynomials $(x-alpha)$ are irreducible. Being degree 1 they cannot be products of lower degree polynomials!
        This being a PID irreducible, prime are one and the same.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 3 hours ago









        P Vanchinathan

        14.4k12036




        14.4k12036




















            Federica Zanni is a new contributor. Be nice, and check out our Code of Conduct.









             

            draft saved


            draft discarded


















            Federica Zanni is a new contributor. Be nice, and check out our Code of Conduct.












            Federica Zanni is a new contributor. Be nice, and check out our Code of Conduct.











            Federica Zanni is a new contributor. Be nice, and check out our Code of Conduct.













             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2977040%2fare-there-rings-with-uncountably-many-irreducible-elements-prime-elements-if-i%23new-answer', 'question_page');

            );

            Post as a guest













































































            Popular posts from this blog

            How to check contact read email or not when send email to Individual?

            Displaying single band from multi-band raster using QGIS

            How many registers does an x86_64 CPU actually have?