Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Let $V=L$ denote the axiom of constructibility. Are there any interesting examples of set theoretic statements which are independent of $ZFC + V=L$? And how do we construct such independence proofs? The (apparent) difficulty is as follows: Let $\phi$ be independent of $ZFC + V=L$. We want models of $ZFC + V=L + \phi$ and $ZFC + V=L + \neg\phi$. An inner model doesn't work for either one of these since the only inner model of $ZFC + V = L$ is $L$ and whatever $ZFC$ can prove to hold in $L$ is a consequence of $ZFC + V=L$. Forcing models are of no use either, since all of them satisfy $V \neq L$.

share|improve this question
add comment

3 Answers

up vote 21 down vote accepted

There are numerous examples of such statements. Let me organize some of them into several categories.

First, there is the hierarchy of large cardinal axioms that are relatively consistent with V=L. See the list of large cardinals. All of the following statements are provably indpendent of ZFC+V=L, assuming the consistency of the relevent large cardinal axiom.

  • There is an inaccessible cardinal.

  • There is a Mahlo cardinal.

  • There is a weakly compact cardinal.

  • There is an indescribable cardinal.

  • and so on, for all the large cardinals that happen to be relatively consistent with V=L.

These are all independent of ZFC+V=L, assuming the large cardinal is consistent with ZFC, because if we have such a large cardinal in V, then in each of these cases (and many more), the large cardinal retains its large cardinal property in L, so we get consistency with V=L. Conversely, it is consistent with V=L that there are no large cardinals, since we might chop the universe off at the least inaccessible cardinal.

Second, even for those large cardinal properties that are not consistent with V=L, we can still make the consistency statement, which is an arithmetic statement having the same truth value in V as in L.

  • Con(ZFC)

  • Con(ZFC+`there is an inaccessible cardinal')

  • Con(ZFC+`there is a Mahlo cardinal')

  • Con(ZFC+`there is a measurable cardinal')

  • Con(ZFC+`there is a supercompact cardinal').

  • and so on, for any large cardinal property. Con(ZFC+large cardinal property).

These are all independent of ZFC+V=L, assuming the large cardinal is consistent with ZFC, since on the one hand, if W is a model of ZFC+Con(ZFC+phi), then LW is a model of ZFC+V=L+Con(ZFC+phi), as Con(ZFC+phi) is an arithmetic statement. And on the other hand, by the Incompleteness theorem, there must be models of ZFC+¬Con(ZFC+phi), and the L of such a model will have ZFC+V=L+¬Con(ZFC+phi).

Third, there is an interesting trick related to the theorem of Mathias that Dorais mentioned in his answer. For any statement phi, the assertion that there is a countable well-founded model of ZFC+phi is a Sigma12 statement, and hence absolute between V and L. And the existence of a countable well-founded model of a theory is equivalent by the Lowenheim-Skolem theorem to the existence of a well-founded model of the theory. Thus, the truth of each of the following statements is the same in V as in L.

  • There is a well-founded set model of ZFC. This is equivalent to the assertion: there is an ordinal α such that Lα is a model of ZFC.

  • There is a well-founded set model of ZFC with ¬CH. (This is also equivalent to the previous statement.)

  • There is a well-founded set model of ZFC with Martin's Axiom.

  • and so on. For all the statements known to be forceable, you can ask for a well-founded set model of the theory.

  • There is a well-founded set model of ZFC with an inaccessible cardinal.

  • There is a well-founded set model of ZFC with a measurable cardinal.

  • There is a well-founded set model of ZFC with a supercompact cardinal.

  • and the same for any large cardinal notion.

These are all independent of ZFC=V=L, since they are independent of ZFC, and their truth is the same in V as in L. I find it quite remarkable that there can be a model of V=L that has a transitive model of ZFC+'there is a supercompact cardinal'. The basic lesson is that the L of a model with enormous large cardinals has very different properties and kinds of objects in it than a model of V=L arising elsewhere. And I believe that this gets to the heart of your question.

Since all these statements are studied very much in set theory, and are very interesting, and are independent of ZFC+V=L, I find them to be positive instances of what was requested.

However, how does this relate to Shelah's view in Dorais's excellent answer? He seems there to dismiss the entire class of consistency strength statements as combinatorics in disguise. What does he mean exactly? Since we set theorists are very interested in these statements, I don't think that he means to dismiss them as silly tricks with the Incompleteness theorem. Perhaps he means something like: to the extent that we believe that a large cardinal property LC is consistent, then we don't really want to consider the theory ZFC+V=L, but rather, the theory ZFC+V=L+Con(LC). That is, we aren't so interested in models having the wrong arithmetic theory, so we insist that Con(LC) if we are comitted to that. And none of the examples I have given exhibit independence from that corresponding theory.

share|improve this answer
    
+1 Again, a wonderful answer! I really liked your thought provoking examples. They made me realize just how subtle 0# really is... –  François G. Dorais Jan 12 '10 at 3:27
    
Yes, I guess one can have in L a transitive model of ZFC+0# exists. Indeed, there is such a model in V iff there is such a model in L, since this is a Sigma^1_2 statement. But of course, in L they will all be fake 0#'s from the perspective of the full L. –  Joel David Hamkins Jan 12 '10 at 3:46
    
Thanks! This brief excursion into the theory of large cardinals looks very interesting but allow me to ask a few more question. Can you give an example of an "interesting sentence" $\phi$ whose independence w.r.t. $ZFC + V=L$ can be established in $ZFC$ alone? –  Ashutosh Jan 12 '10 at 4:03
    
The large cardinal assumptions, compatible with $V=L$, are nice but we need to assume the consistency of their existence and the proof of independence is almost the same as for $ZFC$ alone (but that not relevant to the question I asked). One more comment: By using the adjective "interesting", I intend to eliminate Goedel's diagonal sentences and their variants; e.g. stuff like there is a set model of $ZFC$ etc. –  Ashutosh Jan 12 '10 at 4:03
1  
@Ashutosh2: About "interesting". Surely large cardinals should count as interesting, since they have been studied in set theory for over a century (starting well before the Incompleteness Theorem). Part of their interest now, I believe, is the fact that they do transcend ZFC in consistency strength. After all, we know that such transcendent statements must exist by the Incompleteness Theorem, and large cardinals provide a rich hierarchy able to measure such transcendent strength. The point of my answer was that these axioms also can show the rich diversity of models of V=L. –  Joel David Hamkins Jan 12 '10 at 13:24
show 2 more comments

What I would call the standard source of examples is the series of very nice "finitary" combinatorial statements that Harvey Friedman has been working on. You can see plenty of such statements in his numbered series of FOM posts, and for details of some of the arguments, see for example his nice paper "Finite Functions and the Necessary Use of Large Cardinals", Annals of Math., Vol. 148, No. 3, 1998, pp. 803-893.

The examples Harvey examines are arithmetic. In the "true" model (which is well-founded) they are decided one way, and there are ill-founded (in fact, not $\omega$-) models where they are decided the other way.

It would be highly desirable to have examples of nice arithmetic statements that are not just independent but for which we can produce differing answers in different well-founded models. I don't think anybody has any clue at the moment on how to do such thing. To achieve this would be akin to the invention of forcing.

share|improve this answer
add comment

This is a very interesting question. Here is what Shelah says about this in The Future of Set Theory:

ISSUE: Where does the truth lie between the following two extremes

  1. Every combinatorial statement is decidable in L.

  2. We should have a forcing-like technique to get independence from ZFC+V=L (or for PA, and similar cases, e.g. the twin prime conjecture).

I have strong intuition in favor of both positions, but little knowledge. “Combinatorial” means not syntactical but semantical; consistency strength is discounted as well, as disguised versions of it.

As far as I know no significant progress has been made. There are however little gems like this neat trick of Adrian Mathias to show that every real can be constructible which was posted here by Joel Hamkins not long ago.

share|improve this answer
    
+1. Thanks for this excellent link and quote! –  Joel David Hamkins Jan 12 '10 at 2:15
    
Thanks a lot for the links. –  Ashutosh Jan 12 '10 at 3:40
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.