Let be polynomials with rational coefficients, and is irreducible. Suppose further that there exists a complex number such that . Prove that

I do not know how to prove. and I've thought it for many times....Would you help me out?

Results 1 to 6 of 6

- November 5th 2012, 07:06 PM #1

- Joined
- Jun 2011
- Posts
- 73
- Thanks
- 2

- November 5th 2012, 08:06 PM #2

- Joined
- Mar 2011
- From
- Tejas
- Posts
- 3,273
- Thanks
- 666

## Re: f|g wy?

consider the map from Q[x] to Q(α) given by: p(x)-->p(α). this is a ring homomorphism.

furthermore, since α is algebraic over Q (it satisfies f(x) in Q[x]), Q[a] = Q(α) (that is, Q[α] is actually a FIELD).

now the image of this homomorphism contains Q (we can take as the pre-image of q in Q the constant polynomial q) and α (which has pre-image x), and is therefore surjective.

by the fundamental isomorphism theorem (for rings), Q(α) = Q[x]/I, for some ideal I of Q[x] (namely, the kernel of our homomorphism).

now Q[x] is a principal ideal domain, so I is generated by some polynomial, h(x) in Q[x].

since f(x) is in the kernel (since f(α) = 0), we have f(x) = h(x)k(x), for some polynomial k(x) in Q[x].

but f(x) is irreducible, so k(x) must be a unit (that is, an element of Q*). but then f(x) = qh(x), so h(x) = (1/q)f(x).

this means that (h(x)) = (f(x)).

now g(α) is also in the kernel, which is generated by f(x), so g(x) = f(x)s(x), for some polynomial s(x) in Q[x], that is: f|g.

- November 5th 2012, 10:24 PM #3

- Joined
- Jun 2011
- Posts
- 73
- Thanks
- 2

- November 6th 2012, 06:56 AM #4

- Joined
- Mar 2011
- From
- Tejas
- Posts
- 3,273
- Thanks
- 666

- November 6th 2012, 02:50 PM #5

- Joined
- Jun 2011
- Posts
- 73
- Thanks
- 2

- November 6th 2012, 09:32 PM #6

- Joined
- Mar 2011
- From
- Tejas
- Posts
- 3,273
- Thanks
- 666