PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very high
[parent] every PID is a UFD (Theorem)
PIDsAreUFDs

"every PID is a UFD" is owned by rm50.
(view preamble | get metadata)

View style:

See Also: UFD, unique factorization and ideals in ring of integers


This object's parent.

Attachments:
every PID is a UFD - alternative proof (Theorem) by joking
Log in to rate this entry.
(view current ratings)

Cross-references: sides, prime factors, matching, domain, terms, necessary, divide, integers, contradiction, maximal ideal, maximal element, product, expressible, unit, ascending chain condition, ideals, chain, irreducible element, Noetherian, divisor, ideal generated by, associates, elements, gcd's, gcd domain, prime, irreducible, noetherian ring, proof, UFD, unique factorization domain, principal ideal domain
There is 1 reference to this entry.

This is version 6 of every PID is a UFD, born on 2007-04-15, modified 2007-04-16.
Object id is 9196, canonical name is PIDsAreUFDs.
Accessed 2659 times total.

Classification:
AMS MSC13A15 (Commutative rings and algebras :: General commutative ring theory :: Ideals; multiplicative ideal theory)
 11N80 (Number theory :: Multiplicative number theory :: Generalized primes and integers)
 13G05 (Commutative rings and algebras :: Integral domains)
 16D25 (Associative rings and algebras :: Modules, bimodules and ideals :: Ideals)
 13F07 (Commutative rings and algebras :: Arithmetic rings and other special rings :: Euclidean rings and generalizations)

Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)