integral bases of algebraic number fields
integral_basis(a, opt1, opt2)
integral_basis(f, opt1, opt2)
algebraic number or a set of algebraic numbers
univariate irreducible polynomial over an algebraic number field
Important: The numtheory[integral_basis] command has been deprecated. Use the superseding command NumberTheory[IntegralBasis] instead.
This procedure computes an integral basis for an algebraic number field K. There are several ways to specify the algebraic number field under consideration:
by a RootOf or a set of RootOfs representing algebraic numbers. The RootOfs must be independent.
by a univariate polynomial over the rational numbers or over an algebraic number field in RootOf or radical notation. The polynomial must be irreducible over its coefficients field and the RootOf appearing in the coefficients must be independent. The field represented by the polynomial is the field generated by one of its roots, up to isomorphism.
by a radical number or a set of radical numbers.
The output is a list of elements of K which generate the Z-module of integral elements of K, where Z denotes the ring of integers. An element of K is called integral over Z if it annihilates a monic univariate polynomial with coefficients in Z.
If the input is in RootOf notation, then the output will also be in RootOf notation.
If the input is in radical notation, then the output will be also in radical notation, but the output radicals may differ from the input radicals.
If the input is a polynomial, then the output will be expressed in terms of the variable.
This function supports options of the form option=value:
primes=S : In this case, S must be a prime number or a set of prime numbers. A local integral basis at these primes is computed instead of an integral basis over Z.
method=roundfour : The Ford & Zassenhaus Round Four algorithm is used. This is the default. See "Implementing the Round Four Maximal Order Algorithm", by D. Ford & P. Letard, Journal de Theorie des Nombres de Bordeaux, 1994, 6, p. 39-80.
method=roundtwo : The Zassenhaus Round Two algorithm is used. See "A Course in Computational Algebraic Number Theory" by Henri Cohen, Springer.
method=p_adic : With this option the algorithm will try to compute roots of the polynomial f in the form of p-adic numbers. If at a prime p no wild ramification occurs then the integral basis at the prime p is computed using these p-adic roots, see "An algorithm for computing an integral basis in an algebraic function field", J. of Symbolic Computation, 1994, 18, p. 353-363. If a wild ramification (i.e. p divides the ramification index) does occur then this method does not work. A warning message will be given and the integral basis at the prime p will be computed using method = roundfour.
By setting infolevel[integral_basis] to a positive value some information will be printed during the computation.
q ≔ 41296−6864⁢t+1128⁢t2−336⁢t3−6⁢t5+t6
q ≔ t6−6⁢t5−336⁢t3+1128⁢t2−6864⁢t+41296
r ≔ RootOf⁡x3−15⁢x2+75⁢x−4825,x
r ≔ RootOf⁡_Z3−15⁢_Z2+75⁢_Z−4825
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.