I’m back from Ohio at the College Perk again. The place looks a lot different in daylight. Anyhow, since the last few days have been a little short on the exposition, I thought I’d cover integers.
Okay, we’ve covered that the natural numbers are a commutative ordered monoid. We can add numbers, but we’re used to subtracting numbers too. The problem is that we can’t subtract with just the natural numbers — they aren’t a group. What could we do with ?
Well, let’s just throw it in. In fact, let’s just throw in a new element for every possible subtraction of natural numbers. And since we can get back any natural number by subtracting zero from it, let’s just throw out all the original numbers and just work with these differences. We’re looking at the set of all pairs of natural numbers.
Oops, now we’ve overdone it. Clearly some of these differences should be the same. In particular, should be the same as . If we repeat this relation we can see that should be the same as where we’re using the definition of addition of natural numbers from last time. We can clean this up and write all of these in one fell swoop by defining the equivalence relation: . After checking that this is indeed an equivalence relation, we can pass to the set of equivalence classes and call these the integers .
Now we have to add structure to this set. We define an order on the integers by . The caveat here is that we have to check that if we replace a pair with an equivalent pair we get the same answer. Let’s say , , and . Then
so . The first equality uses the equivalences we assumed and the second uses the inequality. Throughout we’re using the associativity and commutativity. That the first inequality implies the second follows because addition of natural numbers preserves order.
We get an addition as well. We define . It’s important to note here that the addition on the left is how we’re defining the sum of two pairs, and those on the right are additions of natural numbers we already know how to do. Now if and we see
so . Addition of integers doesn’t depend on which representative pairs we use. It’s easy now to check that this addition is associative and commutative, that is an additive identity, that (giving additive inverses), and that addition preserves the order structure. All this together makes into an ordered abelian group.
Now we can relate the integers back to the natural numbers. Since the integers are a group, they’re also a monoid. We can give a monoid homomorphism embedding . Send the natural number to the integer represented by . We call the nonzero integers of this form “positive”, and their inverses of the form “negative”. We can verify that and . Check that every integer has a unique representative pair with on one side or the other, so each is either positive, negative, or zero. From now on we’ll just write for the integer represented by and for the one represented by , as we’re used to.
No comments yet.