Graduate Why Can't the Continuum Hypothesis Be Decided Using Standard Real Number Models?

Click For Summary
The discussion centers on the inability to resolve the Continuum Hypothesis (CH) using standard models of real numbers, particularly those defined by Cauchy sequences of rational numbers. It highlights that different models can either support or contradict CH, emphasizing that the axiomatic system of Zermelo-Fraenkel set theory with the Axiom of Choice (ZFC) leads to the undecidability of CH. The conversation references foundational texts like Hewitt and Stromberg's "Real and Abstract Analysis," which explore set theory and its implications for real number construction. The participants note that CH's undecidability stems from the way rational numbers and their constructions are derived from ZFC. Ultimately, the discussion underscores the complexity of set theory in relation to the Continuum Hypothesis.
lavinia
Science Advisor
Messages
3,365
Reaction score
752
I know that there are several models of the real numbers, some where the Continuum Hypothesis holds, others where it does not. I would like to understand why the usual definition of the reals, limits of Cauchy sequences of rational numbers under the usual absolute value norm, isn't one of these models and why then one can not decide the Continuum Hypothesis for it in particular.
 
Last edited:
Physics news on Phys.org
Because the system of axioms and derived theorems leads to the undecidabity of the CH?
 
I've just yesterday looked into Hewitt, Stromberg, Real and Abstract Analysis, on the search for hints or ideas on one of @micromass' analysis challenges. Their entire first chapter deals with set theoretical basics, starting with the proof of the various equivalences for AC and ending with the construction of ##\mathbb{C}## as the algebraic closure of ##\mathbb{R}## as Cauchy-sequences modulo null-sequences. (Dedekind cuts are an exercise there.)

It also contains some considerations like, e.g. "For all cardinals ##\mathfrak{a}## with ##2 \leq \mathfrak{a} \leq \mathfrak{c}## is ##\mathfrak{a}^{\aleph_0} = \mathfrak{c}## and ##\mathfrak{a}^{\mathfrak{c}} = 2^{\mathfrak{c}}##".

I haven't looked into greater detail, yet, (esp. where they use CH and where not), but if you have the chance, it might be a good reference for this.
 
Last edited:
AgentCachat said:
Because the system of axioms and derived theorems leads to the undecidabity of the CH?

To be more precise CH is undecidable in ZFC. We construct the rationals from the integers, which is constructed from naturals (Peano) which in turn can be constructed from ZFC.
 
If there are an infinite number of natural numbers, and an infinite number of fractions in between any two natural numbers, and an infinite number of fractions in between any two of those fractions, and an infinite number of fractions in between any two of those fractions, and an infinite number of fractions in between any two of those fractions, and... then that must mean that there are not only infinite infinities, but an infinite number of those infinities. and an infinite number of those...

Similar threads

  • · Replies 85 ·
3
Replies
85
Views
9K
  • · Replies 24 ·
Replies
24
Views
6K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
1
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 2 ·
Replies
2
Views
547
  • · Replies 26 ·
Replies
26
Views
5K
Replies
1
Views
2K
Replies
1
Views
3K
  • · Replies 13 ·
Replies
13
Views
3K