Proving algebraic numbers are countable?

  • Thread starter Thread starter SMA_01
  • Start date Start date
  • Tags Tags
    Numbers
Click For Summary
The discussion centers on proving that the set of algebraic numbers, specifically those derived from polynomials with integer coefficients of degree n, is countable. It emphasizes that each polynomial has a finite number of roots, and to establish countability, one must show that there are only countably many such polynomials. The hint suggests using a condition on the coefficients to count the polynomials effectively, leading to a finite number of roots for each polynomial. By taking the union of these finite sets over all possible values of m, the overall set of algebraic numbers can be shown to be countable. The conclusion reinforces that the union of countable sets remains countable, solidifying the proof.
  • #31
Thank you for your help (and patience), I know it took a while for me to get it.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
3K
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
704
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K