Algebraic Number Fields

Mathematica provides representation of algebraic numbers as Root objects. A Root object contains the minimal polynomial of the algebraic number and the root number—an integer indicating which of the roots of the minimal polynomial the Root object represents. This allows for unique representation of arbitrary complex algebraic numbers. A disadvantage is that performing arithmetic operations in this representation is quite costly. That is why Mathematica requires the use of an additional function, RootReduce, in order to simplify arithmetic expressions. Restricting computations to be within a fixed finite algebraic extension of the rationals,

[

], allows a more convenient representation of its elements as polynomials in

AlgebraicNumber[

,{c₀,c₁,...,c_n}]

represent the algebraic number c₀+c₁

+...+c_n

ⁿ in

[

]

Representation of algebraic numbers as elements of a finite extension of rationals.

is an algebraic integer with a MinimalPolynomial of degree l, and {c₀, ..., c_l} are rational numbers, then AlgebraicNumber[

, {c₀, ..., c_l}] is an inert numeric object.

In[1]:=

Out[1]=

N can be used to find a numeric approximation of an AlgebraicNumber object.

In[2]:=

Out[2]=

For any algebraic number

and any list of rational numbers {c₀, ..., c_l} , AlgebraicNumber[

, {c₀, ..., c_l}] evaluates to AlgebraicNumber[

, {d₀, ..., d_m}], such that

, d is a factor of the leading coefficient of MinimalPolynomial of

, such that

is an algebraic integer, m is the degree of MinimalPolynomial of

, and

AlgebraicNumber automatically makes the generator of the extension an algebraic integer and the coefficient list equal in length to the degree of the extension.

In[3]:=

Out[3]=

AlgebraicNumber objects representing rational numbers reduce automatically to numbers.

In[4]:=

Out[4]=

Adding or multiplying AlgebraicNumber objects that explicitly belong to the same field (i.e., have the same first elements), adding or multiplying a rational number and an AlgebraicNumber object, or raising an AlgebraicNumber object to an integer power yields an AlgebraicNumber object.

In[5]:=

Out[5]=

RootReduce transforms AlgebraicNumber objects to Root objects.

In[6]:=

Out[6]=

ToNumberField[a,]	express the algebraic number a in the number field generated by
ToNumberField[{a₁,a₂,...},]	express the a_i in the field generated by
ToNumberField[{a₁,a₂,...}]	express the a_i in a common extension field generated by a single algebraic number

Representing arbitrary algebraic numbers as elements of algebraic number fields.

ToNumberField can be used to find a common finite extension of rationals containing the given algebraic numbers.

In[7]:=

Out[7]=

This represents

as an element of the field generated by Root[1-10 #1²+#1⁴&, 4].

In[8]:=

Out[8]=

Arithmetic within a fixed finite extension of rationals is much faster than arithmetic within the field of all complex algebraic numbers.

Suppose you need to find the value of rational function f with {x, y, z} replaced by algebraic numbers {a, b, c}.

In[9]:=

A direct computation of the value of f at {a, b, c} using RootReduce takes a rather long time.

In[10]:=

Out[10]=

A faster alternative is to do the computation in a common algebraic number field containing {a, b, c}.

In[11]:=

Out[11]=

Arithmetic within the common number field is much faster.

In[12]:=

Out[12]=

Converting the resulting AlgebraicNumber object to a Root object is fast as well.

In[13]:=

Out[13]=

ToNumberField[{a₁, a₂, ...}] is equivalent to ToNumberField[{a₁, a₂, ...}, Automatic], and does not necessarily use the smallest common field extension. ToNumberField[{a₁, a₂, ...}, All] always uses the smallest common field extension.

Here the first AlgebraicNumber object is equal to

so it does not generate the 4^th-degree field

(Root[1-10 #1²+#1⁴&, 4]) it is represented in. However, the common field found by ToNumberField contains the whole field

(Root[1-10 #1²+#1⁴&, 4]).

In[14]:=

Out[14]=

Specifying the second argument All makes ToNumberField find the smallest field possible.

In[15]:=

Out[15]=

MinimalPolynomial[a]	give a pure function representation of the minimal polynomial over the integers of the algebraic number a
MinimalPolynomial[a,x]	give the minimal polynomial of the algebraic number a as a polynomial in x
AlgebraicIntegerQ[a]	give True if the algebraic number a is an algebraic integer and False otherwise
AlgebraicNumberDenominator[a]	give the smallest positive integer n such that na is an algebraic integer
AlgebraicNumberTrace[a]	give the trace of the algebraic number a
AlgebraicNumberNorm[a]	give the norm of the algebraic number a
AlgebraicUnitQ[a]	give True if the algebraic number a is an algebraic unit and False otherwise
RootOfUnityQ[a]	give True if the algebraic number a is a root of unity and False otherwise

Functions for computing algebraic number properties.

The minimal polynomial of an algebraic number a is the lowest-degree polynomial f with integer coefficients and the smallest positive leading coefficient, such that f (a)=0.

This gives the minimal polynomial of

expressed as a pure function.

In[16]:=

Out[16]=

This gives the minimal polynomial of Root[#1⁵-2 #1+7&, 1]²+1 expressed as a polynomial in x.

In[17]:=

Out[17]=

An algebraic number is an algebraic integer iff its MinimalPolynomial is monic.

This shows that

is an algebraic integer.

In[18]:=

Out[18]=

This shows that

is not an algebraic integer.

In[19]:=

Out[19]=

This gives the smallest positive integer n for which

is an algebraic integer.

In[20]:=

Out[20]=

The trace of an algebraic number a is the sum of all roots of MinimalPolynomial[a].

This gives the trace of (-1)^1/7.

In[21]:=

Out[21]=

The norm of an algebraic number a is the product of all roots of MinimalPolynomial[a].

This gives the norm of

In[22]:=

Out[22]=

An algebraic number a is an algebraic unit iff both a and 1/a are algebraic integers, or equivalently, iff AlgebraicNumberNorm[a] is 1 or -1.

This shows that GoldenRatio is an algebraic unit.

In[23]:=

Out[23]=

This shows that AlgebraicNumber[Root[#1³-4#1+17&, 1], {1, 2, 3}] is not an algebraic unit.

In[24]:=

Out[24]=

An algebraic number a is a root of unity iff aⁿ=1 for some integer n.

This shows that

is a root of unity.

In[25]:=

Out[25]=

MinimalPolynomial[s,x,Extension->a]
	give the characteristic polynomial of the algebraic number s over the field [a]
MinimalPolynomial[s,x,Extension->Automatic]
	give the characteristic polynomial of the AlgebraicNumber object s over the number field generated by its first argument
AlgebraicNumberTrace[a,Extension->]
	give the trace of the algebraic number a over the field []
AlgebraicNumberTrace[a,Extension->Automatic]
	give the trace of the AlgebraicNumber object a over the number field generated by its first argument
AlgebraicNumberNorm[a,Extension->]
	give the norm of the algebraic number a over the field []
AlgebraicNumberNorm[a,Extension->Automatic]
	give the norm of the AlgebraicNumber object a over the number field generated by its first argument

Functions for computing properties of elements of algebraic number fields.

If a is AlgebraicNumber[

, coeffs], then MinimalPolynomial[a, x, Extension->Automatic] is equal to MinimalPolynomial[a, x]^d, where d is the extension degree of

(

(a).

The characteristic polynomial of

, represented as an element of an extension of rationals of degree 4, is the square of MinimalPolynomial of

In[26]:=

Out[26]=

The trace of an algebraic number is the sum of all roots of its characteristic polynomial. If a is AlgebraicNumber[

, coeffs], then AlgebraicNumberTrace[a, Extension->Automatic] is equal to d AlgebraicNumberTrace[a], where d is the extension degree of

(

(a).

The trace of

, represented as an element of an extension of rationals of degree 4, is twice the AlgebraicNumberTrace of

In[27]:=

Out[27]=

The norm of an algebraic number is the product of all roots of its characteristic polynomial. If a is AlgebraicNumber[

, coeffs], then AlgebraicNumberNorm[a, Extension->Automatic] is equal to AlgebraicNumberNorm[a]^d, where d is the extension degree of

(

(a).

The norm of

, represented as an element of an extension of rationals of degree 4, is the square of AlgebraicNumberNorm of

In[28]:=

Out[28]=

NumberFieldIntegralBasis[a]	give an integral basis for the field [a] generated by the algebraic number a
NumberFieldRootsOfUnity[a]	give the roots of unity for the field [a] generated by the algebraic number a
NumberFieldFundamentalUnits[a]	give a list of fundamental units for the field [a] generated by the algebraic number a
NumberFieldNormRepresentatives[a,m]
	give a list of representatives of classes of algebraic integers of norm ±m in the field [a] generated by the algebraic number a
NumberFieldSignature[a]	give the signature of the field [a] generated by the algebraic number a
NumberFieldDiscriminant[a]	give the discriminant of the field [a] generated by the algebraic number a
NumberFieldRegulator[a]	give the regulator of the field [a] generated by the algebraic number a
NumberFieldClassNumber[a]	gives the class number of a number field [a] generated by an algebraic number a

Functions of computing properties of algebraic number fields.

An integral basis of an algebraic number field K is a list of algebraic numbers forming a basis of the

-module of the algebraic integers of K. The set {a₁, ..., a_n} is an integral basis of an algebraic number field K iff a_i

K are algebraic integers, and every algebraic integer z

K can be uniquely represented as

with integer coefficients k_i.

Here is an integral basis of

(18^1/3).

In[29]:=

Out[29]=

This gives an integral basis of the field generated by the first root of 533+429 #1+18 #1²+#1³&.

In[30]:=

Out[30]=

NumberFieldIntegralBasis allows specifying the number field by giving a polynomial and a root number.

In[31]:=

Out[31]=

This gives the roots of unity in the field generated by Root[9-2 #²+#⁴&,4].

In[32]:=

Out[32]=

Here are all roots of unity in the field

In[33]:=

Out[33]=

{u₁, ..., u_n} is a list of fundamental units of an algebraic number field K iff u_i

K are algebraic units, and every algebraic unit u

K can be uniquely represented as

with a root of unity

and integer exponents n_i.

Here is a set of fundamental units of the field generated by the third root of #1⁴-10 #1²+1&.

In[34]:=

Out[34]=

This gives a fundamental unit of the quadratic field

In[35]:=

Out[35]=

This gives a set of representatives of classes of elements of norm 9 in the field generated by the first root of #1²-7&.

In[36]:=

Out[36]=

Here is a set of representatives of classes of elements of norm 2 in the field

In[37]:=

Out[37]=

This shows that the polynomial #⁵+#⁴+#³+#²+1& has 1 real root and 2 conjugate pairs of complex roots.

In[38]:=

Out[38]=

This shows that the field

[a] has 12 real embeddings and 6 conjugate pairs of complex embeddings.

In[39]:=

Out[39]=

The discriminant of a number field K is the discriminant of an integral basis {a₁, ..., a_n} of K (i.e., the determinant of the matrix with elements AlgebraicNumberTrace[a_i a_j, Extension->Automatic]). The value of the determinant does not depend on the choice of integral basis.

Here is the discriminant of

In[40]:=

Out[40]=

This gives the discriminant of the field generated by a root of the polynomial #⁵+#⁴+#³+#²+1&. The value of the discriminant does not depend on the choice of the root; hence, NumberFieldDiscriminant allows specifying just the polynomial.

In[41]:=

Out[41]=

The regulator of a number field K is the lattice volume of the image of the group of units of K under the logarithmic embedding

where

₁, ...,

_s are the real embeddings of K in

, and

_s+1, ...,

_s+t are one of each conjugate pair of the complex embeddings of K in

Here is the regulator of

In[42]:=

Out[42]=

This gives the regulator of the field generated by a root of the polynomial #1³-3 #1²+1&. The value of the regulator does not depend on the choice of the root; hence, NumberFieldRegulator allows specifying just the polynomial.

In[43]:=

Out[43]=

This gives the class number of

In[44]:=

Out[44]=

Ask a question about this page | Suggest an improvement | Leave a message for the team