## Is the analysis as taught in universities in fact the analysis of definable numbers?

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Ten years ago when I studied in the university I had no idea about definable numbers, but I came to this concept myself. My thoughts were as follows:

• All numbers are divided into two classes: those which can be unambiguously defined by a limited set of their properties (definable) and such that for any limited set of their properties there is at least one other number which also satisfies all these properties (undefinable).
• It is evident that since the number of properties is countable, the set of definable numbers is countable. So the set of undefinable numbers forms a continuum.
• It is impossible to give an example of an undefinable number and one researcher cannot communicate an undefinable number to the other. Whatever number of properties he communicates there is always another number which satisfies all these properties so the researchers cannot be confident whether they are speaking about the same number.
• However there are probability based algorithms which give an undefinable number in a limit, for example, by throwing dice and writing consecutive numbers after the decimal point.

But the main question that bothered me was that the analysis course we received heavily relied on constructs such as 'let's $a$ to be a number that...", "for each $s$ in interval..." etc. These seemed to heavily exploit the properties of definable numbers and as such one can expect the theorems of analysis to be correct only on the set of definable numbers. Even the definitions of arithmetic operations over reals assumed the numbers are definable. Unfortunately one cannot take an undefinable number to bring a counter-example just because there is no example of undefinable number, but still how to know that all those theorems of analysis are true for the whole continuum and not just for a countable subset?

-

10
I just wrote a long answer to this question, but it was closed just as I was about to click submit. Can we re-open please? I think that there are a number of very interesting issues here. – Joel David Hamkins Oct 29 2010 at 12:48

4
Meta thread: meta.mathoverflow.net/discussion/729/… . I have also voted to reopen. – Qiaochu Yuan Oct 29 2010 at 13:07

13
I disagree with the continuing votes to close. The topic of definability is mathematically rich and forms the basis of huge parts of model theory, particularly where it connects with algebra and algebraic geometry, such as in the deep work of o-minimality. In the set-theoretic context, various technical meta-mathematical issues become prominent. The question is well-motivated, sincere and has mathematically interesting answers. – Joel David Hamkins Oct 30 2010 at 22:43

2
In particular, I can imagine further technical answers arguing the line that in a model of $V=HOD$, the definable objects indeed form an elementary substructure of the universe, fulfilling the OPs observation that statements of analysis can be viewed as ultimately about definable objects. – Joel David Hamkins Oct 30 2010 at 22:43

2
Similar issues with definability lay at the heart of this MO question: mathoverflow.net/questions/34710/… – Joel David Hamkins Oct 30 2010 at 23:27
show 11 more comments

## 2 Answers

The concept of definable real number, although seemingly easy to reason with at first, is actually laden with subtle metamathematical dangers to which both your question and the Wikipedia article to which you link fall prey. In particular, the Wikipedia article contains a number of fundamental errors and false claims about this concept.

The naive treatment of definability goes something like this: In many cases we can uniquely specify a real number, such as $e$ or $\pi$, by providing an exact description of that number, by providing a property that is satisfied by that number and only that number. More generally, we can uniquely specify a real number $r$ or other set-theoretic object by providing a description $\varphi$, in the formal language of set theory, say, such that $r$ is the only object satisfying $\varphi(r)$.

The naive account continues by saying that since there are only countably many such descriptions $\varphi$, but uncountably many reals, there must be reals that we cannot describe or define.

But this line of reasoning is flawed in a number of ways and ultimately incorrect. The basic problem is that the naive definition of definable number does not actually succeed as a definition. One can see the kind of problem that arises by considering ordinals, instead of reals. That is, let us suppose we have defined the concept of definable ordinal; following the same line of argument, we would seem to be led to the conclusion that there are only countably many definable ordinals, and that therefore some ordinals are not definable and thus there should be a least ordinal $\alpha$ that is not definable. But if the concept of definable ordinal were a valid set-theoretic concept, then this would constitute a definition of $\alpha$, making a contradiction. In short, the collection of definable ordinals either must exhaust all the ordinals, or else not itself be definable.

The point is that the concept of definability is a second-order concept, that only makes sense from an outside-the-universe perspective. Tarski's theorem on the non-definability of truth shows that there is no first-order definition that allows us a uniform treatment of saying that a particular particular formula $\varphi$ is true at a point $r$ and only at $r$. Thus, just knowing that there are only countably many formulas does not actually provide us with the function that maps a definition $\varphi$ to the object that it defines. Lacking such an enumeration of the definable objects, we cannot perform the diagonalization necessary to produce the non-definable object.

This way of thinking can be made completely rigorous in the following observations:

• If ZFC is consistent, then there is a model of ZFC in which every real number and indeed every set-theoretic object is definable. This is true in the minimal transitive model of set theory, by observing that the collection of definable objects in that model is closed under the definable Skolem functions of $L$, and hence by Condensation collapses back to the same model, showing that in fact every object there was definable.

• More generally, if $M$ is any model of ZFC+V=HOD, then the set $N$ of parameter-free definable objects of $M$ is an elementary substructure of $M$, since it is closed under the definable Skolem functions provided by the axiom V=HOD, and thus every object in $N$ is definable.

These models of set theory are pointwise definable, meaning that every object in them is definable in them by a formula. In particular, it is consistent with the axioms of set theory that EVERY real number is definable, and indeed, every set of reals, every topological space, every set-theoretic object at all is definable in these models.

• The pointwise definable models of set theory are exactly the prime models of the models of ZFC+V=HOD, and they all arise exactly in the manner I described above, as the collection of definable elements in a model of V=HOD.

In recent work (soon to be submitted for publication), Jonas Reitz, David Linetsky and I have proved the following theorem:

Theorem. Every countable model of ZFC and indeed of GBC has a forcing extension in which every set and class is definable without parameters.

In these pointwise definable models, every object is uniquely specified as the unique object satisfying a certain property. Although this is true, the models also believe that the reals are uncountable and so on, since they satisfy ZFC and this theory proves that. The models are simply not able to assemble the definability function that maps each definition to the object it defines.

And therefore neither are you able to do this in general. The claims made in both in your question and the Wikipedia page on the existence of non-definable numbers and objects, are simply unwarranted. For all you know, our set-theoretic universe is pointwise definable, and every object is uniquely specified by a property.

Update. Since this question was recently bumped to the main page by an edit to the main question, I am taking this opportunity to add a link to my very recent paper "Pointwise Definable Models of Set Theory", J. D. Hamkins, D. Linetsky, J. Reitz, which explains some of these definability issues more fully. The paper contains a generally accessible introduction, before the more technical material begins.

-

14
@Anixx: No, this is not what Joel was saying. He did not say that it is consistent to "postulate in ZFC that undefinable numbers do not exist". What he was saying was that ZFC cannot even express the notion "is definable in ZFC". And no, this has absolutely nothing to do with constructivism (also please note that even in constructivism uncountable means "not countable", whereas you stated that it means "no practical enumeration" whatever that might mean). – Andrej Bauer Oct 29 2010 at 14:50

18
Joel made a very fine answer, please study it carefully. Joel states that there are models of ZFC such that every element of the model is definable. This does not mean that inside the model the statement "every element is definable" is valid. The statement is valid externally, as a meta-statement about the model. Internally, inside the model, we cannot even express the statement. – Andrej Bauer Oct 29 2010 at 15:13

3
This is off-topic, but: it makes no sense to claim that "constructivist continuum is countable in ZFC sense". What might be the case is that there is a model of constructive mathematics in ZFC such that the continuum is interpreted by a countable set. Indeed, we can find such a model, but we can also find a model in which this is not the case. Moreover, any model of ZFC is a model of constructive set theory. You see, constructive mathematics is more general than classical mathematics, and so in particular anything that is constructively valid is also classically valid. – Andrej Bauer Oct 29 2010 at 15:15

3
A minor technical comment on the first bullet point in Joel's answer: To use the minimal transitive model, one needs to assume that ZFC has well-founded models, not just that it's consistent. The main claim there, that there is a pointwise definable model of ZFC, is nevertheless correct on the basis of mere consistency, essentially by the second bullet point plus the consistency of V=HOD relative to ZFC. – Andreas Blass Oct 29 2010 at 16:44

4
Following the comment of Andreas got me thinking: as a topos theorist (which I am not) I would look at the syntactic model of ZFC (the "Lindenabaum algebra") in order to get to both the minimal model and the one in which every set is definable. But I suppose set theorists don't like that kind of model too much because they prefer transitive models that are "really made of sets". Is that so? Historically, where does this tendency come from? – Andrej Bauer Oct 29 2010 at 21:02
show 19 more comments

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

"Definable numbers" are numbers that are definable in terms of first-order logic over set theory. There are perfectly intelligible numbers that cannot be defined in your sense. For example, suppose you have a sequence of definable numbers, $a_n$ that is bounded by a constant $C$. Then $b = \sup a_n$ is a number that is unique and has an unambiguous meaning, but $b$ is not necessarily definable. Each $a_n$ is given by a formula $\phi_n(x)$, but if the formulas are sufficiently different then there is no way to write down a single formula $\phi$ for $b$. The Wikipedia page you link to talks about this issue in terms of Cantor diagonalization.

-

4
I'm not clear what you're after. You said that a researcher cannot give an example of an undefinable number, and that one researcher cannot communicate an undefinable number to another. I pointed you towards a counterexample to both claims. You can give a completely explicit family of formulas, $\phi_n$, so explicit that they can be generated by a computer program, that gives you a number that's not definable. We can't say much about that number, but it still have a description that identifies it uniquely. – arsmath Oct 29 2010 at 13:22

4
Arsmath, you haven't actually described a non-definable number, and it is impossible to do so for the reasons expressed in my answer. The basic difficulty is that the conept of definable number is not itself expressible. – Joel David Hamkins Oct 29 2010 at 13:29

1
Either the family of formulas $\phi_n(x)$ finite and can be communicated to the other researcher, then the number b is definable. Or it is infinite, then it cannot be communicated to the other researcher. You actually did not give an example of b since you say nothing about the defining formulas. Thus b is not defined so far. – Anixx Oct 29 2010 at 13:35

17
@Anixx: Your last comment is based on the erroneous assumption that one can define how to pass from a definition to the thing it defines. Arsmath described a situation where a sequence of formulas might be definable (and even computable) but the sequence of real numbers they define is not definable. Joel explained why your assumption is wrong. I second Andrej's earlier suggestion that you study Joel's answer carefully, and I add my own suggestion that you assume that Joel meant exactly what he said, not what you think he should have meant or must have meant. – Andreas Blass Oct 29 2010 at 16:50

7
It feels like we are going in circles now. – Andres Caicedo Oct 29 2010 at 23:43
show 13 more comments
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 32, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9513221979141235, "perplexity_flag": "head"}