Computing the Minimal polynomial - Ring Theory

In summary, the conversation discusses a mistake in notes regarding the value of ##\alpha^2##. The correct value is ##\alpha^2=5+2\sqrt{6}##, as listed at the end. The procedure is also deemed correct. They go on to mention a text providing a proof of the irrationality of ##\sqrt{2}## using Eisenstein's theorem, but the conversation then points out that it is not necessary to use Eisenstein, as its conditions can be applied instead.
  • #1
chwala
Gold Member
2,746
387
TL;DR Summary
See attached
Am going through this notes...kindly let me know if there is a mistake on highlighted part. I think it ought to be;

##α^2=5+2\sqrt{6}##

1665581657607.png
 
Physics news on Phys.org
  • #2
chwala said:
Summary: See attached

Am going through this notes...kindly let me know if there is a mistake on highlighted part. I think it ought to be;

##α^2=5+2\sqrt{6}##

View attachment 315473
You are right. It is a mistake in the book and should be ##\alpha^2=5+2\sqrt{6}.## It is the correct value on the list at the end again. The procedure itself is correct.
 
Last edited:
  • Like
Likes chwala
  • #3
fresh_42 said:
You are right. It is a mistake in the book and should be ##\alpha^2=5+2\sqrt{6}.## It is the correct value on the list at the end again. The procedure it self is correct.
Thanks...let me peruse through...
 
  • #4
The text from Chwala provides a nice, clean proof of the Irrationality of ##\sqrt 2##, though Eisenstein theorem. Per that theorem, ## x^2 -2## has no Rational solution. A nice, handwavy proof.
 
  • #5
WWGD said:
The text from Chwala provides a nice, clean proof of the Irrationality of ##\sqrt 2##, though Eisenstein theorem. Per that theorem, ## x^2 -2## has no Rational solution. A nice, handwavy proof.
Yes, but Eisenstein uses the fact that ##\mathbb{Z}## is a UFD and ##2## is prime. With that, you don't need Eisenstein anymore:
\begin{align*}
\sqrt{2}=\dfrac{m}{n} \Longrightarrow 2n^2=m^2 \Longrightarrow 2\,|\,m \Longrightarrow 4\,|\,m^2\Longrightarrow 2\,|\,n^2
\end{align*}
contradicting the assumption that ##\dfrac{m}{n}## was cancelled.

Hence, you do not use Eisenstein, you use its conditions.
 

FAQ: Computing the Minimal polynomial - Ring Theory

What is the definition of a minimal polynomial in ring theory?

A minimal polynomial in ring theory is a monic polynomial of the smallest degree that has a given element as its root. It is used to describe the algebraic relationship between an element and its powers in a ring.

How is the minimal polynomial computed?

The minimal polynomial can be computed by finding the characteristic polynomial of the given element and then factoring it into irreducible polynomials. The minimal polynomial will be the lowest degree irreducible polynomial in this factorization.

Why is computing the minimal polynomial important in ring theory?

Computing the minimal polynomial is important in ring theory because it helps us understand the algebraic properties of elements in a ring. It can also be used to determine if two elements are algebraically related or if one element is a root of another polynomial.

What is the relationship between minimal polynomials and minimal ideals?

Minimal polynomials and minimal ideals are related in that a minimal polynomial can be used to generate a minimal ideal in a ring. The minimal polynomial will be the generator of the ideal and all other elements in the ideal can be obtained by multiplying the minimal polynomial with other elements in the ring.

Can a minimal polynomial have multiple roots?

Yes, a minimal polynomial can have multiple roots. This is because the minimal polynomial is defined as the monic polynomial of the smallest degree that has a given element as its root. If the given element has multiple roots, then the minimal polynomial will also have those roots.

Similar threads

Back
Top