I think that FriCAS should be able to do the following: sage: K.<a,b> = QQ.extension([x^2 + 1, x^3 - 2]); K Number Field in a with defining polynomial x^2 + 1 over its base field sage: L.<c> = K.absolute_field() sage: to_L=(L.structure())[1] sage: to_L(a)^2 -1 sage: to_L(b)^3 2 sage: to_L(a) -6/11*c^5 - 9/22*c^4 - 20/11*c^3 - 39/11*c^2 - 39/11*c + 91/22 sage: to_L(b) -6/11*c^5 - 9/22*c^4 - 20/11*c^3 - 39/11*c^2 - 50/11*c + 91/22
If I'm not mistaken, currently it cannot. Sage uses pari to find the "absolute_polynomial", i.e., the minimal polynomial in K. Maybe we could make SAE take optionally a list of polynomials as second argument, and have several generators? No idea how much work that is, though. Martin --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en -~----------~----~----~----~------~----~------~--~---
