Another countability question

Hello everyone! Once again there are no answers in the book so this is just another check just to make sure. Thank you very much in advance.

Question: "Are the set of all algaebraic numbers countable? Justify your respose"

I will attempt to prove that the algaebraic numbers are countable. Once again for my sake let be the set of all algaebraic numbers.

Answer: Let be an algaebraic number. Then by definition there exists a polynomial , such that . Therefore let us define the number by the n-tuple . So now that we have shown that each algaebraic number may be expressed as a n-tuple we may state that where . So now since we have shown that the set of all algaebraic numbers may expressed as a set of n-tuples with each element of the n-tuple being an element of the integers, a countable set, we may conclude that the algaebraic numbers are countable

I know its relatively simple, but I just want to sure I am doing this right.

Hello everyone! Once again there are no answers in the book so this is just another check just to make sure. Thank you very much in advance.

Question: "Are the set of all algaebraic numbers countable? Justify your respose"

I will attempt to prove that the algaebraic numbers are countable. Once again for my sake let be the set of all algaebraic numbers.

Answer: Let be an algaebraic number. Then by definition there exists a polynomial , such that . Therefore let us define the number by the n-tuple . So now that we have shown that each algaebraic number may be expressed as a n-tuple we may state that where . So now since we have shown that the set of all algaebraic numbers may expressed as a set of n-tuples with each element of the n-tuple being an element of the integers, a countable set, we may conclude that the algaebraic numbers are countable

I know its relatively simple, but I just want to sure I am doing this right.

Looks good to me. Now you can conclude that that there are uncountably many transcendental numbers!

Looks good to me. Now you can conclude that that there are uncountably many transcendental numbers!

I'm assuming the reason being that if we assumed that the transcendentals( ) were countable we would ahve that , and since the union of two infinitely countable sets is countable we arrive at a contradiction since the reals are uncountable?

I'm assuming the reason being that if we assumed that the transcendentals( ) were countable we would ahve that , and since the union of two infinitely countable sets is countable we arrive at a contradiction since the reals are uncountable?

Yes!

I want to get off topic and show you something that I find really funny. For some time mathematicians did not know if transcendental numbers existed. Only in 1882 did Louiville show, by contrustion, a transcendental number. Then are proven to be transcendental. But look how easy it is if you are familiar with set theoretic concepts of cardinality! Not only does there have to exist transcendental numbers, there got to be way more of them than algebraic numbers!

That just shows that if you happen to know advanced mathematical concepts you can sometimes murder seemingly simple problems in a few lines.

I want to get off topic and show you something that I find really funny. For some time mathematicians did not know if transcendental numbers existed. Only in 1882 did Louiville show, by contrustion, a transcendental number. Then are proven to be transcendental. But look how easy it is if you are familiar with set theoretic concepts of cardinality! Not only does there have to exist transcendental numbers, there got to be way more of them than algebraic numbers!

That just shows that if you happen to know advanced mathematical concepts you can sometimes murder seemingly simple problems in a few lines.

Haha, that reminds me of this one kid (I think I thought so too in a weird way), that because we know more math than say Newton that we are smarter. That is obviously not true, but hey...we can always dream

Hello everyone! Once again there are no answers in the book so this is just another check just to make sure. Thank you very much in advance.

Question: "Are the set of all algaebraic numbers countable? Justify your respose"

I will attempt to prove that the algaebraic numbers are countable. Once again for my sake let be the set of all algaebraic numbers.

Answer: Let be an algaebraic number. Then by definition there exists a polynomial , such that . Therefore let us define the number by the n-tuple . So now that we have shown that each algaebraic number may be expressed as a n-tuple we may state that where . So now since we have shown that the set of all algaebraic numbers may expressed as a set of n-tuples with each element of the n-tuple being an element of the integers, a countable set, we may conclude that the algaebraic numbers are countable

I know its relatively simple, but I just want to sure I am doing this right.

your proof is unclear and kind of wrong! you can't correspond an algebraic number to an n-tuple of integers! an n-tuple of integers may correspond to n algebraic numbers. for any

and define let be the set of all algebraic numbers. then obviously:

now each is finite (it has at most n distinct elements) and is countable. finally a countable union

the coefficients of an equation do not represent only one algebraic numner! for example (2,-3,1) represents 1 and 2 because both are the roots of

Yeah I realized that right afer I posted it. Ok, well then what about this if we define a set as the set of all integer sequences, that would be countable set by the argument that it is a set of n-tuples with integer elements, then obviously the algaebraic numbers as I suggested they be a represented above would be a subset of and would be countable, or do I need to hit the books again?

Ok, well then what about this if we define a set as the set of all integer sequences, that would be countable set by the argument that it is a set of n-tuples with integer elements, then obviously the algaebraic numbers as I suggested they be a represented above would be a subset of and would be countable, or do I need to hit the books again?

that's roughly the idea! and a word of wisdom: lol ... it's dangerous for a young mind to be happy with just some rough ideas!

I want to get off topic and show you something that I find really funny. For some time mathematicians did not know if transcendental numbers existed. Only in 1882 did Louiville show, by contrustion, a transcendental number. Then are proven to be transcendental. But look how easy it is if you are familiar with set theoretic concepts of cardinality! Not only does there have to exist transcendental numbers, there got to be way more of them than algebraic numbers!

That just shows that if you happen to know advanced mathematical concepts you can sometimes murder seemingly simple problems in a few lines.

Lambert thought that the construction of was impossible. A theorem by Lambert in 1768 says: For each rational ( ) the value is irrational. From this, he deduced that which must be irrational. In a similar argument, one can show that which implies irrationality for .

I want to get off topic and show you something that I find really funny. For some time mathematicians did not know if transcendental numbers existed. Only in 1882 did Louiville show, by contrustion, a transcendental number. Then are proven to be transcendental. But look how easy it is if you are familiar with set theoretic concepts of cardinality! Not only does there have to exist transcendental numbers, there got to be way more of them than algebraic numbers!

That just shows that if you happen to know advanced mathematical concepts you can sometimes murder seemingly simple problems in a few lines.

The computable reals are enumerable but not effectivly enumerable (that is there is no computable function which is one-one from N onto the computable reals).