Gracious Living

Rings, Integral Domains, and Fields
February 2, 2011, 19:36
Filed under: Algebra, Math | Tags: , , , , , ,

In which I sort of breeze through a couple of really awesome and really important concepts.  Last time, we classified abelian groups — now we’ll see what happens if we require additional structure on the groups.  In particular, I’m going to construct \mathbb{Z} and \mathbb{Q} similarly to how the Peano axioms constructed \mathbb{N}.

Continue reading

Ordinal Arithmetic
December 7, 2010, 21:03
Filed under: Math, Set Theory | Tags: , , ,

Freeing yourself of the bounds of Peano arithmetic, you come upon a number of different routes to take.  You want the addition and multiplication operations you defined to make sense in a larger scope, but what this scope is varies depending on your needs.  The standard thing to do is to start “closing” the ordered semiring \mathbb{N} in a number of different ways: group closure by adding negatives and reciprocals, metric closure by adding limits, or algebraic closure by adding solutions to polynomials.  But instead, we could just model the elements of \mathbb{N} as the finite ordinals and use transfinite recursion to extend the operations to operations on ordinals.  Transfinite recursion is like induction on cagefighting elephant steroids.

Once you’ve done this, you lose some of your semiring properties, but you retain the order and you win the exciting new property of it being closed under limits.  This is ordinal arithmetic.  Building it will let us understand the structure of the ordinals more rigorously than we had before: there was an ordinal we called \omega^2+1, but what does this actually mean?

Continue reading

Peano Arithmetic
December 4, 2010, 14:45
Filed under: Logic, Math | Tags: , , ,

Let’s do something fun!

The Peano axioms for arithmetic are something like the Zermelo-Fraenkel axioms for sets.  They describe what we intuitively want to be true about the natural numbers.  Using ZFC, we were able to prove the existence of an inductive set \mathbb{N}, and it’s actually pretty easy to prove that the axioms below hold for that set.  But the idea of the Peano axioms is that any structure satisfying them is “just as good” a model for the natural numbers.  That is, it’s a necessary fact about \mathbb{N} that every number has a successor, but it’s not a necessary fact that the successor of x is the set x\cup\{x\}.  It’s not even necessary that x be a set at all.

And in fact, there are other models.  We could take a category-theory approach and look at \mathbb{N} as the initial object in a category of things satisfying the axioms.  We could treat numbers as just numbers and not suppose any internal structure.  It doesn’t really matter, and perhaps this is the reason why we axiomatize stuff, so that we know what matters and what doesn’t.

The following is meant to be a bit of an exploration, mirroring Peano’s own exposition, into the properties of the natural numbers.  Many of them you probably saw in school, but now you can actually prove them from a very small set of definitions and axioms.  If nothing else, it’s a nice exercise in thinking logically.

Continue reading