login  home  contents  what's new  discussion  bug reports     help  links  subscribe  changes  refresh  edit

Edit detail for TypeTowerDemo revision 2 of 5

1 2 3 4 5
Editor: hemmecke
Time: 2008/08/18 12:06:24 GMT-7
Note:

changed:
-unfortunately not an integral domain. So Axiom simply stops by telling you that
unfortunately not a field (not even an integral domain), so we cannot simply
apply Euclid's algorithm. Axiom simply stops by telling you that

This page demonstrates some features of Axiom.

Let's begin with the construction of a polynomial ring R in the indeterminate z with coefficients from the ring S of square matrices with entries that are polynomials P=F[x] where F is the Galois field with 3 elements.

fricas
(1) -> F:= PrimeField 3

\label{eq1}\hbox{\axiomType{PrimeField}\ } \left({3}\right)(1)
Type: Type
fricas
P:=UnivariatePolynomial(x, F)

\label{eq2}\hbox{\axiomType{UnivariatePolynomial}\ } \left({x , \:{\hbox{\axiomType{PrimeField}\ } \left({3}\right)}}\right)(2)
Type: Type
fricas
S := SquareMatrix(2, P)

\label{eq3}\hbox{\axiomType{SquareMatrix}\ } \left({2, \:{\hbox{\axiomType{UnivariatePolynomial}\ } \left({x , \:{\hbox{\axiomType{PrimeField}\ } \left({3}\right)}}\right)}}\right)(3)
Type: Type
fricas
R := UnivariatePolynomial(z, S)

\label{eq4}\hbox{\axiomType{UnivariatePolynomial}\ } \left({z , \:{\hbox{\axiomType{SquareMatrix}\ } \left({2, \:{\hbox{\axiomType{UnivariatePolynomial}\ } \left({x , \:{\hbox{\axiomType{PrimeField}\ } \left({3}\right)}}\right)}}\right)}}\right)(4)
Type: Type

OK, now we have the type R. Let's construct an element. We start with constructing some coefficients first.

fricas
s1:S := matrix[[2*x +1 ,x^2-1],[0,x-1]]

\label{eq5}\left[ 
\begin{array}{cc}
{{2 \  x}+ 1}&{{{x}^{2}}+ 2}
\
0 &{x + 2}
(5)
Type: SquareMatrix?(2,UnivariatePolynomial?(x,PrimeField?(3)))
fricas
s2 := transpose s1

\label{eq6}\left[ 
\begin{array}{cc}
{{2 \  x}+ 1}& 0 
\
{{{x}^{2}}+ 2}&{x + 2}
(6)
Type: SquareMatrix?(2,UnivariatePolynomial?(x,PrimeField?(3)))

And now we build the polynomial.

fricas
r: R := z^2 + s1*z + s2

\label{eq7}\begin{array}{@{}l}
\displaystyle
{{z}^{2}}+{{\left[ 
\begin{array}{cc}
{{2 \  x}+ 1}&{{{x}^{2}}+ 2}
\
0 &{x + 2}
(7)
Type: UnivariatePolynomial?(z,SquareMatrix?(2,UnivariatePolynomial?(x,PrimeField?(3))))

Of course, since we work in characteristic 3, the following sum must be zero.

fricas
r+ 2*r

\label{eq8}0(8)
Type: UnivariatePolynomial?(z,SquareMatrix?(2,UnivariatePolynomial?(x,PrimeField?(3))))

Note that this is not the integer 0, but it is still a polynomial of type R.

Asking for the degree of r is no problem, because R is a univariate polynomial ring.

fricas
degree r

\label{eq9}2(9)
Type: PositiveInteger?

So let's see what happens if we multiply r by itself.

fricas
r2 := r*r

\label{eq10}\begin{array}{@{}l}
\displaystyle
{{z}^{4}}+{{\left[ 
\begin{array}{cc}
{x + 2}&{{2 \ {{x}^{2}}}+ 1}
\
0 &{{2 \  x}+ 1}
(10)
Type: UnivariatePolynomial?(z,SquareMatrix?(2,UnivariatePolynomial?(x,PrimeField?(3))))

Well, of course there is a common factor of r_2 an r. Can Axiom find it?

fricas
gcd(r2, r)
There are 4 exposed and 3 unexposed library operations named gcd having 2 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op gcd to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named gcd with argument type(s) UnivariatePolynomial(z,SquareMatrix(2,UnivariatePolynomial(x,PrimeField(3)))) UnivariatePolynomial(z,SquareMatrix(2,UnivariatePolynomial(x,PrimeField(3))))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need.

Ooops. What does that say?:

  Cannot find a definition or applicable library operation named gcd.

Ah, of course, the coefficient ring of R is the matrix ring S and this is unfortunately not a field (not even an integral domain), so we cannot simply apply Euclid's algorithm. Axiom simply stops by telling you that there is no applicaple operation.

Of course, Axiom can compute a gcd of univariate polynomials.

fricas
p1:=s1(1,1)

\label{eq11}{2 \  x}+ 1(11)
Type: UnivariatePolynomial?(x,PrimeField?(3))
fricas
p2:=s1(1,2)

\label{eq12}{{x}^{2}}+ 2(12)
Type: UnivariatePolynomial?(x,PrimeField?(3))
fricas
gcd(p1,p2)

\label{eq13}x + 2(13)
Type: UnivariatePolynomial?(x,PrimeField?(3))

OK, let us do that again.

fricas
q1: UP(x, INT) := 2*x+1

\label{eq14}{2 \  x}+ 1(14)
Type: UnivariatePolynomial?(x,Integer)
fricas
q2: UP(x, INT) := x^2+2

\label{eq15}{{x}^{2}}+ 2(15)
Type: UnivariatePolynomial?(x,Integer)
fricas
gcd(q1,q2)

\label{eq16}1(16)
Type: UnivariatePolynomial?(x,Integer)

Nice! Depending on where I compute these polynomials either have a common factor or are coprime.

Well, all depends on the underlying ring, of course.