Proof that R is uncountable using diagonalization The Next CEO of Stack OverflowWhy does Cantor's Proof (that R is uncountable) fail for Q?Infinite Cartesian product of countable sets is uncountableis it possible to proof that this number is not rationalProof that $Bbb R$ is uncountable.show $[0,1]$ is uncountable using outer measureHow to pick decimal expansion in the proof that $(0,1)$ uncountableUncountable intersection of uncountable setsFalse proofs claiming that $mathbbQ$ is uncountable.Proving that the interval $(0,1)$ is uncountableGeneral methods for proving countability and uncountability

Why this way of making earth uninhabitable in Interstellar?

What does "Its cash flow is deeply negative" mean?

Make solar eclipses exceedingly rare, but still have new moons

Why did CATV standarize in 75 ohms and everyone else in 50?

Would this house-rule that treats advantage as a +1 to the roll instead (and disadvantage as -1) and allows them to stack be balanced?

I believe this to be a fraud - hired, then asked to cash check and send cash as Bitcoin

Chain wire methods together in Lightning Web Components

Why isn't acceleration always zero whenever velocity is zero, such as the moment a ball bounces off a wall?

Powershell. How to parse gci Name?

Proper way to express "He disappeared them"

Why is information "lost" when it got into a black hole?

How to count occurrences of text in a file?

Is micro rebar a better way to reinforce concrete than rebar?

Why does the flight controls check come before arming the autobrake on the A320?

Can we say or write : "No, it'sn't"?

Is wanting to ask what to write an indication that you need to change your story?

Does increasing your ability score affect your main stat?

Can MTA send mail via a relay without being told so?

Math-accent symbol over parentheses enclosing accented symbol (amsmath)

Running a General Election and the European Elections together

Prepend last line of stdin to entire stdin

Should I cite using beginthebibliography or beginfilecontents*

Why don't programming languages automatically manage the synchronous/asynchronous problem?

Bartok - Syncopation (1): Meaning of notes in between Grand Staff



Proof that R is uncountable using diagonalization



The Next CEO of Stack OverflowWhy does Cantor's Proof (that R is uncountable) fail for Q?Infinite Cartesian product of countable sets is uncountableis it possible to proof that this number is not rationalProof that $Bbb R$ is uncountable.show $[0,1]$ is uncountable using outer measureHow to pick decimal expansion in the proof that $(0,1)$ uncountableUncountable intersection of uncountable setsFalse proofs claiming that $mathbbQ$ is uncountable.Proving that the interval $(0,1)$ is uncountableGeneral methods for proving countability and uncountability










0












$begingroup$


I understand that in order to prove that $BbbR$ is uncountable, one must show that the following list can be compiled:



$$x_1=x_11x_12x_13\x_2=x_21x_22x_23\x_3=x_31x_32x_33\.\.\.$$



But from here I am not sure how one might show that there is some decimal expansion in $(0,1)$ that is not ‘hit’, and so that $f:BbbNrightarrow(0,1)$ is not bijective, and so that $BbbR$ is not countable.










share|cite|improve this question







New contributor




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







$endgroup$







  • 2




    $begingroup$
    You need to show the list $cannot$ be compiled. The argument is by contradiction: Assume it is countable, therefore it can be "listed". Now you assume that is an exhaustive list of its elements, and then create a new element not contained in the list. Therefore the list is not exhaustive. Now, since adding that new element to the list does not solve the problem, the original assumption of countability was wrong
    $endgroup$
    – Fede Poncio
    Mar 27 at 19:08










  • $begingroup$
    Precisely, @FedePoncio. And you have given a good concise explanation of the proof for OP.
    $endgroup$
    – Lubin
    Mar 27 at 19:13















0












$begingroup$


I understand that in order to prove that $BbbR$ is uncountable, one must show that the following list can be compiled:



$$x_1=x_11x_12x_13\x_2=x_21x_22x_23\x_3=x_31x_32x_33\.\.\.$$



But from here I am not sure how one might show that there is some decimal expansion in $(0,1)$ that is not ‘hit’, and so that $f:BbbNrightarrow(0,1)$ is not bijective, and so that $BbbR$ is not countable.










share|cite|improve this question







New contributor




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







$endgroup$







  • 2




    $begingroup$
    You need to show the list $cannot$ be compiled. The argument is by contradiction: Assume it is countable, therefore it can be "listed". Now you assume that is an exhaustive list of its elements, and then create a new element not contained in the list. Therefore the list is not exhaustive. Now, since adding that new element to the list does not solve the problem, the original assumption of countability was wrong
    $endgroup$
    – Fede Poncio
    Mar 27 at 19:08










  • $begingroup$
    Precisely, @FedePoncio. And you have given a good concise explanation of the proof for OP.
    $endgroup$
    – Lubin
    Mar 27 at 19:13













0












0








0





$begingroup$


I understand that in order to prove that $BbbR$ is uncountable, one must show that the following list can be compiled:



$$x_1=x_11x_12x_13\x_2=x_21x_22x_23\x_3=x_31x_32x_33\.\.\.$$



But from here I am not sure how one might show that there is some decimal expansion in $(0,1)$ that is not ‘hit’, and so that $f:BbbNrightarrow(0,1)$ is not bijective, and so that $BbbR$ is not countable.










share|cite|improve this question







New contributor




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







$endgroup$




I understand that in order to prove that $BbbR$ is uncountable, one must show that the following list can be compiled:



$$x_1=x_11x_12x_13\x_2=x_21x_22x_23\x_3=x_31x_32x_33\.\.\.$$



But from here I am not sure how one might show that there is some decimal expansion in $(0,1)$ that is not ‘hit’, and so that $f:BbbNrightarrow(0,1)$ is not bijective, and so that $BbbR$ is not countable.







real-analysis analysis






share|cite|improve this question







New contributor




Ali Lodhi 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




Ali Lodhi 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






New contributor




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









asked Mar 27 at 18:55









Ali LodhiAli Lodhi

343




343




New contributor




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





New contributor





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






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







  • 2




    $begingroup$
    You need to show the list $cannot$ be compiled. The argument is by contradiction: Assume it is countable, therefore it can be "listed". Now you assume that is an exhaustive list of its elements, and then create a new element not contained in the list. Therefore the list is not exhaustive. Now, since adding that new element to the list does not solve the problem, the original assumption of countability was wrong
    $endgroup$
    – Fede Poncio
    Mar 27 at 19:08










  • $begingroup$
    Precisely, @FedePoncio. And you have given a good concise explanation of the proof for OP.
    $endgroup$
    – Lubin
    Mar 27 at 19:13












  • 2




    $begingroup$
    You need to show the list $cannot$ be compiled. The argument is by contradiction: Assume it is countable, therefore it can be "listed". Now you assume that is an exhaustive list of its elements, and then create a new element not contained in the list. Therefore the list is not exhaustive. Now, since adding that new element to the list does not solve the problem, the original assumption of countability was wrong
    $endgroup$
    – Fede Poncio
    Mar 27 at 19:08










  • $begingroup$
    Precisely, @FedePoncio. And you have given a good concise explanation of the proof for OP.
    $endgroup$
    – Lubin
    Mar 27 at 19:13







2




2




$begingroup$
You need to show the list $cannot$ be compiled. The argument is by contradiction: Assume it is countable, therefore it can be "listed". Now you assume that is an exhaustive list of its elements, and then create a new element not contained in the list. Therefore the list is not exhaustive. Now, since adding that new element to the list does not solve the problem, the original assumption of countability was wrong
$endgroup$
– Fede Poncio
Mar 27 at 19:08




$begingroup$
You need to show the list $cannot$ be compiled. The argument is by contradiction: Assume it is countable, therefore it can be "listed". Now you assume that is an exhaustive list of its elements, and then create a new element not contained in the list. Therefore the list is not exhaustive. Now, since adding that new element to the list does not solve the problem, the original assumption of countability was wrong
$endgroup$
– Fede Poncio
Mar 27 at 19:08












$begingroup$
Precisely, @FedePoncio. And you have given a good concise explanation of the proof for OP.
$endgroup$
– Lubin
Mar 27 at 19:13




$begingroup$
Precisely, @FedePoncio. And you have given a good concise explanation of the proof for OP.
$endgroup$
– Lubin
Mar 27 at 19:13










1 Answer
1






active

oldest

votes


















1












$begingroup$

Consider a sequence $y=y_1y_2y_3...$ such that for each $i$, $y_i neq x_ii$.



If $y=x_n$ for an integer $n$, then considering the $n-$th decimal, you would have $y_n=x_nn$. This is not true.



So $y$ is not one of the $x_n$.






share|cite|improve this answer









$endgroup$













    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',
    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
    );



    );






    Ali Lodhi 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%2f3164955%2fproof-that-r-is-uncountable-using-diagonalization%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









    1












    $begingroup$

    Consider a sequence $y=y_1y_2y_3...$ such that for each $i$, $y_i neq x_ii$.



    If $y=x_n$ for an integer $n$, then considering the $n-$th decimal, you would have $y_n=x_nn$. This is not true.



    So $y$ is not one of the $x_n$.






    share|cite|improve this answer









    $endgroup$

















      1












      $begingroup$

      Consider a sequence $y=y_1y_2y_3...$ such that for each $i$, $y_i neq x_ii$.



      If $y=x_n$ for an integer $n$, then considering the $n-$th decimal, you would have $y_n=x_nn$. This is not true.



      So $y$ is not one of the $x_n$.






      share|cite|improve this answer









      $endgroup$















        1












        1








        1





        $begingroup$

        Consider a sequence $y=y_1y_2y_3...$ such that for each $i$, $y_i neq x_ii$.



        If $y=x_n$ for an integer $n$, then considering the $n-$th decimal, you would have $y_n=x_nn$. This is not true.



        So $y$ is not one of the $x_n$.






        share|cite|improve this answer









        $endgroup$



        Consider a sequence $y=y_1y_2y_3...$ such that for each $i$, $y_i neq x_ii$.



        If $y=x_n$ for an integer $n$, then considering the $n-$th decimal, you would have $y_n=x_nn$. This is not true.



        So $y$ is not one of the $x_n$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Mar 27 at 19:08









        TheSilverDoeTheSilverDoe

        4,884215




        4,884215




















            Ali Lodhi is a new contributor. Be nice, and check out our Code of Conduct.









            draft saved

            draft discarded


















            Ali Lodhi is a new contributor. Be nice, and check out our Code of Conduct.












            Ali Lodhi is a new contributor. Be nice, and check out our Code of Conduct.











            Ali Lodhi is a new contributor. Be nice, and check out our Code of Conduct.














            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%2f3164955%2fproof-that-r-is-uncountable-using-diagonalization%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

            Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

            Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

            Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ