help links subscribe changes refresh edit

	FrontPage
TouchGraph ←	↑	→ TypedGcd

TypeTowerDemo

Edit detail for TypeTowerDemo revision 5 of 5

	1 2 3 4 5
Editor: test1 Time: 2019/06/18 16:30:43 GMT+0
Note:

changed:
-This page demonstrates some features of Axiom.
This page demonstrates some features of FriCAS.

changed:
-Oh, interesting, Axiom figured out that by 1 we actually meant the polynomial 1 in $R$.
Oh, interesting, FriCAS figured out that by 1 we actually meant the polynomial 1 in $R$.

changed:
-Well, of course there is a common factor of $r_2$ an $r$. Can Axiom find it?
Well, of course there is a common factor of $r_2$ an $r$. Can FriCAS find it?

changed:
-apply Euclid's algorithm. Axiom simply stops by telling you that
apply Euclid's algorithm.  FriCAS simply stops by telling you that

changed:
-Of course, Axiom can compute a gcd of univariate polynomials.
Of course, FriCAS can compute a gcd of univariate polynomials.

This page demonstrates some features of FriCAS.

Let's begin with the construction of a polynomial ring in the indeterminate with coefficients from the ring of square matrices with entries that are polynomials where 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 . 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 .

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

fricas

degree r

$\label{eq9}2$

(9)

Type: PositiveInteger?

Let us add 1 to .

fricas

r+1

$\label{eq10}\begin{array}{@{}l} \displaystyle {{z}^{2}}+{{\left[ \begin{array}{cc} {{2 \ x}+ 1}&{{{x}^{2}}+ 2} \ 0 &{x + 2}$

(10)

Type: UnivariatePolynomial(z,SquareMatrix?(2,UnivariatePolynomial(x,PrimeField?(3))))

Oh, interesting, FriCAS figured out that by 1 we actually meant the polynomial 1 in .

fricas

one: R := 1

$\label{eq11}\left[ \begin{array}{cc} 1 & 0 \ 0 & 1$

(11)

Type: UnivariatePolynomial(z,SquareMatrix?(2,UnivariatePolynomial(x,PrimeField?(3))))

No no, it is not the unit square matrix. It is the unit square matrix multiplied by . Look at the type.

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

fricas

r2 := r*r

$\label{eq12}\begin{array}{@{}l} \displaystyle {{z}^{4}}+{{\left[ \begin{array}{cc} {x + 2}&{{2 \ {{x}^{2}}}+ 1} \ 0 &{{2 \ x}+ 1}$

(12)

Type: UnivariatePolynomial(z,SquareMatrix?(2,UnivariatePolynomial(x,PrimeField?(3))))

Well, of course there is a common factor of an . Can FriCAS 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 is the matrix ring and this is unfortunately not a field (not even an integral domain), so we cannot simply apply Euclid's algorithm. FriCAS simply stops by telling you that there is no applicable operation.

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

fricas