MHB Prime and Maximal Ideals in PIDs .... Rotman, AMA Theorem 5.12

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Prime Theorem
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 understanding the proof of Theorem 5.12 ... ...Theorem 5.12 reads as follows:View attachment 5940
In the above text Rotman writes the following:" ... ... If $$(p) \subseteq J = (a)$$, then $$a|p$$. Hence either $$a$$ and $$p$$ are associates, in which case $$(a) = (p)$$, or $$a$$ is a unit, in which case $$J = (a) = R$$. ... ... ... "My question is as follows:Rotman argues, (as I interpret his argument), that $$a|p$$ implies that either $$a$$ and $$p$$ are associates ... or ... $$a$$ is a unit ...Can someone please explain (slowly and clearly :) ) why this is the case ... ... ?Hope someone can help ... ...

Peter
 
Physics news on Phys.org
Peter said:
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 understanding the proof of Theorem 5.12 ... ...Theorem 5.12 reads as follows:
In the above text Rotman writes the following:" ... ... If $$(p) \subseteq J = (a)$$, then $$a|p$$. Hence either $$a$$ and $$p$$ are associates, in which case $$(a) = (p)$$, or $$a$$ is a unit, in which case $$J = (a) = R$$. ... ... ... "My question is as follows:Rotman argues, (as I interpret his argument), that $$a|p$$ implies that either $$a$$ and $$p$$ are associates ... or ... $$a$$ is a unit ...Can someone please explain (slowly and clearly :) ) why this is the case ... ... ?Hope someone can help ... ...

Peter

I have been reflecting on my question and believe the answer is something like the following:Firstly ... we are given that $$p$$ is irreducible ...

Now ... $$p$$ irreducible

$$\Longrightarrow p$$ is non-zero and $$p$$ not a unit ... and ... where $$p$$ equals a product,

say, $$p = ra$$ ... then one of $$a$$ and $$r$$ is a unit ... Now, $$a|p \Longrightarrow p = ra$$ for some $$r \in R$$

So then we have that:

$$p$$ irreducible and $$p = ra \Longrightarrow$$ one of $$a$$ and $$r$$ is a unit ...

If $$r$$ is a unit then $$a$$ and $$p$$ are associates ... ...

... otherwise $$a$$ is a unit ...
Can someone confirm that this is correct ... or alternatively point out shortcomings and errors in the analysis ...

Peter
 
I have this solution for you.

First, a notation:
$a\sim b$ for $a,b\in R$ iff $a$ and $b$ are associates iff there is a unit $u\in R$ such that $a=ub$.
$\sim$ is an equivalence relation.

R is a PID and commutative.
Given $a\mid p$ and $(p)$ is an prime ideal. And you want to prove that $a\sim p$ or $a\sim 1$ ($a$ is a unit).

$a\mid p$, so there is a $x\in R$ such that $p=xa$, this means that $xa\in (p)$.
$(p)$ is a prime ideal thus (1) $a\in (p)$ or (2) $x\in (p)$

Suppose (1) $a\in (p)$, then there is an $r\in R$ such that $a=rp$.
Then $p=xrp$, and because $R$ is a domain, $xr=1$, i.e., $x$ is a unit and $a\sim p$.

Suppose (2) $x\in (p)$, then there is an $s\in R$ such that $x=sp$.
Then $p=asp$, and because $R$ is a domain, $as=1$, i.e., $a$ is a unit and $a\sim 1$ $\Box$

You fill in the rest of the proof.
 
steenis said:
I have this solution for you.

First, a notation:
$a\sim b$ for $a,b\in R$ iff $a$ and $b$ are associates iff there is a unit $u\in R$ such that $a=ub$.
$\sim$ is an equivalence relation.

R is a PID and commutative.
Given $a\mid p$ and $(p)$ is an prime ideal. And you want to prove that $a\sim p$ or $a\sim 1$ ($a$ is a unit).

$a\mid p$, so there is a $x\in R$ such that $p=xa$, this means that $xa\in (p)$.
$(p)$ is a prime ideal thus (1) $a\in (p)$ or (2) $x\in (p)$

Suppose (1) $a\in (p)$, then there is an $r\in R$ such that $a=rp$.
Then $p=xrp$, and because $R$ is a domain, $xr=1$, i.e., $x$ is a unit and $a\sim p$.

Suppose (2) $x\in (p)$, then there is an $s\in R$ such that $x=sp$.
Then $p=asp$, and because $R$ is a domain, $as=1$, i.e., $a$ is a unit and $a\sim 1$ $\Box$

You fill in the rest of the proof.
Thanks Steenis ... appreciate your help ...

Just working through your post now ...

Peter
 
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