What is a non-constructible real?

I am not sure to fully understand the concept (I read many of the wikipedia definitions for many of these issues but I am still confused). For instance, is a surreal number an example of non-constructible real? Can a non-constuctible real be represented as an infinite sequence of digits (so, is it a regular no-computable real after all)? Is a constructible real the analogy to non-standard naturals (something outside the intended model of natural numbers, or in this case, of real numbers?
What makes them non-constuctible?

Answer

The real numbers are the usual thing. Surreal numbers are not real numbers, so no, they are not an example of non-constructible reals. Any real r can be written as an infinite sequence (n;d1,d2,) where n in an integer and the di are digits. Whether the real is rational, constructible or not, is irrelevant. Any rational number, in fact, any algebraic number, and any transcendental number we ever encounter in analysis, number theory, or even computability theory, is constructible. So, every non-constructible real is transcendental and noncomputable, but the converse is not true. There is no analogy between constructible/non-constructible reals and standard/non-standard natural numbers. They are completely different things.

I think that directly answers your questions. As for the main one: A model of set theory consists of a class (maybe a set, maybe a proper class) M, together with a binary relation E on M such that (M,E) satisfies the axioms of set theory (whether this means ZF, ZFC, or some variant thereof does not matter much for this discussion). This use of the word model is not quite the canonical use in model theory, but it will do for us.

The obvious model of set theory is the class V of all sets, with E being standard membership. But there may be other models. Gödel identified one, that we call L and whose elements we call constructible. E is again standard membership. However, we restrict what sets belong to L. In order to be in L, a set needs to be “definable” in a very precise sense: L is organized by stages, indexed by the ordinals. We start with the empty set. At a given stage we have built an approximation Lα to L, and we go to the next stage Lα+1 by adding to Lα all sets that are first-order definable collections in the structure (Lα,), allowing parameters. We collect what we have so far at limit stages, and L is simple the union of all these approximations.

In a sense, this class appears rather restrictive. The sets that belong to L not only need to be definable, which already may be seen as a bad restriction, but on top of that, their definition is “local”, from the ground up. This is another restriction, as nothing prevents a set from being definable in terms of the whole universe of sets, or maybe in terms of a large fragment of the universe, without it being definable in the way that we require here. For instance, we could define a real by r=0.d1d2 where di=1 iff 2i=i+1, and di=0 otherwise. This real may well not be constructible, as the Lα (and even L) do not appear to have access to the true power set operation, and so may not “know” whether 2i is i+1 or not. Of course, maybe r is constructible “by accident” (for all we know, r could be 0, for example).

What Gödel proved is that the standard axioms of set theory do not suffice to identify a single non-constructible set. More precisely, Gödel proved that L is a model of set theory, and that in this model, the statement “every set is constructible” is true. Hence, it is consistent that there are no non-constructible reals, and since all of classical mathematics can be readily formalized within standard set theory, all real numbers we encounter in practice are constructible. In fact, once we settle on what model of the reals we are to use (whether Dedekind cuts, or classes of Cauchy sequences, etc) we can easily verify that all reals we encounter in practice appear in some Lα and, if we have patience for that sort of thing, we can even provide decent upper bounds for how large α needs to be.

That said, the prevailing view among practicing set theorists is that (if discussion of these matters makes sense at all) not all sets are constructible and, moreover, not all reals are constructible. Beyond that, there is not much more that can be said in full generality. If we accept the existence of certain large cardinals, we can exhibit specific reals that are not constructible, but these reals are not objects that we encounter in classical mathematics, and the way we “exhibit” them is far beyond from the usual way we describe a number in (say) analysis. For example, it is common to mention 0 as a canonical non-constructible real, but this is an object that we do not study from the point of view of number theory or classical analysis, and whether its fifth digit is 3 or not is the sort of question we do not really care about.

One of the key discoveries in 20th century set theory is the fact that there are many natural statements that are not decidable by the usual axioms, that is, for each of these statements ϕ there are models of set theory where ϕ holds and models where it fails. If we accept ϕ as part of what is true of the universe of sets, it is quite possible that ϕ implies the existence of non-constructible reals. For example, ϕ could be the statement “The Borel conjecture is true”. This statement means that if a set of reals is strongly null, then it is countable. Since this statement implies the negation of the continuum hypothesis, and the continuum hypothesis is true in the constructible universe, then we have that there must be non-constructible reals. Beyond that, not much can be said.

Of course the discussion here is in context, so in a model of set theory there may not be non-constructible reals, in another there may be, and in a third model there may be as well, even though the latter two have nothing in common. (Also, in the above, I am assuming tacitly the consistency of the theories discussed to avoid cluttering the text with comments on relative consistency.)

Attribution
Source : Link , Question Author : Wolphram jonny , Answer Author : Andrés E. Caicedo

Leave a Comment