MHB Maximal Ideals - Exercise 5.1 (iii) Rotman AMA

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Exercise
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Joseph J. Rotman's book: Advanced Modern Algebra (AMA) and I am currently focused on Section 5.1 Prime Ideals and Maximal Ideals ...

I need some help with Exercise 5.1, Part (iii) ... ...Exercise 5.1 reads as follows:
View attachment 5943Can someone please help me to get a start on this exercise ...

Peter
 
Physics news on Phys.org
Hint:

over a field $F$, the ring $F[x]$ is a Euclidean domain (with Euclidean function $\text{deg}$), and thus a fortiori a principal ideal domain, and also a unique factorization domain.

So maximal ideals are generated by irreducible polynomials, which *are* the prime ideals as well, since irreducibles are prime and vice-versa.

Due to the Fundamental Theorem of Algebra, part (iii) is actually easier than part (ii).
 
Deveno said:
Hint:

over a field $F$, the ring $F[x]$ is a Euclidean domain (with Euclidean function $\text{deg}$), and thus a fortiori a principal ideal domain, and also a unique factorization domain.

So maximal ideals are generated by irreducible polynomials, which *are* the prime ideals as well, since irreducibles are prime and vice-versa.

Due to the Fundamental Theorem of Algebra, part (iii) is actually easier than part (ii).
Thanks for the help, Deveno ... appreciate it

Not quite sure what you are saying about Part (ii) though ... again we have a PID and so again, as you say, the maximal ideals are generated by irreducible polynomials, which *are* the prime ideals as well, since irreducibles are prime and vice-versa ... so answer seems the same ...

Can you clarify ...

Peter
 
$\Bbb C[x]$ has a lesser variety of irreducible polynomials that $\Bbb R[x]$ does. For example, $x^2 + 1 = (x + i)(x - i)$ is reducible in $\Bbb C[x]$, but is irreducible in $\Bbb R[x]$.

This is because $\Bbb C$ is algebraically closed, and $\Bbb R$ is not.
 
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