Minimum polynomial over a field

In summary: If a field extension F/E is simple and the minimum polynomial of a is a monic irreducible polynomial of degree n over E, then [F: E] = nIn summary, the dimension over Q (rationals) of the extension Q(sqrt(3+2sqrt2)) is 2. This is because (3+2sqrt2) can be simplified to (1+sqrt2)^2 and the minimum polynomial with sqrt(3+2sqrt2) as a root is (x^2)-2x-1, which is irreducible. Additionally, the relevant theorem states that if a field extension is simple and the minimum polynomial of an element is a monic irreducible polynomial of degree n over the base field
  • #1
math8
160
0
The question is to determine the dimension over Q(rationals)of the extension Q(sqrt(3+2sqrt2)).
So we need to find [Q(sqrt(3+2sqrt2)): Q].

All I can say is that (3+2sqrt2) = (1+sqrt2)^2.
I also know that we're trying to find the degree of the minimum polynomial over Q that has sqrt(3+2sqrt2) as a root.

But I don't know how to proceed.
 
Physics news on Phys.org
  • #2
I'm not really sure how to explain it, but it seems obvious to me how to go about constructing that particular field extension out of other field extensions that are very easy to understand. (And your observation makes this even more obvious)

You have a problem: you want to compute [Q(sqrt(3+2sqrt2)): Q].
You can simplify this problem.
Do so.
 
  • #3
I would say that this degree is 2, and the minimum polynomial is (x^2)-2x-1.
 
  • #4
My question is, are there some other details that need to be specified other than showing that (x^2)-2x-1 is irreducible?
 
  • #5
You don't actually need to find the minimal polynomial of that element. You just have to find the degree of the field extension. And you already know the degree of Q(sqrt(3+2sqrt2)); it would be clear if you wrote the extension differently...

If you're not sure about the details, you can always look at the definitions and theorems! It would certainly be faster than asking for help over the internet. :wink:

But yes, the relevant theorem is:
Theorem: If f is an irreducible integer polynomial of degree d, and f(a) = 0, then [Q(a) : Q] = d.
 

FAQ: Minimum polynomial over a field

What is a minimum polynomial over a field?

A minimum polynomial over a field is a polynomial with the smallest degree that has the given element as a root. It is also known as the minimal polynomial.

What is the significance of finding the minimum polynomial over a field?

Finding the minimum polynomial over a field is significant because it helps us understand the algebraic properties of the given element. It also helps us find the algebraic relationship between the given element and other elements in the field.

How is the minimum polynomial over a field calculated?

The minimum polynomial over a field can be calculated using different methods such as the Euclidean algorithm, the Berlekamp-Massey algorithm, and the Cantor-Zassenhaus algorithm. These algorithms use the properties of the given element and the field to find the minimum polynomial.

Can a polynomial have more than one minimum polynomial over a field?

No, a polynomial can have only one minimum polynomial over a field. This is because the minimum polynomial is unique for a given element and field.

What is the relationship between the degree of the minimum polynomial over a field and the degree of the field extension?

The degree of the minimum polynomial over a field is always less than or equal to the degree of the field extension. This means that the degree of the minimum polynomial gives us information about the degree of the field extension.

Back
Top