Does an element of a set, that can't be in a list, make that set uncountable?












2












$begingroup$


We can map the infinite subsets of $mathbb N$ to the finite subsets of $mathbb N$



The finite subset will be a prefix, of the infinite subset (that it is paired with), that has not yet been used.




$1 mapsto { color{red}{1} ,2,3,4,5,6,7,8 dots } mapsto { color{red}{1} }$



$2 mapsto { color{red}{2} ,4,6,8,10,12,14 dots } mapsto { color{red}{2} }$



$3 mapsto { color{red}{1,3} ,5,7,9,11,13,15 dots } mapsto { color{red}{1,3} }$



$4 mapsto { color{red}{1,2} ,3,7,9,19,27,31 dots } mapsto { color{red}{1,2} }$



$5 mapsto { color{red}{1,2,3} ,4,21,22,25,32 dots } mapsto { color{red}{1,2,3} }$



$6 mapsto { color{red}{2,3} ,4,6,7,8,21,55,58 dots } mapsto { color{red}{2,3} }$



$7 mapsto { color{red}{2,3,4} ,6,7,8,9,21,55,58 dots } mapsto { color{red}{2,3,4} }$



$8 mapsto { color{red}{2,3,4,6} ,7,9,21,55,58 dots } mapsto { color{red}{2,3,4,6} }$



$9 mapsto { color{red}{2,3,4,6,7} ,6,7,8,21,55,58 dots } mapsto { color{red}{2,3,4,6,7} }$



$dots$




We can then find an infinite set that is not in this list (by diagonalization).




$N mapsto { color{red}{4,5,8,9,dots} } mapsto { color{red}{4} } lor { color{red}{4,5} } lor { color{red}{4,5,8} } lor{ color{red}{4,5,8,9} } dots$




We can then pair our infinite set, that can't be in our list, with ${ color{red}{4} }$ if it is not been used or ${ color{red}{4,5} }$ or ${ color{red}{4,5,8} }$ etc... until we find some finite set that has not been used.



Since we need sets with a finite number of elements, and we have sets with an infinite number of elements to choose from, we will always find a finite prefix from each infinite set.



So, if we can find a finite set for every infinite set IN or NOT IN our list, and our set of finite sets is countable then can we still say that our set of infinite sets is uncountable based on there being an element that can't be in a list?






elementary-set-theory







share|cite|improve this question











$endgroup$












  • $begingroup$
    I'm confused---what, exactly, is your question? If I understand it correctly, you are trying to determine if the set of finite subsets of $mathbb{N}$ is countable. That is, is the set $$bigcup_{n=1}^{infty} mathbb{N}^n$$ countable? If this is your question, then a countable union of countable sets is countable. Or are you asking about the set of infinite sequences with elements in $mathbb{N}$, which is uncountable by a diagonalization argument?
    $endgroup$
    – Xander Henderson
    Jan 8 at 15:36






  • 1




    $begingroup$
    math.stackexchange.com/questions/2873936/…
    $endgroup$
    – Asaf Karagila♦
    Jan 8 at 16:13
















2












$begingroup$


We can map the infinite subsets of $mathbb N$ to the finite subsets of $mathbb N$



The finite subset will be a prefix, of the infinite subset (that it is paired with), that has not yet been used.




$1 mapsto { color{red}{1} ,2,3,4,5,6,7,8 dots } mapsto { color{red}{1} }$



$2 mapsto { color{red}{2} ,4,6,8,10,12,14 dots } mapsto { color{red}{2} }$



$3 mapsto { color{red}{1,3} ,5,7,9,11,13,15 dots } mapsto { color{red}{1,3} }$



$4 mapsto { color{red}{1,2} ,3,7,9,19,27,31 dots } mapsto { color{red}{1,2} }$



$5 mapsto { color{red}{1,2,3} ,4,21,22,25,32 dots } mapsto { color{red}{1,2,3} }$



$6 mapsto { color{red}{2,3} ,4,6,7,8,21,55,58 dots } mapsto { color{red}{2,3} }$



$7 mapsto { color{red}{2,3,4} ,6,7,8,9,21,55,58 dots } mapsto { color{red}{2,3,4} }$



$8 mapsto { color{red}{2,3,4,6} ,7,9,21,55,58 dots } mapsto { color{red}{2,3,4,6} }$



$9 mapsto { color{red}{2,3,4,6,7} ,6,7,8,21,55,58 dots } mapsto { color{red}{2,3,4,6,7} }$



$dots$




We can then find an infinite set that is not in this list (by diagonalization).




$N mapsto { color{red}{4,5,8,9,dots} } mapsto { color{red}{4} } lor { color{red}{4,5} } lor { color{red}{4,5,8} } lor{ color{red}{4,5,8,9} } dots$




We can then pair our infinite set, that can't be in our list, with ${ color{red}{4} }$ if it is not been used or ${ color{red}{4,5} }$ or ${ color{red}{4,5,8} }$ etc... until we find some finite set that has not been used.



Since we need sets with a finite number of elements, and we have sets with an infinite number of elements to choose from, we will always find a finite prefix from each infinite set.



So, if we can find a finite set for every infinite set IN or NOT IN our list, and our set of finite sets is countable then can we still say that our set of infinite sets is uncountable based on there being an element that can't be in a list?






elementary-set-theory







share|cite|improve this question











$endgroup$












  • $begingroup$
    I'm confused---what, exactly, is your question? If I understand it correctly, you are trying to determine if the set of finite subsets of $mathbb{N}$ is countable. That is, is the set $$bigcup_{n=1}^{infty} mathbb{N}^n$$ countable? If this is your question, then a countable union of countable sets is countable. Or are you asking about the set of infinite sequences with elements in $mathbb{N}$, which is uncountable by a diagonalization argument?
    $endgroup$
    – Xander Henderson
    Jan 8 at 15:36






  • 1




    $begingroup$
    math.stackexchange.com/questions/2873936/…
    $endgroup$
    – Asaf Karagila♦
    Jan 8 at 16:13














2












2








2


0



$begingroup$


We can map the infinite subsets of $mathbb N$ to the finite subsets of $mathbb N$



The finite subset will be a prefix, of the infinite subset (that it is paired with), that has not yet been used.




$1 mapsto { color{red}{1} ,2,3,4,5,6,7,8 dots } mapsto { color{red}{1} }$



$2 mapsto { color{red}{2} ,4,6,8,10,12,14 dots } mapsto { color{red}{2} }$



$3 mapsto { color{red}{1,3} ,5,7,9,11,13,15 dots } mapsto { color{red}{1,3} }$



$4 mapsto { color{red}{1,2} ,3,7,9,19,27,31 dots } mapsto { color{red}{1,2} }$



$5 mapsto { color{red}{1,2,3} ,4,21,22,25,32 dots } mapsto { color{red}{1,2,3} }$



$6 mapsto { color{red}{2,3} ,4,6,7,8,21,55,58 dots } mapsto { color{red}{2,3} }$



$7 mapsto { color{red}{2,3,4} ,6,7,8,9,21,55,58 dots } mapsto { color{red}{2,3,4} }$



$8 mapsto { color{red}{2,3,4,6} ,7,9,21,55,58 dots } mapsto { color{red}{2,3,4,6} }$



$9 mapsto { color{red}{2,3,4,6,7} ,6,7,8,21,55,58 dots } mapsto { color{red}{2,3,4,6,7} }$



$dots$




We can then find an infinite set that is not in this list (by diagonalization).




$N mapsto { color{red}{4,5,8,9,dots} } mapsto { color{red}{4} } lor { color{red}{4,5} } lor { color{red}{4,5,8} } lor{ color{red}{4,5,8,9} } dots$




We can then pair our infinite set, that can't be in our list, with ${ color{red}{4} }$ if it is not been used or ${ color{red}{4,5} }$ or ${ color{red}{4,5,8} }$ etc... until we find some finite set that has not been used.



Since we need sets with a finite number of elements, and we have sets with an infinite number of elements to choose from, we will always find a finite prefix from each infinite set.



So, if we can find a finite set for every infinite set IN or NOT IN our list, and our set of finite sets is countable then can we still say that our set of infinite sets is uncountable based on there being an element that can't be in a list?






elementary-set-theory







share|cite|improve this question











$endgroup$




We can map the infinite subsets of $mathbb N$ to the finite subsets of $mathbb N$



The finite subset will be a prefix, of the infinite subset (that it is paired with), that has not yet been used.




$1 mapsto { color{red}{1} ,2,3,4,5,6,7,8 dots } mapsto { color{red}{1} }$



$2 mapsto { color{red}{2} ,4,6,8,10,12,14 dots } mapsto { color{red}{2} }$



$3 mapsto { color{red}{1,3} ,5,7,9,11,13,15 dots } mapsto { color{red}{1,3} }$



$4 mapsto { color{red}{1,2} ,3,7,9,19,27,31 dots } mapsto { color{red}{1,2} }$



$5 mapsto { color{red}{1,2,3} ,4,21,22,25,32 dots } mapsto { color{red}{1,2,3} }$



$6 mapsto { color{red}{2,3} ,4,6,7,8,21,55,58 dots } mapsto { color{red}{2,3} }$



$7 mapsto { color{red}{2,3,4} ,6,7,8,9,21,55,58 dots } mapsto { color{red}{2,3,4} }$



$8 mapsto { color{red}{2,3,4,6} ,7,9,21,55,58 dots } mapsto { color{red}{2,3,4,6} }$



$9 mapsto { color{red}{2,3,4,6,7} ,6,7,8,21,55,58 dots } mapsto { color{red}{2,3,4,6,7} }$



$dots$




We can then find an infinite set that is not in this list (by diagonalization).




$N mapsto { color{red}{4,5,8,9,dots} } mapsto { color{red}{4} } lor { color{red}{4,5} } lor { color{red}{4,5,8} } lor{ color{red}{4,5,8,9} } dots$




We can then pair our infinite set, that can't be in our list, with ${ color{red}{4} }$ if it is not been used or ${ color{red}{4,5} }$ or ${ color{red}{4,5,8} }$ etc... until we find some finite set that has not been used.



Since we need sets with a finite number of elements, and we have sets with an infinite number of elements to choose from, we will always find a finite prefix from each infinite set.



So, if we can find a finite set for every infinite set IN or NOT IN our list, and our set of finite sets is countable then can we still say that our set of infinite sets is uncountable based on there being an element that can't be in a list?






elementary-set-theory




elementary-set-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 8 at 15:36







Ivan Hieno

















asked Jan 8 at 15:30









Ivan HienoIvan Hieno

16510




16510












  • $begingroup$
    I'm confused---what, exactly, is your question? If I understand it correctly, you are trying to determine if the set of finite subsets of $mathbb{N}$ is countable. That is, is the set $$bigcup_{n=1}^{infty} mathbb{N}^n$$ countable? If this is your question, then a countable union of countable sets is countable. Or are you asking about the set of infinite sequences with elements in $mathbb{N}$, which is uncountable by a diagonalization argument?
    $endgroup$
    – Xander Henderson
    Jan 8 at 15:36






  • 1




    $begingroup$
    math.stackexchange.com/questions/2873936/…
    $endgroup$
    – Asaf Karagila♦
    Jan 8 at 16:13


















  • $begingroup$
    I'm confused---what, exactly, is your question? If I understand it correctly, you are trying to determine if the set of finite subsets of $mathbb{N}$ is countable. That is, is the set $$bigcup_{n=1}^{infty} mathbb{N}^n$$ countable? If this is your question, then a countable union of countable sets is countable. Or are you asking about the set of infinite sequences with elements in $mathbb{N}$, which is uncountable by a diagonalization argument?
    $endgroup$
    – Xander Henderson
    Jan 8 at 15:36






  • 1




    $begingroup$
    math.stackexchange.com/questions/2873936/…
    $endgroup$
    – Asaf Karagila♦
    Jan 8 at 16:13
















$begingroup$
I'm confused---what, exactly, is your question? If I understand it correctly, you are trying to determine if the set of finite subsets of $mathbb{N}$ is countable. That is, is the set $$bigcup_{n=1}^{infty} mathbb{N}^n$$ countable? If this is your question, then a countable union of countable sets is countable. Or are you asking about the set of infinite sequences with elements in $mathbb{N}$, which is uncountable by a diagonalization argument?
$endgroup$
– Xander Henderson
Jan 8 at 15:36




$begingroup$
I'm confused---what, exactly, is your question? If I understand it correctly, you are trying to determine if the set of finite subsets of $mathbb{N}$ is countable. That is, is the set $$bigcup_{n=1}^{infty} mathbb{N}^n$$ countable? If this is your question, then a countable union of countable sets is countable. Or are you asking about the set of infinite sequences with elements in $mathbb{N}$, which is uncountable by a diagonalization argument?
$endgroup$
– Xander Henderson
Jan 8 at 15:36




1




1




$begingroup$
math.stackexchange.com/questions/2873936/…
$endgroup$
– Asaf Karagila♦
Jan 8 at 16:13




$begingroup$
math.stackexchange.com/questions/2873936/…
$endgroup$
– Asaf Karagila♦
Jan 8 at 16:13










2 Answers
2






active

oldest

votes


















5












$begingroup$

Your question is moot, since the motivating "fact" is false.




The culprit is your implicit claim in the sentence




until we find some finite set that has not been used.




How do we know such a thing exists at all?



For example, let $(F_i)_{iinmathbb{N}}$ enumerate the finite sets, and let $X_i=F_icup (max(F_i),infty)$ (I'm just taking the unions above in order to make each of my $X_i$s infinite). Note that $F_i$ is a prefix of $X_i$. I can map each $X_i$ to $F_i$, and this seems to work ... but now I've used up every finite set, and when I come to my next infinite set - say, the set of evens - I'm stuck.



Now you might argue that I built my map stupidly above, but the point is that the onus is on you to prove that there is a non-stupid way to "continue building forever." And indeed, one of the consequences of Cantor's theorem is that there isn't.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    Incidentally, a similar instance of the "I don't know where exactly you'll run out of room, but you will eventually" is Fodor's lemma, but that's much more complicated.
    $endgroup$
    – Noah Schweber
    Jan 8 at 16:12





















5












$begingroup$

Even though that specific infinite subset isn't in our list, we can still have all its finite prefixes in our list of finite subsets.



For instance, say the 10th infinite subset in your list is ${4, ldots}$. Then the 20th is ${4, 5, ldots}$. Then the 30th is ${4, 5, 8, ldots}$. And so on. None of them have to be your infinite set, all of them can be different from your infinite set early enough to allow your set to be the result of the diagonalization. But all of your set's prefixes are in our list of finite subsets.






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
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3066311%2fdoes-an-element-of-a-set-that-cant-be-in-a-list-make-that-set-uncountable%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









    5












    $begingroup$

    Your question is moot, since the motivating "fact" is false.




    The culprit is your implicit claim in the sentence




    until we find some finite set that has not been used.




    How do we know such a thing exists at all?



    For example, let $(F_i)_{iinmathbb{N}}$ enumerate the finite sets, and let $X_i=F_icup (max(F_i),infty)$ (I'm just taking the unions above in order to make each of my $X_i$s infinite). Note that $F_i$ is a prefix of $X_i$. I can map each $X_i$ to $F_i$, and this seems to work ... but now I've used up every finite set, and when I come to my next infinite set - say, the set of evens - I'm stuck.



    Now you might argue that I built my map stupidly above, but the point is that the onus is on you to prove that there is a non-stupid way to "continue building forever." And indeed, one of the consequences of Cantor's theorem is that there isn't.






    share|cite|improve this answer











    $endgroup$









    • 1




      $begingroup$
      Incidentally, a similar instance of the "I don't know where exactly you'll run out of room, but you will eventually" is Fodor's lemma, but that's much more complicated.
      $endgroup$
      – Noah Schweber
      Jan 8 at 16:12


















    5












    $begingroup$

    Your question is moot, since the motivating "fact" is false.




    The culprit is your implicit claim in the sentence




    until we find some finite set that has not been used.




    How do we know such a thing exists at all?



    For example, let $(F_i)_{iinmathbb{N}}$ enumerate the finite sets, and let $X_i=F_icup (max(F_i),infty)$ (I'm just taking the unions above in order to make each of my $X_i$s infinite). Note that $F_i$ is a prefix of $X_i$. I can map each $X_i$ to $F_i$, and this seems to work ... but now I've used up every finite set, and when I come to my next infinite set - say, the set of evens - I'm stuck.



    Now you might argue that I built my map stupidly above, but the point is that the onus is on you to prove that there is a non-stupid way to "continue building forever." And indeed, one of the consequences of Cantor's theorem is that there isn't.






    share|cite|improve this answer











    $endgroup$









    • 1




      $begingroup$
      Incidentally, a similar instance of the "I don't know where exactly you'll run out of room, but you will eventually" is Fodor's lemma, but that's much more complicated.
      $endgroup$
      – Noah Schweber
      Jan 8 at 16:12
















    5












    5








    5





    $begingroup$

    Your question is moot, since the motivating "fact" is false.




    The culprit is your implicit claim in the sentence




    until we find some finite set that has not been used.




    How do we know such a thing exists at all?



    For example, let $(F_i)_{iinmathbb{N}}$ enumerate the finite sets, and let $X_i=F_icup (max(F_i),infty)$ (I'm just taking the unions above in order to make each of my $X_i$s infinite). Note that $F_i$ is a prefix of $X_i$. I can map each $X_i$ to $F_i$, and this seems to work ... but now I've used up every finite set, and when I come to my next infinite set - say, the set of evens - I'm stuck.



    Now you might argue that I built my map stupidly above, but the point is that the onus is on you to prove that there is a non-stupid way to "continue building forever." And indeed, one of the consequences of Cantor's theorem is that there isn't.






    share|cite|improve this answer











    $endgroup$



    Your question is moot, since the motivating "fact" is false.




    The culprit is your implicit claim in the sentence




    until we find some finite set that has not been used.




    How do we know such a thing exists at all?



    For example, let $(F_i)_{iinmathbb{N}}$ enumerate the finite sets, and let $X_i=F_icup (max(F_i),infty)$ (I'm just taking the unions above in order to make each of my $X_i$s infinite). Note that $F_i$ is a prefix of $X_i$. I can map each $X_i$ to $F_i$, and this seems to work ... but now I've used up every finite set, and when I come to my next infinite set - say, the set of evens - I'm stuck.



    Now you might argue that I built my map stupidly above, but the point is that the onus is on you to prove that there is a non-stupid way to "continue building forever." And indeed, one of the consequences of Cantor's theorem is that there isn't.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Jan 8 at 16:08

























    answered Jan 8 at 16:02









    Noah SchweberNoah Schweber

    123k10150286




    123k10150286








    • 1




      $begingroup$
      Incidentally, a similar instance of the "I don't know where exactly you'll run out of room, but you will eventually" is Fodor's lemma, but that's much more complicated.
      $endgroup$
      – Noah Schweber
      Jan 8 at 16:12
















    • 1




      $begingroup$
      Incidentally, a similar instance of the "I don't know where exactly you'll run out of room, but you will eventually" is Fodor's lemma, but that's much more complicated.
      $endgroup$
      – Noah Schweber
      Jan 8 at 16:12










    1




    1




    $begingroup$
    Incidentally, a similar instance of the "I don't know where exactly you'll run out of room, but you will eventually" is Fodor's lemma, but that's much more complicated.
    $endgroup$
    – Noah Schweber
    Jan 8 at 16:12






    $begingroup$
    Incidentally, a similar instance of the "I don't know where exactly you'll run out of room, but you will eventually" is Fodor's lemma, but that's much more complicated.
    $endgroup$
    – Noah Schweber
    Jan 8 at 16:12













    5












    $begingroup$

    Even though that specific infinite subset isn't in our list, we can still have all its finite prefixes in our list of finite subsets.



    For instance, say the 10th infinite subset in your list is ${4, ldots}$. Then the 20th is ${4, 5, ldots}$. Then the 30th is ${4, 5, 8, ldots}$. And so on. None of them have to be your infinite set, all of them can be different from your infinite set early enough to allow your set to be the result of the diagonalization. But all of your set's prefixes are in our list of finite subsets.






    share|cite|improve this answer











    $endgroup$


















      5












      $begingroup$

      Even though that specific infinite subset isn't in our list, we can still have all its finite prefixes in our list of finite subsets.



      For instance, say the 10th infinite subset in your list is ${4, ldots}$. Then the 20th is ${4, 5, ldots}$. Then the 30th is ${4, 5, 8, ldots}$. And so on. None of them have to be your infinite set, all of them can be different from your infinite set early enough to allow your set to be the result of the diagonalization. But all of your set's prefixes are in our list of finite subsets.






      share|cite|improve this answer











      $endgroup$
















        5












        5








        5





        $begingroup$

        Even though that specific infinite subset isn't in our list, we can still have all its finite prefixes in our list of finite subsets.



        For instance, say the 10th infinite subset in your list is ${4, ldots}$. Then the 20th is ${4, 5, ldots}$. Then the 30th is ${4, 5, 8, ldots}$. And so on. None of them have to be your infinite set, all of them can be different from your infinite set early enough to allow your set to be the result of the diagonalization. But all of your set's prefixes are in our list of finite subsets.






        share|cite|improve this answer











        $endgroup$



        Even though that specific infinite subset isn't in our list, we can still have all its finite prefixes in our list of finite subsets.



        For instance, say the 10th infinite subset in your list is ${4, ldots}$. Then the 20th is ${4, 5, ldots}$. Then the 30th is ${4, 5, 8, ldots}$. And so on. None of them have to be your infinite set, all of them can be different from your infinite set early enough to allow your set to be the result of the diagonalization. But all of your set's prefixes are in our list of finite subsets.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 8 at 16:10

























        answered Jan 8 at 15:37









        ArthurArthur

        113k7115197




        113k7115197






























            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%2f3066311%2fdoes-an-element-of-a-set-that-cant-be-in-a-list-make-that-set-uncountable%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

            'app-layout' is not a known element: how to share Component with different Modules

            Image
            0 My application was working fine until I decided to go with lazy loading: So, my shared component looks like this: import { Component, Renderer2 } from '@angular/core'; export interface FormModel { captcha?: string; } @Component({ selector: 'app-layout', templateUrl: './app-layout.component.html', styleUrls: ['./app-layout.css'] }) export class FullLayoutComponent { } app-layout.component.ts I am using this component in my Another component say school-home.component.html like this: <app-layout> </app-layout> and it was working fine until I created a Module school-home.module.ts like this: import { NgModule } from '@angular/core'; import { CommonModule } from '@angular/common'; import { SchoolhomeRoutingModule ...
            Read more

            android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

            Image
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 0 This is a simple project showing cubes on Unity, exported to android project and imported on Android studio. On maifest file it showed following warning: Expecting <uses-feature android:name="android.software.leanback" android:required="false" /> tag I have no information about it. And also on default emptyview android project does not use/mention this feature. I know it is required by TV's and such but why its not added by default? Why is this? And Should I concern about it? android unity3d ...
            Read more

            WPF add header to Image with URL pettitions [duplicate]

            Image
            up vote 0 down vote favorite This question already has an answer here: Image source URI requiring authorization 3 answers Add header to all* HTTP requests on a machine 1 answer first of all sorry for my english. Recently I added some security in the backend of my project, and now I need to send a validation code(apiKey) inside the headers to retrieve the images. I have a problem with ALL images in my project that I had attached in my UI. For example, before I had: <Image Height="90" Source="{Binding Video.Thumbnail}"/> Now I need to change my code to create a CUSTOM petition add the apiKey in the header:...
            Read more