Filed under: Algebra, Math, Set Theory, Topology | Tags: algebra, construction, Math, order theory, set theory

It looks like I’m getting views now, which is surprising. I’ve been pretty busy with schoolwork, but I really want to get this blog up to speed, particularly because I’d like to start discussing things as I’m learning about them. I’d also like to make more non-mathematical posts, but maybe these are best left to a separate blog? Thoughts?

Our first example of a field was the field of rationals, . Recall that this was the field of fractions of the integers, which were in turn the free abelian group on one generator with their natural multiplication. But now it appears that we’re stuck. While we intuitively know what should be — it’s a line, for crying out loud — there seems to be no algebraic way of “deriving” it from . A first guess might be to add in solutions of polynomials, like as the solution of , but not only does this include some complex numbers, it also misses some real numbers like and . (We call such numbers — those that aren’t solutions of polynomials with rational coefficients — **transcendental**. It’s actually quite difficult to prove that transcendental numbers even exist.)

Instead, we turn to topology. Below, I give two ways of canonically defining , one using the metric properties of , one using its order properties. I found this really interesting when I first saw it, but I can’t see it interesting everyone, so be warned if you’re not a fan of set theory or canonical constructions. One of the topological techniques we’ll see will be useful later, but at that point it’ll be treated in its own right.

Filed under: Math, Set Theory | Tags: cardinals, Math, ordinals, set theory, trivial

Let’s get tricky! Unlike ordinal arithmetic, the arithmetic of cardinals isn’t really an extension of Peano arithmetic. Rather, it’s a consequence of the set model of ordinals, with the sum of two ordinals being the order type of their disjoint union, and their product being the order type of their Cartesian product.

Part of the reason for this is that cardinals have a vastly different notion of “successor.” See, the ordinals are well-ordered, so any subset has a least element, and thus we can identify each cardinal with the least ordinal of its cardinality. So we’ll say . (Exercise: these are all limit ordinals.) Then the cardinals, as a subset of the ordinals, are also well-ordered, and thus we can define the successor of a cardinal as the least cardinal greater than it, and the limit of a set of cardinals as their least upper bound.

Since the cardinals, as aleph numbers, are also *indexed* by the ordinals, we have . We can treat the map as a function ; then this function is normal. So in particular it has a *fixed point* (indeed, an unbounded class of them): this is an ordinal such that . Even though the cardinals increase a lot “faster” than the ordinals, this number is simultaneously the th cardinal and the th ordinal! The first such ordinal is .

This fills me with the greatest glee.

We won’t be assuming the generalized continuum hypothesis for the first part of this, so we won’t mention the beth numbers (which are ). If you do assume it, the beth numbers are the aleph numbers; if you don’t, it’s difficult to say anything about them arithmetic-wise.

Like Devlin, I’ll use for cardinals, for ordinals.

Filed under: Math, Set Theory | Tags: arithmetic, Math, ordinals, set theory

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 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 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 , but what does this actually *mean*?

Filed under: Math, Set Theory | Tags: Math, order theory, set theory, topology, weird

When we talked about cardinality, we defined “standardized” finite cardinal numbers as the set , which we modeled as and so on. We’ve since noted certain special properties of this model:

- the set exists by the ZFC axioms
- because of this, it is “pure” — everything is a set of sets, there are no ur-elements
- the “successor function” is well-defined, injective, and its image is everything but
- because of this, if a statement is true for and its truth for implies its truth for , it is true for all elements of — this is the “inductive property”
- iff , and these synonymous relations are total orders on .

In the discussion of the Axiom of Choice, we defined a “well-order” as a total order in which every subset has a least element, and proved that every set can be well-ordered if we assume the AC. In fact, the subset/element ordering on is already a well-order: given , the set is a least element, and you should prove that this is always an element of (induction might help).

Cardinalities tell us everything about sets up to bijection. But when sets also have orders on them, this isn’t enough. If we care about the orders on and , the only functions we should be caring about are those that are **order-preserving**: that is, that when . Likewise, rather than all bijections, we care about the **order isomorphisms**: bijections that are order-preserving and have order-preserving inverses. We’re “pairing off” the sets again, but in the same order. None of the bijections with in the post on countability did this, and it’s pretty clear why: any order isomorphism has to preserve the type of ordering, and is well-ordered while and aren’t.

The order isomorphism classes (or **order types**) of general posets or tosets are many and difficult to talk about. But the order types of well-ordered sets are easier to study. Below the fold, let’s take them on.

Filed under: Math, Set Theory | Tags: axiomatic, MaBloWriMo, Math, order theory, set theory

This post is going to be a bit more technical than most, so feel free to skim it if you find it difficult. You should know the statements of the theorems and the definition of well-ordering, though.

When I stated the ZFC set axioms, I put choice last for a reason. As I said there, it’s a bit like the parallel postulate in Euclidean geometry (if you don’t know this story, you should read about it — it’s fascinating). Unlike the other axioms, it’s non-constructive, and it looks complicated enough that you should be able to get it from the other axioms, though it’s in fact independent of them (meaning they can’t prove it or disprove it). For these reasons, many mathematicians in the early half of the century used choice sparingly, and made it very clear what pieces of their work required it. But as we’ve seen, we needed it to show that every infinite set contains a sequence, and likewise, many of its consequences are so useful that it’s common nowadays to use it without reservation. (And yes, Munroe, the Banach-Tarski paradox is a good thing.)

Besides important consequences, there are about four important equivalent statements to the axiom of choice, and that’s what I’ll be talking about today. Hopefully this will give you an idea of what a choice function is and how powerful it is. We’ll be showing the following statements are equivalent:

**The axiom of choice**: every set has a**choice function**such that for all .- Every Cartesian product of non-empty sets is non-empty.
**Zorn’s Lemma**: Every partially ordered set, in which every totally ordered subset has an upper bound, has a maximal element.**Hausdorff Maximum Principle**: Every partially ordered set has a maximal totally ordered subset.**Well-Ordering Theorem**: Every set can be well-ordered.

Below the fold, definitions of these terms and proofs of equivalence.

(This is a follow-up to my post on cardinality. In it, I constructed a model of the natural numbers, which I also called , by , and so on [I used boldface for these sets last time, but it really isn’t necessary]. This set is “pure” and it exists by the Zermelo-Fraenkel axioms. Assuming the axiom of choice, it’s also the “smallest” infinite set up to bijection. Below the jump, I talk about larger infinities.)

(This was originally a longer post that went through to countability and the continuum hypothesis. I’ve broken it in half, ending at the definition of infinite sets, in the interest of keeping things short, and also possibly of MaBloWriMo. The next half will be up soon!)

What we’re going to do today is measure sets. I said that sets have no structure back in the first couple of posts, but this isn’t entirely true. Finite sets, for example, have a definite number of elements. Today, I show that you can extend this idea of number to infinite sets by considering a special class of function between sets that preserves number. The strange properties of this will end up making topology and set theory a lot more interesting.