Results 1 to 1 of 1

Math Help - constructive method of proving algebraic closure?

  1. #1
    Newbie
    Joined
    May 2010
    Posts
    1

    constructive method of proving algebraic closure?

    Hi everyone, i'm new. Nice to be here.
    I'm not a native english speaker, so please forgive my far-from-perfect use of this language.
    My question is:

    Let alpha and beta be two algebraic numbers, and let P and Q be the respective minimal polinomials. So P(alpha)=0 and Q(beta)=0.
    Is there a way to express, in terms of P and Q, a polinomial R such that R(alpha+beta)=0 holds?
    Similarly, is there a way to find S such that S(alpha*beta)=0 holds?

    Such polinomials R and S must exist, because the set of algebraic nubers is a field, but i don't know if there is a way to find some kind of function (or at least an algorithm) f such that f(P,Q)=R. Hope this is clear.

    Thank you for your attention.


    Edit: the title is not correct. Solving this problem has little to do with proving algebraic closure, i think. Sorry guys.
    Last edited by panurge; May 21st 2010 at 06:59 PM. Reason: error
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Relation between topological closure and algebraic closure
    Posted in the Differential Geometry Forum
    Replies: 3
    Last Post: November 4th 2010, 03:45 PM
  2. Galois group of the algebraic closure of the rationals
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: September 3rd 2009, 12:52 PM
  3. Galois extension, algebraic closure
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: December 10th 2008, 09:02 PM
  4. Algebraic Method
    Posted in the Algebra Forum
    Replies: 4
    Last Post: November 4th 2008, 04:28 PM
  5. Algebraic Closure.
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: February 19th 2006, 10:55 AM

Search Tags


/mathhelpforum @mathhelpforum