Prove Countability: Algebraic Numbers

  • Context: Graduate 
  • Thread starter Thread starter quasar_4
  • Start date Start date
  • Tags Tags
    Countability
Click For Summary

Discussion Overview

The discussion revolves around the proof of the countability of the set of algebraic numbers. Participants explore various methods and reasoning, including the potential use of induction and the properties of polynomials.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested, Mathematical reasoning

Main Points Raised

  • One participant questions whether induction is necessary for proving countability and expresses uncertainty about alternative methods.
  • Another participant suggests that while induction is not required, it can be useful, particularly by considering polynomials of different degrees separately.
  • A participant proposes mapping algebraic numbers to their corresponding polynomials and discusses using the "height" of polynomials to argue for countability.
  • Another participant clarifies that algebraic numbers are roots of polynomials with rational coefficients and outlines a countable union argument based on this property.
  • One participant expresses confusion about tracking the sets involved and hopes for improved understanding as the course progresses.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the necessity of induction, with some suggesting it is helpful while others question its role. The discussion remains unresolved regarding the best approach to the proof.

Contextual Notes

Participants note the importance of distinguishing between different sets and their unions, indicating potential limitations in clarity regarding the proof structure.

Who May Find This Useful

Students studying mathematical proofs, particularly in the context of set theory and algebra, may find this discussion relevant.

quasar_4
Messages
273
Reaction score
0
So in general, do I always need to use induction to prove that a set is countable?

I'm trying to prove that the set of algebraic numbers is countable, but not sure if I am supposed to do it by induction. I am not sure how else to do it.
 
Physics news on Phys.org
You don't "need to" use induction, but in this case an inductive-type argument is very helpful. Algebraic numbers are roots of polynomials - so it might be a good idea to consider polynomials of degree n separately.
 
ok, so the induction would be done on the degree of the polynomial...

I was thinking maybe I could map each algebraic number to the polynomial(s) of which it is a root. Then use this definition of the "height" of the polynomial (in our book, it's the sum of the degree of the polynomial with the absolute value of the coefficients of the poly.). I think it is reasonable to say that since each polynomial of degree n has at most n roots, that the set of algebraic numbers corresponding to all the polynomials of height h is at most countable (I hope this is strong enough).

Then if I take the union of the sets of differing heights, I'd be taking the union of at most countable sets, which must also be at most countable...

where does the induction step fit in? I guess I'm not sure what to show.. that the idea holds for the polynomials of degree 1, then show n => n+1?
 
Why should there be an inductive step?

A key point that you might have missed is that algebraic numbers are roots of polynomials with rational coefficients. So for each n, the set P_n of polynomials with rational coefficients of degree <= n is countable. Each p in P_n has at most n roots. Let A_n denote the set of roots of all polynomials in P_n; this is a countable union of finite things, and is thus countable. Finally, the set of algebraic numbers is the union of the A_n's, and is thus countable (being also a countable union of countable sets).

This is pretty much your argument, and it's perfectly fine.
 
excellent! I think it is just a bit confusing at first to keep track of which sets are which, and what's being put in union with other things. I am hoping that these proofs get easier as the course goes by... :P
 

Similar threads

  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 5 ·
Replies
5
Views
5K
  • · Replies 30 ·
2
Replies
30
Views
4K
Replies
11
Views
3K