Proving Irrationality of Roots of Polynomials with Integer Coefficients

[MathematicalPhysicist]

prove for any rational root of a polynomial with integer coeffiecnts,a_{n}x^n+a_{n-1}x^{n-1}+...+a_{1}x+a_0 an doesn't equal 0.
if written in lowest terms as p/q. that the numerator p is a factor of a0 and the denominator q is a factor of an.

well, what i did is as follows:
-(an(p/q)^n+...+a1(p/q))=a0
-p(anp^(n-1)/q^n+...+a1/q)=a0

now if anp^(n-1)/q^n+...+a1/q=b/c (where b/c is in its lowest terms), i need to prove that c divides p.
because a0 is an integer c must divide p, because it doesn't divide b.
but this doesn't imply that p is a factor of a0, but that p/c is factor of a0.
i don't know how to proceed from here, i know i must show that c=1, but i dnot know how.

i would appreciate it if you could help me also with an.

 

[HallsofIvy]

How is this a question on irrationals?

Suppose x_1= \frac{p}{q} is a root of
a_{n}x^n+a_{n-1}x^{n-1}+...+a_{1}x+a_0,
x₂, ..., x_n are the others.
Then
1) a_{n}x^n+a_{n-1}x^{n-1}+...+a_{1}x+a_0= a_n(x-x_0)(x-x_1)\cdot\cdot\cdot(x-x_n)
and
2) (x- x_1)= x- \frac{p}{q}= \frac{1}{q}(qx- p)

 

[MathematicalPhysicist]

i can see that from (an/q)(x-x0)(qx-p)...(x-xn)=anx^n+...+a1x+a0
we can conclude that q is a factor of an, but how can i prove that p is a factor of a0?

btw, this question in the book isn't about irrtional but it's connected to a question about irrationals which employs this fact, i forgot that this question doesn't entail anthing about it.

 

[Office_Shredder]

Once you've factored your polynomial, let's say you're looking at the solution which fits the factored term:

(qx-p)

All your terms will look exactly like that.
Most people prefer to factor out the q, like HallsofIvy did, and leave the a_n as a separate constant from the rest of the polynomial, however, no one says you have to do it that way. So:

(qx-p)=0
qx=p
x=p/q

And of course, it's clear that once the terms are all multiplied back, q will be a factor of a_n, and p a factor of a₀, because multiplying all the constant terms is a₀

 

[StatusX]

If p/q is a rational root of the polynomial, written in lowest terms, then GCD(p,q)=1. We can write:

a_n \left(\frac{p}{q}\right)^n+...+a_1 \left(\frac{p}{q}\right)+a_0=0

Multiplying across by qⁿ:a_n p^n + a_{n-1} p^{n-1}q+...+a_1 p q^{n-1}+a_0q^n=0

Now look at this equation mod p and mod q, and use the fact that GCD(p,q)=1.

 

[MathematicalPhysicist]

0=(anp^n+...a1pq^n-1+a0q^n)mod q
each term in the polynomial besides anp^n has q as its factor, so bacuse anp^n should be divisble by q, and gcd(p,q)=1, an is divisble by q. and the same goes with a0 but with p.

thanks, status.

i have a follow up question, prove with help of the above statement, that \sqrt 2+ 2^{\frac{1}{3}} and \sqrt 3+2^{\frac{1}{3}}
are irrationals.

i guess also here i need to assume that they are rational roots of a polynomial and perhaps to prove that p isn't a factor of a0 and q isn't a factor of an, but how do i find a suiteable polynomial with integer coefficients?
perhaps if x1 is one of the numbers and x2 is the other, then the polynomial is (x-x1)(x-x2)=0, but I am not sure how to apply ad absurdum here.

thanks in advance.

 

[StatusX]

Consider, for example, x=2^{1/3}+3^{1/2}[/tex]. If you look at x², x³, etc, you will quickly see that they are all rational linear combinations of 1, 2^{1/3}, 2^{2/3}, 3^{1/2}, 2^{1/3} 3^{1/2}, 2^{2/3} 3^{1/2},. Thinking of these as basis vectors in a 6 dimensional vector space over the rational numbers, the seven vectors 1,x,x²,...,x⁶, must be linearly dependent, and so there are some rational numbers a_i with:<br /> <br /> a_0+a_1 x + ... + a_6 x^6=0<br /> <br /> These can be found by solving a system of 6 linear equations. <br /> <br /> This is pretty tedious though. The only other way I can think of to find this polynomial is using Galois theory. Consider the following simple example. Say we want to find a quadratic polynomial with rational coefficients for which r=a+b\sqrt{2} is a root, where a,b are rational. We write this polynomial as:<br /> <br /> x^2+cx+d = (x-r)(x-s)<br /> <br /> where s is the other root. We could use the above method to find c and d. But Galois theory allows us to determine s by the following argument. First we note that if we take any true equation involving numbers of the form e+f\sqrt{2}, e and f rational, and we replace \sqrt{2} by -\sqrt{2} every place it occurs, we get another true equation. This means that this operation is something called an &quot;automorphism&quot;. <br /> <br /> If we apply this operation to the equation above, the LHS doesn&#039;t change, since c,d are rational, and so the RHS must also remain the same. But this is only possible if s=a-b\sqrt{2}. Expanding this out we get our minimal polymial for r.<br /> <br /> In the case you&#039;re aksed to do, the group of automorphisms is more complicated than the example I just gave. If you knew how to compute the group, it would give you a significant shortcut to finding the answer, but if you&#039;re not familiar with this process, you should probably try the first way I suggested.

 

[MathematicalPhysicist]

your second appraoch i can't still use cause i haven't learned galois theory.

about your first approach, i said that i need to use my first question in the first post, which means to use the fact that a_is are integers, but you use this polynomial with rational coefficients which differs from this.

i would like to see a way that incorporates the first question.

btw, in your approach i should prove that a_i arent rational in order to prove that x isn't rational, right?

 

[StatusX]

Well, you can always multiply through by a common denominator to get a polynomial with integer coefficients. By the way, the first method I suggested guarantees an answer, but you're probably better off just playing around with different powers of x, combining them with integer coefficients to try to construct the polynomial. If this doesn't work, use the first method, but please use a computer to do it.

 

[MathematicalPhysicist]

i don't think the aim of the book from which i took the problem is to solve this question with a computer aid.

 

[StatusX]

Then don't use one. But you'll turn a 5 minute problem into an hour of tedious work, where the chances of making a mistake is just about 100%. By the way, if you do want to try to find the polynomial by just messing around, you might want to try combining the polynomials for \sqrt{3} and 2^{1/3}. (eg, plug \sqrt{3}+2^{1/3} into x^2-3)

 

[MathematicalPhysicist]

i tried messing with polynomials but didnt go very far.
anyway the polynomial i should find is of integer coefficients, and then i should show that a0 doesn't have p as its factor and an doesn't have q as its factor, right?

 

[StatusX]

Well, once you find the polynomial, you'd have to show it has no rational roots. By using the conditions on p and q, you can reduce the possible rational roots to some finite number, and check all of these. Then if x is a root of the polynomial, you know it isn't rational.