other exercises: 20241128_DiskMat_Serie10.pdf further references:

5.10 a) To show that is a field, we have to show that is irreducible (Theorem 5.37).

Thus, does not have any roots. Since is a polynomial of degree 2 and has no root, is irreducible (Corollary 5.30). Thus, is a field (Theorem 5.37).


5.10 b) We will find a generator of , where

Since is a polynomial of degree over , and has elements,

Thus, an element needs to have

We assume is a generator of :

Since , . Since generates a finite field and has the same cardinality as , is isomorphic to (Theorem 5.39). Thus, is a generator of .


5.10 c) Let in ().

The roots of are elements , for which (Def. 5.33). Since is a polynomial of degree , has at most roots (Theorem 5.31).

Because is a polynomial with degree , elements of are polynomials with degree (Def. 5.34) with coefficients in . Thus, each element in can be written as

where . By substituting each of the 27 elements of for in , we can find the roots of . Since it is quite time-consuming to do the calculations by hand, I have written a python script for this purpose diskmat_serie10_5c.py:

from sympy import symbols, div, Poly, GF
 
# Define the variables
x,y = symbols('x y')
 
# define all (27) elements
elements = [0,1,2,x,2*x,x**2,2*x**2, x**2+1, x**2+2, 2*x**2+1, 2*x**2+2,
    x**2+x, 2*x**2+x, x**2+2*x+1, x**2+2*x+2, x**2+x+1, x**2+x+2,
    2*x**2+2*x+1, 2*x**2+2*x+2, 2*x**2+x+1, 2*x**2+x+2, 2*x+1, 2*x+2,
    x+1, x+2, x**2+2*x, 2*x**2+2*x]
denominator = Poly(x**3+2*x**2+1,x)
 
# compute all elements
for idx, y in enumerate(elements):
    numerator = Poly(y**2+y*2*(x**2+x)+(x**2+2), x)
 
    # Perform division in Z_3
    quotient, remainder = div(numerator, denominator, domain=GF(3))
 
    # the remainder of the division is the same as modulo polynomial
    print(f"{str(idx).zfill(2)}: {y}".ljust(20), remainder)

The results of the inserted elements:

00: 0                Poly(x**2 - 1, x, modulus=3)
01: 1                Poly(-x, x, modulus=3)
02: 2                Poly(-x**2 + x, x, modulus=3)
03: x                Poly(0, x, modulus=3)
04: 2*x              Poly(x**2 + 1, x, modulus=3)
05: x**2             Poly(0, x, modulus=3)
06: 2*x**2           Poly(x**2 + x - 1, x, modulus=3)
07: x**2 + 1         Poly(x**2 - x + 1, x, modulus=3)
08: x**2 + 2         Poly(-x**2 + x + 1, x, modulus=3)
09: 2*x**2 + 1       Poly(x**2, x, modulus=3)
10: 2*x**2 + 2       Poly(x**2 - x, x, modulus=3)
11: x**2 + x         Poly(x**2 - 1, x, modulus=3)
12: 2*x**2 + x       Poly(x**2 + x - 1, x, modulus=3)
13: x**2 + 2*x + 1   Poly(-x**2 - 1, x, modulus=3)
14: x**2 + 2*x + 2   Poly(-1, x, modulus=3)
15: x**2 + x + 1     Poly(-x**2 + x, x, modulus=3)
16: x**2 + x + 2     Poly(-x, x, modulus=3)
17: 2*x**2 + 2*x + 1 Poly(x, x, modulus=3)
18: 2*x**2 + 2*x + 2 Poly(x, x, modulus=3)
19: 2*x**2 + x + 1   Poly(x**2 - x, x, modulus=3)
20: 2*x**2 + x + 2   Poly(x**2, x, modulus=3)
21: 2*x + 1          Poly(-1, x, modulus=3)
22: 2*x + 2          Poly(-x**2 - 1, x, modulus=3)
23: x + 1            Poly(-x**2 + x + 1, x, modulus=3)
24: x + 2            Poly(x**2 - x + 1, x, modulus=3)
25: x**2 + 2*x       Poly(x**2 + 1, x, modulus=3)
26: 2*x**2 + 2*x     Poly(x - 1, x, modulus=3)

As we can see, and . To verify the roots:

  • for :
  • for :

Since and , are roots of (Def 5.33). Due to (Theorem 5.31) are all roots of .