MHB Solving a Polynomial Equation - Discussion in Fraleigh - Page 204

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading John Fraleigh's book, A First Course in Abstract Algebra.

I am at present reading Section 22: Rings of Polynomials.

I need some help with an aspect of Fraleigh's discussion of "solving a polynomial equation" or "finding a zero of a polynomial" ...

The relevant text in Fraleigh is as follows:View attachment 4560

In the above text, we read the following:

" ... ... In terms of this definition, we can rephrase the classical problem of finding all real numbers r such that $$r^2 + r - 6 = 0$$ by letting $$F = \mathbb{Q}$$ and $$E = \mathbb{R}$$ and finding all $$\alpha \in \mathbb{R}$$ such that

$$\phi_\alpha ( x^2 + x - 6 ) = 0
$$

that is finding all zeros of $$x^2 + x - 6$$ in $$\mathbb{R}$$ ... ... "My question is as follows:

What is the relevance of the field $$F$$? It appears that if we made $$F = \mathbb{R}$$ we would have achieved the same result ... .. indeed (if we regard a field as a subfield of itself) we could have taken $$F = E$$ and achieved the same result ...

Can someone please explain the relevance of the subfield $$F$$? ... ... I am sure that I am missing something ...

Peter
*** NOTE ***I do understand that changing $$F$$ changes the nature/type of the polynomials that can be input to the homomorphism $$\phi_\alpha$$ since the co-efficients of the polynomial come from $$F$$ ... but still do not really see the point or relevance of the subfield $$F$$ ...
 
Last edited:
Physics news on Phys.org
Hi Peter,

I could be wrong about this, but I think it comes down to the word "classical" used by Fraleigh. If I'm not mistaken, the classical problem is to split a polynomial over the integers, and it is known that this is equivalent to splitting a polynomial over the field $\mathbb{Q}$ (https://en.wikipedia.org/wiki/Factorization_of_polynomials)
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top