I’m calling this “Localization 1” since it is technically the beginning of the construction that we eventually want. But for now, I don’t even want to define what it means for a ring to be local, or why this may or may not be a (the) “localization.”

Last time we formed the field of fractions, but it came with some restrictions that we don’t need (as long as we don’t care that the end result isn’t a field). So today we will be forming the “ring of fractions.” Let’s think about what made that construction work. Essentially we didn’t want to “divide” by things that could end up as zero. This was the restriction that R be a domain. So let’s throw out that restriction, and just make sure there are no zero divisors. We also didn’t really care about the ring structure at all for the denominator. We only cared that it was closed under multiplication.

Let be a multiplicative set with 1 (it is closed under mult.) with no zero divisors. Now do the same exact construction as before on . We call the set of equivalence classes the ring of fractions and denote it . It is straightforward computation to check that this is still a ring.

Now the only reason I included 1 in S was so that there is a natural embedding given by . This embedding tends to be really nice for proving certain properties about the ring of fractions. One of these properties is exactly what we would hope: the embedding sends ideals to ideals, i.e. if an ideal such that , then is an ideal (with this being a bijection between prime ideals).

So the preimage under the embedding turns out to be fairly important. What is it on the element level? Well . And without giving too much away, we get the nice result that if is prime and , then . Then we get that if prime, then is prime. So maybe there will be some importance to the notion of prime later.

Now let’s backtrack and try to do this construction one more time (OK, so it will come up again next time, but…). We really, really don’t want to have to restrict the set S to have no zero divisors. This is just too pesky of a condition. Can we somehow get around it?

This time let’s suppose is multiplicative with 1, and let’s only assume . There can be zero divisors, though. Let . Then is an ideal. Clearly if then pick such that and . Then and , so . Also and , (since we’ve assumed commutativity) we clearly have .

Since we have a perfectly good ideal, and this ideal in a sense mimics the property of zero divisors, we do the natural thing and mod out by it. Thus form , and . Then has no zero divisors in . Suppose there was one, say . Then there exists such that . By definition of the “bar” we have that for some and for some (and ), so so which means that s itself was a zero divisor. But trivially all zero divisors are sent to 0 under the mapping, so .

So we form by first canonically factoring through . Why all this trouble? In essence what we are trying to do is form a new minimal ring that contains the old ring such that every element is a unit. If the kernel of the mapping is not {0} (i.e. there were zero divisors in the set), then the mapping is not an embedding and so the new ring doesn’t contain the old ring. The astute reader will note that this almost seems like a universal construction. This is what we’ll do when I actually get to localization for real.

## One thought on “Localization 1”