Sqrfree
square-free factorization of polynomials over algebraic extensions
Calling Sequence
Parameters
Description
Examples
evala(Sqrfree(P, x), opts)
P
-
expression involving algebraic numbers or algebraic functions.
x
(optional) name, set of names, or list of names.
opts
(optional) option name or set of option names.
Options currently supported: independent, expanded.
This function computes square-free factorizations of polynomials and rational functions over algebraic function fields or algebraic number fields. The square-free factorization is returned in the form [u,[[f1,ⅇ1],...,[fn,ⅇn]] such that P=u⁢f1ⅇ1⁢...⁢fnⅇn where fi is a monic and square-free polynomial in the variables x. In other words, Gcd fi,∂∂xfi=1 for all i and Gcd⁡fi,fj=1 for all i≠j. The coefficient u is an element of the coefficients field of P and it is free of x. The fi's are collected with respect to x.
Algebraic functions and algebraic numbers may be represented by radicals or with the RootOf notation (see type,algnum, type,algfun, type,radnum, type,radfun).
The argument P is considered as a polynomial or a rational function in x. Other names are considered as elements of the coefficient field. If the optional argument x is omitted, then all the names in P which do not appear inside a RootOf or a radical are used.
The ei's are positive integers if P is a polynomial in x and integers if P is a rational function in x. By default, the ei's may not be distinct since partial factorizations are preserved. If the option expanded is specified, factorizations of polynomials with the same multiplicity are not preserved. In any case, the ei's are sorted by nondecreasing value.
Algebraic numbers and functions occurring in the results are reduced modulo their minimal polynomial (see Normal).
The RootOf and the radicals defining the algebraic numbers must form an independent set of algebraic quantities, otherwise an error is returned. Note that this condition need not be satisfied if the expression contains only algebraic numbers in radical notation (e.g., 2, 3, 6). A basis over Q for the radicals can be computed by Maple in this case.
To skip the independence checking, use the option independent.
If a or b contains functions, their arguments are normalized recursively and the functions are frozen before the computation proceeds.
Since the ordering of objects may vary from a session to another, the leading coefficients may change accordingly.
Other objects are frozen and considered as variables.
alias⁡α=RootOf⁡x3+x+1
α
q≔x−α⁢x2−α2⁢x−1
q≔x−α⁢−α2+x2⁢x−1
evala⁡Sqrfree⁡q
1,x+α,1,x−1,1,x−α,2
evala⁡Sqrfree⁡q,expanded
1,x2+α−1⁢x−α,1,x−α,2
p≔expand⁡x−sqrt⁡t⁢y⁢sqrt⁡t⁢x+12
p≔t⁢x3+2⁢t⁢x2+x−t32⁢y⁢x2−2⁢t⁢y⁢x−t⁢y
evala⁡Sqrfree⁡p,x
t,x−t⁢y,1,x+1t,2
evala⁡Sqrfree⁡p,y
−t32⁢x2−2⁢x⁢t−t,−xt+y,1
evala⁡Sqrfree⁡p
r≔x2−2⁢y2x−RootOf⁡_Z2−2⁢y3
evala⁡Sqrfree⁡r
1,RootOf⁡_Z2−2⁢y+x,1,x−RootOf⁡_Z2−2⁢y,−2
If a polynomial defining a RootOf is reducible, the RootOf does not generate a well-defined field. In some cases, an error is returned:
evala⁡Sqrfree⁡x2+RootOf⁡x2−x
Error, (in `evala/Sqrfree/preproc`) reducible RootOf detected. Substitutions are {RootOf(_Z^2-_Z) = 0, RootOf(_Z^2-_Z) = 1}
To pretend that all the defining polynomials are irreducible, use the option 'independent':
evala⁡Sqrfree⁡x2+RootOf⁡x2−x,independent
1,x2+RootOf⁡_Z2−_Z,1
Alternatively, use indexed RootOfs:
evala⁡Sqrfree⁡x2+RootOf⁡x2−x,index=1
1,x,2
evala⁡Sqrfree⁡x2+RootOf⁡x2−x,index=2
1,x2+1,1
See Also
evala
Factor
RootOf
sqrfree
Download Help Document