Advice for 13 Year Old Struggling with Real Analysis

[bit188]

Hello! I am thirteen and *very* interested in mathematics.

I've done calculus 1-3, some ODE's, and some linear algebra. I just started into basic real analysis (while completing linear algebra/ODE's), and the problems are *really* tough. I can solve a good number of the problems, but some I can't; how can I build up my skills in this area? Are there any problems online (preferably with answers)?

I'm using Kolmogorov and Fomin's Introductory Real Analysis. Thanks.

 

[JohnDuck]

Wow, you're really on the ball. Congratulations on your initiative, I wish I was half that motivated when I was 13.

I'm halfway through a two-semester Intro to Real Analysis course myself. In general, I have a lot of success on the homework when I write down exactly the definitions and assumptions of the problem, and exactly what I am trying to prove. Usually the proof comes easily after a little inspection, but if not then I'll write a statement logically equivalent to what I'm trying to prove and see if that helps. If you have some specific questions I'm sure the knowledgeable denizens of PF could be of more assistance.

 

[bit188]

Hey! Thanks :D

For example, my book is asking me to prove that the set of algebraic numbers is countable; I'm really having trouble with it. Help would be *greatly* appreciated. Thanks!

 

[DeadWolfe]

Well, one can associate a polynomial with rational coefficients to every algebraic number, and if one can prove that such polynomials are countable then you would be done.

 

[mathwonk]

basically, cantor proved countable unions of countable sets are countable, by one of his two famous diagonal arguments, so to prove countability you try to write your set as a countable union, of finite or countable sets.

 

[bit188]

So say p(x) = a_{0} + a_{1}x + a_{2}x^2 + ... + a_{n}x^n = 0 for every algebraic number x. I'd just need to prove that there is a countable number of polynomial equations of the form p(x) for every x, right?

(The a's are supposed to have subscripts, not coefficients! I can't seem to get the subsctript thingy to work in latex)

 

[DeadWolfe]

Yeah, but keep in mind that the coefficients are not arbitrary real numbers.

 

[bit188]

Hey! I think I did it... here's my proof:

We can associate every algebraic number \mbox{x} with a polynomial equation p(x) = a_{0} + a_{1}x + a_{2}x^2 + ... + a_{n}x^n = 0. Let P be the set of all polynomials of the form p(x). Then P can be written as the union of all sets of polynomials of order n. By the Fundamental Theorem of Algebra, polynomials of order n have exactly n solutions. Therefore, P is countable, and it follows that the set of algebraic numbers is countable.

Thanks for everybody's help!