Lecture Notes in Mathematics



Similar documents
CHAPTER 7 GENERAL PROOF SYSTEMS

Set theory as a foundation for mathematics

NIM with Cash. Abstract. loses. This game has been well studied. For example, it is known that for NIM(1, 2, 3; n)

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

Full and Complete Binary Trees

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

Math 4310 Handout - Quotient Vector Spaces

Follow links for Class Use and other Permissions. For more information send to:

THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES

GENTLY KILLING S SPACES TODD EISWORTH, PETER NYIKOS, AND SAHARON SHELAH

Classical theorems on hyperbolic triangles from a projective point of view

If n is odd, then 3n + 7 is even.

Notes on Richard Dedekind s Was sind und was sollen die Zahlen?

This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

CS 3719 (Theory of Computation and Algorithms) Lecture 4

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CONTENTS OF DAY 2. II. Why Random Sampling is Important 9 A myth, an urban legend, and the real reason NOTES FOR SUMMER STATISTICS INSTITUTE COURSE

PROCEEDINGS OF SYMPOSIA IN APPLIED MATHEMATICS Volume XXIII MODERN STATISTICS: METHODS AND APPLICATIONS

Georg Cantor ( ):

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

How many numbers there are?

Notes on Determinant

Georg Cantor and Set Theory

TEXAS A&M UNIVERSITY. Prime Factorization. A History and Discussion. Jason R. Prince. April 4, 2011

Schneps, Leila; Colmez, Coralie. Math on Trial : How Numbers Get Used and Abused in the Courtroom. New York, NY, USA: Basic Books, p i.

3. Mathematical Induction

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS

Every tree contains a large induced subgraph with all degrees odd

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Understanding Competitive Advantage

Degrees that are not degrees of categoricity

The Banach-Tarski Paradox

There is no degree invariant half-jump

Mathematical Modeling and Methods of Option Pricing

Lasers in Restorative Dentistry

The Product Manager s Toolkit

So let us begin our quest to find the holy grail of real analysis.

6.2 Permutations continued

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

On Lexicographic (Dictionary) Preference

CS 301 Course Information

Notes on Complexity Theory Last updated: August, Lecture 1

Math 223 Abstract Algebra Lecture Notes

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ?

arxiv:math/ v3 [math.gn] 31 Oct 2010

ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

COFINAL MAXIMAL CHAINS IN THE TURING DEGREES

Mechanics 1: Vectors

Lecture 2: Universality

SET-THEORETIC CONSTRUCTIONS OF TWO-POINT SETS

Basic Probability Concepts

Regular Languages and Finite Automata

No: Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

4.5 Linear Dependence and Linear Independence

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

A Non-Linear Schema Theorem for Genetic Algorithms

P NP for the Reals with various Analytic Functions

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

i/io as compared to 4/10 for players 2 and 3. A "correct" way to play Certainly many interesting games are not solvable by this definition.

Rigorous Software Development CSCI-GA

Linear Risk Management and Optimal Selection of a Limited Number

AN ANALYSIS OF A WAR-LIKE CARD GAME. Introduction

Mathematical Induction

Geometrical Characterization of RN-operators between Locally Convex Vector Spaces

ALMOST COMMON PRIORS 1. INTRODUCTION

The Open University s repository of research publications and other research outputs

Gödel s Ontological Proof of the Existence of God

Queenette Udoh-Ilomechine Novena University Library Ogume, Delta State, Nigeria

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents

ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS

The Foundations of Mathematics

Switching and Finite Automata Theory

Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)

Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University

8 Divisibility and prime numbers

Ramsey numbers for bipartite graphs with small bandwidth

GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

MATH 590: Meshfree Methods

FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL

This puzzle is based on the following anecdote concerning a Hungarian sociologist and his observations of circles of friends among children.

Chapter 1. NP Completeness I Introduction. By Sariel Har-Peled, December 30, Version: 1.05

THE DIMENSION OF A VECTOR SPACE

THE DEGREES OF BI-HYPERHYPERIMMUNE SETS

Large induced subgraphs with all degrees odd

Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses

Duality of linear conic problems

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

Transcription:

Lecture Notes in Mathematics Edited by A. Dold and B. Eckmann 405 Keith J. Devlin H,~vard Johnsbraten The Souslin Problem Springer-Verlag Berlin-Heidelberg New York 1974

Dr. Keith Devlin Seminar fer Logik und Grundlagenforschung der Philosophischen Fakult~t 53 Bonn BeringstraBe 6 BRD Dr. Havard Johnsbr&ten Matematisk Institutt Universitetet I Oslo, Blindern Oslo 3/Norge Library of Congress Cataloging in Publication Data Devlin, Keith J The Souslin problem. (Lecture notes in mathematics, 405) Bibliography: p. 1. Set theory. I. Johnsbraten, Havard, 1945- joint author. II. Title. III. Series: Lecture notes in mathematics (Berlin) 405. QA3.L28 no. 405 [QA248] 510'.8s [5!i'.3] 74-17386 AMS Subject Classifications (1970): 02-02, 02 K05, 02 K25, 04-02, 04A30 ISBN 3-540-06860-0 Springer-Verlag Berlin Heidelberg New York ISBN 0-38?-06860-0 Springer-Verlag New York Heidelberg Berlin This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically those of translation, reprinting, re-use of illustrations, broadcasting, reproduction by photocopying machine or similar means, and storage in data banks. Under 54 of the German Copyright Law where copies are made for other than private use, a fee is payable to the publisher, the amount of the fee to be determined by agreement with the publisher. by Springer-Verlag Berlin Heidelberg 1974. Printed in Germany. Offsetdruck. Julius Beltz, Hemsbach/Bergstr.

Acknowledgements The last five chapters of this book are based almost exclusively on a set of notes written by Devlin during the S11mmer of 1972. During this time, he was living with, and almost entirely supported by his wife's parents, Mr and Mrs H. Carey of Sidcup, Kent, to whom thanks should now be put on record. The manuscript was typed by Mrs. R. Msller of the Univer- sity of Oslo, for whose care and patience we owe a consider- able debt.

CONTENTS Chapter I. II. III. IV. V. VI. VII. V~I. IX. X. Preliminaries Souslin's Hypothesis The Combinatorial Property Homogeneous Souslin Trees and Lines Rigid Souslin Trees and Lines Martin's Axiom and the Consistency of SH Towards Con(ZFC +CH + SH) : A False Start Iterated Forcing Jensen Style How JensenKilled a Souslin Tree ConZFC ~ Con(ZFC+CH+SH) I 8 23 32 46 5~ 68 74 97 113 APPENDIX. Iterated Souslin Forcing and ~(~) REFERENCES GLOSSARY OF NOTATION 122 426 128 INDEX

CORRECTION An Israel mathematician called Uri Avraham has pointed out t~at~ in Chapter IX, the claim straddling pages 105 and 106 is false as stated. To be precise, given an Aronszajn tree ~, we define, for C a certain closed unbounded subset of ~, a ('generic) order-embedding of TIC into Q, and claim that this order-embedding can be extended to all of ~ As we have set things up this is false (although a slight modification to the definition of ~a+2 on page 105 would in fact make our claim true). What we should have said is not that our particular embedding extends to all of @, but that it easily gives rise to such an embedding. In fact, this is perhaps more easily seen (via Theorem II.5) in terms of our original definition of special Aronszajn (Page 15)= By means of our embedding of TIC into Q, we may write TIC = Um< Am, where each A m is an (uncountable) antichain of T. Let ~:aml~<~1 > be a or~e-one enumeration of A m, each m, and let <m~l ~<~I > be the monotone enumeration of C. For each m< ~I' and for each~xet c, let sx= lystlc + I I x<~yj. Since each S x is count- able, let <sn(x)in< ~> enumerate it. For each ~m< ~, the set ~n,~m = [Sn(a~ m) Ira< ~I is clearly an antichain of T. But ~ = 1,,(Wz~<&)'u{U-,m<~>-,m - c~ ~- - n )' so ~ is special. Q, ED. Keith J. Devlin Bonn, 1 4.9 74

Introduction In 1920, the awakening of interest in Set Theory was heralded by the app~arence of a new journal in mathematics - Fundamenta Mathematicae. It is fitting that in the very first volume appeared the statement of a problem which was to play a prominent role in the development of that subject. Indeed, as with the continuum problem, research into the simple question there raised by M. Souslin was to have far-reaching ramifications in several branches of set theory, notably in constructibility theory and in the theory of forcing, the very two subjects whose existence stemmed from the work on the continuum problem. As with the continuum problem, Souslin's problem concerned the real numbers. However, instead of asking "how many" reals there are, Souslin asked whether a certain set of conditions uniquely characterized the real numbers. More precisely, Souslin's problem was this. Suppose we are given a dense linearly ordered set X, complete (in the sense of, say, Dedekind cuts) and with no end-points, and that X has the property that there is no uncountable collection of pairwise disjoint open intervals of X. Must then X be (isomorphic to) the real line,]r? (Probl~me 3, M. Souslin [Su I]. ) It turned out that this problem was undecidable on the basis of the usual (i.e. Zermelo - Fraenkel) axioms of set theory. It is the purpose of this short book to provide the proofs of this undecidability and of the undecidability of the problem even when the continuum hypothesis is assumed. The vast majority of these results are due solely to one person, Ronald Jensen. (In fact, Chapter VI is essentially the only place where results appear which are not his.) For the most part, these results appear here for the first time in print. The exposition falls naturally into two parts. In the five first chapters, we discuss the non-provability of Souslin's hypothesis (i.e. the assumption that Souslin's problem has a positive answer) in ZFC ~ CH. This part which also contains (Chapter II) a basic discussion of the problem~ should be fairly easy to read. The prerequisites are a reasonable (e.g. Ist year graduate level) aquaintance with the method of forcing and a knowledge of constructibility theory. In chapter I we sketch briefly the material we require. It is natural to include in this part some discussion of the notion of a Souslin line (i.e. a "continuum" which does possess the properties stated in Souslin's problem,

VIII but which is not isomorphic to ~R ), and Chapters IV and V provide just such a discussion. The second part - Chapters VI - X - is concerned entirely with the consistency of Souslin's hypothesis. Strictly speaking, the forcing theory outlined in Chapter I is all that is required for an understanding of the proofs, but some considerable aquaintance with this kind of material is really necessary. In particular, the proofs in this part tend to be extremely long and technical. We expect that chapters VIII - X will only be read in detail by the highly motivated (whatever that motivation may be ~ ). These three chapters are certainly not the stuff of "first-year graduate courses"~ The book comes from two main sources. For the first part of the book, a set of lecture notes written by Jensen in Kiel in 1969. For the second part, a set of notes written by Devlin in Sidcup in 1972. These latter were based exclusively on a (much larger) set of notes written by Jensen some years earlier. For readers who have previously seen the original Jensen manuscript, let us say now that the proof of Con (ZFC+SH +CH) which we give here is essentially the same as the proof described there. The organisation of the proof is somewhat different, however, and the length is considerably reduced. Also (hopefully) we have found all the errors which the original manuscript contained. We have tried to adopt the terminology and notation most common in current set-theoretical usage. We use 'iff' to denote 'if and only if' and use either QED or else to denote the end of a proof. Since this is not really a textbook (rather an account of Jensen's work) we have not included any exercises. The reader who completes the entire book will not need any further exercise We thank Thomas Jech for reading the last five chapters and suggesting some improvements. Keith J. Devlin & H~vard Johnsbr~ten Department of Mathematics University of Oslo June, 1974