every PID is a UFD - alternative proof

Proposition. If $R$ is a principal ideal domain, then $R$ is a unique factorization domain.

Proof. Recall, that due to Kaplansky Theorem (see this article (http://planetmath.org/EquivalentDefinitionsForUFD) for details) it is enough to show that every nonzero prime ideal in $R$ contains a prime element.

On the other hand, recall that an element $p\\in R$ is prime if and only if an ideal $(p)$ generated by $p$ is nonzero and prime.

Thus, if $P$ is a nonzero prime ideal in $R$ , then (since $R$ is a PID) there exists $p\\in R$ such that $P=(p)$ . This completes the proof. $\\square$

单词	EveryPIDIsAUFDAlternativeProof
释义	every PID is a UFD - alternative proof Proposition. If $R$ is a principal ideal domain, then $R$ is a unique factorization domain. Proof. Recall, that due to Kaplansky Theorem (see this article (http://planetmath.org/EquivalentDefinitionsForUFD) for details) it is enough to show that every nonzero prime ideal in $R$ contains a prime element. On the other hand, recall that an element $p\\in R$ is prime if and only if an ideal $(p)$ generated by $p$ is nonzero and prime. Thus, if $P$ is a nonzero prime ideal in $R$ , then (since $R$ is a PID) there exists $p\\in R$ such that $P=(p)$ . This completes the proof. $\\square$
随便看	Sheafification1 SheafOfMeromorphicFunctions sheaf of meromorphic functions SheafOfSections sheaf of sections ShefferStroke Sheffer stroke SheilaScottMacintyre Sheila Scott Macintyre ShiftOperatorsInellp shift operators in ℓ^p ShiodaTateFormula Shioda-Tate formula ShortExactSequence short exact sequence ShortTaylorTheorem short Taylor theorem ShriDattathreyaRamachandraKaprekar Shri Dattathreya Ramachandra Kaprekar ShuffleOfLanguages shuffle of languages ShuntingYardAlgorithm shunting yard algorithm SidonSet Sidon set