Finding roots in an extension field

In summary, the Frobenius automorphism maps the roots of a polynomial to the roots of the same polynomial.
  • #1
PsychonautQQ
784
10

Homework Statement


Let q be a root of p(x) = x^3 + x^2 + 1 in an extention field of Z2 (integers modulus 2). Show that Z2(q) is a splitting field of p(x by finding the other roots of p(x)

hint: this question can be greatly simplified by using the frobenius automorphism to find these zero's

Homework Equations


frobenius automorphism : f(a) = a^p

The Attempt at a Solution


So we are given one root and need to prove that this is enough to when adjoined to the original field to get the other two roots...

so p(q) = 0
and p(x) = (x-q)m(x) where m(x) is of degree 2

I'm a little confused on how to use the frobenius automorphism here or even why it would help at all...
anyone have any insight for me?
 
Physics news on Phys.org
  • #2
Have you tried to compute ##f(q)##? Is it a root again? You know ##q≠1##.
 
  • Like
Likes PsychonautQQ
  • #3
warning: i use p(x) to express the polynomial I'm trying to find the roots of and also f(q) = q^p, where p is the prime that the frobenius automorphism maps to. Sorry for unnecessary confusion >.<...

wouldn't q^p = q in Z mod 2? I mean, if q is odd then q = q^p = 1, if q is even then q = q^p = 0... perhaps these roots are not integers, i probably should have figured that >.< haha.

Does the solution have to do with the fact that if we apply the frobenius autmorphism to p(x), it will fix the coefficients of each term?

f(q) = q^p. I am not sure if this is a root or not. I suppose it must be for the reason I just stated, if i apply the frobenius morphism as so: f(0) = f(p(q)) = p(q^p), so yes, it appears that q^p is a root of p(x)... but how do we know that q^p doesn't equal q? Also, it's still a bit foggy to me how this frobenius morphism is going to help me prove the main question, i don't understand the connection very clearly. Thanks for being so patient with me!
 
  • #4
Well, you have everything at hand, resp. said already. (again ...:smile:)

Your ##p##'s are really confusing. Let us denote the prime by ##2## and the minimal polynomial ##p(x) = x^3 +x^2 + 1 \in ℤ_2[x]##.
The good news is we don't have to bother signs and ##a+a=0## for any ##a##.

You've told me last time that automorphisms map roots to roots.
Since ##f(q) = q^2## is a root, we obstinately could divide ##p(x)## by ##(x+q)## and next by ##(x+q^2)## and find the third root. With ##p(q)=0## we can get rid of the higher potentials of ##q##. If there will be a remainder somewhere, then we must have done something wrong.

Edit: the "again" above has been meant as: You know more than you think you know.
 
Last edited:
  • Like
Likes PsychonautQQ
  • #5
Automorphisms map roots to roots, how interesting. No matter what polynomial in what subfield, the roots will be mapped to roots. Should this be obvious or are automorphisms amazing? I realize that automorphisms are all about preserving basically everything, but still, why is it obvious that a counter example to this would be impossible? Like i understand that automorphisms should always map roots to roots if it fixes every coefficient in the polynomial, but even if these coefficients arn't fixed it still maps roots to roots? o_O cool.
 
  • #6
There's another hint: If ##f## maps roots to roots, what does ##f^2##? (I admit I stubborn calculated the third root and found out afterwards that it is ##f^2(q)##. Silly me.)
 
  • Like
Likes PsychonautQQ
  • #7
PsychonautQQ said:
Automorphisms map roots to roots, how interesting. No matter what polynomial in what subfield, the roots will be mapped to roots. Should this be obvious or are automorphisms amazing? I realize that automorphisms are all about preserving basically everything, but still, why is it obvious that a counter example to this would be impossible? Like i understand that automorphisms should always map roots to roots if it fixes every coefficient in the polynomial, but even if these coefficients arn't fixed it still maps roots to roots? o_O cool.
No, I don't think so. Please forget this at once. The Frobenius automorphism you mentioned isn't any automorphism! And you can easily check whether ##q^2## is a root of ##p(x)## by dividing ##p## by ##x+q^2##
Edit: ... or easier whether ##(q^2)^3 + (q^2)^2 + 1 = 0##.
 
Last edited:
  • #8
PsychonautQQ said:
Automorphisms map roots to roots, how interesting.
Let us be more careful here.

If we have a field extension ##\mathbb{F} \subset \mathbb{E}##, a polynomial ## p(x) \in \mathbb{F}[x]## and an automorphism ##σ \in Aut(\mathbb{E} / \mathbb{F})##, i.e. ##σ(a) = a## for all ##a \in \mathbb{F}##, then for every zero ##z \in \mathbb{E}## of ##p(x)## we get: $$0 = p(z) ⇒ 0 = σ(0) = σ(p(z)) = p(σ(z))$$ So the crucial point here is the invariance of ##\mathbb{F}## under ##σ## that allows us the "root hopping" with automorphisms.
 

FAQ: Finding roots in an extension field

What is an extension field?

An extension field is a field that contains elements which are not found in the base field. In other words, it is an extension of the base field with additional elements.

Why is it important to find roots in an extension field?

Finding roots in an extension field is important because it allows us to solve polynomial equations that cannot be solved in the base field. This expands our ability to solve mathematical problems and make new discoveries.

How do you find roots in an extension field?

To find roots in an extension field, we use the concept of algebraic closure, which states that every polynomial equation has a root in an extension field. We can then use various techniques such as factoring, substitution, and the quadratic formula to find the roots.

Can all polynomials be solved in an extension field?

No, not all polynomials can be solved in an extension field. Some polynomials may have roots that cannot be expressed in the extension field, known as non-algebraic numbers. In such cases, we can only approximate the root.

How is finding roots in an extension field relevant in real-world applications?

Finding roots in an extension field is relevant in many real-world applications, such as cryptography, coding theory, and signal processing. These fields involve complex mathematical problems that can be solved more efficiently by using extensions fields and their roots.

Similar threads

Replies
12
Views
2K
Replies
3
Views
1K
Replies
1
Views
1K
Replies
2
Views
1K
Replies
1
Views
1K
Replies
7
Views
2K
Back
Top