## Propositions equivalent to the completeness of the real numbers

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

Can anyone point me to a reasonably comprehensive article (or book chapter) explaining which basic theorems of calculus are equivalent to the completeness axiom of the reals and which ones aren't?

Here "equivalent" means equivalent relative to a base system that includes all the ordered field axioms, plus naïve set theory, plus (optionally) the Peano axioms (which one probably needs if one wants to use the natural numbers as an index-set, e.g. in the Nested Intervals Property).

At first I thought reverse mathematics would be the place to look, but a little bit of poking around now leads me to think that reverse mathematics in the usual sense deals with more arcane issues, with base systems that are at once weaker and stronger than what I have in mind: Konig's infinity lemma isn't provable in all of them, but the Intermediate Value Theorem is.

(Stephen Simpson, in his Wikipedia article http://en.m.wikipedia.org/wiki/Reverse_mathematics, writes: "... RCA0 is sufficient to prove a number of classical theorems which, therefore, require only minimal logical strength. These theorems are, in a sense, below the reach of the reverse mathematics enterprise because they are already provable in the base system. The classical theorems provable in RCA0 include: ... Basic properties of the real numbers (the real numbers are an Archimedean ordered field; any nested sequence of closed intervals whose lengths tend to zero has a single point in its intersection; the real numbers are not countable). ... The intermediate value theorem on continuous real functions.".)

So, reverse mathematics may not be the place to turn for answers to questions like "Is the completeness of the reals equivalent to the Mean Value Theorem?" (answer: yes); but I'm sure someone has considered such questions systematically. Perhaps somebody wrote a beautiful Monthly article a few decades ago that explained things so clearly as to make the whole matter seem trivial, with the result that the article was forgotten? :-)

-
My omission of the Archimedean axiom from the base theory was intentional. Indeed, one way to show that various theorems of calculus do NOT imply completeness is to show that they are satisfied by non-Archimedean totally ordered fields. – James Propp Apr 19 2011 at 21:29
This reference might help: math.hawaii.edu/~tom/mathfiles/rolle_Illinois.pdf Of course you can also look for more recent articles that cite it. – David Feldman Apr 20 2011 at 0:37
T. W. Körner, A Companion to Analysis discusses some of this. – lhf Apr 20 2011 at 10:34

1
This question is difficult to answer because it is too vague. First, there are two different axioms of completeness for the reals: Cauchy completeness and Dedekind completeness. I suspect you mean the latter, but this is not clear from the question. Second, the base theory you describe is unclear. What kind of comprehension axioms does your "naïve set-theory" comprise? Are the (optional!) natural numbers distinguished elements of the field or are they a separate sort? How are functions coded in this theory? – François G. Dorais♦ Jul 15 2011 at 15:19

1
François is correct in surmising that when I wrote "completeness" I meant "Dedekind completeness". As for what base theory I am presupposing, François answered this question very convincingly in the thread mathoverflow.net/questions/71344/… : it's second-order logic with standard semantics. – James Propp Jul 27 2011 at 14:37
show 3 more comments

## 2 Answers

Since the article I was looking for doesn't seem to exist, I decided to write one myself; the current draft can be found at http://jamespropp.org/reverse.pdf .

Comments are welcome!

-

1
Very interesting! What would be wonderful is a chart with arrows giving the implications between the various properties. – Qiaochu Yuan Jul 26 2011 at 19:30
I am having trouble in understand the exact theory that you are working in. It seems to me like a modification of the theory RCF (the theory of real closed fields which is complete for the first order properties of real numbers in the language of ordered fields), it would be nice to state the exact language and axioms of the theory in one place. – Kaveh Jul 26 2011 at 20:08
You may also want to check the first volume of "Constructivism in Mathematics" by van Dalen and Troelstra where they develop a theory for elementary analysis and discuss the equivalence/non-equivalence of various analytical principles and definition (constructively). – Kaveh Jul 26 2011 at 20:11
I'll look into van Dalen Troelstra; thanks for the reference. Meanwhile, can you give me more information about the completeness of the theory RCF? This might resolve the issue about provability that I didn't know how to address at the bottom of page 2 and the top of page 3. – James Propp Jul 26 2011 at 21:59
The language of RCF is the language of ordered rings. The axioms are the axioms for an ordered field plus axioms stating that every polynomial of odd degree has a root (IIRC). The theory is complete in the sense that for any true first order sentence in this language, either RCF proves it or RCF proves its negation. You can find more about RCF in model theory books like David Marker's. – Kaveh Jul 27 2011 at 0:22
show 4 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.

EDIT: I noticed that I misunderstood the question after posting the answer, so this is not a answer to the question. I am leaving it here just in case it might be interesting to others.

This is studied in bounded reverse math by people like Fernando Ferreira and colleagues.

The base theory BTFA [Fer'94] is a two sorted theory version of Sam Buss's bounded arithmetic theory $S^1_2(\alpha)$ [Bus85, ch. 9] plus bounded collection/replacement for $\Sigma^b_\infty$ formulas ($B\Sigma^b_\infty$) plus a form of comprehension axiom for $\Delta_1$ sets ($\nabla^b_1CA$):

$$\forall x (\forall z \ \varphi(x,z) \leftrightarrow \exists y \ \psi(x,y)) \Rightarrow \exists Z \ \forall x \ (x \in Z \leftrightarrow \exists y \ \psi(x,y))$$

where $\varphi$ and $\psi$ are respectively $\Pi^b_1$ and $\Sigma^b_1$ formulas. This is a modification of Simpson's axiom in his book [Sim'09]. Because of its special form the first order part is conservative over $S^1_2$ and is incapable of using the full power of comprehension for $\Delta_1$ sets. On the other hand, the second order part of the smallest model of the theory is $\Delta_1$ sets.

In [FF'02, thm. 4], a version of the Intermediate Value Theorem is proven in BTFA. Some caution is needed here in formalizing the IVT. Also the proof is not constructive (either there is a rational number which is the root of the function or we can continue a process getting arbitrary close to a root. Deciding that a given rational number is not a root of the function is not decidable and this is required since we need to stop the process of dividing the current interval into two halves if we reach a root, i.e. we need this assumption so we have $f(m)<0 \ \lor \ f(m)>0$ where $m$ is the rational mid-point of the current interval). As far as I remember WKL is not provable in BTFA. See also [FF'05] and [FF'08].

References:

1. Fernando Ferreira, "A feasible theory for analysis", The Journal of Symbolic Logic 59, 1001-1011, 1994.

2. António Fernandes and Fernando Ferreira, "Groundwork for weak analysis", The Journal of Symbolic Logic 67, pp. 557-578, 2002.

3. António Fernandes and Fernando Ferreira, "Basic applications of weak König's lemma in feasible analysis", in "Reverse Mathematics 2001", edited by Stephen Simpson. Lecture Notes on Logic (Association for Symbolic Logic), vol. 21, pp. 175-188 (A K Peters, 2005).

4. Fernando Ferreira and Gilda Ferreira, "The Riemann integral in weak systems of analysis", Journal of Universal Computer Science, 14, no. 6, pp. 908-937 (2008).

5. Samuel R. Buss, "Bounded Arithmetic", Bibliopolis, Revision of 1985 Ph.D. thesis.

6. Stephen G. Simpson, "Subsystems of Second Order Arithmetic", Second Edition, Perspectives in Logic, Association for Symbolic Logic, Cambridge University Press, 2009.

-

This is a good answer, Kaveh. You should undelete it. There is also interesting work of Phuong Nguyen and Stephen Cook in this area that might be useful. – François G. Dorais♦ Jul 16 2011 at 6:40
I deleted my answer since these theories still satisfy "base systems that are at once weaker and stronger than what I have in mind: Konig's infinity lemma isn't provable in all of them, but the Intermediate Value Theorem is." – Kaveh Jul 27 2011 at 11:17
{"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": 14, "mathjax_display_tex": 1, "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.9189371466636658, "perplexity_flag": "middle"}