 |
|
| Science Forum Index » Mathematics Forum » Another splitting field... |
|
Page 1 of 1 |
|
| Author |
Message |
| Al2009... |
 Posted: Mon Nov 02, 2009 5:39 pm |
|
|
|
Guest
|
Hi,
I made several splitting fields x^q - x over Z_p ( where p is a prime number q=p^n) for the last couple of days.
When we factorise x^q - x over Z_p, the highest degree irreducible polynomial is always degree n.
For instance,
p=2, q=2^2=4, x^4-x = x * (x-1)(x^2 + 1) ---> The highest-degree irreducible polynomial is degree 2, which is x^2 + 1
p=3, q=3^2=9, x^9-x= x(x+1)(x-1)(x^2+1)(x^4 +1) ---> The highest-degree irreducible polynomial is degree 2, which is x^2 + 1, while (x^4+1) is reducible.
p=2, q=2^3 = 8 ,x^8 - x = x(x+1)(x^3+x^2+1)(x^3+x^2+1)---> The highest-degree irreducible polynomial is degree 3, which is x^3+x^2+1.
So all polynomial x^q - x over Z_p, the highest-degree irreducible polynomial is n, where q=p^n.
This does not look trivial to me. Why this pattern appears?
Thank you. |
|
|
| Back to top |
|
|
|
| Arturo Magidin... |
| Posted: Mon Nov 02, 2009 6:39 pm |
|
|
|
Guest
|
On Nov 2, 9:39 pm, Al2009 <algebra_whate... at (no spam) yahoo.ca> wrote:
[quote]Hi,
I made several splitting fields x^q - x over Z_p ( where p is a prime number q=p^n) for the last couple of days.
When we factorise x^q - x over Z_p, the highest degree irreducible polynomial is always degree n.
For instance,
p=2, q=2^2=4, x^4-x = x * (x-1)(x^2 + 1) ---> The highest-degree irreducible polynomial is degree 2, which is x^2 + 1
p=3, q=3^2=9, x^9-x= x(x+1)(x-1)(x^2+1)(x^4 +1) ---> The highest-degree irreducible polynomial is degree 2, which is x^2 + 1, while (x^4+1) is reducible.
p=2, q=2^3 = 8 ,x^8 - x = x(x+1)(x^3+x^2+1)(x^3+x^2+1)---> The highest-degree irreducible polynomial is degree 3, which is x^3+x^2+1.
So all polynomial x^q - x over Z_p, the highest-degree irreducible polynomial is n, where q=p^n.
This does not look trivial to me. Why this pattern appears?
[/quote]
Because the degree of the splitting field over Z_p is n; and the
extension is always simple: there is an element alpha such that Z_q Z_p(alpha). So the minimal polynomial of alpha must be a factor of x^q-
x over Z_p; this polynomial must be of degree n, since [Z_p
(alpha):Z_p] = degree(minimal polynomial of (alpha)).
--
Arturo Magidin
[quote]
Thank you.[/quote] |
|
|
| Back to top |
|
|
|
| Gerry Myerson... |
| Posted: Mon Nov 02, 2009 11:21 pm |
|
|
|
Guest
|
In article
<1703590632.852.1257219615788.JavaMail.root at (no spam) gallium.mathforum.org>,
Al2009 <algebra_whatever at (no spam) yahoo.ca> wrote:
[quote]Hi,
I made several splitting fields x^q - x over Z_p ( where p is a prime number
q=p^n) for the last couple of days.
[/quote]
That splitting field is the field of q elements.
[quote]When we factorise x^q - x over Z_p, the highest degree irreducible polynomial
is always degree n.
[/quote]
Because the field of q elements is of degree n over Z_p.
--
Gerry Myerson (gerry at (no spam) maths.mq.edi.ai) (i -> u for email) |
|
|
| Back to top |
|
|
|
| Al2009... |
| Posted: Tue Nov 03, 2009 11:08 am |
|
|
|
Guest
|
[quote]On Nov 2, 9:39Â pm, Al2009 <algebra_whate... at (no spam) yahoo.ca
wrote:
Hi,
I made several splitting fields x^q - x over Z_p (
where p is a prime number q=p^n) for the last couple
of days.
When we factorise x^q - x over Z_p, the highest
degree irreducible polynomial is always degree n.
For instance,
p=2, q=2^2=4, x^4-x = x * (x-1)(x^2 + 1) ---> The
highest-degree irreducible polynomial is degree 2,
which is x^2 + 1
p=3, q=3^2=9, x^9-x= x(x+1)(x-1)(x^2+1)(x^4 +1)
---> The highest-degree irreducible polynomial is
degree 2, which is x^2 + 1, while (x^4+1) is
reducible.
p=2, q=2^3 = 8 ,x^8 - x =
x(x+1)(x^3+x^2+1)(x^3+x^2+1)---> The highest-degree
irreducible polynomial is degree 3, which is
x^3+x^2+1.
So all polynomial x^q - x over Z_p, the
highest-degree irreducible polynomial is n, where
q=p^n.
This does not look trivial to me. Why this pattern
appears?
Because the degree of the splitting field over Z_p is
n; and the
extension is always simple: there is an element alpha
such that Z_q =
Z_p(alpha). So the minimal polynomial of alpha must
be a factor of x^q-
x over Z_p; this polynomial must be of degree n,
since [Z_p
(alpha):Z_p] = degree(minimal polynomial of (alpha)).
--
Arturo Magidin
Thank you.
[/quote]
That is a really helpful explanation for me to understand the basic ideas of finite fields.
Thank you so much. |
|
|
| Back to top |
|
|
|
|
|
All times are GMT - 5 Hours
The time now is Mon Dec 14, 2009 7:58 pm
|
|