Is this proof that the algebraic numbers are countable legit?
Clash 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.
real-analysis logic
add a comment |Â
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.
real-analysis logic
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
add a comment |Â
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.
real-analysis logic
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.
real-analysis logic
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
add a comment |Â
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
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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