A fairly simple question: I've read in multiple sources that Godel proved that if we accept the axiom of constructibility in ZFC, then we can create an explicit formula that well-orders the real numbers. I tried searching for a paper or some other source that explains what this formula is, but I came up empty-handed. Can someone explain what this formula is, or perhaps point me to a resource that does?
Set Theory – V=L and a Well-Ordering of the Reals
set-theory
Related Solutions
Here is a simple proof of (3), without continued fractions.
For any real number x, let f(x) be the real obtained by interleaving the binary digits of x with the binary digits of pi, a fixed irrational number. This is clearly order-preserving, and f(x) is irrational since the digits will not repeat. QED
The answer is no, if you allow me to adopt some weak-but-equivalent forms of the other axioms. And the reason is interesting:
- A shocking number of the axioms of set theory are true in the non-negative real line R+, with the usual order < being used to interpret set membership. (!)
Let's just check. For example, Extensionality holds, because if two real numbers have the same predecessors, then they are equal. The emptyset axiom holds, since there are no non-negative reals below 0. The Union axiom holds, since for any real x, the reals less than x are precisely the reals that are less than something less than x. (Thus, every set is its own union.) A weakened version of the Power set axioms holds, the Proper Power set, which asserts that for every x, there is a set p whose elements are the strict substs of x. This is because for any real number x, the reals below x are precisely the reals y (other than x), all of whose predecessors are less than x. (Thus, every real is its own proper power set.) An alternative weakening of power set would say: for every x, there is p such that y subset x implies y in p. This is true in the reals by using any p > x. A weakened pairing axiom states similarly: for every x,y, there is z with x ε z and y ε z. This is true in the reals by using any z above both x and y. The Foundation axiom is no problem, since 0 is in every nonempty set. Also, similarly AC holds in the form about families of disjoint nonempty sets, since this never occurs in this model. The Weak Collection Axiom holds since if every y < x has phi(x,y,w), then in fact any y in the same interval will work (since this structure has many automorphisms), and so we may collect witness with any B above x and w. Note that Separation fails, since, for example, {0} does not exist in this model. Also, Replacement fails for the same reason.
Similar interesting models can be built by considering the structure (ORD,<) built using only ordinals, or the class { Vα | α in ORD }. These also satisfy all of the weakened forms of the ZFC axioms without Separation, using Collection in place of Replacement.
Thus, part of the answer to your question is that it depends on what you mean by the "other axioms of ZFC".
Apart from this, however, let me say that the term Weak Collection is usually used to refer to the axioms that restrict the complexity of the formulas in the usual Collection scheme, rather than the axiom that you state. For example, in Kripke Platek set theory KP, a weak fragment of ZFC, one has collection only for Sigma_1 formulas, and this is described as a Weak Collection axiom. (What you call Weak Collection is usually just called Collection.) And there is a correspondingly weakened version of Separation in KP.
But I am happy to adopt your terminology here. You stated that AC plus Replacement implies Weak Collection, but this is not quite right. You don't need any AC. Instead, as your argument shows, what you need is the cumulative Vα hierarchy, which is built on the Power set axiom, not AC. That is, If you have Replacement and Power set and enough else to build the Vα hierarchy, then you get Collection as you described, even if AC fails. For example, ZF can be axiomatized equivalently with either Collection or Replacement.
Your question is a bit unusual, since usually Separation is regarded as a more fundamental axiom than Replacement and Collection, and more in keeping with what we mean by set theory. After all, if one has a set A and a property phi(x), particularly when phi is very simple, it is one of the most basic set theoretic constructions to be able to form { x in A | phi(x) }, and any set theory violating this is not very set-like. We don't really want to consider models of set theory where many instances of Separation fail (for example, Separation for atomic formula is surely elemental).
Incidentally, there is another version of a weakening of Collection in the same vein as what you are considering. Namely, consider the scheme of assertions, whenever phi(x,y) is a property, that says for every set A, there is a set B such that for every a in A, if there is b with phi(a,b), then there is b in B such that phi(a,b).
OK, let me now give a positive answer, with what I think is a more sensible interpretation of your question. I take what I said above (and Dorais's comment) to show that we shouldn't consider set theories where the Separation Axiom fails utterly. Rather, what we want is some very weak set theory, such as the Kripke Platek axioms, and then ask the relationship between Weak Collection and Replacement over those axioms. And here, you get the postive result as desired.
Theorem. If KP holds, then Weak Collection implies Replacement.
Proof. Assume KP plus (Weak) Collection. First, I claim that this is enough to prove a version of the Reflection Principle, since that proof amounts to taking successive upward Skolem hulls, which is what Collection allows. That is, I claim that for every set x and any formula phi, there is a transitive set Y such that x in Y and phi(w) is absolute between Y and the universe V. This will in effect turns any formula into a Delta0 formula using parameter Y.
Applying this, suppose we have a set A and every a in A has a unique b such that phi(a,b). By the Reflection Principle, let Y be a large set transitive containing A such that phi(a,b) and "exists b phi(a,b)" are absolute between Y and V. So Y has all the desired witnesses b for a in A. But also, now { b | exists a in A phi(a,b) } is a Delta0 definable subset of Y, since we can bound the quantifier again by Y. So the set exists. So Replacement holds. QED
I think we can get away with much less than KP. Perhaps one way to do the argument is to just prove Separation by induction on the complexity of formulas. One can collect witnesses by (weak) Collection, and this turns the formulas into lower complexity, using the new bound as a bound on the quantifiers.
Best Answer
The order is very easy. Under $V=L$, the set-theoretic universe is built according the hierarchy $(L_\alpha \mid \alpha \in \mathrm{Ord})$, where $L_0$ is empty, $L_{\alpha+1}$ consists of all definable subsets of $L_\alpha$, and $L_\lambda$ is the union of all earlier $L_\alpha$ when $\lambda$ is a limit ordinal.
Since we can order the definitions used to go from $L_\alpha$ to $L_{\alpha+1}$, we obtain a definable well-ordering of the entire universe. Namely, $x$ is less than $y$ iff
If one analyzes the complexity of the resulting definition for real numbers, it has complexity $\Delta^1_2$ in the descriptive set theoretic hierarchy.