Ring of fractions
A Commutative ring is always a subring of a larger ring , called the ring of fractions, in which every nonzero element of that is not a zero divisor is a unit in . If is an integral domain, will be a field, called the field of fractions of .
Theorem 113.1.
Let be a commutative ring. Let be any nonempty subset of that does not contain , does not contain any zero divisors and is closed under multiplication. Then there is a commutative ring such that contains as a subring and every element of is a unit in . Also,
- every element of is of the form , for some and . If then is a field.
- is the “smallest” ring containing in which all elements of become units. Precisely, satisfies this universal property: If in an injective ring homomorphism such that is a unit for every , there exists a unique injective homomorphism such that .
Localization
We now generalize the notion of ring of fractions so that can have zero divisors. Note that when only contained non-zero divisors, the defining equivalence relation on was
We cannot use the same definition here: suppose and is such that . Since is a unit in , we have
forcing . The following definition provides the obvious remedy:
Definition 113.2.
5149e4Let be a commutative ring and be a multiplicative subset. The localization is the ring of fractions with , , modulo the relation
Standard examples of multiplicative sets include:
- , for a prime ideal
- , where is an integral domain (localizing at this just gives us the field of fractions of ).
If , is the zero ring, so we usually exclude form . There is a canonical embedding
which is injective iff does not contain any zero divisors.
There is a bijection between the set of prime ideals of and the set of prime ideals of that are disjoint from (stated here for integral domains, this apparently holds in general. Check this).
Localization of a module
Definition 113.3.
Let be an -module and be a multiplicative set. The localization of at is denoted or and constructed analogously to Definition 2.
iff for every there exists with . For , this gives: iff for every there is with . Equivalently, iff there exists with .