7 ms·
How to use Zorn's lemma
- ColinWright 9y agoThere is a standard and well-known joke that goes: “The Axiom of Choice is obviously true, the well-ordering principle obviously false, and who can tell about Zorn’s lemma?” — Jerry Bona It's a joke because all three statements are equivalent, and yet AC seems like it should be true, and the well-ordering principle seems too much to ask for. The submitted page is intended to help those who don't understand what Zorn's lemma is about, or how or why one might use it. Some math required ...
- fjsolwmv 9y agoDo you know why people have the inconsistent misconceptions mocked in the joke?
- kd0amg 9y agoAt a glance, choice seems obvious because every nonempty set has an element, so taking one element from each set in a collection looks like a perfectly reasonable thing to do. For well-ordering, it asserts a property that people are typically not taught to treat the reals as having. "Everybody knows" that a set of reals doesn't necessarily have a smallest element. The "next-largest"/"next-smallest" construction is something you see a lot in (mistaken) attempts to prove 1 ≠ 0.999…. My usual experience is that people presented with well-ordering principle try to figure out how it works with the reals -- what is the order relation? It seems like asserting the existence of this structure pushes them into a more constructivist mode of thinking, whereas they don't typically feel like they need to come up with a way to construct choice functions. Zorn's lemma deals with a setting that has somewhat more structure to it, so it doesn't really seem obvious whether it's true or not.
- nerdponx 9y agoWhy does WO seem like too much to ask for, and why are people so-so on Zorn's? I find them both just as intuitive as AC if not moreso.
- v64 9y agoI think the canonical example is that WO means there's a well ordering of the reals. We have to accept it as true, but what the hell would that look like? It's generally assumed that such a well ordering wouldn't be constructible, so it does seem like a little much to ask for. Edit: For those curious why this is problematic, a well ordering on a set means that for any non-empty subset of the set, there's a consistent way to define the least element of the set. An easy example is the natural numbers starting from 0 going up. The well ordering on the naturals is the usual <, and 0 is the lowest of the entire set. This doesn't work this way for the integers. Because the integers go to negative infinity, we have to order them in a different way (but we know it's possible because the well ordering principle says so). It turns out the way to do it is to define the order on the integers this way: 0 1 -1 2 -2 3 -3 etc. Now the integers are ordered in such a way that we have a well defined least element, 0. Now, WO says the real numbers have a well ordering as well. What would that look like? For instance, < fails us because the open interval (0,1) has no least element. The well ordering has to hold for any non-empty subset, and there are ways to create very strange and pathological subsets of R. To think that the entirety of R can be ordered in such a way like the integers is asking for a lot. But the well ordering principle states that even if we can't figure out the order, we can assume that one exists and use it in proofs. But it's weird because we're pretty much resigned to never knowing how it'd actually look.
- deleted 9y ago[deleted]
- monochromatic 9y agoGreat explanation.
- danbruc 9y agoI guess the following won't work then. 0 / 0.1, 0.2, 0.3...0.9 / 0.01, 0.02, 0.03...0.09, 0.11, 0.12, 0.13...0.19, 0.21...0.99 / 0.001, 0.002, 0.003...0.009, 0.011, 0.012... And when ever you list x, you also list -x, 1/x, and -1/x. Except for 0 of course. And you have to throw in +1 and -1 somewhere. Somehow it feels like you should cover all the reals eventually but that can't be true because that would imply there are only countable infinite many reals. It actually looks more like a convoluted version of the standard way to enumerate the rationals by visiting diagonals in order of increasing distance from the origin on a two dimensional integer lattice.
- unprovable 9y agoDoing Reverse Mathematics, AC is waaaay to strong for me :P (We stick to weak subsystems of second order arithmetic, by and large) But this is a really nice treatment of the Lemma :D Thanks!
- fjsolwmv 9y ago> then Zorn's lemma may well be able to help you. Sure , stuff is easier to prove if you add unrealistic axioms.
- giomasce 9y agoWhich other ZFC axiom would be "realistic"?
- xamuel 9y agoMy favorite application of the Axiom of Choice, which Computer Scientists will appreciate: Theorem ("Konig's Lemma"): If a tree has infinitely many nodes, and every node has only finitely many children, then the tree must have an infinite branch. Proof: The tree's root, X1, has infinitely many descendants. Since the root has only finitely many children, some child, X2, of the root, must have infinitely many descendants. Since X2 has only finitely many children, some child, X3, of X2, must have infinitely many descendants. This process repeats forever, producing a sequence X1, X2, X3, ... which is an infinite branch through the tree.
- mrmyers 9y agoYou don't need the axiom of choice for the countable case, which is all that's required for computer science.
- cuspycode 9y agoWhy is the AC necessary for this recursive tree traversal?
- xamuel 9y agoThe AC is necessary[1] because at each of the infinitely many steps, you have to choose which of possibly several candidates to use. [1] As mrmyers points out, you actually only need a weaker version of AC, called Countable Choice.
- deleted 9y ago[deleted]
- matthewrudy 9y agoApologies for the appalling Mathmo joke, but... * What's yellow and equivalent to the Axiom of Choice? * Zorn's Lemon
- giomasce 9y agoThat was the Bananach space...