Does the Isomorphism Between Field Extensions Determine the Minimal Polynomial?

In summary, in this conversation the question was posed whether $\alpha_1$ necessarily has $l_2$ as its minimal polynomial over $F(\alpha_2)$. Evidence was presented suggesting that this is indeed the case, including the fact that $l_2$ is the minimal polynomial of $\alpha_1$ over $F(\alpha_2)$ and the relationship between the degrees of $l_2, l_1,$ and $m$. However, there is a potential issue with $q_2(\alpha_1)$, which requires further investigation.
  • #1
caffeinemachine
Gold Member
MHB
816
15
Let $L$ be an extension of a field $F$. Let $\alpha_1, \alpha_2\in L$ be such that both of them are algebraic over $F$ and have the same minimal polynomial $m$ over $F$. We know that there is an isomorphism $\phi:F(\alpha_1)\to F(\alpha_2)$ defined as $\phi(\alpha_1)=\alpha_2$ and $\phi(x)=x$ for all $x\in F$. We can extend $\phi$ to an isomorphism $\psi:F(\alpha_1)[x]\to F(\alpha_2)[x]$ defined as $\psi(\sum_{j=0}^k a_jx^j)=\sum_{j=0}^k \phi(a_j)x^j$. Let $l_1$ be the minimal polynomial of $\alpha_2$ over $F(\alpha_1)$ and define $l_2(x)=\psi(l_1(x))$.

QUESTION: Is is necessarily true that $\alpha_1$ has $l_2$ as its minimal polynomial over $F(\alpha_2)$.

I have some evidence which says that $l_2$ indeed is the minimal polynomial of $\alpha_1$ over $F(\alpha_2)$.

1. Say $l_2^*$ is the minimal polynomial of $\alpha_1$ over $F(\alpha_2)$. Then $[F(\alpha_1,\alpha_2):F(\alpha_2)]=\deg l_2^*$. Which gives $[F(\alpha_1,\alpha_2):F]=\deg l_2^*\cdot\deg m$. Similarly $[F(\alpha_1,\alpha_2):F]=\deg l_1\cdot\deg m$ and we conclude that $\deg l_1=\deg l_2^*$.

2. Since $l_1$ is the minimal polynomial of $\alpha_2$ over $F(\alpha_1)$, we must have that $l_1(x)|m(x)$ in $F(\alpha_1)[x]$. Thus there is an element $q_1(x)\in F(\alpha_1)[x]$ such that $l_1(x)q_1(x)=m(x)$. Operating $\psi$ on both the sides we get $l_2(x)q_2(x)=m(x)$, where $q_2(x)=\psi(q_1(x))$. Now since $m(\alpha_1)=0$, we have $l_2(\alpha_1)q_2(\alpha_1)=0$. If from here we can show that $l_2(\alpha_1)=0$ then we'd be done. But I can't rule out the possibility that $q_2(\alpha_1)=0$.

Can anyone help?
 
Physics news on Phys.org
  • #2
caffeinemachine said:
Let $L$ be an extension of a field $F$. Let $\alpha_1, \alpha_2\in L$ be such that both of them are algebraic over $F$ and have the same minimal polynomial $m$ over $F$. We know that there is an isomorphism $\phi:F(\alpha_1)\to F(\alpha_2)$ defined as $\phi(\alpha_1)=\alpha_2$ and $\phi(x)=x$ for all $x\in F$. We can extend $\phi$ to an isomorphism $\psi:F(\alpha_1)[x]\to F(\alpha_2)[x]$ defined as $\psi(\sum_{j=0}^k a_jx^j)=\sum_{j=0}^k \phi(a_j)x^j$. Let $l_1$ be the minimal polynomial of $\alpha_2$ over $F(\alpha_1)$ and define $l_2(x)=\psi(l_1(x))$.

QUESTION: Is is necessarily true that $\alpha_1$ has $l_2$ as its minimal polynomial over $F(\alpha_2)$.

I have some evidence which says that $l_2$ indeed is the minimal polynomial of $\alpha_1$ over $F(\alpha_2)$.

1. Say $l_2^*$ is the minimal polynomial of $\alpha_1$ over $F(\alpha_2)$. Then $[F(\alpha_1,\alpha_2):F(\alpha_2)]=\deg l_2^*$. Which gives $[F(\alpha_1,\alpha_2):F]=\deg l_2^*\cdot\deg m$. Similarly $[F(\alpha_1,\alpha_2):F]=\deg l_1\cdot\deg m$ and we conclude that $\deg l_1=\deg l_2^*$.

2. Since $l_1$ is the minimal polynomial of $\alpha_2$ over $F(\alpha_1)$, we must have that $l_1(x)|m(x)$ in $F(\alpha_1)[x]$. Thus there is an element $q_1(x)\in F(\alpha_1)[x]$ such that $l_1(x)q_1(x)=m(x)$. Operating $\psi$ on both the sides we get $l_2(x)q_2(x)=m(x)$, where $q_2(x)=\psi(q_1(x))$. Now since $m(\alpha_1)=0$, we have $l_2(\alpha_1)q_2(\alpha_1)=0$. If from here we can show that $l_2(\alpha_1)=0$ then we'd be done. But I can't rule out the possibility that $q_2(\alpha_1)=0$.

Can anyone help?

Here's an answer. abstract algebra - Minimal Polynomial Trouble - Mathematics Stack Exchange
 

FAQ: Does the Isomorphism Between Field Extensions Determine the Minimal Polynomial?

What is a minimal polynomial?

A minimal polynomial is the smallest degree monic polynomial that has a given number as its root. It is used to find the algebraic relationship between a root and its conjugates.

How is a minimal polynomial calculated?

The minimal polynomial can be calculated using the Cayley-Hamilton theorem, which states that the minimal polynomial of a square matrix is its characteristic polynomial. It can also be calculated by finding the roots of a polynomial and checking if they satisfy the given number.

What is the significance of the minimal polynomial in linear algebra?

In linear algebra, the minimal polynomial is used to find the Jordan canonical form of a matrix, which is a useful tool for solving systems of linear equations. It also helps in understanding the properties of a matrix, such as its eigenvalues and eigenvectors.

Can a minimal polynomial have multiple roots?

Yes, a minimal polynomial can have multiple roots. In fact, a minimal polynomial can have all of its roots as the given number, and this is known as a perfect power. However, in most cases, the minimal polynomial has distinct roots.

What are some common difficulties encountered with minimal polynomials?

One common difficulty is finding the minimal polynomial for a given number or matrix, as it involves finding the roots of a polynomial. Another challenge is determining the degree of the minimal polynomial, as it depends on the number of distinct roots. Additionally, there may be situations where the minimal polynomial does not exist for a given number or matrix.

Back
Top