Minimal Polynomials of Algebraic Elements

advertisement
OUTLINE
-
Definitions
Rings
Fields
Field Extensions
Algebraic
Minimal Polynomials
-
First Isomorphism Theorem
-
Main Theorem(for simple field extensions)
-
Example of Main Theorem
-
What if my field extension is not simple?!
WHAT IS A RING ?
A ring is a set R equipped with two binary operations called addition and multiplication
such that:
- (R,+) is an abelian (commutative) group
- (R, x) has the following properties:
- Closed
- Associative
- There is a multiplicative identity “1”
- Multiplication distributes over the addition
Examples:
-Z
, Z4 , R , Q
WHAT IS A FIELD ?
A field is commutative ring whose nonzero elements form a group under
multiplication
So a field is commutative ring whose nonzero elements each have a multiplicative
inverse
Examples:
- Zp where p is prime, R, Q, C
Non-examples:
- Zn where n is not prime
WHAT IS A FIELD
EXTENSION ?
Let K be a field. If a set k⊆ K is closed under the field operations and inverses in K (i.e.
k is a subfield of K) then we call K an extension field of k. We say K/k, “K over k,” is
a field extension.
Example:
- R and Q are both fields where Q ⊆ R. Therefore, R is an extension field of Q. We
could state this as: R/Q is a field extension. The same relationship holds for R ⊆C.
π‘ͺ
𝑹
𝑸
Extension field of R
Extension field of Q and
Subfield of C
Subfield of R
CONSTRUCTING AN EXTENSION FIELD
Consider a base field k. Adjoin with it an element α ∈ k to construct k(α), the smallest
field that contains the base field k and also α.
Example:
- If we start with the field Q, we can build the field extension Q(√2)/Q by adjoining
√2 to Q where Q(√2) = {a + b√2 | a, b ∈ Q} is an extension field.
Note: we call any extension of the form k(α) a simple extension field because only one
element is adjoined.
𝑸(√2)
𝑸
Extension
Field (K)
Subfield (k)
WHAT IS AN
ALGEBRAIC ELEMENT ?
If K is a field extension of k, then an element α∈ K is called algebraic over k if there
exists some non-zero polynomial g(x) ∈ k[x] such that g(α) = 0.
Example:
- Consider Q(√2), an extension field of Q. √2 is algebraic over Q since it is a root of
π’™πŸ − 𝟐 ∈ Q[x].
Non-Example:
- Consider Q(π). π is a root of x – π, but this polynomial is not in Q[x]. So, π is not
algebraic over Q.
WHAT IS A MINIMAL
POLYNOMIAL ?
Let α ∈ K be algebraic over k. The minimal polynomial of α is the monic polynomial p
∈k[x] of least degree such that p(α) = 0.
Proposition: The minimal polynomial is irreducible over k and any other non-zero
polynomial f(x) such that f(α) = 0 must be a multiple of p.
Example:
α = √2 element of Q(√2) where √2 is algebraic over Q. The minimal polynomial of
√2 is π’™πŸ − 𝟐.
WHAT ARE QUOTIENT
RINGS ?
A quotient ring is constructed out of a given ring R by a process of “moding out” by an
ideal I ⊆ R, denoted R/I.
Ex.1
𝒁/ πŸ‘ ≅ π’πŸ‘
In general, 𝒁/ 𝒑 ≅ 𝒁𝒑
Ex.2
𝑹 𝒙 / π’™πŸ + 𝟏 ≅ π‘ͺ
where π’™πŸ + 𝟏 is the ideal
Note, when you have a principal ideal, it is generator is the minimal polynomial
CONSEQUENCE OF THE
FIRST ISOMORPHISM THEOREM
Given K/k, with 𝛼 ∈ 𝐾 algebraic over k and the minimal polynomial 𝑝 of 𝜢, consider
the homomorphism
πœ‘: π‘˜ π‘₯
π‘˜ 𝛼
x
𝛼
N𝐨𝐭𝐞: ker πœ‘ = 𝑝
By the First Isomorphism Theorem,
π‘˜ π‘₯ / 𝑝 ≅ π‘˜(𝛼)
Domain
Kernel
Range
Given K = k(α), with α algebraic over k, how do we
compute the minimal polynomial of any β ∈ K ?
Main Theorem: Let K/k be a field extension, and let α ∈ K be algebraic over k.
Let 𝑝 ∈ π‘˜[π‘₯] be the minimal polynomial of α over k. Let 0 ≠ 𝛽 ∈ k(α), say
π‘Žπ‘œ + π‘Ž1 𝛼 + β‹― + π‘Žπ‘› 𝛼 𝑛
𝛽=
𝑏0 + 𝑏1 𝛼 + β‹― + π‘π‘š 𝛼 π‘š
where π‘Žπ‘– , 𝑏𝑗 ∈ π‘˜, 0 ≤ 𝑖 ≤ 𝑛, 0 ≤ 𝑗 ≤ π‘š. Let 𝑓 π‘₯ = π‘Žπ‘œ + π‘Ž1 π‘₯ + β‹― + π‘Žπ‘› π‘₯ 𝑛 and
𝑔(π‘₯) = 𝑏0 + 𝑏1 π‘₯ + β‹― + π‘π‘š π‘₯ π‘š be the corresponding polynomials in
π‘˜[π‘₯]. Consider the ideal 𝐽 =< 𝑝, 𝑔𝑦 − 𝑓 > of π‘˜[π‘₯, 𝑦]. Then the minimal
polynomial of 𝛽 over k is the monic polynomial that generates the ideal 𝐽 π‘˜ 𝑦 .
Note: since π‘˜ π‘₯ / 𝑝 ≅ π‘˜(𝛼), we can compute in π‘˜ π‘₯ / 𝑝
Proof.
Since π‘˜[π‘₯]/ 𝑝 is a field and 𝑔 𝛼 ≠ 0, there is a polynomial 𝑙 ∈ π‘˜ π‘₯ such that 𝑔𝑙
≡ 1 (π‘šπ‘œπ‘‘ 𝑝 ) that is 𝑔𝑙 − 1 ∈ 𝑝
Let β„Ž = 𝑓𝑙. Note that β„Ž 𝛼 = 𝛽.
Now consider the map πœ‘ ∢ π‘˜ 𝑦
π‘˜π‘₯/𝑝
𝑦
β„Ž+ 𝑝
≅
π‘˜(𝛼)
𝛽
π‘ž is in the kernel of πœ‘ if and only if π‘ž 𝛽 = 0. Therefore, the minimal polynomial of 𝛽
will be in the kernel of πœ‘.
We now find the generator of the kernel of 𝝋 because
this will be minimal polynomial !!!
…
By another theorem, the kernel of πœ‘ is 𝑝, 𝑦 − β„Ž
are considering the ideal 𝐽 =< 𝑝, 𝑔𝑦 − 𝑓 >.
π‘˜[𝑦] . Recall that we
So, if we can show 𝑝, 𝑦 − β„Ž =< 𝑝, 𝑔𝑦 − 𝑓 > then we know that the kernel of the map πœ‘ is
𝑝, 𝑔𝑦 − 𝑓 π‘˜[𝑦] , namely the minimal of 𝛽 is the monic polynomial that generates the ideal
𝐽 π‘˜ 𝑦 , and we are done!
To show this, use containment: 𝑝, 𝑔𝑦 − 𝑓 ⊇ 𝑝, 𝑦 − β„Ž
𝑦 − β„Ž = 𝑦 − 𝑓𝑙 ≡ 𝑙 𝑔𝑦 − 𝑓
π‘šπ‘œπ‘‘ 𝑝
𝑦 − β„Ž ∈ 𝑝, 𝑔𝑦 − 𝑓
Now show: 𝑝, 𝑔𝑦 − 𝑓 ⊆ 𝑝, 𝑦 − β„Ž
𝑔𝑦 − 𝑓 ≡ 𝑔 𝑦 − 𝑓𝑙 = 𝑔 𝑦 − β„Ž π‘šπ‘œπ‘‘ 𝑝
𝑔𝑦 − 𝑓 ∈ 𝑝, 𝑦 − β„Ž
𝑝, 𝑦 − β„Ž = 𝑝, 𝑔𝑦 − 𝑓
RESULTS!
The minimal polynomial of 𝜷 over k is the monic polynomial that
generates the ideal 𝑱 π’Œ[π’š]
This gives us an algorithm for finding the minimal polynomial:
Given 𝜢 and 𝜷 as in the theorem, compute the Groebner basis G
for the ideal 𝑝, 𝑔𝑦 − 𝑓 of k[x,y] with respect to the lex term
ordering x > y. The polynomial in G which is in y alone is the
minimal polynomial of 𝜷.
LET’S FIND THE MINIMAL POLYNOMIAL!
Consider the field Q(𝛼) , where 𝛼 is a root of the irreducible polynomial: π‘₯ 5 − π‘₯ − 2
We want to find the minimal polynomial for an element 𝛽 =
𝑓(𝛼)
𝑔(𝛼)
=
1− 𝛼 −2𝛼 3
𝛼
∈ 𝑄(𝛼)
Let’s construct the ideal as the theorem/algorithm
𝐽 = 𝑝, 𝑔(π‘₯)𝑦 − 𝑓(x) = π‘₯ 5 − π‘₯ − 2, π‘₯𝑦 − (1 − π‘₯ − 2π‘₯ 3 ) = π‘₯ 5 − π‘₯ − 2, π‘₯𝑦 + 2π‘₯ 3 + π‘₯
minimal polynomial of 𝛽!
THIS IS TRUE !
Recall, β =
1− α −2α3
α
and α is a root of x 5 − x − 2.
𝑦5 +
β5 +
1− α −2α3 5
)
α
(
+
11 4
𝑦 + 4𝑦 3 − 5𝑦 2 + 95y + 259
2
11 4
β
2
11 1− α −2α3 4
(
)
2
α
+ 4β3 − 5β2 + 95β + 259 =
+ 4(
1− α −2α3 3
)
α
− 5(
1− α −2α3 2
)
α
1− α −2α3
+ 95(
α
) + 259 =
…
=0
So, β is a root of the (irreducible over k) polynomial
𝟏𝟏 πŸ’
π²πŸ“ +
𝐲 + πŸ’π² πŸ‘ − πŸ“π² 𝟐 + πŸ—πŸ“π² + πŸπŸ“πŸ—
𝟐
This is the minimal polynomial for 𝜷 over k.
WHAT IF THE FIELD EXTENSION IS NONSIMPLE?
As defined, a simple field extension can be written with only one element adjoined to
the base field in order to make up the extension field.
A non-simple field extension has multiple elements adjoined to the base field to make
up the extension field.
Examples:
- Q( 𝟐, πŸ‘)
- R/Q
In a non-simple extension field, we want to extend our above theorem in order to find
the minimal polynomial of any element 𝜷 of π’Œ 𝜢𝟏 , 𝜢𝟐 , … , πœΆπ’
Given K = π’Œ 𝜢𝟏 , 𝜢𝟐 , … , πœΆπ’ , with 𝛼𝑖 ’s algebraic over k, how do
we compute the minimal polynomial of any β ∈ K ?
Main Theorem Revised: Let K= π‘˜ 𝛼1 , … , 𝛼𝑛 be a field extension, and let 𝛼𝑖 ’s
∈ K be algebraic over k. Let 𝑝𝑖 ∈ π‘˜ 𝛼1 , … , 𝛼𝑖−1 π‘₯𝑖 be the minimal polynomial
of 𝛼𝑖 over π‘˜ 𝛼1 , … , 𝛼𝑖−1 . Let 0 ≠ 𝛽 ∈ π‘˜ 𝛼1 , … , 𝛼𝑖−1 , say
𝑓(𝛼1 , … , 𝛼𝑛 )
𝛽=
𝑔(𝛼1 , … , 𝛼𝑛 )
where 𝑓, 𝑔 ∈ π‘˜ π‘₯1 , … . , π‘₯𝑛 . Consider the ideal 𝐽 =< 𝑝1 , … , 𝑝𝑛 , 𝑔𝑦 − 𝑓 >
contained in π‘˜[π‘₯1 , … , π‘₯𝑛 , 𝑦]. Then the minimal polynomial of 𝛽 over k is the
monic polynomial that generates the ideal 𝐽 π‘˜ 𝑦 .
Note: For 𝑖 = 2, … , 𝑛 and 𝑝 ∈ π‘˜ 𝛼1 , … , 𝛼𝑖−1 π‘₯𝑖 , we let 𝑝 be any polynomial in
π‘˜ π‘₯1 , … , π‘₯𝑖 such that 𝑝 𝛼1 , … , 𝛼𝑖−1 , π‘₯𝑖 = 𝑝.
Download