Jump to content

Recommended Posts

Posted

Show that if f(x) is an irreducible polynomial over K and ⊂ L such that the degree of L over K and the degree of f(x) are relatively prime, then f(x) is irreducible over L.

Let x0 be a root of f(x) and n be a degree of f(x). Since f(x) is irreducible over K, the degree of K(x0) over K is n.

Let r be the degree of L over K. We know that n and r are relatively prime.

Let's assume that f(x) is reducible over L. Then x0 is root of one of its factorizing polynomials. Call its degree, m, where m < n. Since this polynomial is irreducible over L, the degree of L(x0) over L is m.

Since L includes KL(x0) includes K(x0). Call the degree of L(x0) over K(x0), t. We have the degree of L(x0) over K equals nt, because of the inclusions K ⊂ K(x0) ⊂ L(x0), and equals rm, because of the inclusions K ⊂ L ⊂ L(x0).

So, nt = rm. As n and r are relatively prime, n | m. But this contradicts that m < n. Thus, f(x) is irreducible over L.

QED.

Any doubts? 🙂

Posted

Write down a multiplication table for the elements of the finite field extension F2(α) where α2+α+1 = 0.

All elements of the field F2(α) have a form a+bα, where a and b are 0 or 1. Thus, the elements are, 0, 1, α, and 1+α. The multiplication table is:

0 x anything = 0

1 x anything = the same anything

α x α = 1+α

α x (1+α) = 1

(1+α) x (1+α) = α

The End.

 

Posted

Show that a field L with q = pn elements contains a field K with r = pm elements if and only if m | n.

 

A field with pn elements has degree n over the prime field Fp, [L : Fp] = n. 

A field with pm elements has degree m over the prime field Fp, [K : Fp] = m. 

If L contains K, then

[L : Fp] = [L : K] [K : Fp], i.e., n = [L : K] m.

Thus, m | n.

 

L consists of all roots of polynomial xq-x. K consists of all roots of polynomial xr-x. It can be proved by induction than if m | n, then all roots of the later are also roots of the former*. Thus, L contains K.

 

QED

 

* For example, if n = 2m then xq = (xr)r.

Posted (edited)

The following are my understandings related to the exercise in the previous post.

A field of pn elements consists of roots of the polynomial xq-x, where q=pn. These are combined roots of all irreducible polynomials over field Fp which divide xq-x. These are irreducible polynomials of degrees m such that m | n. Each of them contributes m roots to the field.

The number of elements in the field, pn, is sum of products m·Np(m), where Np(m) is number of irreducible polynomials of degree m over field Fp. This sum is for all m which divide n.

Edited by Genady
Posted (edited)

The last formula in the previous post can be used to calculate the numbers of irreducible polynomials without listing them.

For example, for p = 2 we get:

degree 1 polynomials, N2(1) = 21/1 = 2,

degree 2 polynomials, N2(2) = (22 - 1xN2(1))/2 = 1,

degree 3 polynomials, N2(3) = (23 - 1xN2(1))/3 = 2,

degree 4 polynomials, N2(4) = (24 - 1xN2(1) - 2xN2(2))/4 = 3,

degree 5 polynomials, N2(5) = (25 - 1xN2(1))/5 = 6.

 

These numbers can be compared with the finding in this earlier exercise:

 

Edited by Genady
Posted

Let S ⊆ M ⊆ L be field extensions.

1. Let S ⊆ M and M ⊆ L be normal extensions. Is S ⊆ L normal?

Not necessarily. Here is an example of it being "abnormal." 
Let S = Q, M = Q(21/2), L = Q(21/4). 
Polynomial x2-2 is irreducible over S and has both of its zeroes in M. So, S ⊆ M is normal.
Polynomial x2-21/2 is irreducible over M and has both of its zeroes in L. So, M ⊆ L is normal.
However, polynomial x4-2 is irreducible over S but has only two of its four zeroes in L. Thus, S ⊆ L is not normal.

2. Let S ⊆ L be normal. Is M ⊆ L normal?

Yes. Any polynomial irreducible over M is irreducible over S. If this polynomial has one zero in L it has all zeroes in L, because S ⊆ L is normal. Since it has all its zeros in L, M ⊆ L is normal, too.

3. Let S ⊆ L be normal. Is S ⊆ M normal?

Not necessarily. 
Let S = Q, M = Q(21/4), L = Q(21/4, i). 
Polynomial x4-2 is irreducible over S and has all its zeros in L. So, S ⊆ L is normal. However, it has only two of its four zeroes in M. Thus, S ⊆ M is not normal.

 

Posted

Is the extension K ⊆ L normal, where K = Q, L = Q(21/3)?

21/3 is zero of polynomial x3-2, which is irreducible in Q. Other two zeroes of this polynomial are complex and thus ∉ L. Hence, this extension is not normal.

Is such extension normal for K = Q(21/2), L = Q(21/4)?

21/4 is zero of polynomial x4-2, which is reducible in K, i.e., x4-2 = (x2 - 21/2)(x2 + 21/2). The first factor has both zeroes in L, while the second does not have any zeroes in L. Hence, this extension is normal.

Posted

Find all subgroups of the group of automorphisms G(L/K) and all corresponding subfields between the fields K and L, where K = Q and L is splitting field of the polynomial f(x) = (x2-2)(x2-5).

Each factor of f(x) above is irreducible in K. The first factor has zeroes ±21/2, the second has zeroes ±51/2. Thus L = Q(21/2, 51/2). The order of the group G(L/K) = [L : K] = 4, and it has four automorphisms:

s0: 21/2 → 21/2, 51/2 → 51/2

s1: 21/2 → 21/2, 51/2 → -51/2

s2: 21/2 → -21/2, 51/2 → 51/2

s3: 21/2 → -21/2, 51/2 → -51/2.

The subgroups are: H0 = {s0}, H1 = {s0, s1}, H2 = {s0, s2}, H3 = {s0, s3}.

The subfield corresponding to H0 fixes all elements in L and thus, it is Q(21/2, 51/2).   

The subfield corresponding to H1 fixes the element 21/2 and thus, it is Q(21/2).   

The subfield corresponding to H2 fixes the element 51/2 and thus, it is Q(51/2).

The subfield corresponding to H3 fixes the element (21/2×51/2) and thus, it is Q(101/2).

Posted

Apparently, an extension K ⊆ L being normal simply means that every irreducible polynomial over K has either all or none of its zeroes in L.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.