Is this proof that the algebraic numbers are countable legit?

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











up vote
1
down vote

favorite












Here is my version of the proof that the set of algebraic numbers is countable. Is it correct?



First we show that the set of polynomials with rational coefficients is countable. For ever fixed natural $n$, there is a bijection between the set of polynomials of degree $n$ and the set $mathbb Q^n$ that sends $x^n+a_n-1x^n-1+dots+a_0$ to $(a_n-1,dots,a_0)$. Thus the set of polynomials with rational coefficients of a fixed degree is countable. The set of all polynomials with rational coefficients is the union of that set over all $nin mathbb N$, so it's also countable as a countable union of countable sets.



Now each polynomial of degree $n$ has at most $n$ roots. We can enumerate all polynomials due to the above: $p_1(x),p_2(x),dots.$ Let $(P)_iin mathbb N$ be the set of all polynomials with rational coefficients. Let $S_i$ be the set of all roots of $p_i(x)$. The set of all algebraic numbers is the union of $S_i$ over all $iin mathbb N$. This is a countable union of finite sets, thus countable.







share|cite|improve this question
















  • 1




    Seems good to me. You will have counted each algebraic number multiple times, but that's not really an issue.
    – Arthur
    Aug 26 at 20:22











  • @Arthur Hot to see that that isn't an issue? Maybe if I hadn't counted the same number multiple times, the set of algebraic numbers would end up to be finite?
    – user531587
    Aug 26 at 20:27










  • Algebraic numbers include rational numbers, so theu are not finite...
    – xarles
    Aug 26 at 20:29










  • @xarles I think that he was joking. If countable is overcounting then the answer would be finite.
    – badjohn
    Aug 26 at 20:35










  • This proof is fine.
    – Jair Taylor
    Aug 26 at 21:44














up vote
1
down vote

favorite












Here is my version of the proof that the set of algebraic numbers is countable. Is it correct?



First we show that the set of polynomials with rational coefficients is countable. For ever fixed natural $n$, there is a bijection between the set of polynomials of degree $n$ and the set $mathbb Q^n$ that sends $x^n+a_n-1x^n-1+dots+a_0$ to $(a_n-1,dots,a_0)$. Thus the set of polynomials with rational coefficients of a fixed degree is countable. The set of all polynomials with rational coefficients is the union of that set over all $nin mathbb N$, so it's also countable as a countable union of countable sets.



Now each polynomial of degree $n$ has at most $n$ roots. We can enumerate all polynomials due to the above: $p_1(x),p_2(x),dots.$ Let $(P)_iin mathbb N$ be the set of all polynomials with rational coefficients. Let $S_i$ be the set of all roots of $p_i(x)$. The set of all algebraic numbers is the union of $S_i$ over all $iin mathbb N$. This is a countable union of finite sets, thus countable.







share|cite|improve this question
















  • 1




    Seems good to me. You will have counted each algebraic number multiple times, but that's not really an issue.
    – Arthur
    Aug 26 at 20:22











  • @Arthur Hot to see that that isn't an issue? Maybe if I hadn't counted the same number multiple times, the set of algebraic numbers would end up to be finite?
    – user531587
    Aug 26 at 20:27










  • Algebraic numbers include rational numbers, so theu are not finite...
    – xarles
    Aug 26 at 20:29










  • @xarles I think that he was joking. If countable is overcounting then the answer would be finite.
    – badjohn
    Aug 26 at 20:35










  • This proof is fine.
    – Jair Taylor
    Aug 26 at 21:44












up vote
1
down vote

favorite









up vote
1
down vote

favorite











Here is my version of the proof that the set of algebraic numbers is countable. Is it correct?



First we show that the set of polynomials with rational coefficients is countable. For ever fixed natural $n$, there is a bijection between the set of polynomials of degree $n$ and the set $mathbb Q^n$ that sends $x^n+a_n-1x^n-1+dots+a_0$ to $(a_n-1,dots,a_0)$. Thus the set of polynomials with rational coefficients of a fixed degree is countable. The set of all polynomials with rational coefficients is the union of that set over all $nin mathbb N$, so it's also countable as a countable union of countable sets.



Now each polynomial of degree $n$ has at most $n$ roots. We can enumerate all polynomials due to the above: $p_1(x),p_2(x),dots.$ Let $(P)_iin mathbb N$ be the set of all polynomials with rational coefficients. Let $S_i$ be the set of all roots of $p_i(x)$. The set of all algebraic numbers is the union of $S_i$ over all $iin mathbb N$. This is a countable union of finite sets, thus countable.







share|cite|improve this question












Here is my version of the proof that the set of algebraic numbers is countable. Is it correct?



First we show that the set of polynomials with rational coefficients is countable. For ever fixed natural $n$, there is a bijection between the set of polynomials of degree $n$ and the set $mathbb Q^n$ that sends $x^n+a_n-1x^n-1+dots+a_0$ to $(a_n-1,dots,a_0)$. Thus the set of polynomials with rational coefficients of a fixed degree is countable. The set of all polynomials with rational coefficients is the union of that set over all $nin mathbb N$, so it's also countable as a countable union of countable sets.



Now each polynomial of degree $n$ has at most $n$ roots. We can enumerate all polynomials due to the above: $p_1(x),p_2(x),dots.$ Let $(P)_iin mathbb N$ be the set of all polynomials with rational coefficients. Let $S_i$ be the set of all roots of $p_i(x)$. The set of all algebraic numbers is the union of $S_i$ over all $iin mathbb N$. This is a countable union of finite sets, thus countable.









share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Aug 26 at 20:16









user531587

15710




15710







  • 1




    Seems good to me. You will have counted each algebraic number multiple times, but that's not really an issue.
    – Arthur
    Aug 26 at 20:22











  • @Arthur Hot to see that that isn't an issue? Maybe if I hadn't counted the same number multiple times, the set of algebraic numbers would end up to be finite?
    – user531587
    Aug 26 at 20:27










  • Algebraic numbers include rational numbers, so theu are not finite...
    – xarles
    Aug 26 at 20:29










  • @xarles I think that he was joking. If countable is overcounting then the answer would be finite.
    – badjohn
    Aug 26 at 20:35










  • This proof is fine.
    – Jair Taylor
    Aug 26 at 21:44












  • 1




    Seems good to me. You will have counted each algebraic number multiple times, but that's not really an issue.
    – Arthur
    Aug 26 at 20:22











  • @Arthur Hot to see that that isn't an issue? Maybe if I hadn't counted the same number multiple times, the set of algebraic numbers would end up to be finite?
    – user531587
    Aug 26 at 20:27










  • Algebraic numbers include rational numbers, so theu are not finite...
    – xarles
    Aug 26 at 20:29










  • @xarles I think that he was joking. If countable is overcounting then the answer would be finite.
    – badjohn
    Aug 26 at 20:35










  • This proof is fine.
    – Jair Taylor
    Aug 26 at 21:44







1




1




Seems good to me. You will have counted each algebraic number multiple times, but that's not really an issue.
– Arthur
Aug 26 at 20:22





Seems good to me. You will have counted each algebraic number multiple times, but that's not really an issue.
– Arthur
Aug 26 at 20:22













@Arthur Hot to see that that isn't an issue? Maybe if I hadn't counted the same number multiple times, the set of algebraic numbers would end up to be finite?
– user531587
Aug 26 at 20:27




@Arthur Hot to see that that isn't an issue? Maybe if I hadn't counted the same number multiple times, the set of algebraic numbers would end up to be finite?
– user531587
Aug 26 at 20:27












Algebraic numbers include rational numbers, so theu are not finite...
– xarles
Aug 26 at 20:29




Algebraic numbers include rational numbers, so theu are not finite...
– xarles
Aug 26 at 20:29












@xarles I think that he was joking. If countable is overcounting then the answer would be finite.
– badjohn
Aug 26 at 20:35




@xarles I think that he was joking. If countable is overcounting then the answer would be finite.
– badjohn
Aug 26 at 20:35












This proof is fine.
– Jair Taylor
Aug 26 at 21:44




This proof is fine.
– Jair Taylor
Aug 26 at 21:44















active

oldest

votes











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



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2895475%2fis-this-proof-that-the-algebraic-numbers-are-countable-legit%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2895475%2fis-this-proof-that-the-algebraic-numbers-are-countable-legit%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

How to combine Bézier curves to a surface?

Why am i infinitely getting the same tweet with the Twitter Search API?

Carbon dioxide