Primitives and minimal polynomials

829 Views Asked by At

got this assignment from my coding class and don't know if I've made it correct. Can someone tell if my methods for solving the tasks are correct?

Let $f(x) = 1 + x ^3 + x ^4$ . It is given that $f(x)$ is irreducible in $K[x]$. Let $F = GF(2^4 )$ be $K[x] modulo f(x)$ and let be $x modulo f(x)$ in $F$.

a) By making a table expressing $1, \beta, \beta^2... \beta^{14}$ in the form $a_0 + a_1\beta + a_2\beta^2 + a_3\beta^3$ (or $a_0a_1a_2a_3)$ with the a_i in $K$, verify that $\beta$ is a primitive element of $F$.

So after constructing the table I made the following equation:

$p(\beta)=1+\beta^3+\beta^4$ and after inputting the corresponding values from the table $p( \beta) = 1000 + 0001 + 1001 = 0000$ so $\beta$ is a primitive

b) Let $\alpha$ be $\beta^{12}$. Is $\alpha$ a primitive element of F?

so the equation is now $p(\beta^{12})=1+(\beta^{12})^3+(\beta^{12})^4 = 1 + \beta^{36} + \beta^{48}$. Here I'm not actually sure. The table is only till $\beta^{14}$ and in the book i've found that $\beta^{15} = 1$? so following this $\beta^{36} = \beta^6$ and $\beta^{48} = \beta^3$ and the equation gets the following form $p(\beta^{12})=1000+1111+0001=0110$ so $\beta^{12}$ is not a primitive?

c) Find the minimal polynomial $m(x)$ in $K[x]$ for $\alpha$ as in (b)

so $\alpha = \beta^{12}$, and $m_a(\beta^{12})=a_01+a_1\beta^{12}+a_2(\beta^{12})^2+a_3(\beta^{12})^3+a_4(\beta^{12})^4=a_01+a_1\beta^{12}+a_2\beta^{24}+a_3\beta^{36}+a_4\beta^{48} = a_0(1000)+a_1(1100)+a_2(1010)+a_3(1111)+a_4(0001)$. solving the equation gives $a_0=a_1=a_2=a_3=a_4=1$ and $m_\alpha(x) = 1 + x + x^2 + x^3 + x^4$ and the roots are $\{\beta^{12},\beta^{24},\beta^{36},\beta^{48}\}$ and $m_{12}(x)=m_{24}(x)=m_{36}(x)=m_{48}(x)$ denote the minimal polynomials of $\beta^i$

1

There are 1 best solutions below

6
On

Your test that $1000+0001+1001 = 0000$, that is, $1+\beta^3+\beta^4 = 0$ shows only that $\beta$ is a root of $1+x^3+x^4$ and not that $\beta$ is primitive (meaning of order $15$). What shows that $\beta$ is primitive is that $1, \beta, \beta^2, \ldots, \beta^{14}$ all have different representations as polynomials of degree at most $3$ in $\beta$ and so $\beta$ has order $15$ or more; and when you compute $\beta^{15}$ as a polynomial of degree at most $3$ in $\beta$, you find that $\beta^{15} = 1$ and so $\beta$ is indeed of order $15$ and hence primitive.

On the other hand, $\alpha = \beta^{12}$ is not a primitive element. Here, it is simpler to use the result that

$${\sf ord}(\beta^k) = \frac{{\sf ord}(\beta)}{\gcd({\sf ord}(\beta), k)}$$ to deduce that $\beta^{12}$ is an element of order $5$. Or, you could try showing that $\alpha^5 = \beta^{60} = 1$, hopefully without grinding out the table to $60$ terms (hint: you already know that $\beta^{15}=1$). So, $\alpha$ is an element of order $5$ or a divisor of $5\quad$....