Well, things can get ultra busy around mid-terms. I don’t think I’ve posted in two weeks. What I really wanted to do next was to post some category theory basics. I’m not sure if I should, though, since so many math blogs have already done this. I then wanted to go on to define the fundamental group purely in categorical language. It turns out to be a really nice construction compared to the tedious typical way.

Instead, I’ve recently become quite interested in rings. There also seems to be a very large lack of “pure” ring theory in the blogosphere. Sure rings pop up and are needed by people doing things with algebraic geometry, say, but using ring theory isn’t the same as developing it.

I’m going to cover the basics quite quickly with the assumption of previous exposure, since I really want to get to some of the more interesting constructions (i.e. localization), then I’ll slow it down.

Ring: We have a set with two operations, we’ll call them addition and multiplication. The addition part forms an abelian group, and the multiplication…well, it puts you back in the set and is associative. We need a way to relate these operations, so we also require that and , i.e. there is a distributive law in effect. Note that there is not required in general to be a multiplicative identity, multiplicative inverses, or commuting of the multiplication.

NOTE: Until I say otherwise I will assume the ring is commutative (meaning multiplication) with 1 (meaning having a mult identity). will always denote this.

Subring: A subset of that is itself a ring.

Ideal: A subring that “swallows” multiplication. So is an ideal if for any we have that for all .

Prime ideal: An ideal is prime if for element we have that either or .

Principal ideal: An ideal is principal if it is generated by a single element. So an ideal is generated by “a” if .

Maximal ideal: A proper ideal such that there is no other ideal with the property (where all containments are proper).

Domain: A ring in which the cancellation law holds. i.e. if and , then . Note that no element can divide zero, so if , then either or .

We can quotient in the natural way: is the set of cosets of I where our operations are and . We get the nice result that any ideal of is of the form where is an ideal of (and ).

I think that may lay down all the terminology I’ll need to get started. I’m not sure if I’ll really use any of these terms for awhile, though.

Common rings: . Note that we can get from by taking “quotients.” This can be made precise for any domain. It is called the fraction field of denoted .

Let me take some time to explain this, since it is the motivation for localization. We want to form a field that contains as a subring such that the elements of , say have the form where . Note that this “looks” like division, and in fact is division in the case of .

To make this process precise takes a bit of work, though. Set up . Define (a,b)~ (c,d) iff . This is done since we want our relation to look like fractions, a/b , so a/b=c/d if we can cross-multiply and get the same thing. It is straightforward to check that this defines an equivalence relation. Now we let be the set of equivalence classes.

Our operations on should mimic those of fractions, so our addition is [a,b]+[c,d]=[ad+bc, bd] and [a,b][c,d]=[ac,bd]. These are well-defined and it is just computation to check that the axioms of a field are satisfied. (If you want a hint: the zero is [0,1] and the 1 is [1,1], the additive inverse of [a,b] is [-a,b] and the mult inverse is [b,a]).

Before finishing up, I want to point out how restrictive we had to be. We want a more general way of doing this. We don’t want to require that R be a domain, and we don’t want to have to take fractions with every single element in R. It turns out this general process is extremely useful and it is called localization.

September 2, 2010 at 9:11 am

good one! it will be nice if you expose the reader to more concrete prime ideals and demonstrate its natural setting…