Modern Birkhäuser Classics Many of the original research and survey monographs in pure and applied mathematics published by Birkhäuser in recent decades have been groundbreaking and have come to be regarded as foundational to the subject. Through the MBC Series, a select number of these modern classics, entirely uncorrected, are being re-released in paperback (and as eBooks) to ensure that these treasures remain accessible to new generations of students, scholars, and researchers.
M. Holz K. Steffens E. Weitz
Introduction to Cardinal Arithmetic
Reprint of the 1999 Edition Birkhäuser Verlag Basel · Boston · Berlin
Authors: Michael Holz Unter den Bäumchen 17 30926 Seelze Germany e-mail:
[email protected]
Edmund Weitz Bernadottestr. 38 22763 Hamburg Germany
Karsten Steffens Institut für Algebra, Zahlentheorie und Diskrete Mathematik Universität Hannover Welfengarten 1 30167 Hannover Germany e-mail:
[email protected]
Originally published under the same title in the Birkhäuser Advanced Texts – Basler Lehrbücher series by Birkhäuser Verlag, Switzerland, ISBN 978-3-7643-6124-7 © 1999 Birkhäuser Verlag, P.O. Box 133, CH-4010 Basel, Switzerland
1991 Mathematics Subject Classification 04-01, 04A10, 03E10 Library of Congress Control Number: 2009937809 Bibliographic information published by Die Deutsche Bibliothek Die Deutsche Bibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data is available in the Internet at
.
ISBN 978-3-0346-0327-0 Birkhäuser Verlag AG, Basel · Boston · Berlin This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, broadcasting, reproduction on microfilms or in other ways, and storage in data banks. For any kind of use whatsoever, permission from the copyright owner must be obtained. © 2010 Birkhäuser Verlag AG Basel · Boston · Berlin P.O. Box 133, CH-4010 Basel, Switzerland Part of Springer Science+Business Media Printed on acid-free paper produced of chlorine-free pulp. TCF ∞
ISBN 978-3-0346-0327-0 987654321
e-ISBN 978-3-0346-0330-0 www.birkhauser.ch
Contents
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
vii
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1
1 Foundations 1.1 The Axioms of ZFC . . . . . . . . . . . . . . . . . . . . . . 1.2 Ordinals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3 Transfinite Induction and Recursion . . . . . . . . . . . . . 1.4 Arithmetic of Ordinals . . . . . . . . . . . . . . . . . . . . . 1.5 Cardinal Numbers and their Elementary Properties . . . . . 1.6 Infinite Sums and Products . . . . . . . . . . . . . . . . . . 1.7 Further Properties of κλ – the Singular Cardinal Hypothesis 1.8 Clubs and Stationary Sets . . . . . . . . . . . . . . . . . . . 1.9 The Erd¨ os-Rado Partition Theorem . . . . . . . . . . . . . 2 The 2.1 2.2 2.3
. . . . . . . . .
. . . . . . . . .
5 15 20 30 40 58 70 79 96
Galvin-Hajnal Theorem Ideals and the Reduction of Relations . . . . . . . . . . . . . . 103 The Galvin-Hajnal Formula . . . . . . . . . . . . . . . . . . . . 108 Applications of the Galvin-Hajnal Formula . . . . . . . . . . . 121
3 Ordinal Functions 3.1 Suprema and Cofinalities . . . . . . . . . . . . . . . . 3.2 κ-rapid Sequences and the Main Lemma of pcf-Theory 3.3 The Definition and Simple Properties of pcf(a) . . . . 3.4 The Ideal J<λ (a) . . . . . . . . . . . . . . . . . . . . .
. . . .
. . . .
. . . .
. . . .
. . . .
131 143 151 159
4 Approximation Sequences 4.1 The Sets H(Θ) . . . . . . 4.2 Models and Absoluteness 4.3 Approximation Sequences 4.4 The Skolem Hull in H(Θ) 4.5 3-Club Sequences . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
173 176 196 199 202
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
vi 5 Generators of J<λ+ (a) 5.1 Universal Sequences . . . . . . . . . . . . . . . . . . . 5.2 The Existence of Generators . . . . . . . . . . . . . . . 5.3 Properties of Generators . . . . . . . . . . . . . . . . . 6 The Supremum of pcfμ (a) 6.1 Control Functions . . . . . . . . . . . . . . . . . . . . 6.2 The Supremum of pcfμ (a) . . . . . . . . . . . . . . . . 7 Local Properties p 7.1 The Ideals J∗ (b) and J<λ (a) . . . . . . . . . . . . . . 7.2 Intervals in pcf(a) . . . . . . . . . . . . . . . . . . . . 8 Applications of pcf-Theory 8.1 Cardinal Estimates . . . . . . . . . . . . . . . . . . . . 8.2 J´ onsson Algebras . . . . . . . . . . . . . . . . . . . . . 8.3 A Partition Theorem of Todor˘cevi´c . . . . . . . . . . . 8.4 Cofinalities of Partial Orderings ([λ]≤κ , ⊆) . . . . . . . 9 The Cardinal Function pp(λ) 9.1 pp(λ) and the Theorems of Galvin, Hajnal and Silver 9.2 The Lemma of Galvin and Hajnal for pp(λ) . . . . . .
Contents
. . . . . 209 . . . . . 213 . . . . . 218 . . . . . 221 . . . . . 225 . . . . . 233 . . . . . 244 . . . .
. . . .
. . . .
. . . .
. . . .
249 251 262 265
. . . . . 270 . . . . . 275
Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287 List of Symbols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
Preface This book is an introduction to modern cardinal arithmetic, developed in the frame of the axioms of Zermelo-Fraenkel set theory together with the axiom of choice. It splits into three parts. Part one, which is contained in Chapter 1, describes the classical cardinal arithmetic due to Bernstein, Cantor, Hausdorff, K¨ onig, and Tarski. The results were found in the years between 1870 and 1930. Part two, which is Chapter 2, characterizes the development of cardinal arithmetic in the seventies, which was led by Galvin, Hajnal, and Silver. The third part, contained in Chapters 3 to 9, presents the fundamental investigations in pcf-theory which has been developed by S. Shelah to answer the questions left open in the seventies. All theorems presented in Chapter 3 and Chapters 5 to 9 are due to Shelah, unless otherwise stated. We are greatly indebted to all those set theorists whose work we have tried to expound. Concerning the literature we owe very much to S. Shelah’s book [Sh5] and to the article by M. R. Burke and M. Magidor [BM] which also initiated our students’ interest for Shelah’s pcf-theory. The enthusiasm of our students for cardinal arithmetic contributed much to the formation of this book. Our thanks are due to S. Shelah for answering several questions and to T. Jech for sending us some papers. Our thanks are also due to S. Neumann for many hints to Chapter 9 and to T. Espley and A. Truong for their contributions concerning the readability of this book.
Introduction If M and N are sets1 and if there exists a bijection2 from M onto N , then we say that M and N are equinumerous, and write M ≈ N . To measure the number of members of a set, we will introduce sets of comparison. With ω we denote the set of natural numbers; 0 is a natural number. If for example M is equinumerous to the set {n ∈ ω : n < 25}, then we say that M has exactly 25 members, and {n ∈ ω : n < 25} is a set of comparison for M . If N is a set and if N and ω are equinumerous, then ω will be a set of comparison for N , and N will be called countably infinite or denumerable. A well known example for such a set is N = {n ∈ ω : n is divisible by 2}. We will assign to each set M a set of comparison |M |, the so-called cardinality of M , such that the following holds. (1) M ≈ N ⇐⇒ |M | = |N |. (2) M ≈ |M |. Chapter 1, § 1.5 shows that such an assignment M → |M | is possible. Any set |M | is called a cardinal number or a cardinal. If |M | and |N | are cardinal numbers, then we write |M | ≤ |N | iff3 there is an injection4 from M into N , and |M | < |N | iff |M | ≤ |N | and ¬(M ≈ N ). If we assume the axiom of choice, then any two cardinal numbers are comparable, i.e., we get |M | ≤ |N | or |N | ≤ |M | for any sets M and N ; conversely it will not prove difficult to show that this assertion implies the axiom of choice. Thus the class CN of cardinal numbers is linearly ordered by ≤ and by <. These linear orderings have no greatest element. G. Cantor proved in 1873 that, for any set M , the so-called power set P(M ) of M , i.e., the set {x : x ⊆ M }, satisfies |M | < |P(M )|. In Section 1.5 1 We assume that the reader has an intuitive knowledge about the mathematical notion of a set. {x : E(x)} will be, as usual, the collection of all mathematical objects satisfying the property E(x). 2 That is a function f from M into N such that, for every y ∈ N , there is exactly one x ∈ M with y = f (x). 3 We use the mathematical word iff as usual as an abbreviation for if and only if. 4 That is a function f from M into N such that, for every y ∈ N , there is at most one x ∈ M with y = f (x).
2
Introduction
we will see that CN is well-ordered by <, that means that every nonempty subset of CN has a <-least element. Consequently, for every cardinal number |M |, there exists a smallest cardinal number greater than |M |; we denote it by |M |+ . Every natural number will be shown to be cardinal, and ω is the set of finite cardinals. The infinite cardinals are enumerated by the so-called aleph function whose values ℵ(α) are usually written as ℵα . The smallest infinite + + cardinal is ω, ℵ0 = ω. So we have ℵ1 = ℵ+ 0 , ℵ2 = ℵ1 , and ℵn+1 = ℵn for every n ∈ ω. A natural candidate for the next cardinal, the smallest cardinal greater than every ℵn , is {ℵn : n ∈ ω}. The following properties show that this set is the supremum of the set {ℵn : n ∈ ω}, and we denote it by ℵω . Therefore we require further that, for any cardinals κ and μ, (3) κ < μ ⇐⇒ κ ∈ μ. (4) If K is a set of cardinal numbers, then K is a cardinal number. (5) κ < μ =⇒ κ ⊆ μ. These properties will be realized, and thus CN will be completely ordered by < in the sense that every nonempty set of cardinals has a supremum. The name cardinal number would be inappropriate if one could not calculate with cardinals. We define the addition, multiplication and exponentiation of cardinals by |M | + |N | := |M ∪ N |, if M ∩ N = ∅, |M | · |N | := |M × N |, and |M ||N | := |N M |, where N M is the set of all functions from N into M . Each of these operations is a canonical extension of the corresponding operation for natural numbers. However, addition and multiplication satisfy a simple new rule: if one of the nonempty sets M and N is infinite, then |M | + |N | = |M | · |N | = max{|M |, |N |}. Thus we see that the course of values of addition and multiplication can be easily described. This is not at all the case for the exponentiation (κ, λ) → κλ of cardinals. It is easy to see that |ω 2| = |P(ω)|, where 2 := {0, 1}, and that ω 2 and the set of real numbers are equinumerous. With Cantor’s result we get ℵ0 < 2ℵ0 . Cantor believed that there is no cardinal κ with ℵ0 < κ < 2ℵ0 , meaning that 2ℵ0 = ℵ+ 0 . This assertion is called the continuum hypothesis, the more general assertion that 2κ = κ+ for all infinite cardinals κ is called the generalized continuum hypothesis, written as (GCH). Under the assumption that ZermeloFraenkel set theory with the axiom of choice, denoted by ZFC, is consistent, K. G¨ odel proved that ZFC + (GCH), the theory ZFC with the additional axiom (GCH), is consistent, and P. J. Cohen proved, that ZFC + ¬(GCH)
Introduction
3
is consistent. If the reader wishes to accept (GCH), he need not study this book further, since the exponentiation of cardinals obeys in ZFC + (GCH) simple rules. The difficulties arise when cardinal exponentiation is studied in the axiom system ZFC, and we will describe some of them. Let ICN be the class of infinite cardinal numbers. Clearly the so-called continuum function (2κ : κ ∈ ICN) is increasing, i.e., we have 2κ ≤ 2μ for all κ, μ ∈ ICN with κ < μ. To formulate a further property of the continuum function, we need the notion of the cofinality of an infinite cardinal κ, written as cf (κ). If κ > ℵ0 , then we call κ a successor cardinal iff there exists some cardinal μ with κ = μ+ , and otherwise a limit cardinal. In this introduction let us define cf (ℵ0 ) = ℵ0 , cf (μ+ ) = μ+ for any successor cardinal μ+ , and cf (λ) = min{|K| : K ⊆ {ν ∈ ICN : ν < λ} and K = λ} for limit cardinals λ. This minimum exists since, for N = {ν ∈ ICN : ν < λ}, we have N = λ. Namely, (5) gives N ⊆ λ, hence | N | ≤ |λ|. Furthermore, N is a cardinal by (4), and < λ, (1) and (2) yield N ≤ λ. The supposition N < λ leads to ( N )+ + + since λis a limitcardinal, and thus gives ( N ) ∈ N and ( N ) ⊆ N , hence ( N )+ ≤ N , contradicting the definition of a cardinal successor. From N ⊆ λ and thus |N | ≤ λ, together with the other parts of the definition, we get cf (κ) ≤ κ for every infinite cardinal number κ. If κ ∈ ICN, then we call κ regular iff cf (κ) = κ, and singular iff cf (κ) < κ. A well-known theorem of J. K¨ onig says that κ < cf (2κ ). Let Reg denote the class of regular cardinals. W. B. Easton proved the following theorem. Assume that F : Reg −→ ICN is a function satisfying (i) κ < μ =⇒ F (κ) ≤ F (μ) and (ii) κ < cf (F (κ)). Then ZFC + ∀κ ∈ Reg(2κ = F (κ)) is consistent, only if ZFC is consistent. This result shows that the course of values of the continuum function on the class of regular cardinals is only limited by the rules (i) and (ii). However, J. Silver proved for singular cardinals κ with ℵ0 < cf (κ): If 2μ = μ+ for all infinite cardinals μ < κ, then 2κ = κ+ . So we see that the values of the continuum function for singular cardinals κ can in fact depend on its course of values on the set of smaller cardinals. Further investigations on the exponentiation of cardinals showed that the so-called gimel function (κcf(κ) : κ ∈ ICN) is of outstanding importance. Already A. Tarski and K. G¨ odel remarked that one can reduce the study of cardinal arithmetic to the study of this function. If κ is regular, then we have κcf(κ) = 2κ , and for singular κ we have κcf(κ) ≤ 2κ . Galvin and Hajnal found a nontrivial upper bound for κcf(κ) if κ is singular and cf (κ) > ℵ0 . Until recently, one could not give a corresponding estimate for singular cardinals with countable cofinality. For this, Shelah developed a theory of its own, the so-called pcf-theory, which is complete in itself, allows to extend
4
Introduction
the Galvin-Hajnal theorem to singular cardinals with countable cofinality, and has other applications outside of cardinal arithmetic. For cardinal arithmetic, it yields for example the following theorem: If 2ℵn < ℵω for every n ∈ ω, then 2ℵω < ℵℵ4 . Chapters 3 to 9 of this book give an introduction to the foundations of pcf-theory.
Chapter 1 Foundations 1.1 The Axioms of ZFC The year of birth of set theory can be regarded as 1872. In this year, Georg Cantor introduced the notion of a transfinite (infinite) ordinal number. His investigations, which soon made set theory an independent area of mathematics, met with mistrust and sometimes open hostility from other mathematicians. At the start of the last decade of the century, set theory came into vogue and was being applied more and more extensively to analysis and geometry. Just when Cantor had found high recognition, and when he had put the finishing touches to his investigations, he himself discovered the first antinomy in his system, which was also found two years later, in 1897, by Burali-Forti. Neither of them could offer any solution, but they did not take the problem too seriously, since it arose in a pretty technical area, namely, the theory of well-ordered sets. They believed that a revision of proofs and theorems could settle the situation, as was often the case earlier, under similar circumstances. These hopes were radically dashed when, in 1902, Bertrand Russell published his famous antinomy which occurred just at the beginning of set theoretical investigations and demonstrated that something wasn’t right in the foundations of that discipline. The disclosure of that antinomy led to a foundational crisis in mathematics. Several ways out of this crisis have been developed, the most successful one being without any doubt the axiomatic method. And amongst the various axiomatic systems of set theory, the system which was begun by Zermelo and completed by Fraenkel and Skolem is, adding the axiom of choice, perhaps the most known and the most practical one. The results of our book are set forth in this theory, denoted by ZFC, the axioms of which are represented below. We always begin with a naive formulation of the particular axiom of ZFC and will then make precise the notion of a “property” occurring in two axioms.
6
Chapter 1. Foundations
The axioms of ZFC are not independent in the sense that no axiom can be proved with the help of the other ones. But historical and practical reasons speak for choosing these axioms. The system ZF consists of the axioms (A1)– (A9); thus ZFC is the theory ZF together with the axiom of choice, (AC). We write a ∈ A for the assertion “The set a is a member (or element) of the set A”. The formal symbols we are using are explained later on when we will make precise the notion of a property. (A1) Axiom of Extensionality If any two sets have the same members, then they are equal. (A2) Empty Set Axiom There is a set having no members. As usual, we denote this set by ∅; ∅ := {x : x = x}. (A3) Comprehension Axioms or Subset Axioms If an arbitrary property is given, then to each set a there is a set b whose members are exactly those sets in a which satisfy the property. If E(x) is the considered property, then we write b = {x ∈ a : E(x)}. (A4) Pairing Axiom For any sets a and b, there is a set having as its members just a and b. We denote this (uniquely determined) set by {a, b} and call it the unordered pair or pair set of a and b. This means {a, b} := {z : z = a ∨ z = b}. Note that {a, a} = {a} follows from (A1). This set is called the singleton {a} or singleton of a. (A5) Union Axiom For any set a, there exists a set whose members are exactly the members of the members of a. We donote this set by a. So we have a := {z : ∃u(u ∈ a ∧ z ∈ u)}. Furthermore we put a∪b := {a, b} and {a1 , . . . , an } := {a1 , . . . , an−1 }∪ {an }. (A6) Power Set Axiom For any set a, there exists a set whose members are exactly the subsets of a. We denote this set by P(a) (i.e., P(a):={z : z ⊆ a}) and call it the power set of a. Hereby we say that a set z is a subset of a iff every member of z is a member of a, formally written as ∀u(u ∈ z =⇒ u ∈ a); of course, we abbreviate this by z ⊆ a. (A7) Infinity Axiom There is a set which has the empty set as a member, and has the member b ∪ {b} whenever b is a member of it. Every set having this property is called an inductive set. Thus we can give a short formulation of the infinity axiom: “There is an inductive set”.
1.1. The Axioms of ZFC
7
(A8) Replacement Axioms If the property E(a, b) is functional, that means that for any sets a, b and c we can conclude b = c from E(a, b) and E(a, c), then for each set A there is a set B whose members are exactly those sets b for which there exists a member a of A satisfying E(a, b). Very roughly speaking: “If the domain of a function is a set, then its range is also a set.”1 (A9) Regularity Axiom or Foundation Axiom Any nonempty set has a member which is minimal amongst its members with respect to the relation ∈; or: Any nonempty set has a member which has no members in common with it. (AC) Axiom of Choice For any set A whose members all are nonempty, there is a function with domain A such that, for any member a of A, the value of this function at a is a member of a; or: For any set A whose members all are nonempty, there is a function with domain A “choosing” one member from any member of A. If we define the cartesian product or the set of choice functions for A by A := {f : f is a function from A into A with f (a) ∈ a for all a ∈ A},2 then the axiom of choice, (AC), says: If A is a set of nonempty sets, then A = ∅. To make the notion of a property precise, we introduce a formal language LZF of set theory which differs from the so-called metalanguage or informal language, which is English. This formal language is a special case of a language of the first-order predicate calculus with equality, with one non-logical symbol ∈, denoting membership. The basic symbols of LZF , forming its alphabet, are (sentential) connectives ¬, ∧, ∨, =⇒ , and ⇐⇒; quantifiers ∀ and ∃; variables vj for each natural number j; = and ∈; parentheses ( and ) . Intuitively, ¬ means “no”, ∧ means “and”, ∨ means “or”, =⇒ means “implies”3 , ⇐⇒ means “equivalent”, 1 Note that this assertion needs no axiom if a function of the form f : A −→ B from the set A into a set B in the usual sense is given, since in this case its range is a set by a comprehension axiom. We don’t need the replacements axioms before we assign, by a functional property, to each member of a given set a certain set, and do not know at the beginning that these “values” are members of another fixed set. 2 If a and b are sets, then also a × b (see below) is a set. As a subclass of P(A × A), A is a set by (A5), (A6) and (A3). Note that ∅ = {∅}. 3 This usage of the word “implies” is a conventional part of mathematical jargon, but it is not exactly the way the rest of the world uses the word.
8
Chapter 1. Foundations
∀ means “for all”, and ∃ means “there exists”. A string of symbols or expression is a finite sequence of symbols. The concatenation of strings of symbols is that sequence which results from writing the given strings one behind the other. Certain expressions, corresponding to meaningful assertions, will be called formulas. The formulas of LZF are given by the following inductive definition: (1) For any i and j, (vi ∈ vj ) and (vi = vj ) are formulas (so-called atomic formulas). (2) If ϕ and ψ are formulas, so are (¬ϕ), (ϕ ∧ ψ), (ϕ ∨ ψ), (ϕ =⇒ ψ), (ϕ ⇐⇒ ψ), and (∀vj ϕ) and (∃vj ϕ) for any j. Now a property simply is a formula of LZF . If there is no danger of misunderstanding, we do not use parentheses as restrictively as in the definition of a formula; we will, in a formally incorrect manner, omit them for reasons of readability. The use of bounded quantifiers is very practical: ∀vi ∈ vj ϕ is the formula ∀vi (vi ∈ vj =⇒ ϕ), ∃vi ∈ vj ϕ is the formula ∃vi (vi ∈ vj ∧ ϕ). We also write vi = vj for ¬(vi = vj ) and vi ∈ vj for ¬(vi ∈ vj ). A sentence is a formula with no free variable (see section 4.2 for further details), a theory or axiom system is a set of sentences which are called the axioms of the theory. If a formula ϕ is provable in a theory T , where for our purposes mostly T = ZF or T = ZFC will suffice, we write T ϕ. As usual, we will introduce new function and relation symbols and socalled operations (as the intersection and union of sets). Furthermore it is very useful to speak about collections which need not be sets. Both aims can be realized by using classes: Every variable is a class; if ϕ(x, p) is a formula, then X := {x : ϕ(x, p)} is a class, where we allow ϕ to have free variables p etc. other than x, which are thought of as parameters upon which the class depends. Members of the class X are exactly those sets a which have the property ϕ(a, p). This means that a ∈ {x : ϕ(x, p)} ⇐⇒ ϕ(a, p). This is the main rule with whose help we can eliminate the new expressions {x : ϕ(a, p)}. We use capitel letters A, B, . . . to denote classes, also with indices, and define the extended formulas as those expressions which may contain the symbols {, } and : besides the symbols of LZF and which are defined in the same way as the formulas with the additional rule that (A = B) and (A ∈ B), for classes A and B, are also atomic formulas. If A = {x : ϕ(x)} and B = {x : ψ(x)}, then y ∈ A is the formula ϕ(y), A = B is the formula ∀x(ϕ ⇐⇒ ψ), A = y is the formula ∀x(ϕ ⇐⇒ x ∈ y), A ∈ B is the formula ∃z(ψ(z) ∧ ∀u(u ∈ z ⇐⇒ ϕ(u))), and A ∈ y is the formula ∃z(∀x(ϕ ⇐⇒ x ∈ z) ∧ z ∈ y), where the variable z can be chosen uniquely (and suitably). Thus any extended formula can be replaced by a formula of LZF . We could go one step further and admit classes of the form {x : Ψ(x)}, where Ψ is allowed to contain further classes.
1.1. The Axioms of ZFC
9
A. Levy proves in the appendix of his book [Le] that these extensions of the language can be eliminated in a formally correct way. In the first chapter of this book, the reader can find an explanation of our motivation and justification for our procedure of using classes. We can now give a precise formulation of the replacement axioms, using formulae or, equivalently, using classes. The formalization of the comprehension axioms is left to the reader. If ϕ(x, y, p1 , . . . , pn ), written as ϕ(x, y), is a formula of LZF , then the following sentence is an axiom of ZF: ∀p1 . . . ∀pn (∀u∀v∀w(ϕ(u, v) ∧ ϕ(u, w) ⇒ v = w) ⇒ ∀x∃y∀v(v ∈ y ⇔ ∃u ∈ x ϕ(u, v))). The class version says that, for any class F , the following formula is an axiom of ZF: Func(F ) =⇒ ∀x∃y(y = ran(F |`x)).4 We assume that the reader is familiar with the basic concepts of set theory as, for example, intersection, union, relation, function etc. Especially he should have seen a development of the elementary properties of the Boolean algebra of sets and should have learned to handle the “language of set theory” in the frame of an undergraduate course in mathematics. However, the basic properties of ordinals and cardinals will be described in detail, and principally no knowledge in set theory is required. We now give the definitions of all basic concepts that will be needed from the beginning. x, y, z, . . . always denote sets, A, B, C, . . . denote classes; since x = {z : z ∈ x} is provable5 , the definitions for classes also apply to sets. The class V := {x : x = x} is the universal class. A is a subclass of B, written as A ⊆ B, iff ∀z(z ∈ A =⇒ z ∈ B) (formally: A ⊆ B is an abbreviation for this formula; we will also state this definition in the form A ⊆ B :⇐⇒ ∀z(z ∈ A =⇒ z ∈ B)). A ⊂ B and A B stand for the formula A ⊆ B ∧ A = B, to be read as “A is a proper subclass of B”. Any class A is called a set iff ∃y∀z(z ∈ y ⇐⇒ z ∈ A) is provable. We call A a proper class iff ∀y(y = A) is provable. (x, y) := {{x}, {x, y}} is the ordered pair of x and y. The essential property of this set is ∀x∀y∀u∀v((x, y) = (u, v) ⇐⇒ x = u ∧ y = v). The class A × B := {(x, y) : x ∈ A ∧ y ∈ B} is the cartesian product or product of the classes A and B (where {(x, y) : ϕ(x, y)} := {z : ∃x∃y( z = (x, y) ∧ ϕ(x, y))}). The classes A ∪ B := {x : x ∈ A ∨ x ∈ B}, A ∩ B := {x : x ∈ A ∧ x ∈ B} and A \ B := {x : x ∈ A ∧ x ∈ B} are respectively the union, the intersection and the difference of the classes A and B. We say that the classes A and B are 4 For 5 By
the definitions of Func, ran and F |`x, see below. our conventions, this is the formula ∀z(z ∈ x ⇐⇒ z ∈ x).
10
Chapter 1. Foundations
disjoint iff A ∩ B = ∅. A := {x : ∃a(a ∈ A ∧ x ∈ a)} is the union of A and A := {x : ∀a(a ∈ A =⇒ x ∈ a)} is the intersection of A. If A and Bare sets, so are A \ B, A ∪ B, A ∩ B, A × B and A; in the case that A = ∅, A is also a set. Note that ∅ = V. A relation is a class of ordered pairs: Rel(R) :⇐⇒ R ⊆ V × V. Instead of (x, y) ∈ R we also write xRy. Assume that R is a relation. R is a relation from A into B iff R ⊆ A × B. If R ⊆ A × A, then R is a relation on A or a binary relation on A. Analogously, n-ary relations are defined as subclasses of the n-fold cartesian product of A. The relation R |`A := {(x, y) ∈ R : x ∈ A} is the restriction of the relation R to A, R−1 := {(y, x) : (x, y) ∈ R} is the inverse relation of R. The domain of R is dom(R) := {x : ∃y (x, y) ∈ R}, the range of R is ran(R) := {y : ∃x (x, y) ∈ R}, and fld(R) := dom(R) ∪ ran(R) is the field of the relation R. The image of A under R is R[A] := {y : ∃x ∈ A (x, y) ∈ R}. If S is a further relation, then the composition of R and S is the relation R ◦ S := {(u, w) : ∃v((u, v) ∈ S ∧ (v, w) ∈ R)}. We define F to be a function, written as Func(F ), by Func(F ) :⇐⇒ Rel(F ) ∧ ∀u∀v∀w((u, v) ∈ F ∧ (u, w) ∈ F =⇒ v = w). If F is a function and u ∈ dom(F ), then F (u), the value of F at u, denotes the unique set v with (u, v) ∈ F . Let F : A −→ B
:⇐⇒
Func(F ) ∧ dom(F ) = A ∧ ran(F ) ⊆ B;
then F is a function from A into B. A function F : A −→ V is also called a family and written as F =: (F (a) : a ∈ A). Often one introduces a new symbol, say B, and writes Ba instead of F (a) and (Ba : a ∈ A) instead of F . The cartesian product of a family (F (a) : a ∈ A) is defined by F (a) := {f : f : A −→ {F (a) : a ∈ A} ∧ ∀a ∈ A(f (a) ∈ F (a))}. a∈A
Any function F : A −→ B is a set, being a subclass of A × ran(F ), if A is a set. If A is a set, A B is the class of functions from A into B. idA is the function {(a, a) : a ∈ A}, the so-called identity function or identity on A. A function F from A into B is called surjective or a surjection or a function from A onto B iff ran(F ) = B. Any function F is called injective or one-to-one or an injection iff ∀u∀v∀w((u, v) ∈ F ∧ (w, v) ∈ F =⇒ u = w); in this case, F −1 is a function, the inverse of the function F . If F is an injective function from A onto B, then F is called bijective or a bijection. Now assume that R and S are binary relations on the classes A and B, respectively. A function F : A −→ B is a homomorphism (with respect to R and S) iff
1.1. The Axioms of ZFC
11
∀x ∀y(xRy =⇒ F (x)SF (y)); it is an embedding (w.r.t. R and S) iff it is injective and ∀x ∀y(xRy ⇐⇒ F (x) S F (y)). Any surjective embedding is an isomorphism. If A and B – and thus also F , R and S – are sets, then we will use for such functions the familiar denotation F : (A, R) −→ (B, S). We say that a relation R is reflexive iff ∀x ∈ fld(R)(xRx); irreflexive iff ∀x ∈ fld(R)(¬xRx); antisymmetric iff ∀x ∀y(xRy ∧ yRx =⇒ x = y); asymmetric iff ∀x ∀y(xRy =⇒ ¬yRx); symmetric iff ∀x ∀y(xRy =⇒ yRx); connected or trichotomic iff ∀x ∈ fld(R) ∀y ∈ fld(R)(xRy ∨ x = y ∨ yRx); transitive iff ∀x ∀y ∀z(xRy ∧ yRz =⇒ xRz); an equivalence relation iff it is reflexive, symmetric, and transitive; a partial ordering iff it is reflexive, antisymmetric, and transitive; a strict partial ordering iff it is irreflexive and transitive6 ; a linear ordering iff R is a connected partial ordering; well-founded, written as wf(R), iff (i) ∀x ∈ fld(R)∃y(x ∈ y ∧ R−1 [y] ⊆ y) and (ii) ∀x ⊆ fld(R)(x = ∅ =⇒ ∃y ∈ x∀z ∈ x(¬zRy)); a well-ordering iff R is a well-founded connected strict partial ordering. If R is a relation, B is a subclass of fld(R) and x ∈ B, then x is a greatest element or largest element or maximum of B (w.r.t. R), denoted by max(B), iff ∀z ∈ B(z = x =⇒ zRx); least element or smallest element or minimum of B (w.r.t. R), denoted by min(B), iff ∀z ∈ B(z = x =⇒ xRz); maximal element (w.r.t. R) or R-maximal element of B iff ¬∃z ∈ B(z = x ∧ xRz); minimal element (w.r.t. R) or R-minimal element of B iff ¬∃z ∈ B(z = x ∧ zRx). If A is a class and R is a relation with fld(R) = A, then we write (A, R). For example, if R is a partial ordering on A with fld(R) = A, then we say that (A, R) is a partial ordering. Assume that R is a relation on H with fld(R) = H and X is a subset of H. X is called a chain iff (X, R ∩ (X × X)) is a linear ordering (in particular, any two elements of X are comparable under R, i.e., for all y, z ∈ X we have yRz ∨y = z ∨zRy). We say that X is an antichain iff any two different elements 6 In most cases we will make no difference between partial orderings and strict partial orderings. For any partial ordering R, we get a strict partial ordering R via xR y :⇐⇒ xRy ∧ x = y, and conversely, any strict partial ordering R yields a partial ordering R by xRy :⇐⇒ xR y ∨ x = y.
12
Chapter 1. Foundations
of X are incomparable under R, i.e., iff for all different y, z ∈ X we have ¬(yRz) and ¬(zRy). Assume further that x ∈ H. x is an upper bound (lower bound) of X iff sRx ∨ s = x for all s ∈ X (xRs ∨ x = s for all s ∈ X). We say that x is a supremum of X and write x = sup(X) iff x is a least upper bound of X; i.e., x is an upper bound of X, and xRy ∨ x = y for any upper bound y of X. Accordingly, x is an infimum of X, written as x = inf(X), iff x is a greatest lower bound of X. If (H, R) is a partial ordering and a supremum or an infimum of X exists, then it is uniquely determined. X is called an initial segment of H iff, for all s ∈ X and all z ∈ H, zRs implies z ∈ X. X is a proper initial segment of H iff X is an initial segment of H and different from H. If (H, ≤) and (K, ) are partial orderings and f : H −→ K is a function, then f is called increasing or monotone or monotonic (decreasing) iff, for all x, y ∈ H, x ≤ y implies f (x) f (y) (f (y) f (x)). We say that f is strictly increasing etc. (strictly decreasing) iff, for all x, y ∈ H, x < y implies f (x) ≺ f (y) (f (y) ≺ f (x)). Note: If H is a well-ordering, then every strictly decreasing sequence (for the definition of a sequence, see section 1.4) of elements of H is finite, since its range has a least element. Exercises 1) Let x = {∅,{∅},{∅,{∅}}}. Write the following sets in the form {a1 ,...,ak }: x, x, P({x}), P(x) ∩ (x, {x}). 2) Use the axioms of ZF to show for any sets x, y: a) x × y, {P(y) : y ∈ x}, {f : f : x −→ P(x)} are sets; if x = ∅, then x is a set. b) ∅, {x : y ∈ x}, {x : ¬∃y(x ∈ y ∧ y ∈ x)} are not sets. 3) Prove without using (A9): There is not a set A such that P(A) ⊆ A. Hint: Consider the class {x ∈ A : x ∈ x}. 4) Show with the axiom of regularity, that there is not a finite sequence (xi : i ∈ n) such that x0 ∈ x1 ∈ x2 ∈ . . . ∈ xn−1 ∈ x0 . 5) The following sets [x, y] have, for x = y, exactly two members. Which of them have the property of an ordered pair, i.e., [x, y] = [x , y ] ⇐⇒ x = x ∧ y = y ? a) [x, y] := {{x}, {x, y}}. b) [x, y] := {x, {y}}. c) [x, y] := {x, {x, y}}.
1.1. The Axioms of ZFC
13
6) Prove that the pairing axiom follows from the other axioms of ZF. Hint: Observe that {∅, {∅}} is a set by the power set axiom. Now let a and b be sets and apply a replacement axiom to the formula (u = ∅ ∧ v = a) ∨ (u = {∅} ∧ v = b). 7) Assume that a, b, c, d, e are different sets and R = {(a, b), (a, c), (a, d), (b, b), (b, c), (b, d), (c, c)}. Determine the following sets: dom(R), ran(R), R[{b, e}], R |` {b, e}, R. Is R reflexive, symmetric, R−1 |` {a, b}, R−1 [{a, b}], R ◦ R and antisymmetric, connected, transitive? Has fld(R) a minimal, maximal, greatest, smallest element? 8) In general, a function F : A −→ B needs not be injective and F −1 does not exist. But prove that (F −1 )∗ : P(B) −→ P(A), defined by (F −1 )∗ (x) = F −1 [x] for any x ∈ P(B), is a function, and that (F −1 )∗ is injective if F is surjective. 9) Let f : A −→ B be a function, x ⊆ A and y ⊆ B. Prove: a) b) c) d)
x ⊆ f −1 [f [x]]. f [f −1 [y]] ⊆ y. If f is injective, then in a) equality holds. If f is surjective, then in b) equality holds.
Give examples such that in a) and b) respectively equality does not hold. 10) Let X be a nonempty set. We call a set P a partition of X iff P = X, ∅ ∈ P , and the members of P are pairwise disjoint. If (X, R) is an equivalence relation (we also say that R is an equivalence relation on X) and x ∈ X, then {y ∈ X : (x, y) ∈ R} is the equivalence class of x (w.r.t. R). a) If R is an equivalence relation on X, then the set of equivalence classes is a partition of X. b) If P is a partition of X, and if the relation R ⊆ X × X is defined by (a, b) ∈ R :⇐⇒ ∃Y ∈ P (a ∈ Y ∧ b ∈ Y ), then R is an equivalence relation on X. c) Assume that the set ω of natural numbers and Z, the set of integers, are already known. For any n ∈ ω with n ≥ 2 let Rn be defined by (a, b) ∈ Rn :⇐⇒ n divides b − a. Show that Rn is an equivalence relation on Z, and determine the equivalence classes a, a ∈ Z, for n = 6. (Hint: Use division with remainder.)
14
Chapter 1. Foundations d) Show that, for fixed n ∈ ω, G = {(x, y) : ∃a ∈ Z ∃c ∈ Z(x = (a, c) ∧ y = a · c)} is a function.
11) Assume that X is a nonempty set and Part(X) is the class of partitions of X. Let the relation on Part(X) be defined by P1 P2 :⇐⇒ ∀Y ∈ P1 ∃Z ∈ P2 (Y ⊆ Z) for P1 , P2 ∈ Part(X). Prove: a) Part(X) is a set. b) is a partial ordering on Part(X). c) If T is a nonempty subset of Part(X), then T has an infimum under . Hint: inf(T ) is the partition {Y ⊆ X : Y = ∅ ∧ ∃D(D ⊆ T ∧ Y = D ∧ ∀P ∈ T |P ∩ D| = 1)}. d) If T is a nonempty subset of Part(X), then T has a supremum under . Hint: sup(T ) = inf{P ∈ Part(X) : ∀P ∈ T P P }. 12) Assume that R is a reflexive transitive relation. Put S := {(x, y) : (x, y) ∈ R ∧ (y, x) ∈ R}. Show that S is an equivalence relation on fld(R). Further let [a] := {x ∈ fld(R) : (a, x) ∈ S} be the equivalence class of a ∈ fld(R). Prove that T := {([a], [b]) : (a, b) ∈ R} is a partial ordering on the set {[a] : a ∈ fld(R)}. 13) Assume that A and B are nonempty sets. Further let (X(a,b) : (a, b) ∈ A × B) be a family of sets such that X(a,b) ∩ X(a,c) = ∅ for all a ∈ A and all b, c ∈ B with b = c. Show with the axioms of ZF the existence of the families which are needed in the following equation and prove X(a,b) = X(a,f (a)) . a∈A
b∈B
f ∈A B
a∈A
14) Any two functions f and g are called compatible iff f (x) = g(x) for all x ∈ dom(f ) ∩ dom(g). Prove: a) f and g are compatible iff f ∪ g is a function iff f |` (dom(f ) ∩ dom(g)) = g |`(dom(f ) ∩ dom(g)). b) If F is a set of pairwise compatible functions, then G := F is a function with dom(G) = {dom(f ) : f ∈ F } and ran(G) = {ran(f ) : f ∈ F }.
1.2. Ordinals
15
c) Let A and B be sets and Func(A, B) the class of all functions f with dom(f ) ⊆ A and ran(f ) ⊆ B. Prove with the axioms of ZF that Func(A, B) is a set. We define a relation on this set by f g :⇐⇒ f ⊆ g. Show that is a partial ordering. d) Let X ⊆ Func(A, B). Show that X has a supremum under in Func(A, B) iff X is a set of pairwise compatible functions.
1.2 Ordinals In this section we will prove that every ordinal is well-ordered by ∈. In Section 1.3 we will show that, for each well-ordered set (A, <), there is a unique ordinal α such that (A, <) is isomorphic to (α, ∈). So it suffices to study the theory of ordinals to know the theory of well-orderings. Furthermore the principles of induction and recursion for natural numbers can be generalized for ordinals. So we get the fundamental tools of transfinite set theory. With the axiom of choice we will prove in Section 1.5 that every set can be well-ordered. This allows us to define for each set its cardinality or cardinal number as a special ordinal number. Definition A class A is transitive iff every member of A is a subset of A; this means formally: ∀y∀z(z ∈ y ∧ y ∈ A =⇒ z ∈ A). An ordinal number or ordinal is a transitive set whose members are all transitive. We denote by ON the class of ordinals. Small greek letters α, β, γ, δ, σ, τ, ξ, ζ are variables for ordinals. The letters κ, λ, μ, ν, ρ are reserved for special ordinals, the cardinals or cardinal numbers. Instead of σ ∈ τ we also write σ < τ , instead of σ < τ ∨ σ = τ we write σ ≤ τ . Example ∅ is an ordinal, and therefore ON = ∅. Further no ordered pair is an ordinal. If we assume that (a, b) = {{a}, {a, b}} is an ordinal, then a ∈ (a, b), since every ordinal is transitive. Thus we get a ∈ a, from which we can infer that the set {a} has no ∈-minimal element, contradicting the axiom of regularity. Lemma 1.2.1 a) Any member of an ordinal is an ordinal. b) Any nonempty class A of ordinals has an ∈-minimal element (i.e., A ⊆ ON ∧ A = ∅ =⇒ ∃y(y ∈ A ∧ ∀z(z ∈ A =⇒ z ∈ y))). c) σ ∈ σ.7 7 By the axiom of foundation, we get x ∈ x for every set x. The proof is exactly the same as that for σ.
16
Chapter 1. Foundations
Proof For a), let x ∈ σ. Since σ is transitive, we get x ⊆ σ. Therefore every member of x is transitive, since this holds for the members of σ. Finally, as a member of σ, x is transitive. For b), let σ ∈ A. If σ ∩ A = ∅, we can choose, by the axiom of foundation, an ∈-minimal element of σ ∩ A, which has no ∈-predecessor in A, since σ is transitive. To prove c), we assume that σ ∈ σ. The axiom of foundation implies that the nonempty subset {σ} of σ has a member y satisfying y ∩ {σ} = ∅. Certainly y = σ, and with σ ∈ σ ∩ {σ} we get a contradiction to σ ∩ {σ} = ∅. Corollary 1.2.2 a) ON is not a set. b) Every class A of ordinals is partially ordered by ∈.8 Proof To prove a), we suppose that there is a set y such that y = ON. By Lemma 1.2.1, y is transitive. Furthermore, by definition, all members of y are transitive, and consequently y is an ordinal. This gives y ∈ ON = y, contradicting Lemma 1.2.1 c). Assertion b) follows immediately from Lemma 1.2.1 c) and the fact that all ordinals are transitive. Lemma 1.2.3 ∈ is connected on ON; that means if σ and τ are ordinals, then σ ∈ τ ∨ σ = τ ∨ τ ∈ σ. Proof To get a contradiction, let us assume that the assumption is false. Then, by Lemma 1.2.1 b), the nonempty class A := {σ : ∃τ (σ ∈ τ ∧ σ = τ ∧ τ ∈ σ)} has an ∈-minimal element, say σ0 . By the same reason, the nonempty class B := {τ : σ0 ∈ τ ∧ σ0 = τ ∧ τ ∈ σ0 } has an ∈-minimal element, say τ0 . Thus σ0 ∈ τ0 and σ0 = τ0 and τ0 ∈ σ0 . The contradiction will have arrived if we show σ0 = τ0 . Every member of an ordinal is an ordinal. So let α ∈ σ0 . Then α ∈ A, which implies α ∈ τ0 or α = τ0 or τ0 ∈ α. From either of the last two assertions we can infer that τ0 ∈ σ0 , which is impossible. So we get α ∈ τ0 , hence σ0 ⊆ τ0 . In the same way we conclude successively from α ∈ τ0 that α ∈ B, α ∈ σ0 , and τ0 ⊆ σ0 . Altogether we have shown that σ0 = τ0 . 8 If
A does not have exactly one member, this means that ∈ ∩ (A×A) is a partial ordering.
1.2. Ordinals
17
Corollary 1.2.4 a) Every class A of ordinals is well-ordered by ∈. b) If A is a transitive proper class and all members of A are transitive, then A = ON. c) σ ∈ τ ⇐⇒ σ τ . Proof Together with the preceding results, for the proof of a) we only have to verify the first condition in the definition of a well-founded relation. If R :=∈ ∩ (A × A) and σ ∈ fld(R), then y := σ ∪ {σ} is a set satisfying R−1 [y] ⊆ y. Next we prove part b). From the assumption we can easily infer that all members of A are ordinals. Consider, to get a contradiction, the ordinal α := min(ON \ A). Then A, being a proper class, is no subclass of α. So we can choose γ ∈ A \ α. The previous lemma shows that α < γ. But this yields α ∈ A, since A is transitive, contradicting α ∈ A. For the proof of c), we note that one implication of the equivalence holds by the definition of an ordinal and Lemma 1.2.1 c). For the converse, let σ τ . By Lemma 1.2.3 and τ ∈ τ , we get σ ∈ τ . Definition For any ordinals α and β such that α ≤ β, let (α, β) := (α, β)ON := {x ∈ ON : α < x < β}, (α, β] := (α, β]ON := {x ∈ ON : α < x ≤ β} be the open interval, half open interval of ordinals with endpoints α and β, respectively. The intervals [α, β)ON and [α, β]ON are defined analogously, where [α, β]ON is called the closed interval with endpoints α and β. Lemma 1.2.5
a) If x is a set of ordinals, then x is an ordinal, and x = sup(x). b) If A is a nonempty class of ordinals, then A = min(A). Proof To prove a) we note that every member of x is a member of an ordinal, therefore is itselfan ordinal and in particular transitive. In the same way one can show that x is transitive. Consequently, x is an ordinal. It is an upper bound of x, since τ ∈ x implies τ ⊆ x and thus τ ≤ x by Corollary 1.2.4. If σ < x, then σ is not an upper bound of x because there is an ordinal τ ∈ x such that σ ∈ τ . So we have proved x = sup(x). For part b), Lemma 1.2.1 implies that A has an ∈-minimal element σ0 . Obviously, this is the minimum of A. Certainly we have A ⊆ σ0 . Conversely, if α < σ0 , then α < β for all β ∈ A, and so we get α ∈ A. This proves σ0 = A.
18
Chapter 1. Foundations
Definition If x is a set, then the set S(x) := x ∪ {x} is called the successor of x. An ordinal α is called a successor ordinal iff there is an ordinal σ such that α = S(σ). We also write σ + 1 instead of S(σ). Let 0 := ∅, called zero. An ordinal α is called a limit ordinal, written Lim(α), iff α = 0 and α is not a successor ordinal. We use Lim to denote the class of limit ordinals 9 . Lemma 1.2.6 a) b) c) d)
S(σ) is an ordinal satisfying σ < S(σ). If σ ≤ τ ≤ S(σ), then τ = σ or τ = S(σ). Lim(α) ⇐⇒ α = 0 ∧ α = α. Every ordinal is 0 or a successor ordinal or a limit ordinal.
Proof For part b), suppose that σ < τ < S(σ). Then σ ∈ σ, contradicting Lemma 1.2.1. For part c), first let α be a limit ordinal and β ∈ α. Then α = 0 and, by part b), β < β + 1 < α. So we get β ∈ α and consequently α ⊆ α. Since α is transitive, we have α ⊆ α. Thus we have shown that α = α. Conversely, if α = 0 is a successor ordinal β + 1, then α = β = α. Lemma 1.2.7 a) There exists a limit ordinal. b) If α0 is the least limit ordinal and C := {x : x is inductive} is the class of inductive sets, then α0 = C. Proof First we prove part a). By the axiom of infinity, there is an inductive set y. Let the set x be given by an axiom of comprehension by x := {z ∈ y : z ∈ ON ∧ z ⊆ y}. We want to show that x is an ordinal. First we have 0 ∈ x, hence x = ∅, and every member of x is transitive. If u ∈ z ∈ x, we get u ∈ y since z ⊆ y, and u ∈ ON. Furthermore we have u ⊆ y, since u ⊆ z. This shows u ∈ x; x is transitive. Therefore x is an ordinal. Now suppose x = S(σ). Then S(σ) ⊆ y, and σ ∈ y leads to S(σ) ∈ y. This yields x ∈ x, contradicting Lemma 1.2.1. To prove b), we note that α0 , as a limit ordinal, is an inductive set by Lemma 1.2.6. This implies C ⊆ α0 . To get a contradiction we assume that α0 \ C = ∅. Then the ordinal σ := min(α0 \ C) is a member of α0and thus must be a sucessor ordinal S(τ ), since 0 ∈ C. Further we have τ ∈ C. This implies σ = S(τ ) ∈ C, since any intersection of a nonempty class of inductive sets is inductive again, which contradicts the choice of σ. 9 From the results in Section 1.3 we can easily infer that this is a proper class. If σ ∈ ON and ω is the set of natural numbers defined below, then we can define a function (σn : n ∈ ω) by σ0 := σ and σn+1 := σn + 1; the ordinal τ := sup{σn : n ∈ ω} is a limit ordinal greater than σ.
1.2. Ordinals
19
Definition We define ω := {x ∈ ON : ∀z ≤ x(¬Lim(z))}. ω is a set, since it is a subclass of the smallest limit ordinal. Further it is easy to show that ω is an inductive set. Now Lemma 1.2.7 says that ω is the least limit ordinal and the smallest inductive set. ω is called the set of natural numbers. Each of its members is called a natural number. The first members of ω are 0 := ∅, 1 := {0}, 2 := {0, 1}, . . . . Corollary 1.2.8 (Induction Principle for ω, Complete Induction) inductive subset of ω, then A = ω. Formally:
If A is an
A ⊆ ω ∧ 0 ∈ A ∧ ∀α ∈ A(α + 1 ∈ A) =⇒ A = ω. Exercises 1) Assume that a, b are sets and a is transitive. Prove: a) b is transitive iff b ⊆ P(b). b) If b is transitive, then a ∪ b is transitive. c) If b is transitive, then a ∩ b is transitive. d) If S ⊆ P(a), then a ∪ S is transitive. e) If every x ∈ b is transitive, then b is transitive. f) Ist a = ∅, then a is transitive. 2) Let x be a set. Show that x is an ordinal iff x = 1 or R := {(y, z) : y ∈ x ∧ z ∈ x ∧ y ∈ z} is a well-ordering with fld(R) = x such that ∀y ∈ x(y = {z : zRy}). 3) Show that the following assertions are equivalent for any set x: (i) x is an ordinal. (ii) x is transitive ∧ ∀y ∈ x∀z ∈ x(y ∈ z ∨ y = z ∨ z ∈ y). (iii) x is transitive and every transitive proper subset y of x is a member of x. (iv) (x =0 ∨ 0 ∈ x) ∧ ∀y ∈ x(Sy = x ∨ Sy ∈ x) ∧ ∀y(y ⊆ x =⇒ y = x ∨ y ∈ x). Hint: We have shown above that (i) implies the other assertions. Therefore it is practical to prove that they are all equivalent to (i). For “(iii) =⇒ (i)”, consider the set y := {α ∈ ON : α ∈ x}. For “(iv) =⇒ (i)”, consider α := min(ON \ x).
20
Chapter 1. Foundations 4) Let R be the set of real numbers. Show that any subset of R which is well-ordered by the usual ordering on R is countable. Hint: In a well-ordered set without a maximum, any member has an immediate successor. 5) Prove: If X is a nonempty set of ordinals without a maximum, then sup(X) is a limit ordinal.
1.3 Transfinite Induction and Recursion We remind the reader that a relation R is called well-founded (written as wf(R)) iff (i) ∀x ∈ fld(R)∃y(x ∈ y ∧ R−1 [y] ⊆ y) and (ii) ∀x ⊆ fld(R)(x = ∅ =⇒ ∃y ∈ x∀z ∈ x(¬zRy)). In this definition, condition (i) has technical reasons. We will show that it can be replaced by the condition “the class of R-predecessors of each member x of fld(R) is a set”, which intuitively is more intelligible. From this condition and the axiom of foundation it follows immediately that, for any class A, the relation ∈ ∩ A × A is well-founded. Lemma 1.3.1 If R is a well-founded relation, then R is irreflexive, and any nonempty class A ⊆ fld(R) has an R-minimal element. Proof If x ∈ fld(R), then there is y ∈ {x} such that ¬zRy holds for all z ∈ {x}. Thus we get ¬xRx. To show the second assertion, we take a member x ∈ A and, by the above definition, a set y such that x ∈ y and R−1 [y] ⊆ y. Then the set y ∩ A has an R-minimal element z. If uRz, then u ∈ y, since R−1 [y] ⊆ y, and thus u ∈ A by the choice of z. This shows that z is an R-minimal element of A. Definition If R is a relation and x ∈ fld(R), we say that x
:= {y : yRx∧y = x} is the class of strict R-predecessors of x. If R is well-founded, then x
= {y : yRx}. Theorem 1.3.2 (Transfinite Induction Principle) If R is a well-founded relation, then the following holds: If ∀x ∈ fld(R)(∀y ∈ x
ϕ(y) =⇒ ϕ(x)) , then ∀x ∈ fld(R) ϕ(x). More precisely: If ϕ is a formula of LZF , then ZF wf(R) ∧ ∀x ∈ fld(R)(∀y ∈ x
ϕ(y) =⇒ ϕ(x)) =⇒ ∀x ∈ fld(R) ϕ(x).
1.3. Transfinite Induction and Recursion
21
Proof We assume, to get a contradiction, that the conclusion is false and the premiss is true. Then Lemma 1.3.1 says that there is an R-minimal element x ∈ fld(R) satisfying ¬ϕ(x). So we have ∀y ∈ x
ϕ(y). From our assumption we get ϕ(x), contradicting ¬ϕ(x). Remark 1.3.3 Important special cases of Theorem 1.3.2 are: a) R = ∈ ∩ (ON × ON). So we get the Transfinite Induction Principle for ON: ZF ∀α(∀β ∈ α ϕ(β) =⇒ ϕ(α)) =⇒ ∀α ϕ(α). This is also a direct consequence of Lemma 1.2.1. b) R = ∈ ∩ σ × σ for σ ∈ ON. In particular we obtain for σ = ω the induction principle for ω. c) R = ∈: From the axiom of regularity and Lemma 1.3.8 (see below) we can conclude that the relation ∈ is well-founded. Thus we can use in ZF the so-called ∈-Induction Principle: ∀x(∀y ∈ x ϕ(y) =⇒ ϕ(x)) =⇒ ∀xϕ(x). Corollary 1.3.4 (2nd Form of the Transfinite Induction Principle for ON) ZF ϕ(0) ∧ ∀α(ϕ(α) =⇒ ϕ(α + 1)) ∧ ∀α(Lim(α) ∧ ∀β ∈ α ϕ(β) =⇒ ϕ(α)) =⇒ ∀αϕ(α). Proof This principle follows immediately from the transfinite induction principle for ON if one notices that every ordinal is either 0 or a successor ordinal or a limit ordinal. Theorem 1.3.5 (Transfinite Recursion Theorem Schema) If R, G and F are classes, then let rec(F, R, G) be an abbreviation for the formula Func(F ) ∧ dom(F ) = fld(R) ∧ ∀x ∈ fld(R)(F (x) = G(F |`x
)). If R, F and G are classes, then we can construct a class F , such that the following formula is provable in ZF: (Rel(R)∧wf(R)∧G : V −→ V) =⇒ rec(F, R, G)∧(rec(F , R, G) =⇒ F = F ). We say that the function F is defined by transfinite induction or defined by recursion or defined recursively with respect to the well-founded relation R and the function G.
22
Chapter 1. Foundations
Proof The uniqueness of F can be easily shown, using Theorem 1.3.2.
, then F |` x
= F |` x
, and Namely, if x ∈ fld(R) and F (z) = F (z) for all z ∈ x so we get F (x) = G(F |` x
) = G(F |` x
) = F (x). From Theorem 1.3.2 we can conclude that ∀x ∈ fld(R) F (x) = F (x). Nowwe define the class F and prove that it has the desired properties. Let F := K, where K := {f : Func(f ) ∧ dom(f ) ⊆ fld(R) ∧ ∀x ∈ dom(f )(
x ⊆ dom(f ) ∧ f (x) = G(f |`x
))}. Claim 1 F is a function. For this we show f (x) = g(x) for any f, g ∈ K and x ∈ dom(f ) ∩ dom(g). We use transfinite induction, i.e., we apply Theorem 1.3.2, and assume that the assertion is true for all z ∈ x
. Since x
⊆ dom(f ) ∩ dom(g), this gives f (z) = g(z) for all z ∈ x
. Thus we get f |` x
= g |` x
and, since G is a function, f (x) = G(f |`x
) = G(g |`x
) = g(x). Claim 2 ∀x ∈ dom(F )(F (x) = G(F |`x
)). Let x ∈ dom(F ), that means x ∈ dom(f ) for some f ∈ K. Then x
⊆ dom(f ) ⊆ dom(F ), hence f |`x
= F |`x
and F (x) = f (x) = G(f |`x
) = G(F |`x
). Claim 3 dom(F ) = fld(R). By the definition of F , we have dom(F ) ⊆ fld(R). Now let x ∈ fld(R) and assume, for an application of Theorem 1.3.2, that z ∈ dom(F ) for all z ∈ x
, i.e., x
⊆ dom(F ). Since R is well-founded, there is a set y such that x ∈ y and R−1 [y] ⊆ y. From {x} ⊆ y we get R−1 [{x}] ⊆ R−1 [y] ⊆ y, hence x
⊆ y. Put f := F |`y. If x ∈ dom(f ), then x ∈ dom(F ), and we are done. So assume that x ∈ dom(f ). Since F is a function, f is also a function, and furthermore f is a set by the axiom of replacement. Obviously we have
))} is dom(f ) = y ∩ dom(F ) and x
⊆ dom(f ). Therefore, f := f ∪ {(x, G(f |`x a function such that dom(f ) ⊆ fld(R). Now one easily verifies z ⊆ dom(f ) and f (z) = G(f |` z ) for any z ∈ dom(f ). Namely, if z = x, then x
⊆ dom(f ) ⊆
= f |` x
and f (x) = G(f |` x
) = G(f |` x
). On the other dom(f ), hence f |` x hand, if z = x, then z ∈ dom(f ) ⊆ y, which gives z ⊆ R−1 [y] ⊆ y. Furthermore z ⊆ dom(F ), since z ∈ dom(F ). So we can conclude that z ⊆ dom(f ) ⊆ dom(f ) and f (z) = f (z) = F (z) = G(F |` z ) = G(f |` z ) = G(f |` z ). From this, we get f ∈ K and x ∈ dom(F ). Since x ∈ y, we have x ∈ dom(f ). This contradiction completes the proof of the theorem. Remark 1) Let us call each member of the class K defined in the proof of Theorem 1.3.5 an approximation of F . Then it follows from the preceding arguments that • For each x ∈ fld(R), there is an approximation f of F with F (x) = f (x).
1.3. Transfinite Induction and Recursion
23
• If x ∈ fld(R) and f ∈ V is an arbitrary function satisfying x
⊆ dom(f ) and F (z) = f (z) for all z ∈ x
, then F |` x
= f |` x
, hence F (x) = G(F |` x
) = G(f |` x
). If in addition R is transitive, then f |`x
is an approximation of F . 2) Theorem 1.3.5 is a metatheorem, since it says something about the existence of classes. Given the formulae χ(y, z) and ψ(y, z), defining the classes R and G respectively, we can find a formula ϕ(y, z) defining the class F such that that formula of LZF which results from the formula in Theorem 1.3.5 by the elimination of classes is provable in ZF. For example, under the above premisses, for the formula ∀x ∈ fld(R)(F (x) = G(F |`x
)) (in the extended sense) there is a corresponding formula of ZF: ∀x(∃z(χ(x, z) ∨ χ(z, x)) =⇒ ∃y(ϕ(x, y)∧ ∀f (Func(f ) ∧ dom(f ) = x
∧ ∀z ∈ x
ϕ(z,f (z)) =⇒ (ϕ(x,y) ⇐⇒ ψ(f,y))))), where z ∈ x
is the formula χ(z, x) ∧ z = x and dom(f ) = x
is the formula ∀z(z ∈ dom(f ) ⇐⇒ χ(z, x) ∧ z = x). 3) The proof of Theorem 1.3.5 can be transferred word for word if we formulate Theorem 1.3.5 for functions G whose defining formulae contain parameters. Formally, the above formula ψ(y, z) defining G may contain further free (set) variables in addition to y and z. In this connection we never mention explicitly the parameters. Well known examples are the sum, the product and the exponentiation of ordinals which will be defined in the example after the next corollary. 4) A further important example is the case that we want to define the function F recursively by F (x) = G(x, F |` x
) for all x ∈ fld(R). The proof of Theorem 1.3.5 works for this case if we replace in the definition of the class K the equation f (x) = G(f |`x
) by f (x) = G(x, f |`x
). Corollary 1.3.6 (Transfinite Recursion Principle for ON) a) If G is a class, then we can construct a class F such that ZF G : V −→ V =⇒ Func(F )∧dom(F ) = ON∧∀σ(F (σ) = G(F |`σ)). b) If a, H1 and H2 are classes, then we can construct a class F such that ZF H1 : V −→ V ∧ H2 : V −→ V ∧ ∃y(y = a) =⇒ Func(F ) ∧ dom(F ) = ON ∧ F (0) = a ∧ ∀σ(F (σ + 1) = H1 (F (σ)) ∧ (Lim(σ) =⇒ F (σ) = H2 (F |`σ))). Proof Part a) follows from Theorem 1.3.5, if we take into account that the relation ∈ ∩ (ON × ON) is well-founded and satisfies σ
= {z : z ∈ ON ∧ z ∈ σ} = σ. For the proof of b), we note again that ∈ ∩ (ON × ON) is well-founded and has the field ON. To apply Theorem 1.3.5, we define the function G from V into V by G(0) := a; G(x) := H1 (x(σ)), if x is a function such that dom(x) =
24
Chapter 1. Foundations
σ + 1 for some σ ∈ ON; G(x) := H2 (x), if x is a function whose domain is a limit ordinal; G(x) := 0 in all other cases. Let F be the class given by Theorem 1.3.5. Then we get: F (0) = G(F |` 0) = G(0) = a; F (σ + 1) = G(F |` σ + 1) = H1 (F (σ)), since F |` σ + 1 is a function with domain σ + 1; F (σ) = G(F |` σ) = H2 (F |` σ) for limit ordinals σ, since F |` σ is a function whose domain is the limit ordinal σ. This completes the proof of the corollary. Examples 1.3.7 a) From Corollary 1.3.6 and Theorem 1.3.5 we obtain by an obvious choice of H1 , H2 and of G, respectively, the usual recursion principles for ω, taking f := F |`ω : For each function g : ω −→ ω and each a ∈ ω there exists a unique function f : ω −→ ω satisfying f (0) = a and f (n + 1) = g(f (n)) for all n ∈ ω. For each function g with an appropriate domain, there is a unique function f such that f (n) = g(f |`n) for all n ∈ ω. b) Depending of the parameter α ∈ ON, we will define in Section 1.4 for every β ∈ ON the sum α + β, the product α · β and the exponentiation αβ ; that means that we will apply the principle of transfinite recursion. c) von Neumann’s Hierarchy: For a := ∅ and the functions H1 and H2 , given by H1 (x) := P(x) and H2 (x) := ran(x), where ran(x) := {v : ∃u (u, v) ∈ x}, we consider the function F from Corollary 1.3.6 and put Vα := F (α). Then V0 = ∅; Vα+1 = P(Vα ); Vγ = {Vβ : β < γ} for limit ordinals γ . The sets Vα (α ∈ ON) are called the levels of the von Neumann hierarchy, the function (Vα : α ∈ ON) is called von Neumann’s hierarchy or cumulative hierarchy. We use the principle of ∈-induction to prove that {Vα : α ∈ ON} is the universal class. First, it is easy to see by transfinite induction that every set Vα is transitive and Vα ⊆ Vβ for any α and β with α < β. If x ∈ V is an arbitrary set, and if we assume that y ∈ {Vα : α ∈ ON} for every member y of x, then, for each y ∈ x, there is a least ordinal αy such that y ∈ Vαy +1 . By an axiom of replacement and Lemma 1.2.5, there exists the ordinal α := sup{αy : y ∈ x}. Now we can conclude that x ⊆ Vα , hence x ∈ Vα+1 . This implies V = {Vα : α ∈ ON}.10 10 We
cannot prove this assertion without the axiom of regularity.
1.3. Transfinite Induction and Recursion
25
The least ordinal α with x ∈ Vα+1 is called the rank of the set x, written as rk(x). Sometimes it is practical to use induction on the rank of a set. If y ∈ x ∈ Vα+1 , then y ∈ x ⊆ Vα , and so we get rk(y) < rk(x). Lemma 1.3.8 Let R be a relation. a) The following assertions are equivalent: (i) For every x ∈ fld(R), x
is a set. (ii) For each x ∈ fld(R), there is a set y such that x ∈ y and R−1 [y] ⊆ y. b) R is well-founded iff (1) For every x ∈ fld(R), x
is a set and (2) There is not a family (xn : n ∈ ω) of members of fld(R) satisfying xn+1 Rxn for all n ∈ ω. Proof For the proof of part a), we note first that the implication “(ii) =⇒ (i)” follows from an axiom of subsets, since, for x ∈ y, x
⊆ R−1 [{x}] ⊆ −1 R [y] ⊆ y. Now let us assume (i). Then for every set z the class {
u : u ∈ z∧u ∈ fld(R)} is a set, since it is the range of the restriction of the function F := {(u, u
) : u ∈ V} to the set z ∩ fld(R). Consequently, the class {
u : u ∈ z ∩ fld(R)} ∪ z is also a set, and the class R−1 [z] is a subclass of it. Thus R−1 [z] is a set. Take x ∈ fld(R). Then Corollary 1.3.6 b) tells us that there is a function f : ω −→V satisfyingf (0) = {x} and f (n + 1) = R−1 [f (n)] for every n ∈ ω. Put y := ran(f ) = {f (n) : n ∈ ω}. Then we have x ∈ f (0) ⊆ y. Furthermore, if u ∈ R−1 [y], then there is v ∈ y with uRv. Since v ∈ f (m) for some m ∈ ω, our construction gives u ∈ R−1 [f (m)] = f (m + 1) ⊆ y. Next we turn to the proof that every well-founded relation satisfies properties (1) and (2). For (1), this is clear from part a). If there was a family (xn : n ∈ ω) of members of fld(R) satisfying xn+1 Rxn for all n ∈ ω, then the range {xn : n ∈ ω} of this function would not have a minimal element under R. Conversely let R be a relation satisfying (1) and (2). Then a) implies that the first condition in the definition of a well-founded relation is fulfilled. For the second condition, we need (AC). Assume, to get a contradiction, that there is a nonempty subset X of fld(R) without a minimal element. Let g be a choice function for the set P(X) \ {∅}. By the recursion theorem, there is a function (xn : n ∈ ω) such that x0 ∈ X and xn+1 = g({y ∈ X : yRxn }). It is easy to verify that we have obtained a function whose existence contradicts (2). Definition and Example Let x be an arbitrary set. If there exists a transitive superset of x, then we obtain, taking the intersection of all these sets, an ⊆smallest set with this property. The recursion theorem provides us directly with
26
Chapter 1. Foundations
this set. There is a function f satisfying f (0) = x and f (n + 1) = f (n) for every n ∈ ω. Put y := ran(f ). Thenclearly x ⊆ y. If u ∈ v ∈ y, then v ∈ f (m) for some m ∈ ω, hence u ∈ f (m) = f (m + 1) ⊆ y. Thus y is transitive. Furthermore we can conclude, using complete induction, that y is a subset of every transitive superset of x. It is called the transitive closure of x and is denoted by tc(x). Lemma 1.3.9 If A1 and A2 are transitive classes and π : A1 −→ A2 is an ∈-isomorphism, then A1 = A2 and π = idA1 = {(x, x) : x ∈ A1 }. Proof Consider x ∈ A1 . We will show that π(x) = {π(y) : y ∈ x}. Then we can use transfinite induction on the well-founded relation ∈ ∩ (A1 × A1 ) and obtain immediately π(x) = x from the inductive hypothesis ∀y ∈ x(π(y) = y), which proves the lemma by Theorem 1.3.2. The inclusion “⊇” holds by assumption. For the reverse inclusion let z ∈ π(x). Then z ∈ A2 , since A2 is transitive. Thus z = π(u) for some u ∈ A1 . This gives u ∈ x, and thus z ∈ {π(y) : y ∈ x}, as desired. Definition and Example A relation R is called extensional iff ∀x, y ∈ fld(R)(
x = y =⇒ x = y). We call a class A extensional iff ∀x, y ∈ A(x ∩ A = y ∩ A =⇒ x = y). The relation ∈ is extensional – as stated by the axiom of extensionality. Any transitive class is extensional. Further every linear ordering < is extensional; if we assume x
= y and x = y, then connectivity implies that, without loss of generality, x < y. Then x ∈ y = x
, and thus we have x < x which is a contradiction. Theorem 1.3.10 (Mostowski’s Collapsing Lemma) If the relation R is well-founded and extensional, then there is a unique transitive class A and a unique isomorphism π : fld(R) −→ A with respect to R and ∈. Proof First we will prove uniqueness. If π1 : fld(R) −→ A1 and π2 : fld(R) −→ A2 are isomorphisms satisfying the properties in the theorem, then π2 ◦ π1−1 : A1 −→ A2 is an ∈-isomorphism. From Lemma 1.3.9 we know that A1 = A2 and π2 ◦ π1−1 = idA1 , hence π1 = π2 . The existence of π follows from the recursion theorem, applied to the wellfounded relation R. Let the function G be defined by G(x) := ran(x) := {z : ∃y (y, z) ∈ x}. Then Theorem 1.3.5 yields a function π : fld(R) −→ V such that π(x) = G(π |`x
) = ran(π |`x
) = {π(y) : yRx}. (π is called the collapsing or Mostowski isomorphism for R.) We put A := π[fld(R)] and show that π and A have the desired properties.
1.3. Transfinite Induction and Recursion
27
Claim 1 π is injective. Assume, to get a contradiction, that there are x, y ∈ fld(R) such that x = y and π(x) = π(y). By Lemma 1.3.1, there is an R-minimal element x0 of the class {x ∈ fld(R) : ∃y ∈ fld(R)(π(x) = π(y) ∧ x = y)}. In the same way we get an R-minimal element y0 of {y ∈ fld(R) : π(x0 ) = π(y)∧x0 = y}. Since R is extensional, we have x 0 = y 0 . So consider, without loss of generality, z ∈ x 0 \ y 0 . Then π(z) ∈ π(x0 ). If we suppose that π(z) ∈ π(y0 ), i.e., π(z) = π(u) for some u ∈ y 0 , then the choice of x0 and z ∈ x 0 yield z = u. This gives z ∈ y 0 , a contradiction. Therefore π(z) ∈ π(x0 ) \ π(y0 ), contradicting π(x0 ) = π(y0 ). Claim 2 π is an isomorphism w.r.t. R and ∈. By Claim 1, π is injective, and by the definition of A, π is a surjective function from fld(R) onto A. If yRx, then π(y) ∈ π(x) by the above properties of π. Conversely, if π(y) ∈ π(x), then there exists u such that uRx and π(y) = π(u). Claim 1 shows that y = u, hence yRx. Claim 3 A is transitive. If z ∈ y ∈ A, then y = π(x) for some x ∈ fld(R). Thus z = π(u) for some u with uRx, and consequently z ∈ A. Corollary 1.3.11 a) Any extensional class B is ∈-isomorphic to a transitive class A. b) If (x, ≺) is a well-ordering, then there is a unique ordinal α and a unique isomorphism π : (x, ≺) −→ (α, ∈). c) If B is a proper class, well-ordered by the relation ≺, then B is isomorphic to ON w.r.t. ≺ and ∈. Proof For the proof of part a), we observe first that for B = ∅ we can take A = ∅ and for B = {x} we can take A = {0}. So we can assume that B has at least two members. By the remark at the beginning of this section, the relation R :=∈ ∩ (B × B) is well-founded, by assumption it is extensional, and clearly fld(R) ⊆ B. To show that fld(R) = B, fix x ∈ B and assume, to get a contradiction, that x ∈ fld(R). The class B \ {x} has an ∈-minimal element y. By the assumption on x, the set of ∈-predecessors of y in B is empty, and the same holds for x. Since B is extensional, we get x = y, contradicting y ∈ B \ {x}. So we have shown that B = fld(R), and Theorem 1.3.10 provides us with an isomorphism π from B onto a transitive class. For b), assume without loss of generality that x has at least two elements and choose A and π according to Theorem 1.3.10. Then A is a transitive set. Furthermore it is easy to see that every member of A is transitive. Namely, if u ∈ v ∈ z and z ∈ A, then u ∈ A and v ∈ A, since A is transitive. Since π is an isomorphism and the relation ≺ is transitive, we get u ∈ z. This shows that A is an ordinal.
28
Chapter 1. Foundations
For c), choose again A and π according to Theorem 1.3.10. As in the proof of b) we can conclude that every member of A is transitive. Furthermore, A is a proper class, since otherwise B = π −1 [A] would be a set. Now Corollary 1.2.4 tells us that A = ON. Definition Let (B, ≺) be a well-ordering. The unique isomorphism given by Corollary 1.3.11 is called the order isomorphism of (B, ≺). If B is a set, then we call the ordinal characterized by Corollary 1.3.11 b) the ordinal number or order type of (B, ≺) and write it as otp(B, ≺). Exercises 1) Prove the following induction principles: a) (Finite Induction) If k ∈ ω, then ϕ(0) ∧ ∀n ∈ k(ϕ(n) =⇒ ϕ(n + 1)) =⇒ ∀n ≤ k ϕ(n). b) If ∀m, n ∈ ω(∀k, l ∈ ω((k ∈ m ∨ (k = m ∧ l ∈ n)) =⇒ ϕ(k, l)) =⇒ ϕ(m, n)), then ∀m, n ∈ ω ϕ(m, n). Hint: Define a suitable well-founded relation on ω × ω. 2)
a) Why are the relations ON × {0} and {(α + 1, α) : α < τ }, for any limit ordinal τ , not well-founded?
b) Let α and β be infinite ordinals and the relation ≺ on α×β be defined by (σ1 , σ2 ) ≺ (τ1 , τ2 ) ⇐⇒ σ1 < τ1 ∧ σ2 < τ2 . Is ≺ well-founded? Is it extensional? 3) Give an example of a linear ordering < on a set A and ofa ⊆-chain K of subsets of A which are well-ordered by <, such that K is not well-ordered by <. 4) For α, β ∈ ON let fin(β, α) be the set of all functions f from β into α for which the set {σ < β : f (σ) = 0} is finite. Now we define the generalized Hebrew lexicographic ordering; for f, g ∈ fin(β, α) we put f ≺ g :⇐⇒ f = g ∧ (τ = max{σ ∈ β : f (σ) = g(σ)} =⇒ f (τ ) < g(τ )). Prove that (fin(β, α), ≺) is a well-ordering. Hint: It is easy to verify that ≺ is a linear ordering. To show that every nonempty subset X of fin(β, α) has a smallest element, use induction on β. Choose f ∈ X, f ≡ 0. Consider τ := max{σ < β : f (σ) = 0} and γ := min{g(τ ) : g ≺ f ∧ g ∈ X}.
1.3. Transfinite Induction and Recursion
29
5) Assume that (A, <) is a well-ordering. Prove: a) If f : (A, <) −→ (A, <) is a homomorphism, then a ≤ f (a) for all a ∈ A. b) (A, <) is not isomorphic to any of its proper initial segments. 6) Assume that (A, <) and (B, ≺) are well-orderings. As usual we write (C, <) instead of (C, < ∩ (C × C)) for substructures C of A. For u ∈ A we put Au := {x ∈ A : x < u}, the initial segment of A determined by u. Prove without using Corollary 1.3.11: Either (A, <) is isomorphic to (B, ≺), or there is v ∈ B such that (A, <) is isomorphic to (Bv , ≺), or there is u ∈ A such that (Au , <) is isomorphic to (B, ≺). Hint: Show that F := {(x, y) ∈ A × B : (Ax , <) is isomorphic to (By , ≺)} is an order preserving function or, alternatively, use the recursion theorem. 7) Assume that (Wα : α ∈ ON) is a function such that Wγ = {Wσ : σ < γ} for limit ordinals γ and Wα ⊆ Wα+1 for all α ∈ ON. Prove that Wα ⊆ Wβ whenever α ∈ β ∈ ON. Hint: Use transfinite induction on β. 8) Prove the following properties of the cumulative hierarchy (Vα : α ∈ ON). a) Vα is transitive. b) α < β =⇒ Vα ⊆ Vβ (Use the previous question.) c) Vα ∩ ON = α. d) rk(x) = sup{rk(y) + 1 : y ∈ x}. e) rk(α) = α. Hint: Use transfinite induction on α. 9) Prove: If x, y ∈ Vα , then P(x), x, x × y, x y ∈ Vα+4 . 10) We call a set x hereditarily finite iff its transitive closure is finite. Prove: Vω = {x : x is hereditarily finite}. 11) Prove: If α is a limit ordinal, then there is a set x such that rk(x) = α, x is transitive, and x ∩ ON = {0, 1}. 12) Assume that A, B and C are classes, C ⊆ A, B and C are transitive, and π : A −→ B is an ∈-isomorphism. Prove that π |`C = idC .
30
Chapter 1. Foundations
13) Assume that R is a well-founded relation and fld(R) = P . Prove that there is a function ρR : P −→ ON such that a) xRy =⇒ ρR (x) < ρR (y) for all x, y ∈ P . b) ρR (x) = sup{ρR (y) + 1 : yRx}.
α > ρR (y)}. c) ρR (x) = min{α ∈ ON : ∀y ∈ x The sets Pα := {x ∈ P : ρR (x) = α} are the R-levels of P , ρR (x) is the R-rank of x. Hint: Use the recursion theorem. 14) Prove with the recursion theorem that there is a unique function ρ : V −→ ON such that ρ(x) = sup{ρ(y) + 1 : y ∈ x}. Consequently we have ρ(x) = rk(x) for all sets x. 15) Assume that (A, <) and (B, ≺) are well-orderings. Prove: If g : (A, <) −→ (B, ≺) is a homomorphism, then otp(A, <) ≤ otp(B, ≺).
1.4 Arithmetic of Ordinals Definition Let A be an ordinal or the class ON of ordinals. If F : A −→ V is a function, then we call F a sequence. Notions as upper bound, supremum etc. of a sequence are understood as upper bound, supremum etc. of the range of the sequence. In later chapters we will extend the notion of a sequence to functions whose domain is a club, a stationary set, or a set of regular cardinals. F is called continuous iff for every limit ordinal γ ∈ A we have F (γ) = {F (σ) : σ < γ}; we also say that F is a continuous sequence of sets. Furthermore every function from A into ON that is continuous and strictly increasing under < is called a normal function or normal sequence. More general, a function from an arbitrary set A into ON is called an ordinal function on A. Remark In most applications of the notion of continuity, the domain A of the function is a limit ordinal or the class ON of ordinals. If ran(F ) ⊆ ON, then the continuity of F is equivalent to ∀γ ∈ dom(F ) ∩ Lim (F (γ) = sup{F (σ) : σ < γ}). If the last property is satisfied and if in addition F (α) < F (α + 1) for every α ∈ A, then F already is a normal function. This can be seen as follows: By
1.4. Arithmetic of Ordinals
31
transfinite induction on β ∈ dom(F ) we show α < β =⇒ F (α) < F (β). For β = 0 there is nothing to prove. If β is a limit ordinal, then α < β implies α < σ for some σ < β. The inductive hypothesis and the continuity of F imply F (α) < F (σ) ≤ sup{F (σ) : σ < β} = F (β). Finally, if β = σ + 1, then we get α ≤ σ, F (α) ≤ F (σ) by the inductive hypothesis, and consequently F (α) ≤ F (σ) < F (σ + 1). Further we note that normal functions always map limit ordinals onto limit ordinals. Lemma 1.4.1 Assume that A ∈ ON or A = ON and F : A −→ ON is a strictly increasing function. Then a) F is continuous iff, for every nonempty subset b of A with sup(b) ∈ A, F (sup(b)) = sup{F (α) : α ∈ b} = sup(F [b]). b) α ≤ F (α) for all α ∈ A. Proof For the proof of a) we note that, by the definition of continuity and since sup(γ) = γ for all limit ordinals γ, we only have to show one direction of the equivalence. So let F be a normal function and b be a nonempty subset of A such that sup(b) ∈ A. If b has a maximum, then sup(b) ∈ b, and the desired equation is obvious. Thus let us assume that b has no maximum. Then sup(b) is a limit ordinal, since otherwise its immediate predecessor would be an upper bound of b, too. This gives F (sup(b)) = sup{F (σ) : σ < sup(b)} ≥ sup{F (α) : α ∈ b}. If γ < F (sup(b)), then there is σ < sup(b) such that γ < F (σ). Furthermore there is α ∈ b with σ < α. By assumption, we have F (σ) < F (α) and consequently γ < F (α). Thus every ordinal γ < F (sup(b)) is not an upper bound of the set {F (α) : α ∈ b}, which was still to be shown. For an indirect proof of b), let α ∈ A be minimal with F (α) < α. Then F (α) ∈ A, and therefore F (F (α)) < F (α) since F is strictly increasing. This contradicts the choice of α, and part b) is shown. The normal functions we are now going to define will play an important role in the sequel. They form a proper class of normal functions, since for every ordinal α the function β → α β, where β ∈ ON, is normal, when denotes the addition, multiplication or exponentiation of ordinals. Definition If α is an ordinal, then we define by transfinite recursion on β ∈ ON the ordinal sum α+β, the ordinal product α·β, and the ordinal exponentiation αβ as follows: α + 0 = α; α + (σ + 1) = (α + σ) + 1; Lim(β) =⇒ α + β = sup{α + σ : σ < β}. α · 0 = 0; α · (σ + 1) = (α · σ) + α; Lim(β) =⇒ α · β = sup{α · σ : σ < β}. α0 = 1; ασ+1 = ασ · α; Lim(β) =⇒ αβ = sup{ασ : σ < β}.
32
Chapter 1. Foundations
Remark 1.4.2 a) In the case of addition note remark 3) after Theorem 1.3.5 and choose, for an application of 1.3.5 (we could apply Corollary 1.3.6 as well – and will do this when defining the multiplication of ordinals), G(0) := α; G(x) := S(x(σ)), ifx is a function such that dom(x) = σ + 1 for some σ ∈ ON; G(x) := ran(x), if x is a function whose domain is a limit ordinal; G(x) := 0 in all other cases. Theorem 1.3.5 says that there is a function F : ON −→ V such that F (β) = G(F |` β). Now define α + β := F (β). In the case of multiplication we apply Corollary 1.3.6: a := 0; H1 (x) := x + α, if x is an ordinal, H1 (x) := 0 otherwise; H2 (x) := ran(x). b) From the definition of continuity and Lemma 1.4.3 a) (iii) it follows that the function β → α + β is normal for each α ∈ ON. Lemma 1.4.3 b) (iii) implies the corresponding assertion for the multiplication of ordinals if α > 0, and Lemma 1.4.3 c) (iii) for the exponentiation of ordinals if α > 1. c) By complete induction it can be easily seen that the restrictions to the set ω of the functions defined above yield the usual addition, multiplication and exponentiation of natural numbers. (These operations also could have been obtained by applying a recursion theorem for ω.) The well known properties of these operations are proved using complete induction. d) Intuitively speaking, the sum of ordinals corresponds to that order type which results from putting one well-order behind the other. Corollary 1.3.11 tells us that every well-ordered set is isomorphic to exactly one ordinal bearing the relation ∈. We called this ordinal the order type of the well-ordered set. Now, if (A, <1 ) and (B, <2 ) are well-ordered sets of order type α and β respectively, satisfying A ∩ B = ∅, then we obtain a new well-ordering (A ∪ B, <3 ) as follows: <3 := <1 ∪ <2 ∪ {(a, b) : a ∈ A ∧ b ∈ B} (“first (A, <1 ) and then (B, <2 )”). One can show that this is a wellordering of order type α + β. Analogously, α · β is the order type of that well-ordering ≺ that results from lining up β-times well-orderings (Aσ , <σ ), σ < β, of order type α. More precisely: If ((Aσ , <σ ) : σ < β) is a family of well-orderings of order type α satisfying Aσ ∩ Aτ = ∅ for σ = τ , then we can define a well-ordering ≺ of order type α · β on the set B := {Aσ : σ < β} by a ≺ b :⇐⇒ ∃σ∃τ ((a ∈ Aσ ∧b ∈ Aτ ∧σ < τ ) ∨ (a ∈ Aσ ∧b ∈ Aσ ∧a <σ b)).
1.4. Arithmetic of Ordinals
33
It is simpler to well-order the set α × β by the so-called Hebrew lexicographic ordering: (σ1 , τ1 ) < (σ2 , τ2 ) iff τ1 < τ2 ∨(τ1 = τ2 ∧σ1 < σ2 ). Then (α × β, <) has order type α · β. Shortly speaking, “we take α, β times”. e) The “visual” introduction of addition and multiplication facilitates the understanding of the following special features which immediately follow from the definitions. We have 1 + ω = sup{1 + n : n ∈ ω} = ω. Therefore 1 + ω < ω + 1, the addition of ordinals is not commutative. Further 2 · ω = sup{2 · n : n ∈ ω} = ω, and consequently 2 · ω < ω · 2 = ω + ω, the multiplication of ordinals is also not commutative. In addition, we have shown that (1 + 1) · ω = 1 · ω + 1 · ω – the corresponding distributive law is false. The other distributive law, α · (β + γ) = α · β + α · γ, is true; furthermore the associative laws and certain monotonicity properties hold. We collect all these properties in the following lemma. f) For the sake of completeness, let us mention how to introduce the ordinal exponentiation as an order type of a well-ordered set. For α, β ∈ ON let fin(β, α) be the set of all functions f from β into α for which the set {σ < β : f (σ) = 0} is finite. Now the set fin(β, α) will be well-ordered by a generalized Hebrew lexicographic ordering; for f, g ∈ fin(β, α) we define f ≺ g :⇐⇒ f = g ∧ (τ = max{σ ∈ β : f (σ) = g(σ)} =⇒ f (τ ) < g(τ )). One can show that (fin(β, α), ≺) is a well-ordering of order type αβ . The key for the proof is Theorem 1.4.6. Lemma 1.4.3 If α, β and γ are ordinals, then the following laws hold. a)
b)
c)
(i) 0 + α = α = α + 0 (iii) β < γ =⇒ α + β < α + γ (v) (α + β) + γ = α + (β + γ) (i) 0 · α = 0 = α · 0 (iii) 0 < α ∧ β < γ =⇒ α · β < α · γ (v) (α · β) · γ = α · (β · γ) (i) β = 0 =⇒ 0β = 0 (iii) 1 < α ∧ β < γ =⇒ αβ < αγ (v) 1 < α =⇒ β ≤ αβ (vii) (αβ )γ = αβ·γ
(ii) (iv)
β ≤α+β α ≤ β =⇒ α + γ ≤ β + γ
(ii) (iv) (vi) (ii) (iv) (vi)
α·1=α=1·α α ≤ β =⇒ α · γ ≤ β · γ α · (β + γ) = α · β + α · γ 1β = 1 α ≤ β =⇒ αγ ≤ β γ αβ+γ = αβ · αγ
Proof The assertions are verified by transfinite induction on the “argument on the right”, and their proofs are thought of as exercises for the reader. We indicate some proofs and present all ideas which are necessary for the other ones. For a) (iii), note that there is nothing to prove if γ = 0. If γ = σ + 1 and β < γ, then β ≤ σ, and the inductive hypothesis and the definition of the sum
34
Chapter 1. Foundations
of ordinals give α + β ≤ α + σ < (α + σ) + 1 = α + (σ + 1) = α + γ. Finally, if γ is a limit ordinal, then γ = sup(γ), and β < γ means β < σ for some σ < γ. By the inductive hypothesis and by definition, we get α + β < α + σ ≤ sup{α + σ : σ < γ} = α + γ. For a) (v): If γ = 0, then (α + β) + 0 = α + β = α + (β + 0). Furthermore, from the inductive hypothesis and the definition of ordinal addition we can conclude that (α + β) + (σ + 1) = ((α + β) + σ) + 1 = (α + (β + σ)) + 1 = α + ((β + σ) + 1) = α + (β + (σ + 1)). For limit ordinals γ we obtain (α + β) + γ = sup{(α + β) + σ : σ < γ} = sup{α + (β + σ) : σ < γ}. Now we apply Lemma 1.4.1 to the normal function Fα : ON −→ ON, given by Fα (τ ) := α + τ , and to the set b := {β + σ : σ < γ}. Since sup(b) = β +γ, it tells us that α+(β +γ) = Fα (sup(b)) = sup{α+(β +σ) : σ < γ}. This completes the proof. Completely analogously, the associative law of multiplication is shown, and in a similar way one obtains the distributive law. For c) (vii): If α = 0, then the assertion follows from the proceding ones by considering the cases γ = 0; β = 0, γ = 0; β = 0, γ = 0. Now let α = 0. We prove (vii) using transfinite induction on γ. If γ = 0, then αβ·0 = α0 = 1 = (αβ )0 . If γ = σ + 1, then we can conclude from b) (vi), c) (vi), the inductive hypothesis and the definition of exponentiation that αβ·(σ+1) = αβ·σ+β = αβ·σ · αβ = (αβ )σ · αβ = (αβ )σ+1 = (αβ )γ . Finally, if γ is a limit ordinal, then again we apply Lemma 1.4.1 to the continuous function Gα , defined by Gα (τ ) := ατ , and obtain with the inductive hypothesis: αβ·γ = αsup{β·σ:σ<γ} = sup{αβ·σ : σ < γ} = sup{(αβ )σ : σ < γ} = (αβ )γ . Lemma 1.4.4 Let α and β be ordinals. a) (Substraction Lemma) If α ≤ β, then there is a unique ordinal γ such that α + γ = β. b) (Division Lemma) If β = 0, then there are unique ordinals ξ and η satisfying α = β · ξ + η and η < β. c) (Logarithm Lemma) If α = 0 and β > 1, then there are unique ordinals σ, τ and γ (the logarithm, the coefficient and the remainder) such that α = βσ · τ + γ ∧ 1 ≤ τ < β ∧ γ < βσ .
1.4. Arithmetic of Ordinals
35
Proof For part a) we note, that the uniqueness of γ is obvious if one uses the monotonicity properties of ordinal addition in Lemma 1.4.3. Next we prove existence. Since β ≤ α + β, there is a least ordinal γ with β ≤ α + γ. If equality holds, we are done. Otherwise we have γ = 0. Furthermore γ cannot be a limit ordinal, because β < α + γ yields, by the definition of ordinal addition, for limit ordinals γ the existence of an ordinal σ such that σ < γ and β < α + σ, contradicting the choice of γ. Thus we obtain γ = η + 1 for some η and, again by the choice of γ, α + η < β < α + η + 1, which contradicts Lemma 1.2.6 b). For the proof of part b), we state first that the uniqueness of ξ and η follows again from a) and Lemma 1.4.3. Now we prove existence. Lemma 1.4.3 tells us that α ≤ β · α, and so there is a least ordinal γ such that α ≤ β · γ. If equality holds, we are done taking ξ := γ and η := 0. Suppose that α < β · γ. Then we get in complete analogy to the proof of a), that γ is a successor ordinal ξ + 1. Hence β · ξ < α < β · (ξ + 1) = β · ξ + β. From a) follows the existence of a unique ordinal η satisfying β · ξ + η = α. Since α = β · ξ + η < β · ξ + β, Lemma 1.4.3 a) gives η < β. Finally, we turn to the proof of c). Having studied the previous proofs, the reader will be familiar with the following arguments. To prove existence, we note first that α ≤ β α by Lemma 1.4.3 c). So there is a least ordinal δ with α ≤ β δ . If equality holds, put σ := δ, τ := 1, and γ := 0. In the other case the continuity of exponentiation and the choice of δ ensure again that δ cannot be a limit ordinal. Thus δ = σ + 1 for some σ ∈ ON. Now we have β σ < α, and by part b) there are unique ordinals τ and γ satisfying α = β σ · τ + γ and γ < β σ . Since α < β δ = β σ+1 = β σ · β, Lemma 1.4.3 b) tells us that 1 ≤ τ < β. Uniqueness can be proved again with Lemma 1.4.3; this is left to the reader. Corollary 1.4.5 Let α and β be ordinals. a) α is a limit ordinal iff there is an ordinal ξ = 0 with α = ω · ξ. b) The operation α → ω · (1 + α) defines the unique ∈-isomorphism from ON onto the class of limit ordinals. c) If α is a limit ordinal and 1 ≤ n < ω, then n · α = α. d) If n < ω and ω ≤ α, then n + α = α. e) α · β is a successor ordinal iff α and β are both successor ordinals. Proof First we prove a). By Lemma 1.4.4 we get, for α and ω, unique ordinals ξ and η such that η < ω and α = ω · ξ + η. If α is a limit ordinal, then η = 0 and ξ = 0. Conversely, if η = 0 and ξ = 0 then, by Remark 1.4.2 b), α = ω · ξ is a limit ordinal if this holds for ξ, and also in the case ξ = σ + 1, because ω is a limit ordinal and then α = ω · σ + ω. For b), let the equation G(α) := ω · (1 + α) define the function G. By part a), G(α) is a limit ordinal, and Lemma 1.4.3 says that G is strictly monotonic.
36
Chapter 1. Foundations
If α is a limit ordinal and σ < α, then we get with d) 1 + σ ≤ σ + 1 < α and 1 + α = α. Therefore G(α) = ω · α = sup{ω · σ : σ < α} = sup{ω · (1 + σ) : σ < α} = sup{G(σ) : σ < α}, and thus G is continuous. Finally, G is surjective. Consider a fixed limit ordinal τ . By a), we can represent τ as τ = ω·α for some α = 0. If α ≥ ω, then G(α) = τ , since 1 + α = α. On the other hand, if α = σ + 1 is finite, then G(σ) = τ . For c), the assumption and part a) give α = ω · ξ for some ξ = 0. Further, by the definition of ordinal multiplication, n · ω = sup{n · m : m < ω} = ω, since n > 0. The associative law gives n · α = n · (ω · ξ) = ω · ξ = α. Part d) can be proved analogously to c), using Lemma 1.4.4 a). Since α ≥ ω, there is an ordinal β with α = ω + β. For the proof of e), let first α and β be successor ordinals. Then, by the definition of ordinal multiplication, α · β is a successor ordinal. Now let conversely α · β be a successor ordinal γ + 1. Then Lemma 1.4.3 says that both α and β are nonzero. By Lemma 1.4.4, we obtain a unique representation γ = α · ξ + η with η < α. Hence γ + 1 = α · ξ + η + 1 = α · β. The assertion η + 1 < α would contradict the uniqueness property in Lemma 1.4.4 b). Thus η + 1 = α and γ + 1 = α · ξ + α = α · (ξ + 1) = α · β. For the same reasons we get β = ξ + 1, as desired. Theorem 1.4.6 (Cantor Normal Form for the base β) Assume that α and β are ordinals with α = 0 and β > 1. Then there are unique ordinals σ1 , . . . , σn and τ1 , . . . , τn such that α = β σ1 · τ1 + . . . + β σn · τn , σ1 > . . . > σn and 1 ≤ τi < β for i = 1, . . . , n. In particular, for β = ω, there are unique ordinals α1 , . . . , αn satisfying α = ω α1 + . . . + ω αn
and α1 ≥ . . . ≥ αn .
Proof We use transfinite induction on α ∈ ON. Most work has already been done in Lemma 1.4.4 c). This lemma provides us, for α = 0 and β > 1, with unique ordinals σ1 , τ1 and γ such that 1 ≤ τ1 < β, γ < β σ1 and α = β σ1 ·τ1 +γ. Since γ < α, we can represent γ, if γ = 0, by the inductive hypothesis in the desired form with ordinals τ2 , . . . , τn , satisfying 1 ≤ τi < β for i = 1, . . . , n and σ2 > . . . > σn . Now we have β σ2 ≤ γ < β σ1 , from which we can conclude together with Lemma 1.4.3 that σ1 > σ2 . If β = ω, then all ordinals τi are natural numbers, and ωσi ·τi is the τi -fold sum of ω σi . From this, we get the second assertion of the theorem. We have learnt that the operations for ordinals extend the usual operations on ω but satisfy no longer all of its rules. The representation of an ordinal
1.4. Arithmetic of Ordinals
37
in Theorem 1.4.6 permits the definition of a so-called natural sum, satisfying the most important laws of finite arithmetic. Definition The representation of an ordinal α = 0, given by the first part of Theorem 1.4.6, is called the Cantor normal form of α for the base β or the Cantor normal form of α for the base ω, if β = ω. The Cantor normal form of 0 is ω0 · 0. Now assume that α = 0 and β are represented in Cantor normal form for the base ω. If we add powers ω σ of ω, occurring only in one representation, to the other one as the summand ωσ · 0, then we can assume without loss of n σi · ni and β = generality that α and β are uniquely given as α = i=1 ω n σi ω · m such that σ > . . . > σ , 0 ≤ n < ω, 0 ≤ m i 1 n i i < ω, and i=1 mi + ni = 0 for i = 1, . . . , n. Then we can define the natural sum α#β of the ordinals α and β by n
ω σi · (mi + ni ). α#β := i=1
We call an ordinal γ a principal number of addition iff γ = 0 and, for all α < γ, α + γ = γ. γ is called additively decomposable iff there are ordinals α < γ and β < γ such that α + β = γ; otherwise we say that γ is additively indecomposable. Remark The natural sum of ordinals satisfies the associative law and the commutative law. Later on we will need the fact that the equation α#β = γ has, for a fixed ordinal γ, only finitely many solutions (α, β). This is true, since there are only finitely many nonzero coefficients in the Cantor normal form of γ and, for every natural number l, the equation x+y = l has only finitely many solutions (x, y) ∈ ω × ω. In complete analogy to the notion of a principal number of addition one can define principal numbers of multiplication and of exponentiation. It turns σ out that {2}∪{ω(ω ) : σ ∈ ON} is the set of principal numbers of multiplication (see Exercise 1.4.7) and {ω}∪{α ∈ ON : ω α = α} is the set of principal numbers of exponentiation (see Exercise 1.4.8). Clearly 1 is the only principal number of addition less than ω, and Corollary 1.4.5 d) says that ω is the least principal number of addition greater than 1. The next lemma characterizes the principal numbers of addition. Lemma 1.4.7 a) An ordinal γ = 0 is a principal number of addition iff it is additively indecomposable. b) The principal numbers of addition are exactly the ordinals of the form ω α , where α ∈ ON.
38
Chapter 1. Foundations c) (ω α : α ∈ ON) is the unique ∈-isomorphism from ON onto the class of principal numbers of addition.
Proof For a), let γ be a principal number of addition, and let α and β be less than γ. Then, by Lemma 1.4.3, α + β < α + γ = γ, and γ is additively indecomposable. Conversely, if this is the case for a fixed γ = 0, then take α < γ and choose, according to Lemma 1.4.4, an ordinal β ≤ γ with α + β = γ. Then by definition β = γ, and γ is a principal number of addition. For the proof of b), let α ∈ ON. Clearly, ω α = 0. If 0 < β < ω α and β1 ω +. . .+ω βn is the Cantor normal form of β for the base ω, then Lemma 1.4.3 tells us that βi < α for i = 1, . . . , n. If we can show that σ < τ implies ωσ + ω τ = ω τ , then we obtain β + ωα = ω α , and ω α is a principal number of addition. So assume that σ < τ . By Lemma 1.4.4 a), there is an ordinal γ = 0 with τ = σ + γ. Then ω γ ≥ ω, and Corollary 1.4.5 d) says that 1 + ωγ = ω γ . By Lemma 1.4.3, we get ω σ + ω τ = ω σ + ω σ+γ = ω σ + ω σ · ω γ = ωσ · (1 + ω γ ) = ω σ · ωγ = ωτ . To prove the converse, let, for any α, γ = 0 be not of the form ω α . Then in the Cantor normal form ω γ1 + . . . + ω γn of γ occur at least two summands, so we have ω γ1 < γ, and the uniqueness assertion of Theorem 1.4.6 implies that ω γ1 + γ = γ. Thus γ is not a principal number of addition. Part c) is easy to show, since α → ω α defines, by Lemma 1.4.3, a normal function, which is surjective by part b). Exercises 1) If τ is a limit ordinal and (αξ : ξ < τ ) is a strictly increasing sequence of ordinals, then sup{αξ : ξ < τ } is a limit ordinal. 2) If τ is a principal number of addition, (η(ξ) : ξ < τ ) is a normal sequence of ordinals, and σ < τ , then η(ξ) + σ ≤ η(ξ + σ) for all ξ < τ . 3) Use Lemma 1.4.4 to show that the relations <3 on α × {0} ∪ α × {1} and the Hebrew lexicographic ordering on α × β from Remark 1.4.2 d) are well-orderings of order type α + β and α · β, respectively. 4) Prove: If σ1 > . . . > σn and, for all i ∈ {1, . . . , n}, 1 ≤ τi < α, then ασ1 · τ1 + . . . + ασn · τn < ασ1 +1 . 5) Consider the relation defined in Remark 1.4.2 f). It is a well-ordering by Exercise 1.3.4. Use the Cantor normal form theorem to show that this well-ordering has order type αβ .
1.4. Arithmetic of Ordinals
39
Hint: If f ∈ fin(β, α), {σ ∈ β : f (σ) = 0} = {σ1 , . . . , σn } and σ1 > . . . > σn , let Φ(f ) := ασ1 · f (σ1 ) + ασ2 · f (σ2 ) + . . . + ασn f (σn ). Then we know from a previous question that Φ(f ) < ασ1 +1 , hence Φ(f ) ∈ αβ . Prove that Φ is strictly increasing and a function onto αβ . 6) Let ≺ be the canonical well-ordering of ON × ON, defined in Section 1.5, and let ot(α) be the order type of (α × α, ≺). Prove: a) b) c) d) e)
{(σ, τ ) : (σ, τ ) ≺ (0, β)} = β × β. ot(α + 1) = ot(α) + α + α + 1. ot(ω) = ω and ot(ω · 2) = ω · ω. ot(α) ≤ ω α . If α = ω α , then ot(α) = α.
Hint: If A is a set, (A, <) is a well-ordering, and Au = {x ∈ A : x < u} is the initial segment of (A, <) determined by u, then otp(A, <) = sup{otp(Au , <) + 1 : u ∈ A}. 7) An ordinal α is called a principal number of multiplication iff α > 1 and β · α = α for all β with 1 ≤ β < α. Prove: a) 2 and ω are principal numbers of multiplication. If 2 < n < ω, then n is not a principal number of multiplication. τ b) If τ = 0, then ωω is a principal number of multiplication. Hint: Use the Cantor normal form theorem for the base ω and a previous exercise. c) If γ is nonzero and not a principal number of addition, then ωγ is not a principal number of multiplication. d) If α1 = 0, n > 1, and α = ω α1 + · · · + ω αn with α1 ≥ . . . ≥ αn , then α is not a principal number of multiplication. τ e) {α : α is a principal number of multiplication} = {2} ∪ {ω ω : τ ∈ ON}. τ Hint: If α = 2 and α = ω ω for all τ , represent α as α = ω α1 + . . . + ω αn with α1 ≥ α2 ≥ . . . ≥ αn . 8) ε is called a principal number of exponentiation iff ε > 2 and αε = ε for all α with 2 ≤ α < ε. Prove: a) If 2γ = γ, then γ is a principal number of exponentiation. Hint: Prove successively that γ is a limit ordinal, a principal number of addition (using γ = ω · ξ for some ξ > 0), and a principal number of multiplication.
40
Chapter 1. Foundations b) {ω} ∪ {α : ω α = α} is the class of principal numbers of exponentiation. c) If f : ω −→ ON is given by f (0) = α and f (n + 1) = ω f (n) , then γ := sup{f (n) : n ∈ ω} has the property ω γ = γ. So the class of principal numbers of exponentiation is unbounded in ON. For α = 0 we obtain the smallest principal number of exponentiation which is greater than ω.
1.5 Cardinal Numbers and their Elementary Properties Theorem 1.5.1 The following statements are equivalent (in ZF). (i) Axiom of choice. (ii) Well-ordering Principle: For every set x, there exists a relation ≺ on x such that (x, ≺) is a well-ordering. (Shortly speaking: Every set can be well-ordered.) (iii) Zorn’s Lemma11 : If H is a set and ≤ is a partial ordering on H such that every subset of H linearly ordered by ≤, i.e., every chain in H, has a ≤-upper bound in H, then H possesses a ≤-maximal element. Proof For the proof of “(ii)=⇒(i)”, assume that x is a set of nonempty sets and ≺ is a well-ordering on x, and let the function f be defined by f := {(y, z) : y ∈ x and z is the ≺ -smallest element of y}. Then obviously f is a choice function for x. Next we prove “(i)=⇒(iii)”. By transfinite recursion, we define a function corresponding to the following “visual” proof. Take a0 ∈ H. If a0 is maximal with respect to ≤, then we are ready. Otherwise, there is a member y of H such that a0 ≤ y and a0 = y – choose a1 to be such a member. If we have chosen an ∈ H for each n ∈ ω without finding a maximal element, then our assumption tells us that the chain {an : n ∈ ω} has an upper bound in H. Take one of these upper bounds and call it aω . In this manner we go on and obtain an ascending chain of members of H. The process must stop at some ordinal yielding a ≤maximal element of H, since otherwise, and this is the crucial point of the construction, we would get an injection of ON into H, contradicting the fact that H is a set. Let us make these ideas precise. Take f as a choice function for P(H) \ {∅}, and let for each x ⊆ H the set s(x) be defined as the set of 11 This is only a lemma in the axiom system ZFC. Mostly it is used as an axiom. For historical and habituary reasons, we will keep this name.
1.5. Cardinal Numbers and their Elementary Properties
41
upper bounds of x with respect to ≤ which are not a member of x. Further take b ∈ H, which is possible since H = V . The transfinite recursion theorem provides us with a function F : ON −→ V such that for all σ ∈ ON we have, putting F (σ) =: aσ : f (s({aτ : τ < σ})) if s({aτ : τ < σ}) = ∅, aσ = b otherwise. It is easy to see that F |` {σ : aσ = b} is an injective function. Thus there is smallest σ0 with aσ0 = b, since, assuming the contrary, we would get F [ON] ⊆ H. Consequently, by the axiom of comprehension, F [ON] would be a set, and the axiom of replacement would imply that this would also hold for F −1 [F [ON]] = ON. This would contradict Corollary 1.2.2. The assumptions of Zorn’s lemma give that σ0 is not a limit ordinal. So let σ0 = τ0 + 1. Since s({aτ : τ < σ0 }) = ∅, aτ0 is a ≤-maximal element of H, as desired. Finally, for the proof of “(iii)=⇒(ii)”, let x be a set. Note that x is wellorderable iff there is a bijection from an ordinal onto x: If this is the case, then each such bijection induces a well-ordering on x by the well-ordering ∈ on this ordinal; the reverse implication follows from Corollary 1.3.11. This motivates the definition of H := {f : ∃σ(f : σ −→ x and f is one-to-one)}. We take the inclusion ⊆ as the partial ordering ≤ on H. If H satisfies the assumptions of Zorn’s Lemma and g is a maximal element of H, say g : α −→ y, then y = x. Otherwise we could choose z ∈ x \ y and define h := g ∪ {(α, z)}. Then h would be a one-to-one function from α + 1 into x, hence h ∈ H, and a proper extension of g, contradicting the fact that g is maximal. Let us check therefore whether H satisfies the assumptions of (iii). First we have H = ∅, since the empty function ∅ is a member of H. If f0 is any union of a chain K of members of H, then f0 is a function and one-to-one, since K is a chain. The domain of f0 is {dom(g) : g ∈ K}, hence is an ordinal by Lemma 1.2.5, being the union of a set of ordinals. Finally we state that ran(f0 ) ⊆ x, and thus f0 ∈ H. It remains to be shown that H is a set (for proper classes H, Zorn’s Lemma generally fails – take (H, ≤) := (ON, ⊆)). Each f ∈ H induces a well-ordering Rf = {(a, b) : a, b ∈ ran(f ) ∧ f −1 (a) < f −1 (b)} of the subset ran(f ) of x. For each well-ordering (ran(f ), Rf ) there exists, by Corollary 1.3.11, a unique ordinal τf and a unique isomorphism, namely f , from (τf , ∈) onto the given well-ordering. Thus the function F := {(f, (ran(f ), Rf )) :
42
Chapter 1. Foundations
f ∈ H} is one-to-one. Its range is a set as a subset of the set P(x) × P(x × x). Now the axiom of replacement, applied to the function F −1 , tells us that H is a set. Remark There are a lot of assertions that are equivalent in ZF to the axiom of choice. Furthermore there are extensive investigations on weaker versions of this axiom and how they implicate one another. The reader is referred to the literature, especially to Th. Jech, The Axiom of Choice, [Je1], and to H. Rubin and J. E. Rubin, Equivalents of the Axiom of Choice, II, [RR]. We give examples for some further equivalent assertions; other examples can be found in the exercises. (iv) (Cardinal Comparability) ∀x∀y∃f (f : x −→ y is injective ∨f : y −→ x is injective). (v) ∀x∀y(x = ∅ ∧ y = ∅ =⇒ ∃f (f : x −→ y is surjective ∨f : y −→ x is surjective)). (vi) ∀x(¬∃n ∈ ω(|x| = |n|) =⇒ |x × x| = |x|), where |a| = |b| means: There is a bijection from a onto b. (vii) Zorn’s lemma restricted to sets partially ordered by the relation ⊆. (viii) Every vector space has a basis. Definition A cardinal number or cardinal is an ordinal that cannot be mapped one-to-one onto a smaller ordinal. If x is a set, then from (AC), Theorem 1.5.1, and Corollary 1.3.11 we obtain an ordinal that can be mapped one-to-one onto x, since x can be wellordered. The smallest ordinal with this property is called the cardinality or cardinal number of x, written as |x|. Any bijection from |x| onto x is called an enumeration of x. Remark The cardinality of any set is obviously a cardinal number. Furthermore we have, by definition, |α| ≤ α, and for cardinal numbers α holds |α| = α. If α and β are cardinal numbers, and if there is a bijection from α onto β, then α = β. If the cardinal numbers |x| and |y| exist in ZF, then it is easy to obtain the following equivalences. They can be used to formulate in ZF many statements on cardinalities of sets which are of importance for the working mathematician and can be applied without explicitly defining the object |x|. Any two sets with the property in a) are called equinumerous. a) |x| = |y| ⇐⇒ ∃f (f : x −→ y ∧ f is bijective). b) |x| ≤ |y| ⇐⇒ ∃f (f : x −→ y ∧ f is one-to-one). Lemma 1.5.2 (ZF) If z is a set and h : (P(z), ⊆) −→ (P(z), ⊆) is a homomorphism, then h has a fixed point (i.e., there is w ⊆ z such that h(w) = w).
1.5. Cardinal Numbers and their Elementary Properties
43
Proof Put y := {u ∈ P(z) : u ⊆ h(u)} and w := y. By the definition of y, and since h is a homomorphism, we have y ⊆ {h(u) : u ∈ y} ⊆ h(w). So we get w ⊆ h(w) and thus h(w) ⊆ h(h(w)), which gives h(w) ∈ y. But this implies h(w) ⊆ w, and w is the desired fixed point. Theorem 1.5.3 (Cantor-Schr¨oder-Bernstein) (ZF) If there are injective functions f : x −→ y and g : y −→ x, then there exists a bijection from x onto y. Proof Let the function h∗ : P(x) −→ P(x) be defined by h∗ (u) := x \ g[y \ f [u]]. From u ⊆ v we get h∗ (u) ⊆ h∗ (v). Thus Lemma 1.5.2 says that there is a subset w of x such that w = x \ g[y \ f [w]]. Now the desired bijection h : x −→ y is given by h(z) := f (z), if z ∈ w, and h(z) := g−1 (z), if z ∈ w. The easy verification is left to the reader. Corollary 1.5.4 a) |x| = |y| ⇐⇒ ∃f (f : x −→ y ∧ f is bijective). b) |x| ≤ |y| ⇐⇒ ∃f (f : x −→ y ∧ f is one-to-one). c) x = ∅ =⇒ (|x| ≤ |y| ⇐⇒ ∃f (f : y −→ x ∧ f is onto x)). Lemma 1.5.5 If K is a set of cardinal numbers, then sup(K) (= cardinal number.
K) is a
Proof First we note that K is aset of ordinal numbers. Thus sup(K) isan ordinal, we have sup(K) = K by Lemma1.2.5, and furthermore and | K| is an upper bound of K, then K = sup(K) ≤ | K| | K| ≤ K. If and K isa cardinal, since K ∈ K. = | K|. To show that property, let κ Then κ ⊆ K, and κ = |κ| ≤ | K| follows from Corollary 1.5.4. Thus | K| is an upper bound of K. Lemma 1.5.6 a) (Cantor) If x is a set, then |x| < |P(x)| and |P(x)| = |x 2|. b) (Hartogs’ Theorem)(ZF) If κ is a cardinal number, then there is a cardinal number greater than κ.12 Proof For the proof of a), we note first that {(z, {z}) : z ∈ x} is an injection from x into P(x). We will show that there is no surjection from x onto P(x) and assume, to get a contradiction, that f is such a surjection. Let y := {z ∈ x : z ∈ f (z)}. By assumption, there is u ∈ x such that f (u) = y. Now 12 The smallest cardinal number with this property, constructed in the proof, is called the Hartogs number of κ.
44
Chapter 1. Foundations
we can argue closely to Russell’s antinomy and conclude that u ∈ f (u) ⇐⇒ u ∈ f (u). This contradiction, together with the previous remark, proves |x| < |P(x)|. For the proof of the second assertion we map each subset v of x onto its so-called characteristic function from x into {0, 1}, which has the value 1 at the argument z ∈ x iff z ∈ v. This yields a bijection from P(x) onto x 2. Next we turn to the proof of part b). In ZFC, the power set of each set can be well-ordered. Therefore b) follows at once from a). Since we have carried out the main steps for a proof of this assertion in ZF already in the proof of Theorem 1.5.1, we give Hartogs’ proof of this assertion in ZF. Let A := {α : ∃f (f : α −→ κ ∧ f is one-to-one)}. When proving the well-ordering theorem with the help of Zorn’s lemma, we showed in ZF that the class B := {f : ∃α(f : α −→ x and f is one-to-one)} is a set for each set x. Since, for x = κ, A = {dom(f ) : f ∈ B}, we obtain with an axiom of replacement that A is also a set. Thus there is a smallest ordinal λ such that λ ∈ A. It is easy to show that κ ∈ A and ∀β∀γ(β ∈ A ∧ γ < β =⇒ γ ∈ A). If we could map λ one-to-one onto a smaller ordinal β, then we would get λ ∈ A, since β ∈ A. This contradiction shows that λ is a cardinal greater than κ, as desired. Furthermore, it is the smallest cardinal greater than κ. Corollary 1.5.7 The class CN of cardinal numbers is a proper class. The same holds for CN \ ω, the class of infinite cardinal numbers. Proof Assume that CN is a set y. Then, by Lemma 1.5.5, κ := sup(y) ∈ CN. From Lemma 1.5.6 we obtain a cardinal λ > κ. Together with λ ∈ y, this yields the contradiction λ < λ. Definition Let CN := {κ ∈ ON : κ is a cardinal } be the class of cardinal numbers. By complete induction it is easy to see that every natural number is a cardinal number. The members of ω are called finite cardinal numbers. Thus we call a cardinal number κ infinite or transfinite iff κ ≥ ω. Note that ω is the smallest infinite cardinal. We write ICN for the class of infinite cardinal numbers. Lemma 1.5.6 says that for each cardinal κ there is a smallest cardinal greater than κ. We denote it by κ+ and call it the cardinal successor or successor of κ. Every infinite cardinal of the form κ+ is called a successor cardinal. These cardinal numbers are exactly the values ℵα+1 of the aleph function (see below) at arguments that are successor ordinals. Any infinite cardinal number which is uncountable and not a successor cardinal is called a limit cardinal. A set x is called finite if there is a natural number n and a bijection from n onto x. Otherwise we call x infinite. Pfin (x) denotes the set of finite subsets of the set x. We say that x is denumerable or countably infinite iff there is a bijection from ω onto x. x is called countable iff it is finite or countably infinite.
1.5. Cardinal Numbers and their Elementary Properties
45
By Corollary 1.5.7 and Corollary 1.3.11, there is exactly one ∈-isomorphism from ON onto the class ICN of infinite cardinal numbers. Usually, it is denoted by ℵ and called the aleph function. Instead of ℵ(α) we write ℵα . Especially, ℵ0 , that means ω, is the smallest infinite cardinal, and ℵ1 , that means (ℵ0 )+ , is the smallest uncountable cardinal (ordinal). Often in the literature, part c) of the following lemma is taken as a recursive definition (in ZF – see above) of the aleph function. For each α ∈ ON, the members of the set ℵα+1 \ℵα are exactly the ordinal numbers, and hereby the representatives of well-ordered sets, of cardinality ℵα . The smallest element of this set, ℵα , often is called an initial ordinal. If we want to emphasize this order-theoretical character of ℵα , and also for historical reasons, we use the denotation ωα instead of ℵα .13 If μ is an infinite cardinal, μ = ℵα , and β is an ordinal, then let the cardinal μ+β be defined by μ+β := ℵα+β . In analogy to intervals of ordinals we define, for any cardinals κ and μ such that κ ≤ μ, the interval (κ, μ)CN := (κ, μ)ON ∩ CN of cardinals. The intervals (κ, μ]CN , [κ, μ)CN , and [κ, μ]CN are defined in the same way. Lemma 1.5.8 a) If κ is an infinite cardinal, then there is an ordinal α with κ = ℵα . b) If α < β, then ℵα < ℵβ . c) ℵ0 = ω, ℵα+1 = ℵ+ α and ℵγ = sup{ℵα : α < γ} for limit ordinals γ. Proof Part a) is true by the definition of the aleph function. b) and c) follow from the fact that ℵ : ON −→ ICN is an ∈-isomorphism. Definition (Sum, product and exponentiation of cardinal numbers) If κ and λ are cardinal numbers, then the sets κ × {0} ∪ λ × {1} and κ × λ can be well-ordered (for example by the relation ≺ defined in Theorem 1.5.11). We call the cardinal numbers κ + λ := |κ × {0} ∪ λ × {1}| and κ · λ := |κ × λ| the (cardinal) sum and the (cardinal) product of the cardinal numbers κ and λ (not to be confused with the sum and product of ordinal numbers). Furthermore x y = {f : f : x −→ y} is a set, if x and y are sets. We define κλ := |λ κ| as the exponentiation or power of the cardinal numbers κ and λ. This definition makes sense in ZFC. 13 A
typical example is the denotation ℵωα instead of ℵℵα .
46
Chapter 1. Foundations
By Lemma 1.5.6, we have κ < 2κ for every cardinal κ, hence κ+ ≤ 2κ . The continuum hypothesis is the assertion 2ℵ0 = ℵ1 , the generalized continuum hypothesis, abbreviated by (GCH), is the assertion 2ℵα = ℵα+1 for all α ∈ ON. Remark Usually, one introduces the real numbers as follows: First the set Z of integers is constructed from the set ω of natural numbers, then the set Q of rational numbers, the set of all fractions of integers, is constructed from Z. A Dedekind cut in Q is an ordered pair (A, B) of nonempty subsets of Q satisfying A ∪ B = Q, ∀a ∈ A ∀b ∈ B(a < b) and inf(B) ∈ B, if the infimum exists. Then we can define the set R of real numbers, the so-called continuum, as the set of all Dedekind cuts in Q. Clearly we have |R| ≤ |P(Q)| = 2|Q| = 2ℵ0 by Lemma 1.5.6. If we can specify a subset of R of cardinality 2ℵ0 , then it is shown that |R| = 2ℵ0 . ω We get an injection from into R, if we assign to each sequence f ∈ ω 2 ∞ the set 2−n−1 ∈ [0, 1] := {x ∈ R : 0 ≤ x ≤ 1}. the ternary fraction n=0 2f (n)3 Thus the continuum hypothesis can be reformulated equivalently as ¬∃X ⊆ R(ω < |X| < |R|). Lemma 1.5.9 a) If x and y are sets with |x| = κ and |y| = λ, then κ+λ = |x×{0}∪y×{1}|, κ · λ = |x × y|, and κλ = |y x|. b) For natural numbers, the cardinal sum, product and exponentiation coincide with the corresponding ordinal operations defined in Section 1.4. c) If is the addition, multiplication, or exponentiation of ordinals, and if α and β are nonzero ordinals, one of them being infinite, then |α β| ≤ max{|α|, |β|}. In particular, every infinite cardinal number κ is a principal number of addition, i.e., we have α + κ = κ for all α < κ. Proof In a), we immediately obtain the desired bijections with the help of the given bijections from x onto κ and from y onto λ. Part b) is proved by complete induction, and the first assertion in part c) by transfinite induction according to the recursive definitions of the ordinal operations and by Theorem 1.5.14. The second assertion follows from Lemma 1.4.7. Lemma 1.5.10 For cardinal numbers κ, λ, μ a) (i) (κ + λ) + μ = κ + (λ + μ) (ii) b) (i) (κ · λ) · μ = κ · (λ · μ) (ii) (iv) (iii) κ · 0 = 0 (v) κ · (λ + μ) = κ · λ + κ · μ
and ν the following laws hold. κ+λ=λ+κ κ·λ=λ·κ κ·1=κ
1.5. Cardinal Numbers and their Elementary Properties c)
(i) (iii) (v)
d) (i) (iii)
κλ+μ = κλ · κμ (κ · λ)μ = κμ · λμ κ1 = κ, 1κ = 1 If κ ≤ μ and λ ≤ ν, then : κ+λ≤μ+ν λ = 0 =⇒ κλ ≤ μν
(ii) (iv) (vi)
(κλ )μ = κλ·μ κ0 = 1, 0κ = 0 for κ = 0 κ2 = κ · κ
(ii)
κ·λ≤μ·ν
47
Proof We leave it as an exercise for the reader to find suitable bijections and injections. We indicate the proof of (ii) in part c). If f : μ −→ λ κ is a function, then for each β ∈ μ the value f (β) is a function from λ into κ. Let the function φ(f ) : λ × μ −→ κ be defined by φ(f )(α, β) := f (β)(α). Then φ is μ a bijection from (λ κ) onto λ×μ κ. Theorem 1.5.11 There is a well-ordering ≺ on ON × ON such that, for every α ∈ ON, the well-ordering (ℵα × ℵα , ≺) is an initial segment of ≺ which is isomorphic to (ℵα , ∈). In particular we have |ℵα × ℵα | = ℵα , that means ℵα · ℵα = ℵα . Proof We define the relation ≺ on ON × ON by (α, β) ≺ (σ, τ ) :⇐⇒ max{α, β} < max{σ, τ }∨(max{α, β} = max{σ, τ }∧(α < σ ∨(α = σ ∧β < τ ))). That means that we well-order the pairs of ordinal numbers by their maxima and, if their maxima are equal, lexicographically. It is easy to verify that ≺ is a well-ordering on ON × ON, and that (ℵα × ℵα , ≺) is a proper initial segment of this well-ordering for every α ∈ ON. Assume, contrary to our hopes, that α is the smallest ordinal for which (ℵα × ℵα , ≺) is not isomorphic to (ℵα , ∈). By Corollary 1.3.11, there is a unique ordinal γ and an isomorphism f from (γ, ∈) onto (ℵα × ℵα , ≺). Then γ ≥ |γ| = |ℵα × ℵα | ≥ ℵα , and thus, by assumption, γ > ℵα . We conlude that the function f |` ℵα is an isomorphism from (ℵα , ∈) onto a proper initial segment of (ℵα × ℵα , ≺). Since ≺ orders ON × ON first by the maxima of the pairs, the set of first as well as the set of second components of f [ℵα ] must be bounded in ℵα ; take σ < ℵα such that f [ℵα ] ⊆ σ × σ. Now σ is infinite, and so there is β < α with |σ| = ℵβ . Then we get ℵβ < ℵα and, by the choice of α, ℵβ · ℵβ = ℵβ . On the other hand, ℵα = |f [ℵα ]| ≤ |σ × σ| = |σ| · |σ| = ℵβ · ℵβ = ℵβ . This contradiction shows that such an ordinal α does not exist, as desired. Corollary 1.5.12 If κ and λ are cardinal numbers, one of them nonzero and the other infinite, then κ + λ = κ · λ = max{κ, λ}. In particular, ℵα + ℵβ = ℵα · ℵβ = max{ℵα , ℵβ } = ℵmax{α,β} .
48
Chapter 1. Foundations
Proof Without loss of generality let 0 < κ ≤ λ and λ ≥ ω. Then the definitions of the cardinal operations, Corollary 1.5.4, and Theorem 1.5.11 yield λ ≤ κ + λ ≤ κ · λ ≤ λ · λ = λ. This gives the first assertion. The second follows from the monotonicity of the aleph function. Definition If a is a set, then we write [a]λ := {x ⊆ a : |x| = λ} for the set of those subsets of a which have cardinality λ.14 Corollary 1.5.13 Let a be an infinite set of cardinality κ and λ be a cardinal. Then |[a]λ | = |a|λ = κλ , if λ ≤ κ, and |[a]λ | = 0, if λ > κ. Proof The second assertion is obvious. So assume without loss of generality that 0 < λ ≤ κ = |a|. Then |[a]λ | = |[κ]λ |. Using (AC), we can assign uniquely to each subset X of κ of cardinality λ a bijection from λ onto X, that means a member of λ κ. Clearly this defines an injective function, and thus |[κ]λ | ≤ κλ . For the proof of the reverse inequality we observe that every function from λ into κ is a subset of λ × κ with cardinality λ, and that we have |λ × κ| = κ by assumption and by Corollary 1.5.12. Thus we can conclude that κλ = |λ κ| ≤ |[λ × κ]λ | = |[κ]λ | ≤ κλ , as claimed. Theorem 1.5.14 The following assertions hold. They are generally sufficient to get cardinality results in everyday mathematics. a) (ZF) The Cantor-Schr¨ oder-Bernstein theorem. b) If, for any set a and n ∈ ω \ {0}, an is defined by a1 := a and ak+1 := ak × a, then we have for any infinite set a: |a| = |a × a| = |an |
and
|n a| = |a|.
c) If (Ai : i ∈ I) is a family of sets, then | {Ai : i ∈ I}| ≤ |I| · sup{|Ai | : i ∈ I}. d) If a is an infinite set, then |Pfin (a)| = |a|. Proof The first two statements of b) follow directly from Corollary 1.5.12. Hereby an is the set of all n-tupels of members of a. We will also work with the set n a whose members can be regarded as n-tupels, too.15 If we assume as 14 The
sets [a]<λ , [a]≤λ , . . . are defined analogously in Section 1.6. we have two different definitions of an ordered pair, since the set (c, d) is not equal to the function {(0, c), (1, d)}. 15 Then
1.5. Cardinal Numbers and their Elementary Properties
49
inductive hypothesis that g is a bijection from n a onto a, then the equation h(f ) := (g(f |`n), f (n)) defines a bijection from n+1 a onto a × a, and this gives |n+1 a| = |a × a| = |a|. : i ∈ I}, and let < be a well-ordering of I. The For c), let κ := sup{|Ai | function f : {Ai : i ∈ I} −→ {Ai × {i} : i ∈ I}, given by f (a) = (a, i) where i is <-minimal with a ∈ Ai , is injective. So we obtain | {Ai : i ∈ I}| ≤ | {Ai × {i} : i ∈ I}| = |
{|Ai | × {i} : i ∈ I}| ≤ | {κ × {i} : i ∈ I}| = |κ × I| = |I| · κ.
Finally, we prove d). With the axiom of choice it is easy to show for nonempty sets x and y that there is an injection from x into y iff there is a surjection from y onto x. From c) and b) we get | {n a : n ∈ ω}| = |a|. If we assign to each member of {n a : n ∈ ω} its range, then we obtain a surjective function from this set onto Pfin (a). Example We want to show that any two bases of a vector space W over a field K have the same cardinality. If one of the bases is finite, then the exchange theorem of Steinitz says that the other basis is finite, too, and that the bases have the same number of members. So assume that B1 and B2 are infinite bases of W . For each vector x ∈ B1 , there is a finite subset b x of B2 such that x is a linear combination of the elements of bx . Let C := {bx : x ∈ B1 }, and suppose that C = B2 . Take y ∈ B2 \ C. y is a linear combination of certain members x1 , . . . , xn of B1 , and each xi is a linear combination of bxi . Thus y is a linear combination of {bxi : i ∈ {1, . . . , n}}, and our supposition implies that y is not a member of thisset. This contradicts the fact that B2 is linearly independent, hence B2 = {bx : x ∈ B1 }. Theorem 1.5.14 c) says that |B2 | ≤ |B1 | · ℵ0 = |B1 |. By symmetry, we have |B1 | ≤ |B2 |. Now part a) of the theorem yields |B1 | = |B2 |, as desired. Definition Let R be a relation on A with dom(R) = A. If B ⊆ A, then B is called unbounded or cofinal in A under R iff, for each a ∈ A, there is a member b ∈ B such that aR b. We define the cofinality of (A, R), denoted by cf (A, R), by cf (A, R) := min{|C| : C ⊆ A ∧ C is cofinal in A under R}. Thus cf (A, R) is the smallest cardinality of any subset of A that is cofinal in A under the relation R. Because of dom(R) = A, A itself has this property; so the cardinal number cf (A, R) always exists. If α is an ordinal, then the cofinality of α, written as cf (α), is the smallest ordinal μ with the property that there is a function f : μ −→ α such that
50
Chapter 1. Foundations
ran(f ) is cofinal in α under the relation ≤ on ordinals. Obviously, cf (α) ≤ α. Furthermore cf (α) ≤ cf (α, ≤), since for each cofinal subset C of α satisfying cf (α, ≤) = |C| there is a bijection from |C| onto C whose range is cofinal in α; an analogous argument shows that cf (α) is a cardinal. Lemma 1.5.15 and Lemma 1.5.16 tell us that cf (α) = cf (α, ≤) holds. We call a limit ordinal α regular iff cf (α) = α; we have just shown that regular ordinals are cardinals. A limit ordinal α is called singular iff cf (α) < α. With Reg we denote the class of regular cardinal numbers and let (κ, μ)reg := (κ, μ)CN ∩ Reg etc. Lemma 1.5.15 Let α be an ordinal. Then a) cf (0) = 0 and cf (α + 1) = 1. b) If α is a limit ordinal, then there exists a normal function h : cf (α) −→ α whose range is cofinal in α. The last condition is equivalent to sup(ran(h)) = α, i.e., to ran(h) = α. Proof The range of the empty function is cofinal in 0, and the range of the function {(0, α)} is cofinal in α + 1. This proves a). Next we turn to the proof of part b). If α ∈ Lim and f : γ −→ α is a function, then we get from the definition of a limit ordinal ran(f ) is unbounded in α ⇐⇒ sup(ran(f )) = α ⇐⇒ ran(f ) = α. If f : cf (α) −→ α is a function such that sup(ran(f )) = α, then, using transfinite recursion, we obtain a strictly increasing function g : cf (α) −→ α with sup(ran(g)) = α via g(β) := max{f (β), sup{g(σ) + 1 : σ < β}}. Note that, by the definition of cf (α), the ordinal sup{g(σ) + 1 : σ < β} is smaller than α for any β < cf (α). For continuity, we define the function h : cf (α) −→ α by h(0) := g(0), h(γ) := sup{h(β) : β < γ} for limit ordinals γ < α and h(β + 1) := g(β + 1). Then h is continuous. Using transfinite induction, it is easy to verify that h(β) ≤ g(β) for every β < cf (α). From this we get immediately that h is strictly increasing, and clearly we have sup(ran(h)) = α. Lemma 1.5.16 a) If α is a limit ordinal, then cf (cf (α)) = cf (α), hence cf (α) is a regular cardinal. Furthermore we have cf (α, ∈) = cf (α). b) ℵ0 is regular. Furthermore, every infinite successor cardinal κ+ is regular.
1.5. Cardinal Numbers and their Elementary Properties
51
c) If α is a limit ordinal, then cf (α) = cf (ℵα ). d) ℵω is the smallest singular cardinal number. e) The class of singular cardinal numbers is unbounded in ON. Proof For part a), we take strictly increasing functions f : cf (cf (α)) −→ cf (α) and g : cf (α) −→ α such that sup(ran(g)) = α and sup(ran(f )) = cf (α). Then the function g ◦ f is strictly increasing. To show that its range is unbounded in α, consider a fixed β < α. First there is an γ < cf (α) with β < g(γ). Furthermore there is σ < cf (cf (α)) such that γ < f (σ). Thus we have, by the monotonicity of g, β < g(f (σ)). This gives sup(ran(g ◦ f )) = α, and we can conclude that cf (α) ≤ cf (cf (α)). The reverse inequality is trivial. So the first assertion in a) is shown. Since we can find a strictly increasing function f : cf (α) −→ α whose range is cofinal in α, we get cf (α, ∈) ≤ |ran(f )| = |cf (α)| = cf (α). From this together with the remark after the definition of cf (α) we obtain the second assertion of part a). For the proof of b), we note first that obviously ℵ0 is regular, since no finite subset of ω can be cofinal in ω. For the second assertion, consider a function f : μ −→ κ+ . Then, by Theorem 1.5.14 c), | sup(ran(f ))| = | ran(f )| = | {f (β) : β < μ}| ≤ |μ| · κ, since |f (β)| < κ+ for every β < μ, hence |f (β)| ≤ κ. Now, if μ ≤ κ, then | sup(ran(f ))|< κ+ and thus sup(ran(f )) < κ+ . So we get cf (κ+ ) ≥ κ+ . Since cf (κ+ ) ≤ κ+ , we have cf (κ+ ) = κ+ , and thus κ+ is regular. For the proof of c), we note first that ℵα = sup{ℵβ : β < α} for any limit ordinal α. If h : cf (α) −→ α has the property that sup(ran(h)) = α, then the range of the function h : cf (α) −→ ℵα , given by h (β) = ℵh(β) , satisfies sup(ran(h )) = ℵα , hence cf (ℵα ) ≤ cf (α). Conversely, let g : cf (ℵα ) −→ ℵα be fixed, such that ran(g) is cofinal in ℵα . Let g : cf (ℵα ) −→ α be defined by g (γ) = min{σ < α : g(γ) ≤ ℵσ }. If τ < α, then there is γ < cf (ℵα ) such that ℵτ ≤ g(γ). Then τ ≤ g (γ), hence ran(g ) is cofinal in α and cf (α) ≤ cf (ℵα ). Next we turn to d). By definition, ℵω = sup{ℵn : n ∈ ω}. Thus cf (ℵω ) = ω = ℵ0 < ℵω , ℵω is singular. By part b), the cardinal numbers ℵn (n ∈ ω) are regular. Consequently, ℵω is the smallest singular cardinal. For e), we remind the reader of the fact that the ordinal sum is continuous in the second argument. Thus each cardinal ℵα+ω is singular, since it is the supremum of the countable set {ℵα+n : n ∈ ω}, where + is the ordinal sum, and furthermore α ≤ ℵα < ℵα+ω . From this we also get that the class of singular cardinals is unbounded in ON; therefore it is a proper class. Remark Further properties of regular and singular cardinal numbers are presented in Lemma 1.6.11, when we have infinite sums of cardinals at our
52
Chapter 1. Foundations
disposal, and of course in the section on clubs and stationary sets. Those readers which are meeting these concepts for the first time, may always imagine ℵω as the prototype for a singular cardinal and ℵ1 as the prototype for a regular cardinal. The regularity of ℵ1 also follows from the well-known fact that any union of countably many countable sets is countable (see Theorem 1.5.14). The corresponding generalization for arbitrary regular cardinal numbers can be found in Lemma 1.6.11. Exercises Assume that a, b, c, . . . , A, B, C, . . . etc. are sets. 1) If n ∈ ω, then there is no injection from n onto a proper subset A of n. Hint: Use complete induction. For the induction step, consider the cases n ∈ A and n ∈ A. 2) Prove that ω and every member of ω are cardinals. 3) Assume that B and C have the same finite cardinality n. Let f : B −→ C be injective (surjective). Prove that f is surjective (injective). Hint: Use complete induction. 4) Prove that the following assertions are equivalent: (i) A is finite. (ii) Every nonempty subset Y of P(A) has a ⊆-maximal element. (iii) ∀f (f : A −→ A =⇒ (f is injective ⇐⇒ f is surjective)). 5) 6) 7) 8)
9) 10)
11)
Hint: For (i) =⇒ (iii), use Exercise 3. Prove that ordinal and cardinal addition (multiplication, exponentiation) coincide on ω × ω. If A is a finite set all of whose elements are nonempty, then A has a choice function. (ZF) If B is a finite set and each member of B is countable, then B is countable. In ZFC, this assertion is provable for countable sets B. ω {0, 1} is not countable. Hint: Suppose that ω {0, 1} = {fn : n ∈ ω} and construct a new function f : ω −→ {0, 1}. f : ω × ω −→ ω, defined by f (x, y) := 12 (x+ y + 1) · (x+ y) + x, is bijective. Assume that A is a nonempty set and B is a set. Prove: There is an injection from A into B iff there is a surjection from B onto A. For which implication is (AC) not needed? Assume that A has at least three elements. Prove that there is no surjective function from A onto P(A) \ {{a} : a ∈ A}. Hint: The proof is very similar to Cantor’s proof in 1.5.6 a).
1.5. Cardinal Numbers and their Elementary Properties
53
12) Prove that every infinite set has a countably infinite subset. Did you need (AC)? (Yes!) 13) Prove in ZF that (AC) is equivalent to the following assertion: ∀x ∀y ∃f (f is injective ∧ (f : x −→ y ∨ f : y −→ x)). Hint: One implication can be found above. Furthermore we have shown without using (AC) that {σ ∈ ON : ∃f (f : σ −→ A ∧ f is injective)} is a set if A is a set. Use this to show that the above assertion implies that A can be well-ordered. 14) a) If there is a surjection f from an ordinal α onto A, then A can be well-ordered. Hint: For a ∈ A put od(a) := min{σ ∈ α : f (σ) = a}. Define a ≺ b :⇐⇒ od(a) < od(b) for any a, b ∈ A. b) Prove in ZF that (AC) is equivalent to the following assertion: ∀x ∀y(x = ∅ ∧ y = ∅ =⇒ ∃f (f : x −→ y surjective ∨ f : y −→ x surjective)). Hint: Use part a) for one of the implications and show that the class {σ : ∃f (f : A −→ σ ∧ f is surjective)} is a set. Observe that every surjection from A onto σ ∈ ON yields an injection from σ into P(A). 15) (Vaught) Let pd(y) abbreviate the assertion ∀u ∈ y ∀v ∈ y(u = v =⇒ u ∩ v = ∅). Prove in ZF that (AC) is equivalent to the following assertion: ∀x∃y(y ⊆ x ∧ pd(y) ∧ ∀z(z ⊆ x ∧ pd(z) =⇒ ¬ y z)). 16) The set version of Zorn’s lemma says:
If X is a set and M ⊆ P(X) is nonempty, such that K ∈ M for every nonempty ⊆-chain K ⊆ M , then M has a ⊆-maximal element.
Show in ZF that this assertion is equivalent to Zorn’s lemma. Hint: If (H, ≤) is a partial ordering that satisfies the assumptions of Zorn’s lemma, then define M := {X ⊆ H : X is a ≤ -chain}. 17) Assume that X is a set and M ⊆ P(X). We say that M has finite character iff any subset Y of X is a member of M if and only if every finite subset of Y is an member of M . The Teichm¨ uller-Tukey Lemma says:
54
Chapter 1. Foundations If M ⊆ P(X) has finite character and M = ∅, then M has a ⊆maximal element.
Show in ZF that this assertion is equivalent to Zorn’s lemma. Hint: For one implication, the proof of the nontrivial direction of the previous question is quite useful. 18) Hausdorff ’s Maximality Principle says: For every nonempty partial ordering (H, ≤), where H is a set, there is a ⊆-maximal ≤-chain in H. a) Prove in ZF that this principle follows from the Teichm¨ uller-Tukey lemma. b) Prove in ZF that Zorn’s lemma follows from this principle. 19) The Principle of Dependent Choices says that, for every nonempty set A and every relation R on A satisfying ∀x ∈ A ∃y ∈ A xRy, there is a sequence f : ω −→ A such that (f (n), f (n + 1)) ∈ R for all n ∈ ω. Prove that this principle follows from (AC), and prove in ZF that it implies that every countable set of nonempty sets has a choice function. The last assertion is called the axiom of countable choice. 20) (Kelley) Let X be a topological space. An open cover of X is a set U of open sets such that U = X. X is called compact iff every open cover of X has a finite open subcover U ⊆ U. In lectures on topology, one usually proves with (AC) the following assertion, known as Tychonoff ’s Theorem: a family of compact topological If I is a set and (Xi : i ∈ I) is spaces, then the topological space i∈I Xi with the standard product topology is compact. Prove in ZF that (AC) follows from this assertion. Hint:Let (Xi : i ∈ I) be a family of nonempty sets. We want to show that i∈I Xi = ∅. Choose a fixed new set a and put Yi := Xi ∪ {a}. Let a topology Ti on Yi be defined by Ti := {∅, {a}} ∪ {Z ⊆ Yi : Yi \ Z is finite}. Now use the fact that X is compact iff every family of closed sets with the finite intersection property has a nonempty intersection, and consider the family (Ai : i ∈ I), where Ai := {f ∈ k∈I Yk : f (i) ∈ Xi }. 21) Prove without using (AC): a) If B ∩ C = ∅ , then there is a bijection from b) There is a bijection from
B×C
C
A onto (B A).
B∪C
A onto
B
A × C A.
1.5. Cardinal Numbers and their Elementary Properties
55
c) If S is a countable subset of R, then |R \ S| = |R|. Hint: If S is infinite, assume w.l.o.g. that ω \ S is infinite, and map this set bijectively onto ω ∪ S. d) There is a bijection from Rn onto R. e) There is a bijection from R onto the set of all sequences of real numbers. f) There is a bijection from R R onto P(R). 22) (ZF) Show that, for any a, b ∈ R with a < b, |Rn | = |R| = |[a, b]| = |]a, b[| = |]a, b]|. Consequently, the continuum hypothesis is trivially true for open sets: Every nonempty open set is equinumerous to R. 23) Show that, if C = {f ∈ R R : f is continuous} (“continuous” in the usual meaning of calculus), then |C| = |R|. Hint: For any f, g ∈ C, f |`Q = g |`Q implies f = g. −i−1 : (ai : i ∈ ω) ∈ ω {0, 2}} is called the Cantor 24) The set C = { ∞ i=0 ai 3 set. Show: a) The function f : [0, 1] −→ {0, 1}, defined by f (x) = 0 ⇐⇒ x ∈ C, is Riemann integrable. Hint: By the integrability criterion of Riemann, it suffices to specify a sequence of partitions of [0, 1], such that the corresponding lower Riemann sums converge to 1. b) |{f ∈ [0,1] [0, 1] : f is Riemann integrable}| = 2|R| . Hint: Use the hint in a). 25) Prove that the set of open subsets of R (open with respect to the standard topology on R) is equinumerous to R. 26) If A ⊆ R, then a ∈ A is called an isolated point of A if there is ε > 0 such that A ∩ (a − ε, a + ε) = {a}. Show that any subset of R has only countably many isolated points. 27) Assume that (Aα : α < γ) is a sequence of closed subsets of R (with respect to the standard topology on R) which is strictly decreasing under ⊆. Prove that γ is countable. 28) (Cantor-Bendixson Theorem) Prove that every closed subset of R can be represented as A = P ∪ S, where P is perfect (i.e., closed and without isolated points) and S is countable. Hint: Put A0 := A,Aα+1 := Aα := {x ∈ R : x is an accumulation point of Aα } and Aγ := {Aσ : σ < γ} for limit ordinals γ. Show that there is a countable ordinal β such that Aσ = Aβ for all σ ≥ β, and apply the result from a previous question.
56
Chapter 1. Foundations
29) Prove that every perfect subset P of R has the cardinality 2ℵ0 . Hint: Assign to each finite {0, 1}-sequence s a member as of P such that (1) dom(s) = dom(t) =⇒ as = at , (2) f ∈ ω {0, 1} =⇒ af := limn→∞ af |`n exists. Then show that the function (af : f ∈ ω {0, 1}) is injective. 30) Prove that the continuum hypothesis is true for closed sets: For every closed subset A of R, we have |A| ≤ ℵ0 or |A| = 2ℵ0 . Hint: Use the results from the previous questions. 31) Prove: a) |{X ⊆ R : |X| ≤ ℵ0 }| = |R|. b) |{X ⊆ R : X is closed }| = |{X ⊆ R : X is perfect}| = |R|. 32) Prove: If |R| = ℵ1 , then R2 can be partitioned into two sets X and Y such that every straight line parallel to the x-axis contains only countably many points of X, and every straight line parallel to the y-axis contains only countably many points of Y . Hint: The assumption yields a well-ordering < of R of order type ℵ1 . Put X := {(x, y) ∈ R2 : x ≤ y} and Y := {(x, y) ∈ R2 : y < x}. 33) Assume that W is a vector space over the field F . Prove: a) If W has the finite dimension k ∈ ω, then |F | if |F | ≥ ℵ0 , |W | = mk if |F | = m ∈ ω. b) If B is a basis of W , W = {0}, and if one of the sets F and B is infinite, then |W | = max{|F |, |B|}. n Hint: Every w ∈ W \ {0} is uniquely representable as w = i=1 λi bi for some λ1 , . . . , λn ∈ F and b1 , . . . , bn ∈ B. Show first that the equations Φ(w) := {(λ1 , b1 ), . . . , (λn , bn )} and Φ(0) := ∅ define an injection from W into Pfin (F × B). Now use Theorem 1.5.14. 34) If F is a field, then F [x] := {f ∈ ω F : ∃n0 ∀n ≥ n0 f (n) = 0} is the set of polynomials over F . Prove that |F [x]| = max{ℵ0 , |F |}. 35) Assume that κ is infinite and λ ≤ κ. Let T = {f ∈ κ λ : f is surjective}. Then |T | = λκ . Hint: If λ = 0, consider the set Y := {f ∈ κ×λ λ : f is surjective} and assign to each function f ∈ κ λ one-to-one a member of Y . Observe that |(κ × λ) \ f | = κ, if λ ≥ 2.
1.5. Cardinal Numbers and their Elementary Properties
57
36) Assume that κ is infinite and λ ≤ κ. Let T = {f ∈ λ κ : f is injective}. Then |T | = κλ . Hint: If λ = 0, then λ · κ = κ. Therefore |T | = |T |, where T := {g ∈ λ (λ × κ) : g is injective}. Find an injection from λ κ into T . 37) Assume that κ is infinite. Let T = {f ∈ κ κ : f is bijective}. Then |T | = 2κ . Hint: First κ can be partitioned into two disjoint sets B and C of cardinality κ. Every injection from B into B can be extended to a bijection from A onto A. Now apply the previous exercise. 38) If A is infinite, then there are 2|A| equivalence relations on A. 39) Assume that H is a set and (H, ≤) is a linear ordering. Prove that cf (H, ≤ ) equals 0 or 1 or is a regular cardinal. 40) Give an example of a partial ordering which has singular cofinality. 41) Assume that τ is a limit ordinal, (αξ : ξ < τ ) is a strictly increasing sequence of ordinals, and α = sup{αξ : ξ < τ }. Prove that cf (α) = cf (τ ). 42) Prove that |α| ≤ α < |α|+ for every ordinal α. 43) Assume that α is infinite. Show that α + 1 is not a cardinal. 44) Prove: If a is an infinite set of ordinals, then |a| ≤ sup(a). 45) Let κ be a cardinal. Prove that α < κ+ iff |α| ≤ κ. 46) Prove: If f : B −→ V is a function, then |ran(f )| ≤ |B|. 47) Assume that κ is an infinite cardinal and ≺ is the lexicographical ordering on κ {0, 1}. Prove that there is no strictly increasing or strictly decreasing sequence of length κ+ . Hint: Assume that f¯ = (fα : α < κ+ ) is strictly increasing under ≺. For each α < κ there is an ordinal α∗ < κ such that fα |` α∗ = fα+1 |` α∗ , fα (α∗ ) = 0 and fα+1 (α∗ ) = 1, since fα ≺ fα+1 . Use the regularity of κ+ to obtain γ < κ such that |Aγ | = κ+ for Aγ := {α < κ : α∗ = γ}. Let o(f¯) be the least ordinal γ with this property and take f¯ such that o(f¯) is minimal. If α, β ∈ Ao(f¯) and α < β, then fα+1 (o(f¯)) = 1, fβ (o(f¯)) = 0 and α + 1 < β. So consider the subsequence g¯ of f¯ having the members g ) < o(f¯). fα and fα+1 for all α ∈ Ao(f¯) to obtain the contradiction o(¯ 48) Prove: If 2ℵ0 > ℵω , then ℵℵω0 = 2ℵ0 . 49) Assume that κ is a cardinal, and define κ0 := κ, κn+1 := ℵκn for each n ∈ ω, and μ := sup{κn : n ∈ ω}. Show that μ is the smallest fixed point of the aleph function which is greater or equal than κ. In particular, for κ = ω, we obtain the smallest fixed point of the aleph function.
58
Chapter 1. Foundations
1.6 Infinite Sums and Products Definition Let (κi : i ∈ I) be a family of cardinal numbers. Generalizing the definition in Section 1.5, we define the sum and the product of this family as follows:
κi := | {κi × {i} : i ∈ I}|, (κi : i ∈ I) := i∈I
(κi : i ∈ I) := κi := |{f : f : I −→ {κi : i ∈ I} ∧ ∀i ∈ I f (i) ∈ κi }|. i∈I
The product of a family (κi : i ∈ I) of cardinal numbers is defined as the cardinality of the cartesian product of the family (κi : i ∈ I) of sets. Thus we obtain a certain ambiguity of the denotation i∈I κi , with which we will put up, since it will not lead to serious confusions. The context will make plain the intended meaning. So it should be clear that in “f ∈ i∈I κi ” the cartesian product is meant. The following lemma summarizes some laws for the above cardinal operations. It is left as an exercise for the reader to find the suitable bijections and injections. Lemma 1.6.1 Let (κi : i ∈ I) and (λi : i ∈ I) be families of cardinal numbers. Then a) If, for every i ∈ I, xi is a set with |xi | = κi , then
κi = |
{xi × {i} : i ∈ I}| and κi = | xi |.
i∈I
i∈I
i∈I
κi = 0, i∈{0,1} κi = κ0 · κ1 , i∈∅ κi = 1. c) If κi ≤ λi for all i ∈ I, then i∈I κi ≤ i∈I λi and i∈I κi ≤ i∈I λi . |I| d) i∈I κ = κ · |I| and i∈I κ = κ . b)
i∈{0,1}
κi = κ0 + κ1 ,
i∈∅
Lemma 1.6.2 Let (κi : i ∈ I) be a family of cardinal numbers, and let λ be a cardinal number. Then the following laws hold. a) If (Xj : j ∈ J) is a partition of the index set I, then (i) (General commutative and associative laws)
i∈I
κi =
j∈J i∈Xj
κi
and
i∈I
κi =
j∈J i∈Xj
κi .
1.6. Infinite Sums and Products
59
(ii) (Distributive law)
κi =
j∈J i∈Xj
( κf (j) : f ∈ Xj ) . j∈J
j∈J
κi = i∈I λ · κi . c) λ = i∈I λκi . d) ( i∈I κi )λ = i∈I κλi . b) λ ·
i∈I i∈I κi
Proof Again it is left to the reader to find the desired bijections.We will only prove the and will specify a bijection distributive law φ from j∈J Bj onto the set {Cf × {f } : f ∈ j∈J Xj }, where Bj := {κi × {i} : i ∈ Xj } and Cf := j∈J κf (j) . Then the assertion follows from Lemma 1.6.1. Fix F ∈ j∈J Bj . Then, for each j ∈ J, there is a unique i ∈ Xj , say f (j), such that F (j) ∈ κi × {i}. Put φ(F ) := (h, f ) where h ∈ j∈J κf (j) is given by: h(j) is the first component of F (j). Lemma 1.6.3 Let (κi : i ∈ I) be a family of cardinal numbers. Then a) sup{κi : i ∈ I} ≤ i∈I κi . b) If κi > 0 for all i ∈ I, I = ∅ and at least one of the cardinals |I| and κi (i ∈ I) is infinite, then (i) i∈I κi = max{|I|, sup{κi : i ∈ I}} = |I| · sup{κi : i ∈ I}. (ii) If in addition |I| ≤ sup{κi : i ∈ I}, then
κi = sup{κi : i ∈ I}.
i∈I
In particular this holds if the given family is injective. Proof The second equation in b) (i) holds by Corollary 1.5.12. The assertion “≤” in the first equation follows from Theorem 1.5.14. Since κi > 0 for 1 ≤ κ all i ∈ I, we have |I| = i∈I i∈I i . Furthermore it is clear by definition that κj ≤ i∈I κi for every j ∈ I. This gives “≥” and also proves part a). The first equation in b) (ii) follows immediately from (i). Now assume that κi = κj for all i, j ∈ I with i = j. Let f be the order isomorphism from the order type α of the well-ordered set K := {κi : i ∈ I} onto this set. Then |I| ≤ α and f (γ) ≥ γ for every γ < α. From this we can conclude that sup{κi : i ∈ I} = sup(ran(f )) ≥ α ≥ |I|, if α is a limit ordinal. If α = β + 1 and α < ω, then sup{κi : i ∈ I} = f (β) ≥ ω > α = |I|. Otherwise we have α = β + 1, α ≥ ω and sup(ran(f )) = f (β) ≥ β ≥ |α| ≥ |I|.
60
Chapter 1. Foundations
Corollary 1.6.4 Let α and β be ordinals. a) If β is a limit ordinal, (σξ : ξ < β) is a strictly increasing sequence of : ξ < β}, then ordinals and α = sup{σ ξ ξ<β ℵσξ = ℵα . In particular, ℵ = ℵ . ξ β ξ<β b) ξ<α+1 ℵξ = ℵα . Definition If κ and λ are cardinal numbers, then put κ<λ := sup{κν : ν ∈ CN ∧ ν < λ}. If a is a set and λ is a cardinal number, then let [a]<λ := {x ⊆ a : |x| < λ} be the set of all subsets of a whose cardinality is less than λ. In complete analogy the sets [a]≤λ , [a]>λ and [a]≥λ are defined. The set [a]λ has already been defined in Section 1.5. The next corollary establishes the relation between κ<λ and [a]<λ analogously to Corollary 1.5.13. Corollary 1.6.5 a) If κ and λ are cardinal numbers such that κ ≥ 2 and λ ≥ ω, then κ<λ ≥ λ. b) If a is an infinite set, |a| = κ and λ is a cardinal number with 2 ≤ λ ≤ κ, then for all cardinals ν0 < λ
κν = κν .16 κ<λ = |[a]<λ | = ν∈λ∩CN
ν0 ≤ν∈λ∩CN
Proof For the proof of part a), first let λ be a successor cardinal μ+ . Then κ = κμ ≥ 2μ > μ by Lemma 1.5.6. So we get κ<λ ≥ μ+ = λ. Now let λ be a limit cardinal. If ν ∈ λ ∩ CN, then κν ≥ 2ν > ν. From this we can conclude that κ<λ = sup{κν : ν ∈ λ ∩ CN} ≥ sup{ν : ν ∈ λ ∩ CN} = λ. Next we prove b). Corollary 1.5.13 says that the cardinality of [a]ν is κν for cardinal numbers ν ≤ κ and 0 for cardinal numbers ν > κ. Therefore |[a]<λ | = ν ν∈λ∩CN κ . For each cardinal ν0 with ν0 < λ, it follows from Lemma 1.6.3 and 2 ≤ λ ≤ κ that this sum equals sup{κν : ν0 ≤ ν ∈ λ ∩ CN}. In particular, for ν0 = 0, we get κ<λ = sup{κν : ν ∈ λ ∩ CN} = |[a]<λ |. <λ
Corollary 1.6.6 If a is an infinite set and λ is a cardinal number with λ ≤ |a|, then a) |[a]λ | = |a|λ . b) |[a]<λ | = sup{|a|ν : ν ∈ CN ∩ λ}; in particular, |[ω]<ω | = ℵ0 . c) |[a]≤λ | = |a|λ . the literature, also the cardinal number ν∈λ∩CN κν instead of κ<λ is investigated. Further results on κλ can be found in Section 1.7. 16 In
1.6. Infinite Sums and Products
61
Proof Part a) is Corollary 1.5.13, part b) can be found in Corollary 1.6.5 b), and part c) follows at once from b) and c) using [a]≤λ = [a]λ ∪ [a]<λ . Theorem 1.6.7 Assume that (κi : i ∈ I) and (λi : i ∈ I) are families of cardinal numbers. Then the following holds. a) If λi ≥ 2 and κi ≤ λi for all i ∈ I, then i∈I κi ≤ i∈I λi . b) (J. K¨ onig’s Lemma) If κi < λi for all i ∈ I, then i∈I κi < i∈I λi . Proof First we prove a) and the relation “≤” of b). Let I1 := {i ∈ I : λi ≥ ω} and I2 := {i ∈ I : λi < ω}. Since i∈I κi = | {κi × {i} : i ∈ I}|, we assign uniquely to each pair (α, j) with α ∈ κj and j ∈ I a function fα,j ∈ i∈I (λi + 1) by fα,j (i) := κi , if i = j; fα,j (j) := α . It is easy to verify that the functions (fα,j : α ∈ κj ∧ j ∈ I) and (fα,j |`I1 : α ∈ κj ∧ j ∈ I1 ) are injective. This gives
κi ≤ |
i∈I1
(λi + 1)| =
i∈I1
λi .
i∈I1
Furthermore the same argument, applied to (κi : i ∈ I) using the first function, proves the assertion “≤” in b), since κi < λi for all i ∈ I implies that fα,j ∈ i∈I λi . If I2 is infinite, then, by assumption,
κi ≤ ℵ0 · |I2 | = |I2 | < 2|I2 | ≤ |
i∈I2
i∈I2
If I2 is finite, then it follows from λi ≥ 2 for all i that Altogether we obtain from Lemma 1.5.10:
i∈I
κi =
i∈I1
κi +
i∈I2
κi ≤
i∈I1
λi +
λi | =
i∈I2
λi .
i∈I2
i∈I2
λi ≤
κi ≤
i∈I2
λi .
λi .
i∈I
For the proof get a contradiction, that there is a of b) we assume, to bijection h from {κi × {i} : i ∈ I} onto i∈I λi . Then this cartesian product is the union of the pairwise disjoint sets Ai := h[κi × {i}], i ∈ I. Put Bi := λi ∩ {f (i) : f ∈ Ai }. Since |Bi | ≤ |Ai | = κi < λi , Bi is a proper subset of λi for every i ∈ I. Therefore the axiom of choice yields a function g ∈ i∈I λi such that g(i) ∈ λi \Bi for every i ∈ I. So we get the contradiction g ∈ {Ai : i ∈ I}. Corollary 1.6.8 Let β be an infinite ordinal and (κξ : ξ < β) be a sequence of nonzero cardinal numbers.
62
Chapter 1. Foundations a) If (κξ : ξ < β) is strictly increasing and β is a limit ordinal, then
κξ < κξ and κξ < ( κξ )|β| . ξ<β
ξ<β
ξ<β
ξ<β
b) If κξ ≥ 2 for every ξ < β, then
( κξ )|β| = ( κξ )|β| . ξ<β
ξ<β
Proof The first inequality in a) follows from K¨ onig’s lemma, if we put take into consideration that the factor κ0 ≥ 1 does not make λξ := κξ+1 and the product 1≤ξ<β κξ smaller. Since κξ ≤ ξ<β κξ for each ξ < β, we get |β| ξ<β κξ ≤ ( ξ<β κξ ) . Now the second inequality in a) follows from the first one. With the help of Theorem 1.6.7 it can be shown, using the same of part a) argument, that ξ<β κξ ≤ ξ<β κξ ≤ ( ξ<β κξ )|β| . Hereby we obtain
κξ )|β| ≤ ( κξ )|β| ≤ ( κξ )|β|·|β| , ( ξ<β
ξ<β
ξ<β
and with |β| · |β| = |β| part b) is proved. Theorem 1.6.9 Let κ be a cardinal number. a) If κ ≥ 2, then ℵα < cf (κℵα ). b) If κ is infinite, then κ < κcf(κ) . Proof For a), assume that γ ≤ ℵα and f is a function from γ into κℵα . Then we can infer from Theorem 1.6.7 and Lemma 1.5.10 that
| sup(ran(f ))| ≤ |f (β)| < κℵα = (κℵα )|γ| = κℵα ·|γ| = κℵα . β<γ
β<γ
From this we get at once cf (κℵα ) > ℵα . For b), assume that f : cf (κ) −→ κ is a function such that sup(ran(f )) = κ. As above, we obtain
κ≤ |f (β)| < κ = κcf(κ) . β
β
Corollary 1.6.10 a) For any α ∈ ON, cf (2ℵα ) > ℵα . In particular we have 2cf(ℵα ) = ℵα . ℵ
b) If α is a limit ordinal and ℵβ ≥ cf (α), then ℵα = ℵγ β for all ordinals γ; ℵ in particular we have ℵα < ℵαβ .
1.6. Infinite Sums and Products
63
Proof Part a) follows immediately from the previous theorem. So let us prove b). Since cf (ℵα ) = cf (α), it follows from Theorem 1.6.9 that ℵ
α) = ℵcf(α) ≤ ℵαβ . ℵα < ℵcf(ℵ α α
ℵ
ℵ
ℵ
The assumption ℵα = ℵγ β would yield the contradiction ℵαβ = ℵγ β = ℵα . Remark Corollary 1.6.10 tells us that the assertion ℵ0 < cf (2ℵ0 ) is provable in ZFC. Essentially this is the only limitation which is set by the axioms of ZFC for the cardinality of the continuum. The continuum function (2κ : κ ∈ ICN) satisfies two essential laws: (i) κ < μ =⇒ 2κ ≤ 2μ
(monotonicity) and
κ
(ii) κ < cf (2 ). If F : Reg −→ ICN is an arbitrary increasing function satisfying κ < cf (F (κ)) for all κ ∈ Reg, then by the results of W.B. Easton [Ea] it is consistent with the axioms of ZFC that 2κ = F (κ) for all κ ∈ Reg. This means that the axioms of ZFC set no limitations on the continuum function on the regular cardinals except the conditions (i) and (ii). Lemma 1.6.11 Let κ be an infinite cardinal number. a) The following assertions are equivalent. (i) κ is regular. (ii) For any sequence (Sα : α < γ) of sets, satisfying γ < κ and |Sα | < κ for all α < κ, we have | {Sα : α < κ}| < κ (i.e., κ is not a union of less than κ sets, all of which are of cardinality less than κ). (iii) κ is not a sum of less than κ cardinal numbers, all of which are less than κ. b) Assume that κ is an infinite cardinal. Then κ is a sum of cf (κ) cardinals less than κ. If κ is a limit cardinal, then there is a strictly increasing sequence (λξ : ξ < cf (κ)) of cardinal numbers less than κ such that κ=
λξ = sup{λξ : ξ < cf (κ)} .
ξ
For singular cardinals κ we can arrange that cf (κ) < λξ < κ for all ξ < cf (κ). If in addition cf (κ) > ℵ0 , then there also exists a normal sequence of singular cardinals with these properties.
64
Chapter 1. Foundations
Proof For the proof of a), “(ii)=⇒(i)”, assume that κ is a singular cardinal and f : cf (κ) −→ κ is a function such that ran(f ) = κ. Put Sα := f (α) for all α < cf (κ). Then (Sα : α < cf (κ)) is a sequence of less than κ sets, all of which are of cardinality < κ. The union of these sets is κ. cardinal numbers less For “(i)=⇒(iii)”, let (κi : i < γ) be a sequence of than κ with domain γ < κ. Then Theorem 1.5.14 yields i<γ κi ≤ |γ| ·sup{κi : i < γ} < κ, since κ is regular. For “(iii)=⇒(ii)” note that the cardinality of {Sα : α < γ} is at most α<γ |Sα |. Next we turn to the proof of b). Observe that for regular cardinals κ and any ν ∈ CN \ {0} ∩ κ we have κ = ξ<κ ν. Now let κ be a limit cardinal. If, according to Lemma 1.5.15, f : cf (κ) −→ κ is a normal function, i.e., if f is strictly increasing and continuous, such that sup(ran(f )) = κ, then the set c := {|f (β)| : β < cf (κ)} is cofinal in κ. Otherwise the regular cardinal number (sup(c))+ would be smaller than κ and thus be dominated by some value f (σ), and also by |f (σ)|, which would contradict the definition of c. Therefore we obtain by transfinite recursion a strictly increasing continuous sequence (λξ : ξ < cf (κ)) of members of c with supremum κ; from the definition of cofinality we can conclude that it has length cf (κ). Using Lemma 1.6.3, we get κ = ξ cf (κ)}. If in addition we have cf (κ) > ℵ0 , then the cardinals λξ can be chosen as singular. Namely, let λξ+1 for ξ < cf (κ) be the supremum of some strictly increasing sequence in c of length ω having max{λξ , |f (ξ)|} as its first member, let λ0 be defined analogously, and put, for limit ordinals γ < cf (κ), λγ := sup{λξ : ξ < γ}. Then we have, for any limit ordinal γ < cf (κ), cf (λγ ) ≤ γ < cf (κ) < λ0 < λγ , and λγ is singular. Since cf (κ) > ℵ0 , all cardinals λξ are singular. The construction shows that the sequence (λξ : ξ < cf (κ)) is normal and that sup{λξ : ξ < cf (κ)} = κ. Theorem 1.6.12 Let α and β be ordinals. ℵ
a) If α ≤ β, then ℵαβ = 2ℵβ . b) (Hausdorff ’s Formula) ℵ
ℵ
β = ℵα+1 · ℵαβ . ℵα+1
c) (Tarski’s Formula) If |γ| ≤ ℵβ , then ℵ
|γ|
ℵ
β ℵα+γ = ℵα+γ · ℵαβ .
Proof For part a), we can conclude from Lemma 1.5.10 and Corolℵ lary 1.5.12 that 2ℵβ ≤ ℵαβ ≤ (2ℵα )ℵβ = 2ℵα ·ℵβ = 2ℵβ .
1.6. Infinite Sums and Products
65
For b), let first β ≤ α. Then ℵβ ≤ ℵα , and since ℵα+1 is regular, every function from ℵβ into ℵα+1 is already a function from ℵβ into γ for some γ < ℵα+1 . This gives ℵ
β = |ℵβ ℵα+1 | = | ℵα+1
{ℵβ γ : γ < ℵα+1 }| ≤
ℵ
ℵ
β |γ|ℵβ ≤ ℵα+1 · ℵαβ ≤ ℵα+1 .
γ<ℵα+1
If α < β, then ℵα+1 ≤ ℵβ < 2ℵβ , and the assertion follows from a) and Corollary 1.5.12. Now we prove part c) by transfinite induction on γ. If γ = 0, there is nothing to show. For the successor step, we can infer from part b), the inductive hypothesis, and Corollary 1.5.12 that ℵ
ℵ
ℵ
|γ|
ℵ
|γ+1|
β β ℵα+γ+1 = ℵα+γ · ℵα+γ+1 = ℵαβ · ℵα+γ · ℵα+γ+1
ℵ
|γ+1|
= ℵαβ · ℵα+γ · ℵα+γ+1 = ℵαβ · ℵα+γ+1 . Now let γ be a limit ordinal. Then from Theorem 1.6.7 and the continuity of ordinal addition we can conclude that
ℵα+σ ≤ ℵα+σ . ℵα+γ = sup{ℵα+σ : σ < γ} ≤ σ<γ
σ<γ
From the inductive hypothesis, Lemma 1.5.10, and Lemma 1.6.1 we can infer that ℵ ℵ ℵβ |σ| β ℵα+γ ≤( ℵα+σ )ℵβ = ℵα+σ = (ℵαβ · ℵα+σ ) σ<γ
≤
ℵ (ℵαβ )|γ|
σ<γ |σ| ℵα+σ
≤
σ<γ ℵ ·|γ| ℵαβ
ℵ
|γ|·|γ|
|γ|
ℵ
β · ℵα+γ = ℵαβ · ℵα+γ ≤ ℵα+γ .
σ<γ
The last equation and the last inequality hold because, by assumption, |γ| ≤ ℵβ . Corollary 1.6.13 If n ∈ ω, then the following holds. ℵ
ℵ
β a) (Generalized Hausdorff Formula) ℵα+n = ℵαβ · ℵα+n .
ℵ
b) (Bernstein’s Formula) ℵnβ = 2ℵβ · ℵn . ℵ
|α|
c) If α ≤ ℵβ , then ℵαβ = 2ℵβ · ℵα . Examples 1.6.14 a) ℵℵ1 0 = 2ℵ0 · ℵ1 follows from Corollary 1.6.13, and thus ℵℵ1 0 = 2ℵ0 . b) ℵℵω1 = 2ℵ1 · ℵℵω0 .
66
Chapter 1. Foundations c) If 2ℵ1 = ℵ2 , then ℵℵω0 = ℵω1 . To see this, we conclude with Example b) from 2ℵ1 = ℵ2 that ℵℵω0 = ℵℵω1 . Theorem 1.6.9 gives cf (ℵω1 ) = ℵ1 < cf (ℵℵω1 ). Now the assertion follows. ℵ
d) For any α with ω ≤ α < ℵ1 , we have ℵαβ = 2ℵβ · ℵℵα0 . ℵ
e) If n ∈ ω and ℵωn = ℵγ β , then β ∈ {0, . . . , n − 1}. This follows from Theorem 1.6.9, because, under the given assumptions, we have cf (ℵωn ) = ℵn > ℵβ , hence n > β. In particular ℵℵωm = ℵωn for all m ≥ n and, in view of the surprising role of ℵω4 in Shelah’s Theorem 8.1.4 in Chapter 8, ℵℵωm = ℵω4 for all m ≥ 4. f) 2ℵω = ℵω4 follows from Corollary 1.6.10. Lemma 1.6.15 (The four golden rules of cardinal arithmetic) a) (Tarski) If ν ≥ ℵ0 is a cardinal number and (κξ : ξ < ν) is an increasing sequence of infinite cardinals, then κξ = (sup{κξ : ξ < ν})ν . ξ<ν
b) If λ and κ are cardinal numbers such that κ ≥ ℵ0 and λ ≥ cf (κ),then κλ = (sup{ν λ : ν ∈ CN ∩ κ})cf(κ) . c) (Tarski) If λ and κ are cardinal numbers such that κ ≥ ℵ0 and 0 < λ < cf (κ), then
κλ = κ · sup{ν λ : ν ∈ CN ∩ κ} = κ · νλ . ν∈κ∩CN
d) If κ is an infinite cardinal number, then 2κ = (2<κ )cf(κ) . Proof First we prove part a). Since |ν × ν| = ν, we can represent ν as a disjoint union ν = {Bα : α < ν} of subsets Bα of ν such that |Bα | = ν for all α < ν. Then we get μ := sup{κξ : ξ < ν} = sup{κξ : ξ ∈ Bα } for every α < ν, and μ ≤ ξ∈Bα κξ . Consequently, Lemma 1.6.2 yields μ≤ κξ = κξ ≤ μ ≤ μν . μν = α<ν
α<ν ξ∈Bα
ξ<ν
ξ<ν
For b), we can choose a sequence (κξ : ξ < cf (κ)) of cardinals κξ with 2 ≤ κξ < κ satisfying κ = ξ
ξ
ξ
1.6. Infinite Sums and Products
67
Next we prove c). If f ∈ λ κ, then there is an α < κ such that f ∈ λ α, since λ < cf (κ). Furthermore we have |α|λ = ν λ for all ν ∈ κ ∩ CN with ω ≤ ν ≤ α < ν + , hence by Lemma 1.6.3
|α|λ ≤ ν+ · νλ κλ ≤ | {λ α : α < κ}| ≤ ≤κ ·
α<κ
ν∈κ∩CN
ν λ ≤ κ · sup{ν λ : ν ∈ κ ∩ CN} ≤ κλ .
ν∈κ∩CN
For d), we note that the assertion is easy to show for successor cardinals. So let us assume that κ is a limit cardinal. We can apply Lemma 1.6.11 and obtain a strictly increasing sequence (κξ : ξ < cf (κ)) of cardinals less than κ such that κ = ξ
ξ
Corollary 1.6.16 Let κ be an infinite cardinal number and (κξ : ξ < cf (κ)) be a sequence of cardinal numbers such that κ = ξ
ξ
ξ
Part b) follows from part a) together with Corollary 1.5.12 and Lemma 1.6.2. Note that in Lemma 1.6.15 a) we have already proved assertion b) of the following theorem for cardinal numbers β. A slight modification of this proof shows that this assertion is true for any limit ordinal β such that β ≤ ω1 . Tarski believed that it is true for arbitrary limit ordinals. Remark 1.6.18 shows that it is consistent with the axioms of ZFC if ZF is consistent, using the famous result of K. G¨ odel that ZFC + (GCH) is consistent only if ZF is consistent. It was not until the results of P. J. Cohen that this hypothesis was refuted; Magidor [Ma] produced a model with a counterexample for β = ω1 + ω, and Jech and Shelah [JS] showed that if there is any counterexample, then there is one with β = ω1 + ω.
68
Chapter 1. Foundations
Theorem 1.6.17
|β| a) For any ordinal β > 0, ξ≤β ℵξ = ℵβ . For limit ordinals β, also |β| ξ<β ℵξ = ℵβ . b) If β is a principal number of addition and (αξ : ξ < β) is a strictly increasing sequence of ordinals with supremum α, then ℵαξ = ℵ|β| α . ξ<β
Proof We start with the proof of part b). So let β > 1 be a principal number of addition and (αξ : ξ < β) be strictly increasing such that sup{αξ : ξ < β} = α. Then we show first: ℵαξ )|β| = ℵαξ . (∗) ( ξ<β
ξ<β
For the proof of (∗), we put κξ := ℵαξ and τξ,η := ξ for all η, ξ < β. Since, by assumption and Lemma 1.4.7 a), β is not a sum of smaller ordinals, the natural sum ξ#η is less than β for all ξ, η < β. Further we have ξ ≤ ξ#η and η ≤ ξ#η. This gives {τξ,η : ξ, η < β} = {τξ,η : ζ < β ∧ ξ#η = ζ}. By the definition of the natural sum,the equation ξ#η = ζ has for a given ζ only finitely many solutions, hence ξ#η=ζ κτξ,η = κτζ,0 = κζ by Corollary 1.5.12. From this we can conclude with a general associative law that |β| ( κξ )|β| = κξ = ( κξ ) ξ<β
ξ<β
ξ<β η<β
=
( κτξ,η ) = ( κτξ,η ) = κζ ,
ξ<β η<β
ζ<β ξ#η=ζ
ζ<β
which proves (∗). Now the sequence (αξ : ξ < β) is strictly increasing and the aleph function is continuous, and thus sup{ℵαξ : ξ < β} = ℵα and β = sup{ξ : ξ < β} ≤ sup{αξ : ξ < β} = α. By Lemma 1.6.3 we can infer that ξ<β ℵαξ = ℵα . From |β| (∗) and Corollary 1.6.8 it follows that ℵα = ( ξ<β ℵαξ )|β| = ( ξ<β ℵαξ )|β| = ξ<β ℵαξ . This completes the proof of b). Next we turn to the proof of the second equation in part a). To get a contradiction, we assume that it is false and choose β as the smallest limit ordinal for which it fails. Then part b) tells us that β is not additively indecomposable. If we take the Cantor normal form of β for the base ω, β = i 1, since ω δ is additively indecomposable for every δ > 0, β0 ≥ . . . ≥ βn−1 , and βn−1 > 0. Consequently, γ := ω βn−1 is a principal number of addition,
1.6. Infinite Sums and Products
69
and β has the form β = σ + γ. We have γ ≤ σ < β and |β| = |σ|, since the cardinality of the ordinal sum of two infinite ordinals equals the maximum of the cardinalities of the summands. By the choice of β, we have |σ| |β| |γ| ξ<σ ℵξ = ℵσ = ℵσ , and by part b), ξ<γ ℵσ+ξ = ℵβ . So we can con |β| |γ| clude that ξ<β ℵξ = ξ<σ ℵξ · ξ<γ ℵσ+ξ = ℵσ · ℵβ . Furthermore, Tarski’s formula in Lemma 1.6.12 yields |β| |β| |γ| |γ| |β| ℵβ = ℵσ+γ = ℵ|β| · ℵ = ℵ · ℵ = ℵξ . σ σ σ+γ β ξ<β
This contradiction shows that the second equation in a) is true. Now the first equation in a) follows by transfinite induction. For β = 1 it |β| |β| is true, and for limit ordinals β it follows from the second, since ℵβ · ℵβ = ℵβ . Finally we get, by the inductive hypothesis and Hausdorff’s formula, |β| |β| |β+1| ℵξ = ( ℵξ ) · ℵβ+1 = ℵβ · ℵβ+1 = ℵβ+1 = ℵβ+1 . ξ≤β+1
ξ≤β
Remark 1.6.18 Assuming the generalized continuum hypothesis, we can conclude for limit ordinals β and strictly increasing sequences (αξ : ξ < β) with supremum α that ℵαξ = ℵ|β| ℵα+1 = α . ξ<β
To see this we infer from Corollary 1.6.4, K¨ onig’s lemma, and its corollary, that ℵα = ξ<β ℵαξ < ξ<β ℵαξ . From this we get ℵα <
|α| ℵα ℵα ℵαξ ≤ ℵ|β| = ℵα+1 , α ≤ ℵα ≤ ℵα = 2
ξ<β
and this immediately yields the desired claim. Exercises 1) Prove Lemma 1.6.1. 2) Prove Lemma 1.6.2. 3) Assume that κ is an infinite cardinal and n ∈ ω\{0}. Show that ξ<κ n = κ. 4) Assume that κ ∈ ICN, μ ∈ cf (κ) ∩ CN and (κξ : ξ < μ) is a sequence of cardinal numbers less than κ. Prove that ξ<μ κξ < κ. 5) Show that ℵℵω0 = n∈ω ℵn . 6) Assume that κ is an infinite cardinal. Show that (κ+ )κ = 2κ .
70
Chapter 1. Foundations 7) Assume that κ is an infinite cardinal. Show that 2κ = (
2ν )cf(κ) .
ν∈κ∩CN
8) Prove that α<ℵ1 +ω ℵα = ℵℵℵ11 +ω . Hint: Use Tarski’s formula. 9) Assume that σ is a limit ordinal and (η(ξ) : ξ < σ) is a normal function. a) Prove: sup{ ξ<τ ℵη(ξ) : τ < σ} = ξ<σ ℵη(ξ) . b) Refute: sup{ ξ<τ ℵη(ξ) : τ < σ} = ξ<σ ℵη(ξ) . 10) Prove that ξ<τ 2ℵξ = 2ℵτ for any limit ordinal τ . Hint: Assign to X ⊆ ℵτ the function hX ∈ ξ<τ P(ℵξ ) given by hX (ξ) := X ∩ ℵξ . 11) Assume that κ is an infinite cardinal such that 2ν < κ for all ν ∈ κ ∩ CN. Prove that cf (κcf(κ) ) > κ. 12) Prove: If κ is regular and 2μ ≤ κ for all cardinals μ < κ, then μ∈κ∩CN κμ = κ. 13) Prove: If κ = λ+ , then μ∈κ∩CN κμ = 2λ . 14) Refute: If κ and λ are cardinal numbers such that 0 < λ < cf (κ), then κλ = ν∈κ∩CN ν λ . 15) Assume that α is a limit ordinal and γ is an ordinal satisfying ℵγ < cf (α). ℵ ℵγ ℵγ Prove that ℵαγ = ξ<α ℵξ = sup{ℵξ : ξ < α} . Hint: Use a golden rule.
1.7 Further Properties of κλ – the Singular Cardinal Hypothesis In this section we will characterize the cardinal power κλ by its values for smaller bases or exponents17 . Furthermore it will be shown that this power is uniquely determined in the axiom system ZF+(SCH) by the function (2λ : λ ∈ ICN), and that it can be easily computed in the system ZFC+(GCH). (SCH) denotes the so-called “singular cardinal hypothesis”, given by (SCH) ∀κ ∈ ICN(2cf(κ) < κ =⇒ κcf(κ) = κ+ ) . 17 The results in 1.6.12, 1.6.13, and 1.6.15 have certainly already dealt with this subject. We needed them to obtain further findings on products of cardinal numbers.
1.7. Further Properties of κλ – the Singular Cardinal Hypothesis
71
Lemma 1.7.1 (Tarski’s Recursion Formula) If β is a limit ordinal, α is the supremum of the strictly increasing sequence (αξ : ξ < β) and ℵγ < cf (β), then
ℵℵαγ = ℵℵαγξ = sup{ℵℵαγξ : ξ < β} . ξ<β
In particular, for limit ordinals α and ordinals γ satisfying ℵγ < cf (α), we have
ℵ ℵ ℵξ γ = sup{ℵξ γ : ξ < α} . ℵℵαγ = ξ<α
Proof By assumption, we have ℵγ < cf (β) = cf (α) = cf (ℵα ). Therefore we get ℵγ ℵα = {ℵγ ℵξ : ξ < α} = {ℵγ ℵαξ : ξ < β}. Since obviously the cardinality of the index set is at most the supremum of the summands, Lemma 1.6.3 says that
ℵℵαγξ = sup{ℵℵαγξ : ξ < β} ≤ ℵℵαγ . ℵℵαγ ≤ ξ<β
Definition Assume that κ is an infinite and λ is an uncountable cardinal number. We say that λ is κ-strong iff ρκ < λ for every cardinal number ρ less than λ. λ is called a strong limit cardinal iff λ is ν-strong for every cardinal number ν less than λ, that means iff ρν < λ for all cardinal numbers ρ and ν less than λ. It is easy to see that λ is a strong limit cardinal iff 2ν < λ for all cardinal numbers ν less than λ. We say that κ is a (strongly) inaccessible cardinal number iff κ is regular, uncountable and a strong limit cardinal, and a weakly inaccessible cardinal number iff κ is regular, uncountable and a limit cardinal. Remark and Example Obviously we have κ < λ for any κ-strong cardinal λ. The existence of inaccessible cardinal numbers cannot be proved in ZFC. For strongly inaccessible cardinals κ this results from the fact that the von Neumann level Vκ with the ∈-relation is a model of ZFC. Therefore from the existence of an inaccessible cardinal in ZFC the consistency of ZFC could be proved in ZFC, which would contradict a famous theorem of K. G¨ odel concerning the impossibility of certain consistency proofs. For details, the reader is referred to Drake’s book [Dr], Chapter 4. The strong limit cardinals form a proper class. To show this, consider a fixed infinite cardinal number μ. We define by recursion a strictly increasing sequence (κn : n ∈ ω) of cardinal numbers by κ0 := μ and κn+1 := 2κn . Then κ := sup{κn : n ∈ ω} is a strong limit cardinal. Namely, if ρ and ν are smaller
72
Chapter 1. Foundations
than κ, then there is a natural number n such that max{ρ, ν} ≤ κn . We can conclude that ρν ≤ κκnn = 2κn = κn+1 < κ. Thus the class of strong limit cardinals is unbounded in the class of cardinals. Furthermore the supremum of a set of strong limit cardinals is also strong limit. Consequently, the class of strong limit cardinals is unbounded and closed in the class of cardinal numbers, which makes the assertion that these cardinal numbers occur very often precise. The same holds, for any infinite cardinal λ, for the class of λ-strong cardinals. Lemma 1.7.2 If κ is a strong limit cardinal, then 2<κ = κ and 2κ = κcf(κ) . Proof The first assertion is easy to show. For the second we can conclude, using Lemma 1.6.15, that κcf(κ) ≤ κκ = 2κ = (2<κ )cf(κ) = κcf(κ) . Lemma 1.7.3 Let α and β be ordinals with β < α.18 Then ℵ
a) If ℵα is ℵβ -strong, then ℵα = sup{ℵγ β : γ < α} and ℵα if cf (ℵα ) > ℵβ , ℵβ ℵα = cf(α) cf(ℵα ) = ℵα otherwise. ℵα ℵ
ℵ
ℵ
b) If γ < α and ℵα ≤ ℵγ β , then ℵαβ = ℵγ β . ℵ
c) Assume that ℵαβ > 2ℵβ 19 , ℵα is not ℵβ -strong, and γ < α is the smallest ℵ ordinal such that ℵγ β ≥ ℵα . Then ℵγ is ℵβ -strong and singular, and ℵ cf(ℵ ) satisfies cf (ℵγ ) ≤ ℵβ < ℵγ ; furthermore, ℵαβ = ℵγ γ . Proof First let, for the proof of a), α be a limit ordinal. From the asℵ sumption of a) we can conclude that ℵα = sup{ℵγ : γ < α} ≤ sup{ℵγ β : γ < α} ≤ ℵα , and thus ℵ
ℵα = sup{ℵγ β : γ < α}. Let first cf (ℵα ) > ℵβ . Then ℵβ ℵα = {ℵβ ℵγ : γ < α}, and Lemma 1.6.3 says that ℵ ℵ ℵαβ ≤ |α| · sup{ℵγ β : γ < α} = ℵα . (∗)
Now assume that cf (ℵα ) ≤ ℵβ . By assumption, we have ℵβ < ℵα , hence ℵα is singular and α is a limit ordinal. From Lemma 1.6.15 and (∗) we can conclude that ℵ ℵ α) = ℵcf(α) . ℵαβ = (sup{ℵγ β : γ < α})cf(ℵα ) = ℵcf(ℵ α α ℵ
ℵ
β If α is the successor ordinal σ + 1, then ℵσ+1 = ℵσ+1 · ℵσ β = ℵσ+1 , since ℵα is ℵβ -strong.
ℵ
α ≤ β it follows from Theorem 1.6.12 that ℵαβ = 2ℵβ . 19 Certainly this is the case if ℵ > 2ℵβ . α 18 For
1.7. Further Properties of κλ – the Singular Cardinal Hypothesis ℵ
ℵ
ℵ
73
ℵ
Part b) follows from ℵγ β ≤ ℵαβ ≤ (ℵγ β )ℵβ = ℵγ β . For the proof of part c), we choose the smallest ordinal γ < α satisfying ℵβ ℵ ℵ ℵ ℵγ ≥ ℵα . Then ℵγ β = ℵαβ , and β < γ, since otherwise we would get ℵαβ = ℵβ ℵ β ℵγ = 2ℵβ , contradicting the assumption 2ℵβ < ℵα . Furthermore we have ℵ ℵ ℵ ℵ ℵ ℵσβ < ℵα and thus ℵσ β < ℵαβ = ℵγ β for all σ < γ. The supposition ℵσ β ≥ ℵγ ℵ ℵ for some σ < γ would give, together with part b), the contradiction ℵσβ = ℵγ β . ℵβ Therefore we get ℵσ < ℵγ for all σ < γ, and ℵγ is ℵβ -strong. The supposition ℵ ℵ cf (ℵγ ) > ℵβ leads with part a) to ℵαβ = ℵγ β = ℵγ < ℵα . So there only remains ℵ ℵ cf(ℵ ) cf (ℵγ ) ≤ ℵβ < ℵγ , and part a) yields ℵαβ = ℵγ β = ℵγ γ . ℵ
Theorem 1.7.4 (Jech) Let α and β be ordinals. If ℵαβ ∈ {2ℵβ , ℵα }, then there is an ordinal γ ≤ α with cf (ℵγ ) ≤ ℵβ < ℵγ , such that ℵγ is ℵβ -strong and ℵ cf(ℵ ) satisfies ℵαβ = ℵγ γ . Therefore ℵ ℵαβ
⎧ ⎨ =
⎩
2ℵβ ℵα
cf(ℵγ )
ℵγ
or or for some γ ≤ α with cf (ℵγ ) ≤ ℵβ < ℵγ .
ℵ
Proof Let ℵαβ ∈ {2ℵβ , ℵα }. Then, by Theorem 1.6.12, β < α. If ℵα is ℵβ -strong, then the assertion follows from Lemma 1.7.3 a), with γ := α, and ℵ from the assumption that ℵαβ = ℵα . Otherwise, it follows from Lemma 1.7.3 c). Now we turn to the discussion of the singular cardinal hypothesis. Let κ be an infinite cardinal number. By Corollary 1.6.10 we have 2cf(κ) = κ. If 2cf(κ) > κ, then κcf(κ) ≤ (2cf(κ) )cf(κ) = 2cf(κ) , and thus 2cf(κ) = κcf(κ) . In other words, in the case that κ < 2cf(κ) , the cardinal κcf(κ) equals the value of the continuum function at the regular argument cf (κ). Since, from Easton’s result, the continuum function for regular arguments is not subject to any limitations except monotonicity and the condition κ < cf (2κ ), this holds in this case also for κcf(κ) ; so there are models of ZFC in which κcf(κ) > κ+ is valid. However, if 2cf(κ) < κ, then 2cf(κ) < κcf(κ) , i.e., the continuum function and the continuum function for κ (s.b.) differ at the regular argument cf (κ). Since κ < κcf(κ) ≤ κκ = 2κ , it clearly follows from 2κ = κ+ that cf(κ) κ = κ+ . Therefore the singular cardinal hypothesis can be inferred from the generalized continuum hypothesis. If we know the values of the continuum function (2κ : κ ∈ ICN), and if we know the values κcf(κ) for any singular κ, then Theorem 1.7.4 shows that we know the set of values of the function (κλ : κ, λ ∈ ICN). The additional axiom (SCH) makes the course of values of the power function for cardinal numbers, which is a subject of actual research and the main topic of this book,
74
Chapter 1. Foundations
easily surveyed (see Theorem 1.7.8). This applies all the more if we take the generalized continuum hypothesis as an axiom – see the next lemma. Corollary 1.7.5 Assume (GCH). Then for all cardinals κ ≥ 2 and λ ≥ ω, ⎧ if λ < cf (κ), ⎨ κ κ+ if cf (κ) ≤ λ < κ, κλ = ⎩ + λ if κ ≤ λ. Proof If κ ≤ λ, then κλ = 2λ = λ+ by Theorem 1.6.12. So let λ < κ; then κ is infinite. If λ < cf (κ), then we can infer from ν λ ≤ max{2ν , 2λ } ≤ max{ν + , λ+ }, using Lemma 1.6.15, that κ ≤ κλ = κ · sup{ν λ : ν ∈ CN ∩ κ} ≤ κ · sup{max{ν + , λ+ } : ν ∈ CN ∩ κ} ≤ κ. If cf (κ) ≤ λ < κ, then we get κ < κcf(κ) ≤ κλ ≤ κκ = 2κ = κ+ , hence κλ = κ+ . Definition The function (κcf(κ) : κ ∈ ICN) is called the gimel function; instead of κcf(κ) we also write (גκ). If κ = 2 or if κ is an infinite cardinal number, then we call the function (κρ : ρ ∈ ICN) the continuum function for κ; if κ = 2, we call it the continuum function. We say that the continuum function for κ is eventually constant below λ iff there is a cardinal number ρ0 with ρ0 < λ, such that κρ = κρ0 for all cardinal numbers ρ with ρ0 ≤ ρ < λ. In this case we also say that the continuum function for κ is constant below λ from ρ0 on. Lemma 1.7.6 Assume that κ and λ are cardinal numbers such that κ ≥ 2 and λ ≥ ω. Then a) Either the continuum function for κ is eventually constant below λ – if this happens at ρ0 < λ, then obviously κ<λ = κρ for every cardinal ρ with ρ0 ≤ ρ < λ – or there is a strictly increasing sequence (λξ : ξ < cf (λ)) which is cofinal in λ, such that the sequence (κλξ : ξ < cf (λ)) is strictly increasing and cofinal in κ<λ . b) In a), it holds that cf (κ<λ ) ≥ λ in the first case and cf (κ<λ ) = cf (λ) in the second case. c) If ν > 0 is a cardinal number, then ⎧ <λ if 0 < ν < cf (λ), ⎨ κ <λ ν λ κ if cf (λ) ≤ ν < λ, (κ ) = ⎩ ν if λ ≤ ν. κ d) Assume (GCH). Then κ<λ
⎧ ⎨ κ κ+ = ⎩ λ
if λ ≤ cf (κ), if cf (κ) < λ ≤ κ+ , if κ+ < λ.
1.7. Further Properties of κλ – the Singular Cardinal Hypothesis
75
Proof If λ is a successor cardinal μ+ , then κ<λ = κμ , and clearly the first assertion of the alternative is true. Now let λ be a limit cardinal and assume that the first assertion is not true for λ. Then, for each cardinal ρ < λ, there is a cardinal ν such that ρ < ν < λ and κρ < κν . If ρ runs through the values of a sequence of length cf (λ) which is cofinal in λ, then, by the previous condition, we obtain by recursion a strictly increasing subsequence (λξ : ξ < cf (λ)) of this sequence which is cofinal in λ and therefore has also length cf (λ) and the further property that the sequence (κλξ : ξ < cf (λ)) is strictly increasing. By construction, the last sequence must be cofinal in κ<λ . Now we prove part b). Assume that the first assertion in a) is true. If λ = ℵ0 , then it is easy to see that κ ≥ ω and κ<λ = κ. So we get cf (κ<λ ) = cf (κ) ≥ λ. Now let λ > ℵ0 . Theorem 1.6.9 tells us that cf (κ<λ ) = cf (κρ ) > ρ for every infinite cardinal number ρ with ρ0 ≤ ρ < λ. Thus we get cf (κ<λ ) ≥ λ. If the second assertion holds, the cardinal κ<λ has cofinality cf (λ), since it is the supremum of the strictly increasing sequence (κλξ : ξ < cf (λ)) and since cf (λ) is regular. Next we turn to the proof of part c). Let ν be a cardinal number, and assume first that the continuum function for κ is constant below λ from ρ0 on. If 0 < ν < cf (λ), then we choose a cardinal number ρ1 such that max{ρ0 , ν} ≤ ρ1 < λ. This gives (κ<λ )ν = (κρ1 )ν = κρ1 ·ν = κρ1 = κ<λ . For the case λ ≤ ν we obtain in the same way (κ<λ )ν = κρ0 ·ν = κν . If cf (λ) ≤ ν < λ, then we know that λ is singular. λ can be represented by Lemma 1.6.11 as a sum ξ
ξ
and thus (κ<λ )ν = (κλ )ν = κλ . Now we consider the case that in the alternative in a) the second assertion is true. Let the sequences in this assertion be given. Since cf (λ) = cf (κ<λ ) ≤ <λ λξ <λ κ = sup{κ : ξ < cf (λ)}, Lemma 1.6.3 says that κ = (κλξ : ξ < cf (λ)). Let ν < cf (λ) = cf (κ<λ ) and, without loss of generality, ν ≤ λ0 . Then, by Lemma 1.6.15 c),
(κ<λ )ν = κ<λ · (μν : μ ∈ CN ∩ κ<λ ) = (κλξ )ν = κλξ = κ<λ . ξ
ξ
This proves our claim for the case ν < cf (λ). From Corollary 1.6.8 we can conclude, if ν ≥ ω, that
(∗) (κ<λ )ν = ( κλξ )ν = ( κλξ )ν = (κλξ )ν = κ ξ
ξ
ξ
76
Chapter 1. Foundations
If cf (λ) ≤ ν < λ, we can again assume without loss of generality that λ0 ≥ ν, and we get ξ
cardinal number, then if ∃ν0 ∈ ICN ∩ κ ∀ν ∈ CN(ν0 ≤ ν < κ =⇒ 2ν = 2ν0 ) (the continuum function is eventually constant below κ), otherwise.
b) If κ and λ are infinite cardinal numbers, then ⎧ if 2λ < κ and λ < cf (κ), ⎨ κ λ κ+ if 2λ < κ and λ ≥ cf (κ), κ = ⎩ λ 2 if 2λ ≥ κ. Proof For a), we note that Theorem 1.7.7 yields 2κ = 2ν0 = 2<κ if the continuum function is constant below κ from ν0 on. So let us assume that the continuum function is not constant below κ. Then Lemma 1.7.6 b) tells <κ us that 2<κ has cofinality cf (κ). Our assumption gives 2cf(2 ) = 2cf(κ) < 2<κ . From (SCH) and Lemma 1.6.15 we can conclude that 2κ = (2<κ )cf(κ) = <κ (2<κ )cf(2 ) = (2<κ )+ .
1.7. Further Properties of κλ – the Singular Cardinal Hypothesis
77
The third case in b) is easy to show. If κ ≤ 2λ , then 2λ ≤ κλ ≤ (2λ )λ = 2λ , since λ is infinite. Now we prove part b), using transfinite induction on the cardinal number κ. By the previous remark, we can assume without loss of generality that 2λ < κ, hence λ < κ. First let κ be a successor cardinal ν + . Then 2λ ≤ ν. If 2λ < ν, then the inductive hypothesis gives ν λ ∈ {ν, ν + }. If 2λ = ν, then ν λ = 2λ < κ. In any case we have ν λ ≤ κ, and from Theorem 1.6.12 we can conclude that κλ = (ν + )λ = ν λ · ν + = ν + = κ. Now let κ be a limit cardinal. For ν < κ, the inductive hypothesis gives ν λ ∈ {ν, ν + , 2λ }, in particular ν λ < κ. From Lemma 1.7.3 a) we can conclude that κλ = κ, if cf (κ) > λ, and κλ = κcf(κ) , if cf (κ) ≤ λ. In this case we have 2cf(κ) ≤ 2λ < κ. With (SCH), we obtain κλ = κcf(κ) = κ+ . Lemma 1.7.9 The continuum function (2κ : κ ∈ ICN) can be characterized by the gimel function. More precisely: a) If κ is a regular cardinal number, then 2κ = (גκ). b) If κ is a singular cardinal number and if the continuum function is eventually constant below κ, then 2κ = 2<κ . c) If κ is a singular cardinal number and if the continuum function is not eventually constant below κ, then 2κ = (ג2<κ ). Proof Part a) holds, since κ = cf (κ) gives 2κ = 2cf(κ) ≤ κcf(κ) ≤ κκ = 2κ . For b) we note that (גκ) ≤ 2κ , since κcf(κ) ≤ κκ = 2κ . If κ is singular, and if the continuum function is eventually constant below κ, then 2κ = 2<κ follows from the theorem of Bukovsky and Hechler. If the continuum function is not eventually constant below κ, then Lemma 1.7.6 b) says that cf (κ) = cf (2<κ ). <κ Part c) of this lemma tells us that (2<κ )cf(2 ) = 2κ . This proves part c). Remark Lemma 1.7.9 illustrates the importance of the gimel function. An essential aim of this book is to give nontrivial upper bounds for the power κcf(κ) for singular cardinals κ. Exercises 1) Assume that κ is a μ-strong successor cardinal. Show that κ+ is also μ-strong. 2) Prove: If μ and ν are infinite cardinals, then there is a μ-strong regular cardinal greater than ν. 3) Let μ be an infinite cardinal. Find the first ω + 1 μ-strong cardinals. Hint: Consider the cardinal (2μ )+ .
78
Chapter 1. Foundations 4) Prove: If κ is a weakly inaccessible cardinal, then κ = ℵκ . Show that on the other hand the singular fixed points of the aleph function form a proper class. 5) Let κ be an infinite cardinal. Prove that κ is strongly inaccessible iff κ < κ and α α<λ α<λ κα < κ for all cardinals λ < κ and all sequences (κα : α < λ) of cardinals less than κ. 6) Assume that κ is a strongly inaccessible cardinal number. Prove that |Vα | < κ for all α < κ. Hint: Use transfinite induction on α according to the definition of the sets Vα . 7) The beth function : ON −→ ICN is defined by (0) = ℵ0 , (α + 1) = 2(α) and (γ) = sup{2(α) : α < γ}, if γ is a limit ordinal. As usual we also write α instead of (α). Prove: a) |Vω+α | = α . b) If κ is an uncountable regular cardinal, then κ is a fixed point of the beth function iff κ is strongly inaccessible.
8) Prove: If 2ℵ1 < ℵω and (גℵω ) > ℵω1 , then (גℵω1 ) = (גℵω ). 9) Prove: If 2ℵ0 ≥ ℵω1 , then (גℵω ) = 2ℵ0 and (גℵω1 ) = 2ℵ1 . 10) (Jech) Assume that λ is a cf (λ)-strong singular cardinal. Show that cf ((גλ)) ≥ min{ν : ∃μ ∈ λ ∩ CN λ ≤ μν }. 11)
a) Prove: If 2ℵ0 = ℵω+1 and 2ℵ1 = ℵω+2 , then ℵℵω0 < 2ℵω . Hint: Use 1.6.15.
b) Prove that the monotonicity of the gimel function is not provable in ZFC. Hint: By Easton’s result, ZFC is consistent with the assertions 2ℵ0 = ℵω+1 , 2ℵ1 = ℵω+2 and 2ℵ2 = (2ℵω )+ . 12) Assume that λ is a singular cardinal, κ = cf (λ) and Φ ∈ κ κ. Further let (μξ : ξ < κ) be a sequence unbounded in λ such that the set {ξ < κ : +Φ(ξ) } is unbounded in κ. Prove that λ is a strong limit cardinal. 2μξ ≤ μξ 13) Assume that κ and λ are cardinals with κ ≥ 2 and λ ≥ ω, such that cf (κ<λ ) > λ. Prove that the continuum function for κ is eventually constant below λ.
1.8. Clubs and Stationary Sets
79
1.8 Clubs and Stationary Sets Definition If α is a limit ordinal, then we know that a subset C of α is unbounded in α iff sup(C) = α; we call C closed in α iff γ ∈ C for every limit ordinal γ < α in which C ∩ γ is unbounded. Every closed unbounded subset of α is called a club in α. If λ is a singular cardinal of uncountable cofinality, then C is called a special club in λ iff C is a club in λ of order type cf (λ) all of whose members are singular cardinals greater than cf (λ). A club sequence is any sequence of the form (Cα : α ∈ A), where A is a set of limit ordinals and, for every α ∈ A, Cα is a club in α of order type cf (α). For any ordinal α and any sequence (Xξ : ξ < α) of subsets of α, we call the set (Xξ : ξ < α) := ξ<α Xξ := {β ∈ α : ∀ξ < β(β ∈ Xξ )} = {β < α : β ∈
Xξ }
ξ<β
the diagonal intersection and (Xξ : ξ < α) := ξ<α Xξ := {β ∈ α : ∃ξ < β(β ∈ Xξ )} = {β < α : β ∈
Xξ }
ξ<β
the diagonal union of the sequence (Xξ : ξ < α). If C is an arbitraryclass of ordinals, then we say that γ ∈ ON \ {0} is a limit point of C iff γ = (C ∩ γ). Remarks and examples Assume that α is a limit ordinal. a) The order topology on a nonempty subset A of ON is that topology on A having as a base the set {(σ, τ )ON ∩ A : σ, τ ∈ A} ∪ {σ ∩ A : σ ∈ A} ∪ {A \ (σ + 1) : σ ∈ A} ∪ {A}. We remind the reader that a topology on a fixed nonempty set A is a set T of subsets of A which has A and ∅ amongst its members and is closed under finite intersections and arbitrary unions. The members of T are called open sets, their complements in A are called closed sets. We say that a set B ⊆ T is a base of this topology iff every open set is a union of members of B. If A is given without a topology, then we call a set B ⊆ P(A) a base of a topology on A iff B = A and B1 ∩B2 is a union of members of B for all sets B1 , B2 ∈ B. In this case, the set { B : B ⊆ B} is a topology on A. It is called the topology on A generated by the base B. It is easy to see that any subset C of a limit ordinal α is closed in the above sense iff it is closed relative to the order topology on α.
80
Chapter 1. Foundations b) A subset C of α is closed in α iff the limit, i.e., the supremum, of any sequence of members of C which is bounded in α is an element of C. c) For every ordinal γ < α, the set [γ, α) is a club in α – every final segment of α is a club in α. d) If cf (α) > ω, then α ∩ Lim is a club in α (see the next lemma). Without the assumption on cf (α), this assertion is obviously false, since the set of limit ordinals less than α needs not to be unbounded in α; consider ω or ω · 2 (= ω + ω), where + and · denote the ordinal operations. e) The set of all successor ordinals in α > ω is not a club in α – later on, we will see that it is the standard example of a “thin” set, since its intersection with the club of limit ordinals is empty. f) If α > ℵ0 is regular and thus a regular cardinal, and if f : α −→ α is a function, then the set C := {β < α : f [β] ⊆ β} is a club in α. To prove this, let (βξ : ξ < γ) be a strictly increasing sequence in C with γ < cf (α) = α, and β := sup{βξ : ξ < γ}.Then β ∈ α and, since f [βξ ] ⊆ βξ ⊆ β for every ξ < β, f [β] = f [ {βξ : ξ < γ}] = {f [βξ ] : ξ < γ} ⊆ β. Consequently, C is closed. For unboundedness, we apply a typical construction. Fix σ < α. Since α is regular, we have β0 := max{σ +1, sup(f [σ])+1} < α. Assume that the monotone sequence (βj : j ≤ n) with βn < α is already defined. Put, analogously to the basis of the induction, βn+1 := max{βn + 1, sup(f [βn ]) + 1}. By assumption we have β := sup{βn : n ∈ ω} ∈ α, and we obtain that f [β] = {f [βn ] : n < ω} ⊆ {βn+1 : n < ω} = β. Thus β ∈ C and β > σ, which shows that C is unbounded in α.
Lemma 1.8.1 Let α be a limit ordinal with uncountable cofinality. Then the following holds. a) α ∩ Lim is a club in α. b) α contains a club of order type cf (α) (of course this is also true if cf (α) = ω). Furthermore, if A is a subset of Lim, then there exists, by (AC), a club sequence (Cα : α ∈ A). c) If E is any unbounded subset of α, then the set E of limit points of E less than α is a club in α; the same holds for E ∪ E . d) If g : α −→ ON is a normal function, then ran(g) is a club in sup(ran(g)); if in addition g : α −→ α, then ran(g) is a club in α. Conversely, every club C in α is the range of a normal function f with dom(f ) = α if α is regular. If α is singular, then every club C in α is the range of a normal function f : otp(C) −→ α. e) If α is a singular cardinal, then α includes a special club.
1.8. Clubs and Stationary Sets
81
Proof For a), it obviously suffices to prove unboundedness. Fix σ ∈ α∩Lim and put σ0 := σ. If σj < α is already defined for all j ≤ n such that the sequence (σj : j ≤ n) is strictly monotone, then there is an ordinal σn+1 such that σn < σn+1 < α. The ordinal τ := sup{σn : n ∈ ω} is a limit ordinal, has cofinality ω and does not dominate α. The assumption yields that it is a member of α ∩ Lim. For b), observe that we obtain from Lemma 1.5.15 a continuous, strictly monotone function h : cf (α) −→ α such that sup(ran(h)) = α. The last property implies that ran(h) is unbounded in α, and from the continuity of h and Lemma 1.4.1 we can conclude that ran(h) is closed. Since h : cf (α) −→ ran(h) is an ∈-isomorphism, ran(h) is a club in α of order type cf (α), as desired. For c), the unboundedness of E is proved analogously to the proof of a), using the the unboundedness of E: If σ ∈ α, then choose σ0 ∈ E with σ0 > σ. If σj ∈ E is already defined for all j ≤ n such that the sequence (σj : j ≤ n) is strictly increasing, then there is an ordinal σn+1 ∈ E such that σn < σn+1 < α. The ordinal τ := sup{σn : n ∈ ω} is greater than σ, is a limit point of E, has cofinality ω and does not dominate α. Therefore it is, by assumption, a member of α ∩ E . If γ is a limit ordinal and E ∩γ is unbounded in γ, then E∩γ is unbounded in γ. This is easy to see, since for every β < γ there is a limit point σ of E such that β + 1 < σ < γ and, by the definition of a limit point, there exists τ ∈ σ ∩ E with β < τ . Thus we get γ = sup(E ∩ γ) and γ ∈ E . For d), we observe that C is unbounded in sup(ran(g)), if C is the range of a normal function g from α into ON; in the case that g : α −→ α, C is unbounded in α, since β ≤ g(β) for every β < α. C is closed in sup(ran(g)), since g is continuous. Assume that α is regular, C is a club in α, and, according to Corollary 1.3.11, f : γ −→ C is the order isomorphism from γ := otp(C) onto C. f is strictly monotone and continuous, since C is closed, and ran(f ) = C is unbounded in α. This gives α = cf (α) ≤ γ. Since ξ ≤ f (ξ) for all ξ < γ, we get γ ≤ sup(ran(f )) = α. In the same way one proves the corresponding assertion for singular α. For e), Lemma 1.6.11 says that α is the supremum of a continuous, strictly increasing sequence (λξ : ξ < cf (α)) of singular cardinals greater than cf (α). The range of this sequence is a club in α by part d); by definition, it is a special club. Lemma 1.8.2 Let α be an ordinal with uncountable cofinality. a) The intersection of less than cf (α) clubs in α is a club in α. b) Assume that (Cγ : γ < α) is a sequence of clubs in α. If the set {Cγ : γ < β} is unbounded in α for all β < α, then the diagonal intersection of
82
Chapter 1. Foundations the sequence (Cγ : γ < α) is a club in α. This holds in particular if the sequence (Cγ : γ < α) is decreasing under ⊆. If α > ℵ0 is regular, then (Cγ : γ < α) is a club in α.
Proof For a),let (Cγ : γ < τ ) with 0 < τ < cf (α) be a sequence of clubs in α, and let C := {Cγ : γ < τ }. Certainly C is closed in α. We show that C is unbounded in α. For this we use transfinite induction and assume that every intersection of less than τ clubs in α is unbounded in α. Fix σ < α. If τ = 2, then choose αn ∈ C0 and βn ∈ C1 for each n ∈ ω such that σ < α1 < β1 < α2 < β2 < . . . . We then have σ < β := sup{αn : n ∈ ω} = sup{βn : n ∈ ω} and β ∈ C0 ∩ C1 ∩ α, since cf (α) > ℵ0 . If τ = ξ + 1, then the same proof, together with the inductive hypothesis, yields that C = Cξ ∩ {Cγ : γ < ξ} is unbounded in α. Finally, if τ is a limit ordinal, choose for i < τ ordinals γi < α such that γ0 > σ, γi ∈ {Cj : j < i}, and γi > sup{γj : j < i}, which is possible by the inductive hypothesis and because i < cf (α), hence sup{γj : j < i} < α. Put β := sup{γi : i < τ }. We get σ < β < α. Furthermore β = sup{γi : i0 < i < τ } for any i0 < τ , and thus β is a supremum of elements of Ci0 . This gives β ∈ Ci0 for every i0 < τ , and we can conclude that β ∈ C. For the proof of b), we show first that C := Δ(Cγ : γ < α) is closed. So assume that τ < α is a limit ordinal and C ∩ τ is unbounded in τ , and fix σ < τ . Then we have τ = sup{i ∈ C : σ < i < τ }. If σ < i ∈ C, then i ∈ Cσ , and since Cσ is a club, we get τ ∈ Cσ . This gives τ ∈ C. For unboundedness, fix σ < α. Choose σ0 ∈ C0 \σ and σ {Cγ : γ < n+1 ∈ σn } \ (σn + 1). This is possible, since, by assumption, the set {Cγ : γ < σn } is unbounded in α. Then we have β := sup{σn : n ∈ ω} < α, since cf (α) > ℵ0 . Let i < β. Then there is an n0 ∈ ω with i < σn0 , and further β = sup{σ n : n > n0 } is a supremum of elements of Ci , which gives β ∈ Ci . Since β ∈ {Ci : i < β}, we can conclude that β ∈ C, and clearly β > σ. If α > ℵ0 is regular, then, for every β < α, the set {Cγ : γ < β} is a club in α by part a); in particular it is unbounded in α. Using the previous result, we can now conclude that {Cγ : γ < α} is a club in α. Definition If A is a nonempty set, then we say that a set F of subsets of A is a filter on A iff the following conditions are satisfied: (F1) A ∈ F and ∅ ∈ F . (F2) If X, Y ∈ F , then X ∩ Y ∈ F . (F3) If X ∈ F , Y is a subset of A and X ⊆ Y , then Y ∈ F . Every ⊆-maximal filter on A is called an ultrafilter on A. Ifa nonempty set S ⊆ P(A) has the finite intersection property (fip), i.e., if S = ∅ for all S ∈ Pfin (S), then (see Lemma 1.8.3) F := S! := {X ⊆ A : ∃S ∈ Pfin (S) S ⊆ X}
1.8. Clubs and Stationary Sets
83
is a filter on A such that S ⊆ F . It is the filter generated by S. If S = {Y }, we also call it the filter generated by Y . If F is an arbitrary filter on A and X is a subset of A such that A \ X ∈ F , we denote, with regard to the corresponding denotations for ideals, by F |`X the filter generated by F ∪ {X}. For any a ∈ A, the set {X ⊆ A : a ∈ X} is an ultrafilter on A; we call it the principal ultrafilter on A generated by {a}. Every ultrafilter which is not principal is called nonprincipal or free. We say that a set I of subsets of A is an ideal on A iff it satisfies the following properties: (I1) A ∈ I and ∅ ∈ I. (I2) If X ∈ I and Y ∈ I, then X ∪ Y ∈ I. (I3) If X ∈ I and Y ⊆ X, then Y ∈ I. The set dom(I) := I is called the domain of the ideal I. If F is a set of subsets of A, one easily checks that F is a filter on A iff the set I := {A \ X : X ∈ F } is an ideal on A. We call I the dual ideal of F . If F is an ultrafilter on A, then the dual ideal of F is called a prime ideal or a maximal ideal. Conversely, if an ideal I on A is given, we can define a filter F in the same way and call it the dual filter of I. Assume that α is a limit ordinal. We say that a filter F on α is normal iff, for any sequence (Xξ : ξ < cf (α)) of members of F , the diagonal intersection (Xξ : ξ < cf (α)) is a member of F . If cf (α) > ℵ0 , then we call the filter FC = FC (α) := {X ⊆ α : ∃C(C is a club in α ∧ C ⊆ X)} (see Lemma 1.8.2) the clubfilter on α. Any subset S of α is called stationary in α or a stationary subset of α iff C ∩ S = ∅ for every club C in α. Every subset of α which is not stationary in α is called thin or, as usual, nonstationary in α. Lemma 1.8.3 Let A be a nonempty set. a) If a nonempty set S ⊆ P(A) has the finite intersection property, then S! is the smallest filter on A such that S ⊆ S!. b) If U is a filter on A, then the following conditions are equivalent. (i) U is an ultrafilter. (ii) ∀X, Y ∈ P(A)(X ∪ Y ∈ U =⇒ X ∈ U ∨ Y ∈ U ). (iii) ∀X ∈ P(A)(X ∈ / U =⇒ A \ X ∈ U ). c) If I is an ideal and F a filter on A with I ∩ F = ∅20 , then there exists an ultrafilter D on A such that F ⊆ D and D ∩ I = ∅. In particular we get: 20 Such
a filter always exists; take for example the trival filter {A}.
84
Chapter 1. Foundations If d ∈ I, then there is an ultrafilter D on A such that D ∩ I = ∅ and d ∈ D. For every filter F on A there is an ultrafilter D on A such that F ⊆ D (“every filter can be extended to an ultrafilter”21 ). There is a free ultrafilter on any infinite set. d) If A is infinite and U an ultrafilter on A, then the following conditions are equivalent: (i) U is nonprincipal. (ii) Fcof := {X ⊆ A : A \ X is finite} ⊆ U . (iii) No member of U is a finite set.
Proof The proof of a) and d) is left to the reader. We give an indirect proof for the implication “(i) =⇒ (iii)” in b) and assume that there is a subset X of A such that X ∈ U and A \ X ∈ U . Then we get Y ∩ X = ∅ for every Y ∈ U , since Y ∩ X = ∅ would imply Y ⊆ A \ X and thus A \ X ∈ U . Put F := {Z ⊆ A : ∃Y ∈ U (Y ∩ X ⊆ Z)}. Obviously, U ⊆ F and X ∈ F . Further it is easy to see with the filter properties of U that F is a filter. This gives U = F , since U is maximal, hence X ∈ U , a contradiction. For the proof of “(iii) =⇒ (ii)” we assume, that there are sets X, Y ∈ P(A) such that X ∪ Y ∈ U , X ∈ / U and Y ∈ / U . From (iii) we get A \ X ∈ U and A \ Y ∈ U . Thus the intersection of these sets, that is Z := A \ (X ∪ Y ), is a member of U . Now we can conclude that ∅ = (X ∪ Y ) ∩ Z ∈ U , contradicting our assumption that U is a filter. To prove “(ii) =⇒ (i)”, assume that F ⊇ U is a filter and X ∈ F . We will show that X ∈ U . Fix B ∈ U . Then B = (B ∩ X) ∪ (B \ X). Assumption (ii) gives X ∈ U or B \ X ∈ U . But from the second condition we could conclude with U ⊆ F that X ∩ (B \ X) = ∅ ∈ F which would contradict the fact that F is a filter. For the proof of c), it is easy to check that the set M := {G ⊆ P(A) : G is a filter on A ∧ F ⊆ G ∧ G ∩ I = ∅} satisfies the assumptions of Zorn’s lemma. So let D be a maximal element of M. We will show that D is an ultrafilter on A and assume, contrary to our hopes, that there is a set X ⊆ A such that X ∈ D and A \ X ∈ D. If Y ∈ D, then X ∩Y = ∅, since otherwise A\X ∈ D would follow from Y ⊆ A\X. In the same way we get Y ∩ (A \ X) = ∅. This shows that the sets D ∪ {X} and D ∪ {A \ X} 21 Of course this assertion follows easily if we apply Zorn’s lemma to the set of all filters on A containing F .
1.8. Clubs and Stationary Sets
85
have the finite intersection property. Let F1 and F2 be the filters generated by them according to part a). Since D is maximal in M, we can choose Z1 ∈ F1 ∩I and Z2 ∈ F2 ∩ I. Part a) gives F1 = {Y ⊆ A : ∃d ∈ D(d ∩ X ⊆ Y )}, since D is a filter, and an analogous representation holds for F2 . Thus we obtain sets d1 , d2 ∈ D, such that d1 ∩ X ∈ I and d2 ∩ (A \ X) ∈ I. Therefore the set (d1 ∩ X) ∪ (d2 ∩ (A \ X)) is a member of I. But d1 ∩ d2 is a subset of it, and so we get d1 ∩ d2 ∈ I ∩ D, contradicting D ∩ I = ∅. This completes the proof of the first assertion in c). If d ⊆ A and d ∈ I, then the filter Fd := {Y ⊆ A : d ⊆ Y } generated by d is a filter on A with I ∩ Fd = ∅, as desired. The second special consequence follows at once, taking I = {∅}. Also the third consequence is easy to show, taking I := {X ⊆ A : X is finite}. Then I is an ideal on A, and from d) we can conclude that any ultrafilter disjoint from I is nonprincipal. Lemma 1.8.4 Assume that α is a limit ordinal with uncountable cofinality. a) Every superset of a club in α is stationary in α. b) Every stationary subset of α is unbounded in α. c) Every union of less than cf (α) sets that are nonstationary in α is nonstationary in α. d) For every regular cardinal λ < cf (α), the set Σα,λ := {β < α : cf (β) = λ} is stationary in α. Furthermore, every club C in α has a member β with cf (β) = λ such that C ∩ β is a club in β. Proof Part a) follows from Lemma 1.8.2 a). The same holds for part c): If sets, then choose for γ < cf (α) and (Tξ : ξ < γ) is a sequence of nonstationary each ξ < γ a club Cξ inα with Cξ ∩ Tξ = ∅; C := {Cξ : ξ < γ} is a club which does not meet the set {Tξ : ξ < γ}. Part b) follows at once if we choose, for each γ < α, a member of the intersection of the club {β ∈ α : γ ≤ β} with the given stationary set. For the proof of d), consider a fixed club C in α. We can define by recursion, since λ < cf (α) and clubs are unbounded, a strictly increasing continuous sequence g of members of C having length λ. Since C is closed and λ is regular, the supremum β of this sequence is an element of C and has cofinality λ, hence β ∈ Σα,λ . The second assertion follows, too, since ran(g) is a club in β by Lemma 1.8.1, and ran(g) ⊆ C. Definition Assume that M is a subset of P(A) such that M = A for every finite subset M of M . Then M ! := {X ⊆ A : ∃M ∈ Pfin (M ) X ⊆ M }
86
Chapter 1. Foundations
is an ideal on A called the ideal generated by M . It is the smallest ideal on A including M . If A \ B ∈ I, then there exists the ideal I[B] := I ∪ {B}!. We say that B generates the ideal I[B] over I. If X ∈ I, then the set I |`X := {Z ⊆ A : X ∩ Z ∈ I} is an ideal on A, the restriction of the ideal I to X. Note that I |`X = I[A\X]. Let α be a limit ordinal. We say that an ideal I on α is normal iff, for any sequence (Xξ : ξ < cf (α)) of members of I, the diagonal union (Xξ : ξ < cf (α)) is a member of I. If κ is a cardinal with cf (α) ≥ κ, then an ideal I on α is called κ-complete iff every union of less than κ members of I is a member of I. I.e., whenever (Xα : α < γ) is a family of members of I and γ < κ, then {Xα : α < γ} ∈ I. Any ℵ1 -complete ideal also is called σ-complete. If cf (α) > ℵ0 , then we call the dual ideal of the clubfilter FC on α the ideal of thin subsets of α, writing Id (α); i.e, Id (α) = {X ⊆ A : ∃C(C is a club in α ∧ C ∩ X = ∅)}. For any nonempty set A of ordinals with sup(A) ∈ A, the ideal Ib (A) := {X ⊆ A : ∃β ∈ A X ⊆ β} on A is called the ideal of bounded subsets of A. An ultrafilter D on A is called unbounded iff D ∩ Ib (A) = ∅. Lemma 1.8.5 If κ is an uncountable regular cardinal, then Id (κ) is a κ-complete normal ideal on κ and Ib (κ) ⊆ Id (κ). Proof By definition, Id (κ) is closed under subsets. If (Xξ : ξ < κ) is a sequence of members of this ideal, then for each ξ < κ there is a club Cξ in κ us that the diagonal intersection D of such that Cξ ∩ Xξ = ∅. Lemma 1.8.2 tells (Cξ : ξ < κ) and, for every γ < κ, Dγ := {Cξ : ξ < γ} areclubs in κ. An easy calculation shows that D ∩ {Xξ : ξ < κ} = ∅ and Dγ ∩ {Xξ : ξ < γ} = ∅. Thus Id (κ) is κ-complete and normal, as desired. Lemma 1.8.6 Assume that κ is a regular uncountable cardinal and I is a normal ideal on κ. a) If I is κ-complete and dom(I) = κ, then Ib (κ) ⊆ I, and {ξ + 1 : ξ < κ} is a member of I. b) If Ib (κ) ⊆ I, then even Id (κ) ⊆ I. Thus Id (κ) is the smallest κ-complete normal ideal J on κ such that dom(J) = κ.
1.8. Clubs and Stationary Sets
87
Proof For the proof of a) we observe that, for each α < κ, the set Xα := {ξ < κ : ξ ≤ α+1} is a member of I, since I is κ-complete and any singleton {ξ}, ξ < κ, is a member of I on account of dom(I) = κ. Now I is normal, therefore the set α<κ Xα is a member of I, and we have α<κ Xα = {ξ + 1 : ξ < κ}. Next we prove part b). Fix T ∈ Id (κ). Then there is a club C in κ with T ∩ C = ∅. C has order type κ, since κ is regular. So let (δα : α < κ) be the ∈-isomorphism from κ onto C, and let Yα := {ξ < κ : ξ ≤ δα }. By assumption, we have Ib (κ) ⊆ I, and thus Yα ∈ I and Xα ∈ I for every α < κ. From this we can conclude that α<κ Yα ∈ I and α<κ Xα ∈ I, since I is normal. If we can prove the assertion (∗)
T ⊆ α<κ Xα ∪ α<κ Yα ,
then T ∈ I follows, and b) will be shown. We have κ \ (α<κ Xα ∪ α<κ Yα ) = (κ \ α<κ Xα ) ∩ (κ \ α<κ Yα ) = α<κ (κ \ Xα ) ∩ α<κ (κ \ Yα ). If β ∈ κ \ (α<κ Xα ∪ α<κ Yα ), then β is a limit ordinal, since β ∈ α<κ (κ \ Xα ), and δα < β for all α < β, since β ∈ α<κ (κ \ Yα ). Now, firstly the sequence (δα : α < κ) is continuous as a normal function, and we get δβ = sup{δα : α < β} ≤ β, and secondly it is strictly increasing, which gives β ≤ δβ . Altogether we get β = δβ and thus β ∈ C. Since T ∩ C = ∅, we can conclude that β ∈ T , which proves (∗). Lemma 1.8.7 If κ is an uncountable regular cardinal and I is a normal ideal on κ such that Ib (κ) ⊆ I, then I is κ-complete. Proof Consider a cardinal μ < κ and a sequence (Xα : α < μ) of members of I. We will show that α<μ Xα ∈ I. Let the sequence (Yα : α < κ) be defined by Xα \ μ if α < μ, Yα := ∅ otherwise. Since I is normal, ∈ I. Furthermore it is easy to see we know that α<κ Yα : α < μ} ∈ I. that α<κ Yα = {Yα : α < μ}, and thus {Yα Now μ ∈ Ib (κ) gives μ ∈ I, and from this we can conclude that α<μ Xα ⊆ α<μ Yα ∪ μ ∈ I and thus α<μ Xα ∈ I, as desired. Theorem 1.8.8 (Fodor) Assume that α is a limit ordinal with cf (α) > ℵ0 and S ⊆ α is stationary in α. Let further f : S −→ α be a regressive function (i.e., f (γ) < γ for all γ ∈ S \ {0}). Then, for some η < α, the set f −1 [η] is stationary in α. If α is regular, then there even exists η < α such that f −1 [{η}] is stationary in α, i.e., f is constant on a stationary subset of S. Proof To get a contradiction we assume that, for each η < α, there is a club Dη in α such that Dη ∩ f −1 [η] = ∅. Choose, according to Lemma 1.8.1, a
88
Chapter 1. Foundations
club E ⊆ α in α of order type cf (α), and put Cη := {Dξ : ξ ∈ E ∩ (τ + 1)}, where τ = τ (η) := min{ξ ∈ E : ξ ≥ η}. Cη is a club in α, being the intersection of less than cf (α) clubs in α. Furthermore we have Cη ∩ f −1 [η] = ∅, since Cη ⊆ Dτ (η) , τ (η) ≥ η and Dτ (η) ∩ f −1 [τ (η)] = ∅ and thus Dτ (η) ∩ f −1 [η] = ∅. Now the sequence (Cη : η < α) is descending, and Lemma 1.8.2 says that C := (Cη : η < α) and thus C ∩Lim are clubs in α. Consequently, there exists a limit ordinal γ such that γ ∈ C ∩ S, since S is stationary in α. Furthermore we have f (γ) < γ, since f is regressive, hence σ := f (γ) + 1 < γ and γ ∈ Cσ . But on the other hand we have γ ∈ f −1 [σ] by the definition of σ, contradicting Cσ ∩ f −1 [σ] = ∅. Now assume in addition that α is regular and f −1 [η] is stationary in α for some η < α. From f −1 [η] = {f −1 [{σ}] : σ < η} we can conclude from Lemma 1.8.4 that there is an ordinal σ < η such that f −1 [{σ}] is stationary in α. Lemma 1.8.9 Assume that κ is a regular cardinal and I is an ideal on κ. Then I is normal iff there exists, for every set S ⊆ κ with S ∈ I and every function f regressive on S, a set S0 ⊆ S such that S0 ∈ I and f is constant on S0 . Proof First we show that the previous condition is sufficient for the normality of I. So assume that (Xξ : ξ < κ) is a sequence of members of I. We must show that S := ξ<κ Xξ is in I. If σ ∈ S, then the ordinal f (σ) := min{ξ < σ : σ ∈ Xξ } exists. The function f defined by this equation is regressive on S. If S was not a member of I, then our assumption would yield a set S0 ⊆ S with S0 ∈ I and an ordinal γ < κ such that ran(f |` S0 ) = {γ}. We could infer that S0 ⊆ Xγ by the definition of f , and thus S0 ∈ I, a contradiction. Consequently, we get S ∈ I, as desired. Conversely assume that I is normal, S ⊆ κ is a set with S ∈ I, and f : S −→ κ is a regressive function. If 0 ∈ S and S \ {0} ∈ I, then {0} ∈ I, and f is constant on S0 := {0}. Otherwise we have S \ {0} ∈ I or 0 ∈ S, and we can assume without loss of generality that 0 ∈ S. Put Xξ := f −1 [{ξ}] for every ξ < κ. Then there must exist an ordinal ξ < κ with Xξ ∈ I. The supposition Xξ ∈ I for every ξ < κ would lead to ξ<κ Xξ ∈ I, since I is normal. But on the other hand we have S = ξ<κ Xξ , since f is regressive, and S ∈ I. Therefore there exists a set Xξ such that Xξ ∈ I. Clearly we have Xξ ⊆ S, and the function f is constant on Xξ . Corollary 1.8.10 If κ is a regular cardinal, I is a normal ideal on κ and X ∈ P(κ) \ I, then I |`X is a normal ideal on κ. Proof Assume that S ∈ P(κ) \ (I |` X) and f : S −→ κ is a regressive function. Then X ∩ S ∈ I and, by assumption, there is a set S0 ⊆ S ∩ X with S0 ∈ I and an ordinal γ < κ such that ran(f |` S0 ) = {γ}. It is obvious that S0 ∈ I |`X.
1.8. Clubs and Stationary Sets
89
Next we prove a well-known theorem of Solovay which says for regular uncountable cardinals κ: If S ⊆ κ and S ∈ Id (κ), then S can be partitioned into κ classes which are not members of Id (κ). For the proof we need two preparatory lemmas. Lemma 1.8.11 Assume that κ is an uncountable regular cardinal and S is a stationary subset of κ. Then the set T is stationary in κ, where T := {α ∈ S : cf (α) = ω ∨ (cf (α) > ω ∧ S ∩ α is not stationary in α)}. Proof If C is a club in κ, then Lemma 1.8.1 tells us that the set C := {σ < κ : σ = 0 ∧ sup(C ∩ σ) = σ} of limit points of C is a club in κ. Let α := min(C ∩ S). We show that α ∈ C ∩ T . If cf (α) = ω, then this holds by definition. So let cf (α) > ω. Then, by Lemma 1.8.1, C ∩ α is a club in α, since α is a limit point of C. Further we have (C ∩ α) ∩ (S ∩ α) = ∅ by the choice of α, which means that S ∩ α is not stationary in α. Lemma 1.8.12 Let κ be an uncountable regular cardinal and T be a stationary subset of κ ∩ Lim. If fα is, for all α ∈ T , a normal sequence cofinal in α, then one of the following assertions is true. (1) ∃ξ < κ ∀η < κ(Tη := {α ∈ T : ξ ∈ dom(fα ) ∧ fα (ξ) ≥ η} is stationary in κ). (2) ∃D ⊆ κ(D is a club in κ ∧ ∀γ, α ∈ D ∩ T (γ < α =⇒ γ = fα (γ))). Proof Assume that the first assertion is false, that means that for each ξ < κ there is an ordinal η(ξ) < κ and a club Cξ in κ such that Cξ ∩ Tη(ξ) = ∅. This defines a function η from κ into κ. Put C := ξ<κ Cξ and D := {α ∈ C : η[α] ⊆ α ∧ Lim(α)}. From the example following the definition of a club and Lemma 1.8.2 we can conclude that D is a club in κ. If we consider α, γ ∈ D ∩ T with γ < α, then α ∈ C, and thus α ∈ Cξ for all ξ < α and α ∈ / Tη(ξ) for all ξ < α. From this we can infer for every ξ ∈ γ ∩ dom(fα ) that fα (ξ) < η(ξ), since α ∈ Tη(ξ) , and η(ξ) < γ, since γ ∈ D. Now the supposition dom(fα ) ≤ γ would lead to ran(fα ) ⊆ γ < α, contradicting the assumption on fα . So we get γ ∈ dom(fα ). Since γ is a limit ordinal and fα is continuous, the previous considerations show that fα (γ) = sup{fα (ξ) : ξ < γ} ≤ γ. Furthermore we have γ ≤ fα (γ), since fα is strictly increasing. This gives fα (γ) = γ, and the second assertion is true. Theorem 1.8.13 (Solovay) Assume that κ is an uncountable regular cardinal and S is a stationary subset of κ. Then S can be partitioned into κ stationary subsets of κ.
90
Chapter 1. Foundations
Proof Since every superset of a stationary set is also stationary, it obviously suffices to show that the assertion is true for some stationary subset T of S. If f is a function from T into κ and γ1 , γ2 ∈ κ are different, then f −1 [{γ1 }] ∩ f −1 [{γ2 }] = ∅. Thus f yields the desired partition if the set {γ ∈ κ : f −1 [{γ}] is stationary} is unbounded in κ. Now, if f is regressive and Tη := {α ∈ T : f (α) ≥ η} is stationary for all η < κ, then Fodor’s theorem tells us that, for each η < κ, there is an ordinal γη < κ such that f −1 [{γη }] ∩ Tη is stationary in κ. Since γη ≥ η by the definition of Tη , the set {γη : η < κ} is unbounded in κ, and we are ready. We choose the set T ⊆ Lim from Lemma 1.8.11 as the stationary subset T of S which will suit our purposes. For each α ∈ T we can find a sequence fα which is cofinal in α and satisfies ran(fα ) ∩ T = ∅. Namely, if cf (α) > ℵ0 , then S ∩ α is nonstationary in α, and Lemma 1.8.1 d) says that there is a club Cα in α which is the range of a normal function fα and does not meet S ∩ α. If cf (α) = ℵ0 , it is enough to choose a strictly increasing sequence gα : ω −→ α with sup(ran(gα )) = α and to put fα (n) := gα (n) + 1. Now a club D satisfying the conditions in assertion (2) of Lemma 1.8.12 cannot exist. Otherwise D ∩ T would be stationary, in particular there would be ordinals α, γ ∈ D ∩ T such that γ < α and fα (γ) = γ, that means with γ ∈ ran(fα ) ∩ T , contradicting ran(fα ) ∩ T = ∅. Therefore some ξ < κ satisfies the condition in assertion (1) of this lemma, and we define for this ξ and for α ∈ T if ξ ∈ dom(fα ), fα (ξ) f (α) := 0 otherwise. If η > 0, then {α ∈ T : f (α) ≥ η} = {α ∈ T : ξ ∈ dom(fα ) ∧ fα (ξ) ≥ η}, and thus the set {α ∈ T : f (α) ≥ η} is stationary in κ for every η < κ. Since f is regressive, our introductory remarks show that the proof of the theorem is completed. Definition Let α be a limit ordinal. We say that a stationary subset S of α is nonreflecting iff, for all limit ordinals β < α, the set S ∩ β is not stationary in β. Lemma 1.8.14 If λ is a regular cardinal, then the set Σλ+ ,λ = {σ < λ+ : cf (σ) = λ} is a nonreflecting stationary subset of λ+ . Proof By Lemma 1.8.4, the set Σλ+ ,λ is stationary in λ+ . Now let α < λ+ be a fixed limit ordinal. Then μ := cf (α) ≤ λ. Take f : μ −→ α as a strictly monotone function such that sup(ran(f )) = α. Then the function g with g(γ) := f (γ) + 1 has the same properties. Put C := ran(g) and C := C ∪ {γ < α : sup(C ∩ γ) = γ} .
1.8. Clubs and Stationary Sets
91
For μ = ω, C is a club in α, and the same holds for μ > ω by Lemma 1.8.1. By the definition of C, every limit ordinal γ ∈ C is the supremum of the set {g(σ) : σ < μ ∧ g(σ) < γ}. If we choose αγ as the least ordinal in μ such that γ ≤ g(αγ ), then γ = sup(ran(g |` αγ )), and we get cf (γ) ≤ αγ < μ ≤ λ. So we have shown that Σλ+ ,λ ∩ C = ∅, and Σλ+ ,λ ∩ α is not stationary in α, as desired. Exercises22 A, B, . . . , X, Y, . . . , etc. denote sets.
1) Prove: If F is a nonempty set of filters on A, then F is a filter on A. 2) Prove: If K is a nonempty ⊆-chain of filters on A, then K is a filter on A. 3) Let X be a subset of A. Prove: a) If F is a filter (ultrafilter) on A and X ∈ F , then F ∩ P(X) is a filter (ultrafilter) on X. b) If G is a filter on X, then G can be extended to an ultrafilter on A.
4) If F is a filter on A, we put F + := {X ⊆ A : A \ X ∈ F }. Prove that + + F ⊆ F and that F is a filter iff F is an ultrafilter. 5) Let A be an infinite set. Prove that the set {X ⊆ A : A \ X is finite} is a filter on A. It is called the Fr´echet-Filter on A. 6) Let A be an infinite set. Prove: a) There is an ultrafilter F on A such that all members of F have the same cardinality as A (a so-called uniform ultrafilter on A). Hint: The set {A \ X : |X| < |A|} can be extended to an ultrafilter. b) The set of all uniform ultrafilters on A and the set of nonprincipal ultrafilters on A coincide iff A is countable (see also Exercise 7 and Exercise 8 below). Hint: If A is not countable, choose X ⊆ A with ℵ0 ≤ |X| < |A|, and apply part a) to X. 7) Prove that there are no normal nonprincipal ultrafilters on ω. Hint: Assume, to get a contradiction, that F is such a filter. Then ω \ {0} is not an element of the dual ideal of F . Define f : ω \ {0} −→ ω by f (n + 1) := n. Now apply Lemma 1.8.9. 8) Let κ be an infinite cardinal. A filter F on A is called κ-complete iff M ∈ F for any nonempty subset M of F of cardinality less than κ; otherwise it is called κ-incomplete. An ℵ1 -complete filter on A is also called σ-complete, an ℵ1 -incomplete filter on A is also called σ-incomplete. Prove: 22 Exercises
on ideals can be found in Section 2.1.
92
Chapter 1. Foundations a) If A is infinite, then every nonprincipal ultrafilter on A is |A|+ incomplete. In particular, all nonprincipal ultrafilters on countable sets are σ-incomplete. b) If U is a nonprincipal |A|-complete ultrafilter on A, then U is a uniform ultrafilter.
Hint: For any nonprincipal ultrafilter U on A, we have A \ {x} ∈ U for every x ∈ A. 9) We call an uncountable cardinal κ a measurable cardinal iff there is a nonprincipal κ-complete ultrafilter on κ. Prove that every measurable cardinal is regular and strong limit, i.e., it is an inaccessible cardinal. 10) Prove for filters F on A: If μ := sup{κ : F is κ-complete} exists, then μ is regular and F is μ-complete. Hint: Assume that μ is singular and use the fact that F is μ+ -incomplete. 11) Assume that A is infinite and D is an ultrafilter on A. Prove that D is κ-complete iff, for every τ < κ and every partition (Xσ : σ < τ ) of A (that means {Xσ : σ < τ } = A and Xσ ∩ Xξ = ∅ whenever ξ < σ < τ ), there exists a set Xσ0 ∈ D. 12) (Shelah) If A is infinite, F is a filter on A, and κ is a cardinal, then F is calledκ-regular iff there is a sequence (Xξ : ξ < κ) of members of F such that {Xξ : ξ ∈ N } = ∅ for every denumerable subset N of κ. Prove that reg(F ) := min{κ : F is not κ-regular} exists and is a regular cardinal. 13) We call a filter F on A regular iff F is |A|-regular. Prove: If F is a filter on A, then F is regular iff there is a function f : A −→ [A]<ω , such that {x ∈ A : a ∈ f (x)} ∈ F for all a ∈ A. 14) a) If A is infinite, then there is a regular ultrafilter on A. Hint: Consider a bijection f : A −→ [A]<ω and let Xa := {a ∈ A : a ∈ f (x)} for every a ∈ A. b) If F is a regular ultrafilter, then F is σ-incomplete. 15) If A is denumerable, then every free ultrafilter on A is regular. 16) Assume that A and B are infinite sets and F is an ultrafilter on A. For any functions f, g ∈ A B we define, in analogy to the definition for ideals, f =F g iff {a ∈ A : f (a) = g(a)} ∈ F.
1.8. Clubs and Stationary Sets
93
A B. If [f ] := {g ∈ A B : Show that this gives an equivalence relation on f =F g} is the equivalence class of F , then let a∈A B/F := {[f ] : f ∈ A B} be the set of equivalence classes. Prove: If C is a set with |B| = |C|, then | a∈A B/F | = | a∈A C/F |. If U is a regular ultrafilter on A, then | a∈A B/U | = |B||A| . Hint: For the last assertion, use κ := |A| instead of A and C := {n B : n ∈ ω} instead of B. 17) (Shelah) Assume that F is a filter on an infinite set A. F is called weakly κ-regular iff there is a sequence (Xξ : ξ < κ) of elements of F + such that {Xξ : ξ ∈ N } = ∅ for every N ∈ [κ]ℵ0 . Let
reg∗ (F ) := min{κ : F is not weakly κ-regular}. Prove: The cardinal number reg∗ (F ) exists; furthermore, if ν < reg∗ (F ) is a cardinal, then there exists a ν-regular filter D on A with F ⊆ D. Hint: Let ν ∈ reg∗ (F ) ∩ ICN and (Xξ : ξ < ν) be a sequence of members of F + which witnesses that F is weakly ν-regular. Further let (uξ : ξ < ν) be an enumeration of [ν]<ℵ0 . Put
18)
19)
20)
21)
D := {X ⊆ A : ∃u ∈ [ν]<ℵ0 ∀ξ < ν(u ⊆ uξ =⇒ (A \ Xξ ) ∪ X ∈ F )}. If Yξ := {Xζ : ξ ∈ uζ }, then the sequence (Yξ : ξ < ν) witnesses that D is ν-regular. Let κ be an uncountable regular cardinal and f : κ −→ κ be a normal function. Prove that the set C of all fixed points of f is a club in κ. Hint: It is easy to verify that C is closed. For unboundedness, let σ < κ and define α0 := σ, αn+1 := f (αn ), and α := sup{αn : n ∈ ω}. Assume that α is a limit ordinal and C is a subset of α. Prove that C is closed in α iff, for every sequence of members of C which is bounded in α, its supremum is an element of C. Assume that κ is a cardinal with uncountable cofinality, S ⊆ κ, and (αξ : ξ < cf (κ)) is a normal sequence cofinal in κ. Prove: S is stationary in κ iff {ξ < cf (κ) : αξ ∈ S} is stationary in cf (κ). Assume that κ is an uncountable regular cardinal and S is a subset of κ. Prove that the following assertions are equivalent: (i) S is stationary in κ. (ii) For every regressive function f : S −→ κ there is an ordinal α < κ such that f −1 [α] is unbounded in κ. Hint: Assume that C is a club in κ such that C ∩ S = ∅. Let σ := min(C) and define f : S −→ κ by f (ξ) = 0, if ξ ≤ σ, f (ξ) = sup(C ∩ ξ) otherwise.
94
Chapter 1. Foundations
22) Prove: If λ is a κ-strong cardinal with ℵ0 < κ = cf (λ) < λ, then the set {μ < λ : μ is κ-strong} is a club in λ. Hint: For unboundedness, consider a normal sequence (λξ : ξ < cf (κ)) of singular cardinals less than λ such that λ = sup{λξ : ξ < cf (λ)}, according to 1.6.11. 23) a) If κ is an inaccessible cardinal, then the set {μ < κ : μ is strong limit} is a club in κ0 . b) If κ0 is the smallest inaccessible cardinal, then the set {λ < κ0 : λ is strong limit and singular} is a club in κ. 24) Assume that κ is the α-th inaccessible cardinal, where α < κ. Prove that the set T := {λ < κ : λ is regular} is not stationary in κ. Hint: Observe that the set of inaccessible cardinals less than κ is bounded in κ, and use the previous question. 25) A cardinal κ is called a Mahlo cardinal iff κ is inaccessible and the set {λ < κ : λ is regular} is stationary in κ. Assume that κ is a Mahlo cardinal. Prove that {λ < κ : λ is inaccessible} is stationary in κ, and that κ is the κ-th inaccessible cardinal. 26) Assume that κ := min{λ : λ is the λ-th inaccessible cardinal}. Prove that κ is not a Mahlo cardinal. Hint: Take the order isomorphism of the set of inaccessible cardinals less than κ and use Fodor’s theorem to show that this set is not stationary in κ. 27) Assume that κ is a Mahlo cardinal. Prove that the set {λ < κ : λ is the λ-th inaccessible cardinal} is unbounded in κ. Hint: Take the order isomorphism f of the set of inaccessible cardinals less than κ – f (α) is the α-th inaccessible cardinal – and observe, that the set {ν < κ : f −1 (ν) ≤ ν} is stationary and {ν < κ : f −1 (ν) < ν} is not stationary in κ. 28) Assume that κ is a regular uncountable cardinal, and let Xα := κ \ α for every α < κ. Prove that α<κ Xα = κ and α<κ Xα = ∅.
1.8. Clubs and Stationary Sets
95
29) Assume that κ is a regular uncountable cardinal and (Xα : α < κ) is a family of subsets of κ. a) Let Yα := Xα ∩ (κ \ (α + 1)) for every α < κ. Prove that α<κ Xα = α<κ Yα . b) Prove that α<κ Xα = α<κ (Xα ∪ (α + 1)). 30) Assume that κ is a regular uncountable cardinal, f : κ −→ κ is a normal function and C is the set of fixed points of f which are limit ordinals. Prove that C = α<κ (f (α) + 1, κ)ON . 31) (Jech) Assume that κ and λ are cardinals such that ω < κ ≤ λ and cf (κ) = κ. In analogy to the definitions for cardinals, we call a set C ⊆ [λ]<κ closed in [λ]<κ iff, for every chain K (in the partial order ing ([λ]<κ , ⊆)) of members of C with |K| < κ, we have K ∈ C. C is called unbounded in [λ]<κ iff, for every set X ∈ [λ]<κ , there is a set c ∈ C, so that X ⊆ c. Again, every closed and unbounded subset of [λ]<κ is called a club in [λ]<κ . A set S ⊆ [λ]<κ is called stationary in [λ]<κ iff S ∩ C = ∅ for every club C in [λ]<κ . Prove: a) The intersection of less than κ clubs in [λ]<κ is a club in [λ]<κ . b) If (Cξ : ξ < λ) is a sequence of clubs in [λ]<κ , then the diagonal intersection ξ<λ Cξ := {X ⊆ [λ]<κ : X ∈ {Cξ : ξ ∈ X} } is a club in [λ]<κ . c) If S ⊆ [λ]<κ is stationary in [λ]<κ and Φ : S −→ λ is a choice function for S, then there is a stationary set S0 ⊆ S and an ordinal α, such that ran(Φ |`S0 ) = {α}. Hint: The proof runs parallel to the proof of Lemma 1.8.2 and Theorem 1.8.8. 32) Assume that λ is a cardinal with uncountable cofinality and S is a stationary subset of λ. Prove that S can be partitioned into cf (λ) stationary subsets of λ. Hint: Take a normal function f : cf (λ) −→ λ with sup(ran(f )) = λ and apply Solovay’s theorem.
96
Chapter 1. Foundations
1.9 The Erd¨ os-Rado Partition Theorem There are two versions of the pigeonhole principle, a finite one and an infinite one. Pigeonhole Principle (finite version) If t, k ∈ ω \{0}, and if t·k +1 pigeons fly into k holes, then one hole contains t + 1 pigeons. Pigeonhole Principle (infinite version) If κ is a cardinal and μ an infinite cardinal, and if we partition μ into κ sets, where κ < cf (μ), then one set contains μ members. The finite version of the pigeonhole principle has interesting generalizations. We illustrate this by the following example. At every party of six persons, there are three persons who know each other, or there are three persons who don’t know each other. For a proof let {0, 1, ..., 5} = 6 be the set of participants at the party. We partition the set [6]2 of the subsets of 6 containing two elements into two classes by P0 P1
= {{i, j} ∈ [6]2 : i, j know each other}, = {{i, j} ∈ [6]2 : i, j do not know each other}.
Now we fix some person, without loss of generality the person 0. The set M := {{0, i} : 1 ≤ i < 6} is partitioned by the partition (P0 , P1 ) into two classes. Since |M | = 5, we can infer from the pigeonhole principle that there are three persons i1 , i2 , i3 , so that {0, i1 }, {0, i2 }, {0, i3 } are in the same class, say P0 . If {{i1 , i2 }, {i1 , i3 }, {i2 , i3 }} ∩ P0 = ∅ and, without loss of generality, {i1 , i2 } ∈ P0 , then 0, i1 and i2 know each other. On the other hand, if {{i1 , i2 }, {i1 , i3 }, {i2 , i3 }} ∩ P0 = ∅, then i1 , i2 and i3 do not know each other. Definition Let g : A −→ B be a function. Then we know that the set {g−1 [{b}] : b ∈ ran(g)} is a partition of A; thus we will speak of the partition g. If κ, λ, μ and ν are cardinals such that ν ≤ μ and λ ≤ μ, then we write μ −→ (λ)νκ for the following assertion: If K and M are sets with |M | = μ and |K| = κ, and if f : [M ]ν −→ K is a function, then there is a subset L of M with |L| = λ and an element k0 ∈ K such that f [[L]ν ] = {k0 }. L is called homogeneous with respect to the partition f . In the new notation, our previous example can be written as 6 −→ (3)22 . The pigeonhole principles can be formulated as follows.
1.9. The Erd¨os-Rado Partition Theorem
97
Pigeonhole Principle (finite version) If t, k ∈ ω \ {0}, then t · k + 1 −→ (t + 1)1k . Pigeonhole Principle (infinite version) If κ and μ are cardinal numbers with 1 ≤ κ < cf (μ), then μ −→ (μ)1κ . In this section we will prove, for n < ω and μ ∈ ICN, a theorem of the form (∗)
μ −→ (λ)nκ
=⇒
∃ν ∈ ICN(ν −→ (λ)n+1 ). κ
An essential step of the proof is the following lemma. Lemma 1.9.1 Assume that n ∈ ω and μ ∈ ICN satisfy μ −→ (λ)nκ . Further let ν ∈ ICN and f : [ν]n+1 −→ κ be a function. If (τi : i < μ) is an injective function from μ into ν satisfying f ({τi1 , . . . , τin , τj }) = f ({τi1 , . . . , τin , τin +1 }) for all i1 < . . . < in < j < μ, then there is a set M0 ⊆ {τi : i < μ} with |M0 | = λ, and k < κ such that f [[M0 ]n+1 ] = {k}. Proof Let us assume that a function (τi : i < μ) with the above property exists. If i1 < . . . < in < μ, then we put g({τi1 , . . . , τin }) := f ({τi1 , . . . , τin , τin +1 }). From the assumption μ −→ (λ)nκ we can infer that there is a set M0 ⊆ {τi : i < μ} with |M0 | = λ and k ∈ κ, such that g[[M0 ]n ] = {k}. If i1 < . . . < in < in+1 < μ and τi1 , . . . , τin , τin+1 ∈ M0 , then the assumption about f gives us f ({τi1 , . . . , τin+1 }) = g({τi1 , . . . , τin }) = k. Lemma 1.9.1 shows that, for the solution of (∗), we must solve the following problem: If f : [ν]n+1 −→ κ is a partition, find an injective sequence (τi : i < μ) of elements of ν, such that f ({τi1 , . . . , τin , τj }) = f ({τi1 , . . . , τin , τin +1 }) for all i1 < . . . < in < j < μ. Note that we did not yet say anything about the size of ν. Let us solve the problem with a tree argument.
98
Chapter 1. Foundations
Definition A partial ordering (T, <) is called a tree iff for every x ∈ T the set x ˆ := {y ∈ T : y < x} is well-ordered by <. A branch in (T, <) is a ⊆-maximal chain in (T, <); thus every branch is well-ordered by <. The order type of this well-ordering is the length of the branch. We define the rank function ρ : T −→ ON of (T, <) by ρ(x) := sup{ρ(y) + 1 : y ∈ T ∧ y < x}. The ordinal α := sup{ρ(x) + 1 : x ∈ T } =: l(T ) is called the length of the tree. An α-tree is a tree of length α. The set Sβ := {x ∈ T : ρ(x) = β} is the β-th level of (T, <). Note that Sβ = ∅ iff β ≥ l(T ). To prove a theorem of the form (∗), let us assume that f : [ν]n+1 −→ κ is a partition and ν ∈ ICN is chosen large enough to carry through the following construction. We define by recursion a tree T of length μ whose elements are nonempty subsets of ν, and define the relation < by A < B :⇐⇒ A B. It is our aim that, for all α < μ, we can arrange the following for the levels Sα of the tree (T, <). (i) Sα = ν \ {min(A) : A ∈ {Sβ : β < α} }. (ii) Any two different elements of Sα are disjoint. (iii) If ξ < α and B ∈ Sα , then there is a unique set A ∈ Sξ with A < B. For this, we define by recursion the levels Sα of the tree T . We put S0 = {ν}. For the successor step, let us assume that Sξ is already defined and satisfies properties (i)–(iii) for all ξ with ξ ≤ α. If B ∈ Sα , then, by (i)–(iii), there exists a unique chain of sets such that ν = A0 A1 . . . Aξ . . . Aα = B and Aξ ∈ Sξ for all ξ ≤ α. We put τξ := min(Aξ ) for ξ ≤ α and define on B \ {τα } a relation ∼B by ρ ∼B σ :⇐⇒ f ({τξ1 , . . . , τξn , ρ}) = f ({τξ1 , . . . , τξn , σ}) for all ξ1 < . . . < ξn ≤ α. It is easy to check that ∼B is an equivalence relation. Let EB be the set of its equivalence classes, and let Sα+1 := {EB : B ∈ Sα } be the α + 1-th level of T . By construction, Sα+1 satisfies properties (i)–(iii). We will give an estimate for |Sα+1 |. Obviously we have |Sα+1 | = (|EB | : B ∈ Sα ). For B ∈ Sα and ρ ∈ B \ {τα } we consider the function gρ : [{τξ : ξ ≤ α}]n −→ κ, defined by the equation gρ ({τξ1 , . . . , τξn }) := f ({τξ1 , . . . , τξn , ρ}). Since ρ ∼B σ iff gρ = gσ , the number of equivalence classes is majorized by
1.9. The Erd¨os-Rado Partition Theorem
99
the number of functions from [{τξ : ξ ≤ α}]n into κ, and thus, using Theorem 1.5.14, by κmax{ℵ0 ,|α|} . So we get (iv) |Sα+1 | ≤ |Sα | · κ|α|+ℵ0 ∧ (κ < ℵ0 ∧ α < ℵ0 =⇒ |Sα+1 | < ℵ0 ). Now let α < μ be a limit ordinal. Take h(ξ) : h ∈ Sξ } \ {∅}. Sα := { ξ<α
ξ<α
Putting Tα := {Sξ : ξ < α}, we can infer from property (ii) that Sα is the set of nonempty intersections of branches of length α in the tree Tα . Using transfinite induction, we show that properties (i)–(iii) hold for Sα . So assume that they are satisfied for every level Sξ , ξ < α. For (i), let ρ ∈ ν \ {min(A) : : A ∈ A ∈ ξ<α Sξ }. If ξ < α, then ρ ∈ ν \ {min(A) β<ξ Sβ }, and thus the inductive hypothesis and (i) give ρ ∈ Sξ . By (ii), there is a unique set Aξ satisfying Aξ ∈ Sξ and ρ ∈ Aξ .Let the function h ∈ ξ<α Sξbe defined by h(ξ) := Aξ for ξ < α. Then ρ ∈ {h(ξ) : ξ < α}, and thus ρ ∈ Sα . For the proof of the reverse inclusion, let ρ ∈ Sα . Then there is a function h ∈ ξ<α Sξ such that ρ ∈ {h(ξ) : ξ < α}. Fix ξ < α. If A ∈ Sξ and A = h(ξ), then ρ ∈ A by (ii), and thus ρ = min(A). If A ∈ Sξ and A = h(ξ), then min(A) = min(h(ξ)) ∈ h(ξ + 1) by (i), and from ρ ∈ h(ξ +1) we can conclude that ρ = min(A). This shows that ρ ∈ ν \ {min(A) : A ∈ {Sξ : ξ < α}}, and (i) is proved for Sα . Properties (ii) and (iii) follow from the inductive hypothesis and the construction. Altogether we have shown that (T, <) is a tree with the desired properties. It is obvious that (v) Lim(α) =⇒ |Sα | ≤ ξ<α |Sξ |. Let us assume that T is a μ-tree. If we can show that T possesses a branch (Ai : i < μ) of length μ, we can complete the proof of (∗). In this case put τi := min(Ai ) for each i < μ. Assume that i1 < . . . < in < j < μ. Then in + 1 ≤ j, and from Aj ⊆ Ain and Ain +1 ⊆ Ain we can infer that τj , τin +1 ∈ Ain . Consequently, τj and τin +1 are elements of the same equivalence class, that means we have f ({τi1 , . . . , τin , τj }) = f ({τi1 , . . . , τin , τin +1 }). Now, assuming μ −→ (λ)nκ , we can apply Lemma 1.9.1, and (∗) is proved. There remains to show, under an appropriate choice of ν, that T has a branch of length μ. First, we prove two lemmas, due to D. K¨ onig and Ramsey. Lemma 1.9.2 (D. K¨onig) If T is an ω-tree with finite levels only, then T has a branch of length ω.
100
Chapter 1. Foundations
Proof As usual let Sn , n ∈ ω, be the levels of T . By induction, we define an ω-branch (xi : i < ω) of T . Since T is infinite and S0 is finite, we can choose x0 ∈ S0 such that |{x ∈ T : x0 < x}| = ℵ0 , using the pigeonhole principle. Assume that xn ∈ Sn with |{x ∈ T : xn < x}| = ℵ0 is already defined. Applying the previous argument to the sets {x ∈ T : xn < x} and Sn+1 , we obtain an element xn+1 of Sn+1 satisfying xn < xn+1 and |{x ∈ T : xn+1 < x}| = ℵ0 . The sequence (xn : n < ω) is a branch of T of length ω. Theorem 1.9.3 (Ramsey) If k, n ∈ ω \ {0}, then ℵ0 −→ (ℵ0 )nk . Proof Consider the above construction of the tree T and take μ = ℵ0 , ν = ℵ0 and κ = k < ω. Property (iv) shows that every level of the tree T is finite, hence T is an ω-tree. Lemma 1.9.2 says that T has an ω-branch, and so we can conclude that ℵ0 −→ (ℵ0 )nk
=⇒
ℵ0 −→ (ℵ0 )n+1 . k
Since ℵ0 −→ (ℵ0 )1k is obviously true, an (n − 1)-times application of this assertion proves the lemma. Theorem 1.9.4 (Erd¨ os and Rado) Assume that μ and λ are infinite cardinals with λ ≤ μ. Let further κ be a cardinal with 0 < κ < μ and n ≥ 1 be a natural number. Then μ −→ (λ)nκ
=⇒
(2<μ )+ −→ (λ)n+1 . κ
Proof If μ = ℵ0 , then λ = ℵ0 , since λ ≤ μ. The proof of Theorem 1.9.3 shows that , ℵ0 −→ (ℵ0 )nκ =⇒ ℵ0 −→ (ℵ0 )n+1 κ and thus all the more ℵ0 −→ (ℵ0 )nκ
=⇒
(2<ℵ0 )+ −→ (ℵ0 )n+1 . κ
So we can assume that μ > ℵ0 . Let T be the μ-tree constructed above. We use induction on α to show that |Sα | ≤ 2|α|+ℵ0 +κ for all α < μ. Clearly, |S0 | = 1 < 2ℵ0 +κ . For the successor step we obtain, using property (iv): |Sα+1 | ≤ |Sα | · κ|α|+ℵ0 ≤ 2|α|+ℵ0 +κ · κ|α|+ℵ0 +κ = 2|α|+ℵ0 +κ = 2|α+1|+ℵ0 +κ . If α < μ is a limit ordinal, we canconlude with property (v) that |Sα | ≤ ξ<α |Sξ | ≤ ξ<α 2|ξ|+ℵ0 +κ ≤ ξ<α 2|α|+ℵ0 +κ = 2|α|+ℵ0 +κ . So we get | {Sα : α < μ}| ≤ μ · sup{|Sα | : α < μ} ≤ μ · sup{2|α|+ℵ0 +κ : α < μ} ≤ μ · 2<μ = 2<μ , where the last equation follows from Corollary 1.6.5.
1.9. The Erd¨os-Rado Partition Theorem
101
Now we put ν := (2<μ )+ and define Sμ := { h(ξ) : h ∈ Sξ } \ {∅}. ξ<μ
ξ<μ
As in the proof of (i) it can be shown that Sμ = ν \ {min(A) : A ∈ {Sξ : ξ < μ} }. Clearly we have |{min(A): A ∈ {Sξ : ξ < μ} }| ≤ | {Sξ : ξ < μ}| ≤ 2<μ . So the choice of ν yields Sμ = ∅, hence Sμ = ∅, and therefore T has a branch (Aξ : ξ < μ) of length μ. The above considerations show that this completes the proof of the theorem. Corollary 1.9.5 (Erd¨ os and Rado) If κ is an infinite cardinal number, then (2κ )+ −→ (κ+ )2κ . Proof Obviously, we have κ+ −→ (κ+ )1κ , and from Theorem 1.9.4 we can + + infer that (2<κ )+ −→ (κ+ )2κ . Since 2<κ = 2κ , the assertion is proved. Exercises 1) Every infinite partial ordering has an infinite chain or an infinite antichain. Hint: Use Ramsey’s theorem. 2) Show that 2κ −→ (3)2κ for all cardinals κ ≥ 1. 3) Assume that κ is an infinite cardinal, and let expn (κ) be defined by exp0 (κ) := κ and expn+1 (κ) := 2expn (κ) for n ∈ ω. Show that (expn (κ))+ −→ (κ+ )n+1 . κ Hint: Use Theorem 1.9.4. 4) Assume that κ ∈ ICN and f : [κ]2 −→ 2 is a partition. Prove: If there exists, for every set A ∈ [κ]κ , a member a of A such that |{x ∈ A : f ({a, x}) = 1}| = κ, then there is a set C ∈ [κ]ℵ0 such that ran(f |`[C]2 ) = {1}. 5) (Dushnik, Miller) Assume that κ ∈ ICN and f : [κ]2 −→ 2 is a partition. Show that there is a subset X of κ such that |X| = κ and ran(f |`[X]2 ) = {0} or |X| = ℵ0 and ran(f |`[X]2 ) = {1}. Hint: Assume that the assertion is true for all μ ∈ κ ∩ ICN and that there no set C ∈ [κ]ℵ0 such that ran(f |` [C]2 ) = {1}. By Exercise 4 there is a set A ∈ [κ]κ such that |{α ∈ A : f ({a, α}) = 1}| < κ for every a ∈ A. Now distinguish the cases that κ is regular and κ is singular and apply the inductive hypothesis in the second case.
102
Chapter 1. Foundations
6) Show that there is a partition f : [ω]<ω −→ {0, 1} such that, for every infinite subset x of ω, f −1 [{0}] ∩ [x]<ω = ∅ = f −1 [{1}] ∩ [x]<ω . So we get ω −→ (ω)<ω 2 . Hint: If x ∈ [ω]<ω , consider the property |x| ∈ x. 7) Show that there is a partition f : [ω]ω −→ {0, 1} such that, for every infinite subset x ⊆ ω, f −1 [{0}] ∩ [x]ω = ∅ = f −1 [{1}] ∩ [x]ω . So we get ω −→ (ω)ω 2. Hint: Choose a well-ordering ≺ of [ω]ω and consider the property of a set y ∈ [ω]ω that there is a set z ∈ [y]ω with z ≺ y. 8) Show that there is a partition f : [R]2 −→ {0, 1} such that, for every subset x of R with |x| = ℵ1 , f −1 [{0}] ∩ [x]2 = ∅ = f −1 [{1}] ∩ [x]2 . So we get 2ℵ0 −→ (ℵ1 )22 . In particular, the obvious generalization of Ramsey’s theorem, namely ℵ1 −→ (ℵ1 )22 , is false. Hint: Let < be the usual ordering on R and <∗ be a well-ordering of R. If {x, y} ∈ [R]2 and x < y, then x <∗ y or y <∗ x. 9) (Kurepa, Sierpinski) For every infinite cardinal κ, 2κ −→ (κ+ )22 . Hint: In the exercises of Section 1.5 we have seen that there is no strictly increasing or decreasing sequence of length κ+ in P := κ {0, 1} under the lexicographical ordering. Let 2κ =: λ and {fα : α < λ} be an enumeration of κ {0, 1}, and take ≺ as the linear ordering on λ induced by the lexicographical ordering on P . Now define a partition by F ({α, β}) := 1 iff α ∈ β and α ≺ β, F ({α, β} := 0 otherwise. 10) A cardinal κ is called weakly compact iff it is uncountable and satisfies the partition property κ −→ (κ)22 . Prove that every weakly compact cardinal is inaccessible. Hint: To show that κ is regular, assume that κ is the disjoint union of nonempty sets Aξ , ξ < λ, where λ < κ and |Aξ | < κ for all ξ < λ, and consider the partition of [κ]2 given by this partition of κ. To show that κ is strong limit, assume that κ ≤ 2λ for some λ < κ, and use the previous question. Remark An infinite cardinal κ is called a Ramsey cardinal iff it satisfies the partition property κ −→ (κ)<ω 2 . Exercise 6 shows that ω is not a Ramsey cardinal. One can prove (see for example Jech’s book [Je2]): Every measurable cardinal is a Ramsey cardinal, and every Ramsey cardinal is weakly compact and hence inaccessible, see above.
Chapter 2 The Galvin-Hajnal Theorem The so-called singular cardinal problem consists of the description of the poscf(ℵ ) sible size of the cardinal ℵη η , that is (גℵη ), the value of the gimel function at the argument ℵη , for singular cardinals ℵη . An estimate for this cardinal power is given by the Galvin-Hajnal theorem if ℵη is an ℵ0 -strong singular cardinal with uncountable cofinality. The centre of our investigations will be the Galvin-Hajnal formula, from which all other results on cardinals in this chapter will follow. For the first time it turns out that a profound cardinal property is a source of cardinal arithmetic.
2.1 Ideals and the Reduction of Relations In the following let A be a nonempty set and I be an ideal on A, that is a nonempty set of subsets of A which does not contain the member A and is closed under finite unions and under inclusions. Any ideal on A provides us with a measure of the size of a set. Elements of I are subsets of A which we can regard as small. We also say that they are of measure zero modulo I. If κ is an uncountable regular cardinal, then Ib (κ) and Id (κ), the set of bounded and the set of thin subsets of κ respectively, are two ideals on κ which will play an important role in this book. We remindthe reader of some denotations. If I is an ideal on the set A, then dom(I) := I is the domain of I and I + := {X ⊆ A : X ∈ I} is the set of subsets of A which are positive modulo I. We say that the sets X ∈ I are null sets or of measure zero modulo I. Any union of two positive sets or null sets is positive or a null set, respectively, any intersection of two null sets is a null set, subsets of null sets are null sets, and supersets of positive sets are positive. If X is positive and Y is a null set, then X \ Y is positive. Since I = P(A), the
104
Chapter 2. The Galvin-Hajnal Theorem
set (A \ X) ∩ (A \ Y ) is positive for any null sets X and Y . Note that X and A \ X can both be positive. Definition We say that a property ϕ(a) holds modulo I for almost all a ∈ A iff the set {a ∈ A : ¬ϕ(a)}, that means the set of exceptions, is a member of I. The elements of the set I + := {X ⊆ A : X ∈ I} are called I-positive sets or sets of positive measure modulo I. Furthermore we say that an ideal J extends an ideal I iff I ⊆ J. Often we will consider ultrafilters instead of maximal ideals. If D is an ultrafilter on A and I is an ideal on A with D ∩ I = ∅, then I is a subset of the maximal ideal dual to D. This justifies the phrase D extends I for ultrafilters D on A with D ∩ I = ∅. To give an example, let us consider the assertion B ⊆I C. It is to be read as “B is a subset of C modulo I”, for B and C subsets of A. B ⊆I C means that modulo I for almost all a ∈ A the implication a ∈ B =⇒ a ∈ C is true. We are mainly interested in such properties later on, when we will investigate products of structures and especially products of ordinals with the standard well-ordering ∈. Definition Let A be a nonempty set. Remember that we have called functions from A into ON ordinal functions on A. We will omit the addition “on A” when the context makes it plain which basic set is meant. Usually, we denote ordinal functions by f, g, h, also with indices. In this chapter, families of almost disjoint functions F, G, . . ., whose members we also denote by f, g, . . ., will play an important role. Therefore we will denote in this chapter, and sometimes in later chapters, ordinal functions also by Φ and Ψ. If f and g are ordinal functions on A and I is an ideal on A, then we say that f is modulo I less than g, and write f
2.1. Ideals and the Reduction of Relations B ⊆I C B =I C f =I g f ≤I g f
:⇐⇒ :⇐⇒ :⇐⇒ :⇐⇒ :⇐⇒ :⇐⇒
105
B \ C ∈ I, (B \ C) ∪ (C \ B) ∈ I, {a ∈ A : f (a) = g(a)} ∈ I, {a ∈ A : g(a) < f (a)} ∈ I, {a ∈ A : g(a) ≤ f (a)} ∈ I, f ≤I g ∧ ¬(f =I g).
Remark The definition of the relation I is a bit out of the ordinary, since it is not a property that holds almost everywhere, but only a property that holds for all members of an I-positive set. We have included it for reasons which will be discussed later on. Lemma 2.1.1 Assume that A is a nonempty set and I is an ideal on A. Then for all subsets B, C and D of A, the following holds. 1. 3. 5. 7. 9.
B =I B. B =I C ∧ C =I D =⇒ B =I D. B ⊆I B. B ⊆ C =⇒ B ⊆I C. B ⊆I C ⇐⇒ A \ C ⊆I A \ B.
2. 4. 6. 8. 10.
B =I C =⇒ C =I B. B = C =⇒ B =I C. B ⊆I C ∧ C ⊆I D =⇒ B ⊆I D. B =I C ⇐⇒ B ⊆I C ∧ C ⊆I B. B ⊆I C ∧ C ∈ I =⇒ B ∈ I.
Lemma 2.1.2 Assume that A is a nonempty set and I is an ideal on A. Then for all ordinal functions f , g and h on A, the following holds. 2. f =I g =⇒ g =I f. 1. f =I f. 3. f =I g ∧ g =I h =⇒ f =I h. 4. f = g =⇒ f =I g. 5. f ≤I f. 6. f ≤I g ∧ g ≤I f ⇐⇒ f =I g. 8. f ≤ g =⇒ f ≤I g. 7. f ≤I g ∧ g ≤I h =⇒ f ≤I h. 10. ¬(f
106
Chapter 2. The Galvin-Hajnal Theorem
Lemma 2.1.3 Assume that A is a nonempty set, I is an ideal on A, and J is an ideal on A extending I. Furthermore let ϕ(x) be a formula such that ϕ(a) holds modulo I for almost all a ∈ A. Then ϕ(a) holds modulo J for almost all a ∈ A. In particular this applies to maximal ideals J which are dual to ultrafilters extending I. Thus, if D is an ultrafilter on A extending I, then {a ∈ A : ϕ(a)} ∈ D . Remark By the previous lemma, the relations =I , ⊆I , ≤I and
2.1. Ideals and the Reduction of Relations
107
Lemma 2.1.5 Let A be a nonempty set and D be an ultrafilter on A. If f and g are ordinal functions on A, then a) b) c) d)
f f f f
≤D ≤D
g g g g
∨ g ≤D f . ⇐⇒ f
Exercises 1) Show: If I is an ideal on A and X ∈ I, then X ⊆I Y for every subset Y of A. 2) Show: If I is an ideal on A, X ∈ P(A) \ I, and Z ∈ I, then I |`(X ∪ Z) = I |`X. 3) Assume that I is an ideal on A and X1 , X2 ∈ P(A) \ I. Show that I |`(X1 ∪ X2 ) = I |`X1 ∩ I |`X2 . 4)
a) Give examples of a set A, an ideal I on A, and functions f, g ∈ A ON such that a1) f I g and not f
b) Prove that the relations I and
7) Assume that I is an ideal on A. Show that I is principal iff I ∈ I. 8) Assume that A is an infinite set and B is a nonempty subset of A. Further let I be an ideal on B and, for each b ∈ B, Ib be an ideal on A. Prove that J := {X ⊆ A : {b ∈ B : X ∈ Ib } ∈ I} is an ideal on A.
108
Chapter 2. The Galvin-Hajnal Theorem
9) If I is an ideal on the cardinal κ, then 0 is not an element of any diagonal union. 10) Assume that I is an ideal on A, γ is an ordinal, and (dα : α < γ) is a sequence of I-positive subsets of A such that dβ ⊆I dα for all α, β ∈ γ with α < β. Prove that there is an ultrafilter D on A such that D ∩ I = ∅ and dα ∈ D for all α < γ. Hint: Prove that {dα : α < γ} ∪ {Y ⊆ A : A \ Y ∈ I} has the finite intersection property. 11) If κ is a singular cardinal, then there is no normal ideal on κ which contains all bounded subsets of κ. Hint: As usual, κ is the supremum of a strictly increasing sequence (κα : α < cf (κ)) of cardinals with κ0 ≥ cf (κ). Assume that there is such an ideal. Consider the sequence (Xα : α < κ), where Xα := κα for α < cf (κ), and show that κ \ cf (κ) ⊆ α α : fη (α) = ξ}. The coefficients in the columns of this matrix are pairwise disjoint subsets of κ. For every α < κ we have {Xα,ξ : ξ < λ} = (α, κ)ON . Since (α, κ)ON ∈ I, there is ξα < λ such that Xα,ξα ∈ I. 13) Assume that κ is a singular cardinal. Show that every κ-complete ideal on κ is principal. Hint: If I is a κ-complete ideal on κ, then note that α ∩ I ∈ I for every α < κ and show that I ∈ I.
2.2 The Galvin-Hajnal Formula Definition Every function K : A −→ P(A) is called a set function. We call a subset B of A independent with respect to the set function K iff x ∈ K(y) for all x, y ∈ B with x = y. We can interpret a set function as a function which assigns to each x ∈ A the set of people which are known to x, where this relation needs not be symmetric. An independent set can then be interpreted as a subset of A all of whose members do not know each other. Note that ∅ is independent and that the set of independent subsets of A is closed under union of chains. By Zorn’s lemma, there exists an ⊆-maximal independent subset of A; by the same reasons, we obtain, for any subset Y of A, an independent subset of A which is ⊆-maximal w.r.t. the property of being disjoint to Y .
2.2. The Galvin-Hajnal Formula
109
Lemma 2.2.1 (L´az´ar) Assume that κ is a regular and λ is a – finite or infinite – cardinal with λ < κ, A is a set with |A| = κ, and K : A −→ P(A) is a set function such that |K(x)| < λ for all x ∈ A. Then there is a subset B of A of cardinality κ which is independent w.r.t. K.1 Proof For any subset X of A let Xu := {a ∈ A : K(a) ∩ X = ∅} be the set of members a of A who do not know any member of X. We call X popular iff |Xu | < κ and unpopular iff |Xu | = κ. Further let kX := {K(x) : x ∈ X} be the set of members of A which are known to members of X. If |X| < κ, then by the assumption on K we have |kX | < κ since κ is regular. First we notice the following fact: If Z ⊆ A is independent and unpopular, |Z| < κ, Y ⊆ A, |Y | < κ, and Z ∩ Y = ∅, then Zu \ (kZ ∪ Y ∪ Z) = ∅. If we take a member z of this set, we have K(z) ∩ Z = ∅ and z ∈ kZ ∪ Y . Thus Z ∗ := Z ∪ {z} is independent and satisfies Z ∗ ∩ Y = ∅. If we can choose Y in such a way that |Y | < κ and Z ∩ Y = ∅ implies that Z is unpopular, then any ⊆-maximal independent set Z disjoint from Y , which exists by Zorn’s lemma, must be of size κ. It is clear that the condition Z ∩ Y = ∅ implies that Z is unpopular if Y is the union of an ⊆-maximal set of pairwise disjoint popular sets which again exists by Zorn’s lemma. If we can show that |Y | < κ for such a set Y , we get the desired result. So assume that P is a set of pairwise disjoint popular sets such that |P| = λ. The set W := {Xu : X ∈ P} is of size less than κ since κ is regular. Choose y ∈ A\W . Then K(y)∩X = ∅ for all X ∈ P, and consequently K(y) includes a set of representatives for P. So we get |P| ≤ |K(y)| < λ. This contradiction shows that |P| < λ for every ⊆-maximal set Pof pairwise disjoint popular sets. Thus we can choose such a set P, and Y := P has the desired properties. Lemma 2.2.2 If I is a σ-complete ideal on A and α is an ordinal, then the relation
singular cardinals this was proved by A. Hajnal.
110
Chapter 2. The Galvin-Hajnal Theorem
Definition Let α be an ordinal and I be a σ-complete ideal on the set A. Lemma 2.2.2 says that α, #Φ#I,α = #Φ#I,β . Proof We prove the assertion by transfinite induction on the well-founded relation
a) b) c) d)
Proof For c), assume that Φ1 ≤I Φ2 . Then, by Lemma 2.1.2, #Φ1 #I = sup{#Ψ#I + 1 : Ψ
2.2. The Galvin-Hajnal Formula
111
By the definition of #Φ#, there is a function Ψ0 ∈ A α such that Ψ0 ω is a regular cardinal, Φ ∈ κ ON, and I is a κ-complete normal ideal on κ with dom(I) = κ. Then, for every ordinal σ < κ, #Φ#I ≤ σ
⇐⇒
Sσ := {ξ < κ : Φ(ξ) ≤ σ} ∈ I + .
Proof Let σ < κ and first #Φ#I ≤ σ. Assume, to get a contradiction, that Sσ ∈ I. We put Ψη := κ × {η} for all η < κ. Then Ψη
112
Chapter 2. The Galvin-Hajnal Theorem
by the inductive hypothesis. These considerations hold for all Ψ with Ψ
In the case that σ ∈ ON and Ψ ∈ κ ON is defined by Ψ(ξ) = σ for all ξ < κ, we write T (κ, ℵσ ) instead of T (ℵ ◦ Ψ). Theorem 2.2.6 (Galvin-Hajnal Formula) Assume that κ > ω is a regular cardinal and I is a κ-complete normal ideal on κ with dom(I) = κ. Further let (η(ξ) : ξ < κ) be an increasing continuous sequence of ordinals and ℵΘ := 2κ · sup{T (κ, ℵη(ξ) ) : ξ < κ}. If Φ ∈ κ ON is a function and Ψ ∈ κ ON is defined by Ψ(ξ) := η(ξ) + Φ(ξ), then T (ℵ ◦ Ψ) ≤ ℵΘ+ Φ I .
Proof 2 Let F ⊆ ξ<κ ℵη(ξ)+Φ(ξ) be a set of almost disjoint functions. To show that T (ℵ ◦ Ψ) ≤ ℵΘ , we use transfinite induction on the ordinal #Φ#I and will distinguish the cases #Φ#I = 0 and #Φ#I > 0. In the first case, we will represent F, using the fundamental property of normal ideals given by Lemma 1.8.9, as a union of sets FX,β for certain sets X ⊆ κand ordinals ⊆ ξ∈κ ℵη(β) of β < κ. FX,β can be mapped one-to-one onto a set FX,β almost disjoint functions. This will already motivate the choice of Θ: There are at most 2κ such pairs (X, β), and the definition of T (κ, ℵη(β) ) will yield |FX,β | ≤ T (κ, ℵη(β) ), hence |F| ≤ 2κ · sup{T (κ, ℵη(ξ) ) : ξ < κ} = ℵΘ . The proof of the second case is more complicated and will apply two combinatorial results, Lemma 2.2.1 and the Erd¨ os-Rado theorem. Case 1 #Φ#I = 0. Observe first that Lemma 1.8.6 says that Ib (κ) ⊆ I, hence every set X ∈ I + has cardinality κ. Together with Lemma 2.2.5, Case 1 gives {ξ < κ : Φ(ξ) = 0} ∈ I + . By Lemma 1.8.6, the set {ξ +1 : ξ < κ} is a member of I. Furthermore dom(I) = κ yields {0} ∈ I, and consequently we have X0 := {ξ < κ : Φ(ξ) = 0 ∧ Lim(ξ)} ∈ I + . 2 We
follow the proof in [GH].
2.2. The Galvin-Hajnal Formula
113
Fix f ∈ F. Since F ⊆ ξ<κ ℵη(ξ)+Φ(ξ) , we get f (ξ) < ℵη(ξ) for any ξ ∈ X0 . By assumption, the function (η(ξ) : ξ < κ) is continuous, and so there is an ordinal αf (ξ) < ξ such that f (ξ) < ℵη(αf (ξ)) . Thus we obtain the regressive function (αf (ξ) : ξ ∈ X0 ), and from Lemma 1.8.9 and the fact that I is normal we can conclude that there is a set Xf ∈ P(X0 ) \ I and an ordinal βf < κ such that αf (ξ) = {βf } for all ξ ∈ Xf , hence f |`Xf ∈ ξ∈Xf ℵη(βf ) . Fix X ∈ P(X0 ) \ I and β < κ and let FX,β := {f ∈ F : f |`X ∈ ℵη(β) }. ξ∈X := Every member of P(X0 ) \ I is unbounded in κ, hence we obtain via FX,β {f |` X : f ∈ FX,β } a set of almost disjoint functions with |FX,β | = |FX,β |, included in ℵ . Any bijection from X onto κ induces a bijection from η(β) ξ∈X ξ∈X ℵη(β) onto ξ<κ ℵη(β) which preserves the property of two functions of being almost disjoint since κ is regular. Therefore we get |FX,β | ≤ T (κ, ℵη(β)) ≤ ℵΘ . Since F = {FX,β : X ∈ P(X0 ) \ I and β < κ} and there are only 2κ such pairs (X, β), our assertion is proved for the case #Φ#I = 0. Case 2 #Φ#I =: α > 0. κ Let us assume that the assertion is true for every function Φ ∈ ON with #Φ #I < α. Again we want to represent our given set F ⊆ ξ<κ ℵη(ξ)+Φ(ξ) of almost disjoint functions as a union of sets which are not too large; more precisely, as the union of |α| sets, since |α| ≤ α ≤ ℵΘ+ Φ I . Fix f ∈ F. If Φ(ξ) = 0, then there is a least δ < Φ(ξ) such that |f (ξ)| ≤ ℵη(ξ)+δ . But the assumption #Φ#I > 0 implies {ξ < κ : Φ(ξ) = 0} ∈ I by Lemma 2.2.5, and thus Φ(ξ) > 0 holds modulo I for almost all ξ < κ. So we can conclude, if we define functions Φf ∈ κ ON and Ψf ∈ κ ON by
Φf (ξ) := min{δ : |f (ξ)| ≤ ℵη(ξ)+δ } and Ψf (ξ) := η(ξ) + Φf (ξ), that Φf (ξ) < Φ(ξ) holds modulo I for almost all ξ <κ. Thus we get Φf
114
Chapter 2. The Galvin-Hajnal Theorem
f , we have g ∈ ξ<κ (f (ξ)+1). If ξ < κ, then we know that |f (ξ)| ≤ ℵη(ξ)+Φf (ξ) and can choose an injection iξ from f (ξ)+1 into ℵη(ξ)+Φf (ξ) . For each g ∈ P r(f ) we can define a function g∗ ∈ ξ<κ ℵη(ξ)+Φf (ξ) by g ∗ (ξ) := iξ (g(ξ)). If we put )| = |P r∗ (f )|, and P r∗ (f ) is a set P r∗ (f ) := {g ∗ : g ∈ P r(f )}, then |P r(f of almost disjoint functions included in ξ<κ ℵη(ξ)+Φf (ξ) . From #Φf #I < α and the inductive hypothesis we infer that |P r(f )| = |P r ∗ (f )| ≤ T (ℵ ◦ Ψf ) ≤ ℵΘ+ Φf I = ℵΘ+σ . Now we can apply our combinatorial results. Let us assume, to get a contradiction, that |Fσ | ≥ ℵΘ+σ+2 for some σ < α. Without loss of generality let |Fσ | = ℵΘ+σ+2 , since otherwise we could take a suitable subset of Fσ . Then |Fσ | is a regular cardinal, and we have shown that the assumptions of Lemma 2.2.1 are satisfied if we choose the set function P r : Fσ −→ P(Fσ ) which we have defined by P r(f ) = {g ∈ Fσ : g ≤κ f }, since |P r(f )| ≤ ℵΘ+σ for all f ∈ Fσ . Consequently there exists a subset of Fσ with cardinality ℵΘ+σ+2 which is independent with respect to P r. By the definition of Θ, we have ℵΘ+σ+2 > 2κ , and so there is an injective sequence (fξ : ξ < (2κ )+ ) of elements of Fσ such that fζ ∈ P r(fξ ) for any ζ and ξ with ζ < ξ < (2κ )+ . The last assertion implies that there is a smallest ordinal l(ζ, ξ) < κ such that fζ (l(ζ, ξ)) > fξ (l(ζ, ξ)). By this property, a function l : [(2κ )+ ]2 −→ κ is defined. Now the Erd¨ os-Rado theorem, Corollary 1.9.5, says that (2.1) (2κ )+ −→ (κ+ )2κ . Consequently there is a set A ⊆ (2κ )+ with |A| = κ+ and an ordinal γ < κ satisfying ran(l |`[A]2 ) = {γ}. In particular, we can choose a strictly increasing sequence (ξn : n < ω) of members of A. Then, by construction, (fξn (γ) : n ∈ ω) is a strictly decreasing sequence of ordinals. This contradiction completes the proof of the case #Φ#I > 0 and the proof of the theorem. Lemma 2.2.7 Let κ be an infinite cardinal and(γ(ξ) : ξ < κ) be a sequence of ordinals. Then there is a set F ⊆ α<κ ( ξ<α ℵγ(ξ) ) of almost disjoint functions such that |F| = ℵγ(ξ) . ξ<κ
Proof We put μ := | ξ<κ ℵγ(ξ) | and choose an enumeration (gξ : ξ < μ) of the cartesian product ξ<κ ℵγ(ξ) . For ξ < μ let the function fξ ∈ ( ℵ ) be defined by fξ (α) = gξ |` α. Then F = {f α<κ ξ<α γ(ξ) ξ : ξ < μ} is a set of almost disjoint functions, and in particular |F| = μ = ξ<κ ℵγ(ξ) .
2.2. The Galvin-Hajnal Formula
115
Theorem 2.2.8 Assume that κ is an uncountable regular cardinal, I is a normal κ-complete ideal on κ with dom(I) = κ, (η(ξ) : ξ < κ) is an increasing continuous sequence of ordinals, and ℵΘ := 2κ · sup{T (κ, ℵη(ξ) ) : ξ < κ}. If Φ ∈ κ ON and (ℵγ(ξ) : ξ < κ) is a sequence of cardinals satisfying
ℵγ(ξ) ≤ ℵη(α)+Φ(α)
ξ<α
for all α < κ, then
ℵγ(ξ) ≤ ℵΘ+ Φ I .
ξ<κ
Proof By Lemma 2.2.7, there is a set F of almost disjoint functions satisfying ( ℵγ(ξ) ) and |F| = ℵγ(ξ) . F⊆
α<κ ξ<α
ξ<κ
Since ξ<α ℵγ(ξ)≤ ℵη(α)+Φ(α) , there is a set F of almost disjoint functions such that F ⊆ α<κ ℵη(α)+Φ(α) and |F| = |F |. If Ψ ∈ κ ON is defined by Ψ(ξ) := η(ξ) + Φ(ξ), then T (ℵ ◦ Ψ) ≤ ℵΘ+ Φ I by Theorem 2.2.6, and with |F | ≤ T (ℵ ◦ Ψ) the assertion of the theorem follows. It is obvious that an estimate for #Φ#I would improve the preceding theorem. We will obtain such an estimate in Lemma 2.2.10. For its proof we need the following technical lemma. Lemma 2.2.9 Assume that A is a nonempty set, I is a σ-complete ideal on A, Φ ∈ A ON is a function, and X, Y ∈ I + . Then a) If X ⊆ Y , then #Φ#I |`Y ≤ #Φ#I |`X . b) If Z ∈ I, then #Φ#I |`(X∪Z) = #Φ#I |`X . c) #Φ#I |`(X∪Y ) = min{#Φ#I |`X , #Φ#I |`Y }. Proof For part a), we have I |` Y = I[A \ Y ] ⊆ I[A \ X] = I |` X, and therefore Ψ
116
Chapter 2. The Galvin-Hajnal Theorem For c), we note that part a) implies
(1)
#Φ#I |`(X∪Y ) ≤ min{#Φ#I |`X , #Φ#I |`Y }.
We prove the remaining inequality (2)
min{#Φ#I |`X , #Φ#I |`Y } ≤ #Φ#I |`(X∪Y )
by transfinite induction on the well-founded relation
#Φ#I |`X ≤ #Φ#I |`(X∪Y ) .
On account of #Φ#I |`X = sup{#Ψ#I |`X + 1 : Ψ
Ψ
So assume that Ψ
Ψ
By the inductive hypothesis, we have #Ψ #I |`(X∪Y ) = min{#Ψ #I |`X ,#Ψ #I |`Y }. Furthermore Lemma 2.2.3 implies #Ψ #I |`Y = #Ψ #I |`Y = #Ψ#I |`X = #Ψ #I |`X , since Ψ =I |`Y Ψ and Ψ =I |`X Ψ. So we get #Ψ #I |`(X∪Y ) = #Ψ #I |`X = #Ψ #I |`Y . Now (5) yields #Ψ#I |`X = #Ψ #I |`X = #Ψ #I |`(X∪Y ) < #Φ#I |`(X∪Y ) , hence (4) and hereby (3) is proved. Case 2 X ∩ Y = ∅. If X \ Y ∈ I, then Y ∪ (X \ Y ) = X ∪ Y , and from b) we can conclude that #Φ#I |`(X∪Y ) = #Φ#I |`Y ≥ #Φ#I |`X . If X \ Y ∈ I, we can apply Case 1 to the sets X \ Y and Y . Therefore a) yields the estimate #Φ#I |`X ≤ min{#Φ#I |`(X\Y ) , #Φ#I |`Y } = #Φ#I |`(X∪Y ) . This completes the proof of (3). Lemma 2.2.10 Let κ be an uncountable regular cardinal and I be a κ-complete normal ideal on κ with dom(I) = κ. Then
2.2. The Galvin-Hajnal Formula
117
a) For every function Φ ∈ κ ON, #Φ#I < ( ξ<κ |Φ(ξ) + 1|)+ . b) For every function Φ ∈ κ ON, I := I ∪ {Y ⊆ κ : Y ∈ I + and #Φ#I < #Φ#I |`Y } is a κ-complete ideal on κ with dom(I ) = κ. c) (Shelah) If λ > κ is a regular cardinal with μκ < λ for every cardinal μ < λ with cf (μ) = κ, then there is, for every function Φ ∈ κ λ with #Φ#I ∈ Lim, a set Y ∈ P(κ)\I and a set F ⊆ κ λ with |F| < λ, such that F is cofinal in Φ modulo I |`Y ; that means that f κ is a regular cardinal satisfying μκ < λ for all cardinals μ < λ with cf (μ) = κ, and if Φ ∈ κ λ, then #Φ#I < λ. Proof For part a), Lemma 2.2.3 says that there is a sequence (Ψα : α < #Φ#I ) of elements of κ ON, so that #Ψα #I = α and Ψα
If Ψ ∈ κ ON, γ ∈ ON and, for all α < β, γ ≤ #Ψ#I |`Yα , then γ ≤ #Ψ#I |`Y .
We assume that this assertion is true for all Ψ ∈ κ ON and all γ < γ and that, for a given function Ψ, we have γ ≤ #Ψ#I |`Yα for all α < β. Now let γ < γ be fixed. Using Lemma 2.2.3 we can find, for each α < β, a function Ψα ∈ κ ON, so that Ψα
118
Chapter 2. The Galvin-Hajnal Theorem
Obviously Ψ κ, then let G be our required set F of functions. If ξ ∈ Y , then cf (Φ(ξ)) = μ ≤ Φ(ξ) < λ, and so we get |F| ≤ μ < λ. If μ ≤ κ, then let F be the set of all functions f ∈ κ ON satisfying f (ξ) ∈ {gα (ξ) : α < μ} for all ξ < κ. By assumption, we can conclude that |F| ≤ μκ ≤ κκ < λ. Now in both cases one can easily verify that F is cofinal in Φ modulo I |`Y . Case 2 cf ◦ Φ is not constant on any set Z ∈ P(κ) \ I . For each cardinal ν < λ, let Xν := {ξ < κ : cf (Φ(ξ)) = ν} (for ν ≥ λ, this set is empty). By Case 2, we have Xν ∈ I for all ν < λ. Let μ be the smallest cardinal such that Y := {Xν : ν < μ} \ (X0 ∪ X1 ) ∈ I . Since κ\(X0 ∪X1 ) = {Xν : ν ∈ λ}\(X0 ∪X1 ) ∈ I , such a cardinal exists, and we have μ ≤ λ. Next we observe that μ is a limit cardinal. Namely, if μ = ρ+ and T := {ν < μ : ν∈ {0, 1} ∧ Xν = ∅}, then Y = {Xν : ν ∈ T ∩ ρ} ∪ Xρ , the choice of μ. and Xρ ∈ I gives {Xν : ν ∈ T ∩ ρ} ∈ I , contradicting Now the set T is unbounded in μ, and we have Y = {Xν : ν ∈ T }. From the fact that I is κ-complete and Y ∈ I , we can conclude that |T | ≥ κ. Since the sets Xν , ν ∈ T , are pairwise disjoint nonempty subsets of κ, we have |T | = κ, hence cf (μ) ≤ κ. Since T is unbounded in μ, we can easily find a subset T of T which is unbounded in μ and has the cardinality cf (μ). For ν ∈ T , put Zν := {Xρ : ρ ∈ T ∩ ν}; then Zν ∈ I by the choice of μ, and
2.2. The Galvin-Hajnal Formula
119
Y = {Zν : ν ∈ T }, since T is unbounded in T . So the assumption cf (μ) < κ leads to Y ∈ I , contradicting again the choice of μ. Therefore we get cf (μ) = κ. Since λ is regular, κ < λ and μ ≤ λ, we get μ < λ and thus, by assumption, μκ < λ. Now we choose, for each ordinal ξ ∈ Y with Φ(ξ) = 0, a cofinal subset Cξ of Φ(ξ) of order type cf (Φ(ξ)); for the remaining ξ ∈ κ we put Cξ := {0}. We define F := ξ<κ Cξ . Then |F| ≤ μκ , hence |F| < λ. By construction, F is cofinal in Φ modulo I |`Y . For the proof of part d), we assume, to get a contradiction, that there is a function Φ ∈ κ λ such that #Φ#I ≥ λ. If #Φ#I > λ, Lemma 2.2.3 yields a function Ψ ∈ κ λ such that #Ψ#I = λ. So we can assume without loss of generality that #Φ#I = λ. By part c), there is a set F ⊆ κ λ with |F| < λ and a set Y ∈ P(κ) \ I , such that F is cofinal in Φ modulo I |`Y . Since Y ∈ I , we have #Φ#I = λ = #Φ#I |`Y . We will show that #Φ#I |`Y = sup{#f #I |`Y : f ∈ F} which will contradict the assumption that λ is a regular cardinal. By definition, we have #Φ#I |`Y = sup{#Ψ#I |`Y + 1 : Ψ
120
Chapter 2. The Galvin-Hajnal Theorem c) If #Φ#I is a limit ordinal, then the set {a ∈ A : Φ(a) is a limit ordinal } is I-positive. Can one show that Φ(a) is a limit ordinal for almost all a ∈ A modulo I? d) If Φ(a) is a limit ordinal for almost all a ∈ A modulo I, then #Φ#I is a limit ordinal.
4) Assume that κ > ℵ0 is a regular cardinal, Φ ∈ κ ON, I = Id (κ), σ < κ is an ordinal, and {ξ < κ : Φ(ξ) = σ} is a club in κ. Prove that #Φ(ξ)#I = σ. 5) Assume that κ > ω is a regular cardinal. Prove that there are functions Φ, Ψ ∈ κ ON such that Φ |` X = Ψ |` X for some X ∈ Id (κ)+ and #Φ#Id (κ) = #Ψ#Id (κ) . Hint: Use Lemma 2.2.5. 6) Assume that κ is an uncountable regular cardinal and Φ ∈ κ ON is a function. Prove: If σ < κ and S := {ξ < κ : Φ(ξ) < σ} is stationary in κ, then #Φ#Id (κ) < σ. 7) Assume that κ > ω is a regular cardinal, I := Id (κ), and α < κ. Further let Φ ∈ κ κ, + be the ordinal sum, and S := {ξ < κ : Φ(ξ) ≤ ξ + α} be stationary in κ. Prove that #Φ#Id (κ) ≤ κ + α. Hint: Use Fodor’s theorem, Lemma 1.8.4 and Lemma 2.2.5. 8) Assume that κ > ω is a regular cardinal, I := Id (κ), and α < κ. Further let #Φ# := #Φ#Id (κ) for any Φ ∈ κ κ and + be the ordinal sum. Prove: If Ψα (ξ) := ξ + α for all ξ < κ, then #Ψα # = κ + α. 9) Assume that κ > ω is a regular cardinal, I := Id (κ), Φ ∈ κ κ, and + is the ordinal sum. Prove: a) If S := {ξ < κ : Φ(ξ) ≤ ξ + ξ} is stationary in κ, then #Φ#Id (κ) ≤ κ + κ. b) If Φ(ξ) := ξ + ξ for all ξ < κ, then #Φ#Id (κ) = κ + κ. Hint: Use transfinite induction, Fodor’s theorem and Lemma 1.8.4. 10) (Galvin, Hajnal) Assume that κ is an uncountable regular cardinal and I is a κ-complete normal ideal on κ with dom(I) = κ. Prove without using Lemma 2.2.10: a) If μ is an infinite cardinal and Φ ∈ κ μ, then #Φ#I < (μκ )+ . b) If λ is an uncountable, regular, κ-strong cardinal and Φ ∈ κ λ, then #Φ#I < λ. 11) Assume that κ is an uncountable regular cardinal, α ≥ 2 is an ordinal, and I is an ideal on κ. a) Prove that =I is an equivalence relation on κ α.
2.3. Applications of the Galvin-Hajnal Formula
121
b) For the case that I = Ib (κ) find two equivalence classes A and B w.r.t. =I such that, for any f ∈ A and g ∈ B, f and g are not almost disjoint. 12) Assume that κ and λ are cardinals satisfying ω ≤ λ ≤ κ. Prove that there is a set F ⊆ λ κ of almost disjoint functions such that |F| > λ. Hint: Every subset of λ κ of almost disjoint functions which is maximal under inclusion has cardinality greater than λ.
2.3 Applications of the Galvin-Hajnal Formula Corollary 2.3.1 Assume that λ and κ are regular cardinals satisfying ℵ0 < κ < λ and ν κ < λ for every cardinal ν < λ with cf (ν) = κ. Further let μ be an infinite cardinal with μκ < μ+λ , and (ℵγ(ξ) : ξ < κ) be a sequence of cardinals satisfying ℵγ(ξ) < μ+λ ξ<α
for all α < κ. Then
ℵγ(ξ) < μ+λ .
ξ<κ
Proof To apply Theorem 2.2.8, let Φ ∈ κ ON be defined by ℵγ(ξ) ≤ μ+β }. Φ(α) := min{β ∈ ON : ξ<α
By assumption, we have Φ ∈ κ λ, and Lemma 2.2.10 d) tells us that #Φ#I < λ for every κ-complete normal ideal I on κ with dom(I) = κ, in particular for I := Id (κ) by Lemma 1.8.5. If μ =: ℵβ and η(ξ) := β for all ξ < κ, then we have ξ<α ℵγ(ξ) ≤ ℵβ+Φ(α) , and the cardinal ℵΘ in Theorem 2.2.8 can be estimated by ℵΘ ≤ 2κ · μκ = μκ < μ+λ = ℵβ+λ . Therefore there is σ < λ such that ℵΘ = ℵβ+σ . From this together with #Φ#I < λ and Lemma 1.5.9 we can conclude that ℵΘ+ Φ I = ℵβ+σ+ Φ I < ℵβ+λ . Moreover, the definitions of the assumptions of Theorem 2.2.8. So we get the functions η and Φ satisfy +λ ℵ ≤ ℵ < μ , as desired. Θ+ Φ I ξ<κ γ(ξ) Corollary 2.3.2 Assume that ℵη is a κ-strong singular cardinal, where κ := cf (ℵη ) > ω, Φ ∈ κ ON is a function, (η(ξ) : ξ < κ) is a normal function cofinal in η, and F⊆ ℵη(ξ)+Φ(ξ) ξ<κ
122
Chapter 2. The Galvin-Hajnal Theorem
is a set of almost disjoint functions. Then |F| ≤ ℵη+ Φ Id (κ) . In other words, if Ψ ∈ κ ON is defined by Ψ(ξ) := η(ξ) + Φ(ξ), then T (ℵ ◦ Ψ) ≤ ℵη+ Φ Id (κ) . Proof We get an estimate for the cardinal ℵΘ defined in Theorem 2.2.6 by ℵΘ = 2κ · sup{T (κ, ℵη(ξ) ) : ξ < κ} ≤ 2κ · sup{ℵκη(ξ) : ξ < κ} ≤ 2κ · ℵη = ℵη . From Theorem 2.2.6 we can conclude, putting Ψ := (η(ξ) + Φ(ξ) : ξ < κ), that |F| ≤ T (ℵ ◦ Ψ) ≤ ℵΘ+ Φ Id (κ) ≤ ℵη+ Φ Id (κ) . Lemma 2.3.3 Assume that ℵη is a limit cardinal, κ = cf (ℵη ), (η(ξ) : ξ < κ) is an increasing sequence cofinal in η, and λ ≥ 1 is a cardinal. Then there exists a set F ⊆ ξ<κ λ ℵη(ξ) of almost disjoint functions such that |F| = ℵλη . Proof For each function Φ ∈ λ ℵη , we define a function fΦ ∈ by
fΦ (ξ)(α) =
Φ(α) 0
λ ξ<κ
ℵη(ξ)
if Φ(α) < ℵη(ξ) , otherwise.
If Φ, Φ ∈ λ ℵη and Φ = Φ , then there is an ordinal α0 < λ with Φ(α0 ) = Φ (α0 ). Choose an ordinal ξ0 < κ such that ℵη(ξ0 ) is greater than both Φ(α0 ) and Φ (α0 ). Then for every ξ with ξ0 ≤ ξ < κ we can conclude that fΦ (ξ)(α0 ) = Φ(α0 ) = Φ (α0 ) = fΦ (ξ)(α0 ), and thus fΦ (ξ) = fΦ (ξ) for all ξ ∈ [ξ0 , κ)ON . Consequently, the functions fΦ and fΦ are almost disjoint, and the set F := {fΦ : Φ ∈ λ ℵη } has the desired properties. Corollary 2.3.4 (Galvin-Hajnal Lemma) Assume that ℵη is a κ-strong singular cardinal, where κ := cf (ℵη ) > ω, (η(ξ) : ξ < κ) is a normal sequence cofinal in η, and λ ≥ 1 is a cardinal. Further let Φ ∈ κ ON be a function satisfying ℵλη(ξ) = ℵη(ξ)+Φ(ξ) for all ξ < κ. Then ℵλη ≤ ℵη+ Φ Id (κ) . Proof By Lemma 2.3.3, there is a set F ⊆ ξ<κ λ ℵη(ξ) of almost disjoint functions such that |F| = ℵλη . Corollary 2.3.2 tells us that |F| ≤ ℵη+ Φ Id (κ) .
2.3. Applications of the Galvin-Hajnal Formula
123
Corollary 2.3.5 (Galvin-Hajnal Theorem) Let ℵη be a singular cardinal such that κ := cf (ℵη ) > ω. If ℵη is ℵ0 -strong, then, for every cardinal λ with κ ≤ λ < ℵη , ℵλη < ℵ(|η|λ )+ . If ℵη is even a strong limit cardinal, then 2ℵη < ℵ(2|η| )+ , and if in addition η < ℵη , then 2ℵη < ℵℵη . Proof First assume in addition to our assumption that ℵη is λ-strong. Then clearly ℵη is κ-strong. We take a normal sequence (η(ξ) : ξ < κ) cofinal in η. If Φ ∈ κ ON is defined by the equation ℵλη(ξ) = ℵη(ξ)+Φ(ξ) , then Corollary 2.3.4 tells us that ℵλη ≤ ℵη+ Φ Id (κ) . Since ℵη is λ-strong, we can conclude that ℵλη(ξ) < ℵη for all ξ < κ. Thus Φ ∈ κ η and hereby #Φ#Id (κ) < (|κ η|)+ ≤ (|η|λ )+ . This implies η + #Φ#Id (κ) < (|η|λ )+ , which gives ℵλη < ℵ(|η|λ )+ for this case. Now let, according to our assumption, ℵη be ω-strong but not λ-strong. We distinguish two cases. Case 1 2λ ≥ ℵη . Then we have ℵλη ≤ (2λ )λ = 2λ ≤ ℵ2λ < ℵ(2λ )+ ≤ ℵ(|η|λ )+ . Case 2 2λ < ℵη . Since ℵη is not λ-strong, there is β < η such that ℵλβ ≥ ℵη . Case 2 yields that the assumptions of Theorem 1.7.4 are fulfilled. So there is α ≤ β such that cf(ℵ ) ℵα is singular and λ-strong, has cofinality at most λ and satisfies ℵλβ = ℵα α . Now we can conclude that ℵλη = ℵλβ and cf(ℵα ) . ℵλη = ℵα
(∗)
We want to apply the first part of the proof to ℵα instead of ℵη and assume, contrary to our hopes, that cf (ℵα ) = ω. Since ℵη is ω-strong, we get ℵℵα0 < ℵη , hence ℵℵα0 < ℵη ≤ ℵλη , contradicting (∗). Thus cf (ℵα ) > ω. By the above cf(ℵ )
considerations we get ℵλη = ℵα α < ℵ(|α|cf(ℵα ) )+ ≤ ℵ(|η|λ )+ . If in addition ℵη is a strong limit cardinal, then Lemma 1.7.2 says that cf(ℵ ) 2ℵη = ℵη η . Together with κ = cf (ℵη ) = cf (η) and |η|κ ≤ |η||η| = 2|η| , our claim follows from the inequality ℵκη < ℵ(|η|κ )+ which we have just shown. Corollary 2.3.6 If σ is an ordinal with σ < ω1 such that the set {ξ < ω1 : ℵℵξ 1 ≤ ℵξ+σ } is stationary in ℵ1 , then ℵℵω11 ≤ ℵω1 +σ .
124
Chapter 2. The Galvin-Hajnal Theorem
Proof If β < ω1 , then our assumption yields ξ < ω1 such that β < ξ and ℵℵξ 1 ≤ ℵξ+σ < ℵω1 , hence ℵℵβ 1 ≤ ℵℵξ 1 ≤ ℵξ+σ . Therefore ℵω1 is ℵ1 -strong, and the function Φ, defined by the equation ℵℵξ 1 = ℵξ+Φ(ξ) , is a member of ω1 ω1 . Now the set {ξ < ω1 : Φ(ξ) ≤ σ} is stationary in ℵ1 , i.e., it is an element of Id (ℵ1 )+ . Therefore we know from Lemma 2.2.5 that #Φ#Id (ℵ1 ) ≤ σ. Furthermore we have cf (ℵω1 ) = ℵ1 . Putting η(ξ) := ξ for all ξ < ω1 , we can conclude, using Corollary 2.3.4, that ℵℵω11 ≤ ℵω1 +σ . Corollary 2.3.7 Assume that 2ℵ1 < ℵω1 and σ is an ordinal with σ < ω1 such that the set {ξ < ℵ1 : ℵℵξ 0 ≤ ℵξ+σ } is stationary in ℵ1 . Then ℵℵω11 ≤ ℵω1 +σ . Proof We have 2ℵ1 = ℵρ for some ρ < ω1 . Thus ℵℵξ 0 ≥ ℵℵρ 0 = 2ℵ1 for every ξ with max{ρ, ℵ0 } < ξ < ℵ1 , and from Corollary 1.6.13 we can conclude that ℵℵξ 1 = 2ℵ1 · ℵℵξ 0 = ℵℵξ 0 . It follows that {ξ < ℵ1 : ρ < ξ ∧ω < ξ ∧ℵℵξ 0 ≤ ℵξ+σ } = {ξ < ℵ1 : ρ < ξ ∧ω < ξ ∧ℵℵξ 1 ≤ ℵξ+σ }. Now the desired assertion can be inferred from Corollary 2.3.6. Lemma 2.3.8 If κ > ω is a regular cardinal and Φ ∈ κ ON is a function, then #Φ#Id (κ) < κ iff the set {ξ < κ : Φ(ξ) < ξ} is a member of Id (κ)+ , i.e., is stationary in κ. Proof If the set S := {ξ < κ : Φ(ξ) < ξ} is stationary in κ, then, by Fodor’s Theorem, there is an ordinal α < κ and a stationary set S ∗ ⊆ S such that Φ |` S ∗ = S ∗ × {α}. Together with Lemma 2.2.5 we can conclude that #Φ#Id (κ) ≤ α < κ. If conversely #Φ#Id (κ) = α < κ, then we know from Lemma 2.2.5 that the set Sα := {ξ < κ : Φ(ξ) ≤ α} is stationary in κ. Therefore Sα \ (α + 1) is also stationary in κ; since Sα \ (α + 1) ⊆ S, this also holds for S. Corollary 2.3.9 If the set {ξ < ω1 : ℵℵξ 1 < ℵξ+ξ } is stationary in ℵ1 , then ℵℵω11 < ℵω1 +ω1 . Proof The equation ℵℵξ 1 = ℵξ+Φ(ξ) defines a function Φ ∈ ω1 ON. By assumption, we have {ξ < ω1 : Φ(ξ) < ξ} ∈ Id (ℵ1 )+ , hence #Φ#Id (ω1 ) < ℵ1 by Lemma 2.3.8, and furthermore ℵω1 is ℵ1 -strong. Now the assumptions of Corollary 2.3.4 are fulfilled, taking η(ξ) := ξ for all ξ < κ. So we get ℵℵω11 ≤ ℵω1 + Φ Id (ω1 ) < ℵω1 +ω1 .
2.3. Applications of the Galvin-Hajnal Formula
125
Lemma 2.3.10 Let ℵη be a limit cardinal, κ := cf (ℵη ), and (η(ξ) : ξ < κ) be an increasing sequence that is cofinal in η. Then there is a set F of almost disjoint functions such that F ⊆ ξ<κ ℵη(ξ) 2 and 2ℵη = |F| = |
ℵη(ξ)
2|.
ξ<κ
Proof For each X ∈ P(ℵη ), we define a function fX ∈ ξ<κ P(ℵη(ξ) ) by fX (ξ) = X ∩ ℵη(ξ) . If X, Y ∈ P(ℵη ) are different, then there is an ordinal ξ0 < κ such that fX (ξ0 ) = fY (ξ0 ). Since (η(ξ) : ξ < κ) is nondecreasing, we get fX (ξ) = fY (ξ) for all ξ ≥ ξ0 , and thus fX and fY are almost disjoint. On account of 2ℵη(ξ) = |P(ℵη(ξ) )| we can identify fX with a function in ξ<κ ℵη(ξ) 2 and put F := {fX : X ∈ P(ℵη )}. Then we get 2ℵη = |P(ℵη )| = |F| ≤ | ξ<κ ℵη(ξ) 2| ≤ (2ℵη )κ = 2ℵη . Corollary 2.3.11 Assume that ℵη is a singular cardinal with κ := cf (ℵη ) > ω, (η(ξ) : ξ < κ) is a normal function cofinal in η, and σ < κ is an ordinal, such that {ξ < κ : 2ℵη(ξ) ≤ ℵη(ξ)+σ } ∈ Id (κ)+ . Then 2ℵη ≤ ℵη+σ . Proof As in the proof of Corollary 2.3.6 it can be verified that the equation 2ℵη(ξ) = ℵη(ξ)+Φ(ξ) defines a function Φ ∈ κ κ, and that ℵη is a strong limit cardinal. Since {ξ < κ : Φ(ξ) ≤ σ} ∈ Id (κ)+ , Lemma 2.2.5 says that #Φ#Id (κ) ≤ σ. Lemma 2.3.10 tells us that there is a set F ⊆ ξ<κ ℵη(ξ)+Φ(ξ) of almost disjoint functions such that |F| = 2ℵη . By Corollary 2.3.2, we get |F| ≤ ℵη+ Φ Id (κ) ≤ ℵη+σ . Corollary 2.3.12 (J. Silver) If ℵη is a singular cardinal of uncountable cofinality, and if the set {κ < ℵη : κ ∈ ICN ∧ 2κ = κ+ } is stationary in ℵη , then 2ℵη = ℵη+1 . Corollary 2.3.13 Assume that κ and λ are regular cardinals such that ℵ0 < κ < κ λ and μκ < λ for every cardinal μ < λ with cf (μ) = κ. Further let Φ ∈ λ be a function. Then, for every set F ⊆ ξ<κ ℵΦ(ξ) of almost disjoint functions, we have |F| < ℵλ . Proof Let the function (η(ξ) : ξ < κ) be defined by η(ξ) = 0 for all ξ < κ. Then we obtain an estimate for the cardinal ℵΘ in Theorem 2.2.6 by ℵΘ ≤ 2κ · ℵκ0 ≤ κκ · κκ < λ ≤ ℵλ , and this gives Θ < λ for the ordinal Θ. Now Lemma 2.2.10 says that #Φ#I < λ, where I := Id (κ), and from Theorem 2.2.6 we can conclude that |F| ≤ ℵΘ+ Φ I < ℵλ .
126
Chapter 2. The Galvin-Hajnal Theorem
Corollary 2.3.14 Assume that κ and λ are regular cardinals with ω < κ < λ, with cf (μ) = κ. Further let (μξ : satisfying μκ < λ for all cardinals μ < λ ξ< κ) be a sequence of cardinals such that ξ<α μξ < ℵλ for all α < κ. Then ξ<κ μξ < ℵλ . Proof Let the equation ℵΦ(α) = ξ<α μξ , for α < κ, define the function 2.2.7 there Φ on κ. Then Φ ∈ κ λ, andby Lemma is a set F of almostdisjoint functions such that F ⊆ α<κ ( ξ<α μξ ) = ξ<κ ℵΦ(ξ) and |F| = ξ<κ μξ . Now Corollary 2.3.13 says that |F| < ℵλ . Corollary 2.3.15 Assume that κ and λ are regular cardinals with ω < κ < λ, λ is κ-strong, and μ is an arbitrary cardinal. If μν < ℵλ for all ν ∈ κ ∩ CN, then μκ < ℵλ . Corollary 2.3.16 Assume that κ and λ are regular cardinals, ω < κ, λ is κstrong, and ν is a cardinal with cf (ν) = κ. If 2μ < ℵλ for all μ ∈ CN ∩ ν, then 2ν < ℵλ . Proof We choose a sequence (νξ : ξ < κ) of cardinals satisfing νξ < ν νξ for all ξ < κ and ν = ξ<κ νξ . For each ξ < κ, we put μξ := 2 . Then ξ<α νξ < ℵ λ for every ordinal α < κ, and this together with ξ<α μξ = 2 νξ ξ<κ Corollary 2.3.14 gives 2 = 2ν < ℵλ . Corollary 2.3.17 Let α be a limit ordinal with cf (α) > ω. If 2ℵξ < ℵ(|α|cf(α) )+ for all ordinals ξ < α, then 2ℵα < ℵ(|α|cf(α) )+ . Proof Let κ := cf (α), λ := (|α|κ )+ , and ν := ℵα . Then κ and λ are regular cardinals with κ < λ, λ is κ-strong, and cf (ν) = cf (α) = κ. Thus all assumptions of Corollary 2.3.16 are satisfied, and we obtain 2ℵα < ℵ(|α|κ )+ . Corollary 2.3.18 If ℵℵξ 0 < ℵ(2ℵ1 )+ for all ξ < ω1 , then ℵℵω11 < ℵ(2ℵ1 )+ . Proof The assumption and Lemma 1.6.15 imply that ℵℵω01 = ℵω1 ·
ℵℵξ 0 < ℵ(2ℵ1 )+ ,
since cf (ℵ(2ℵ1 )+ ) = (2ℵ1 )+ > ℵ1 .
ξ<ω1
If we put κ := ℵ1 , λ := (2ℵ1 )+ , and μ := ℵω1 , then κ and λ are regular cardinals such that κ < λ. Furthermore, λ is κ-strong and μν < ℵλ for all ν ∈ κ ∩ CN. From Corollary 2.3.15 we can conclude that ℵℵω11 < ℵ(2ℵ1 )+ .
2.3. Applications of the Galvin-Hajnal Formula
127
Exercises 1) Assume that ℵη is a κ-strong singular cardinal, where κ := cf (ℵη ) > ℵ0 . Further let (η(ξ) : ξ < κ) be a normal sequence cofinal in η such that the + set S := {ξ < κ : (גℵη(ξ)) = ℵ+ η(ξ) } is stationary in κ. Prove that (גℵη ) = ℵη . Hint: Exercise 1.8.22 says that {μ < ℵη : μ is κ-strong} is a club in ℵη , and thus S ∗ := {ξ < κ : ℵη(ξ) is κ-strong and (גℵη(ξ) ) = ℵ+ η(ξ) } is stationary in κ. If ξ ∈ S ∗ is a limit ordinal, use a golden rule to prove that ℵκη(ξ) = (גℵη(ξ) ) and apply the Galvin-Hajnal lemma. 2) (Silver) If the singular cardinal hypothesis holds for all singular cardinals with countable cofinality, then it holds for all singular cardinals. Hint: Use transfinite induction on singular cardinals to show that from ω < κ := cf (ℵη ) < ℵη and 2cf(ℵη ) < ℵη it follows that (גℵη ) = ℵ+ η . Prove first that ℵη is κ-strong, and apply the previous question. 3) Assume that ℵη is a κ-strong singular cardinal, where κ := cf (ℵη ) > ℵ0 . Further let (η(ξ) : ξ < κ) be a normal sequence cofinal in η, and Φ ∈ κ ON be a function, such that 2ℵη(ξ) ≤ ℵη(ξ)+Φ(ξ) for all ξ < κ. Then 2ℵη ≤ ℵη+ Φ Id (κ) . Hint: Apply Lemma 2.3.10 and Corollary 2.3.2. 4) Let β < ℵ1 be an ordinal. If 2ℵη < ℵ+β η holds for all singular cardinals with countable cofinality, then this assertion holds for all singular cardinals. Hint: Apply Exercise 6 from Section 2.2. 5) Assume that 2ℵ1 < ℵω1 and Φ ∈ ω1 ω1 is a function such that the set {ξ < ω1 : ℵℵξ 0 ≤ ℵξ+Φ(ξ) } is a club in ω1 . Prove that (גℵω1 ) ≤ ℵω1 + Φ Id (ω1 ) . Hint: Remember that ℵℵα1 = max{2ℵ1 , ℵℵα0 } for all α with ℵ0 ≤ α < ℵ1 (Corollary 1.6.13), and apply the Galvin-Hajnal lemma. 6) If the set {ξ < ω1 : 2ℵξ ≤ ℵξ+ξ+2 } is stationary in ω1 , then 2ℵω1 ≤ ℵω1 +ω1 +2 . Hint: Prove that ℵω1 is a strong limit cardinal, and use Lemma 2.3.10 and Corollary 2.3.2. 7) If ℵω1 is a strong limit cardinal, and if {ξ < ω1 : ℵℵξ 0 ≤ ℵξ+ξ } is a club in ω1 , then 2ℵω1 < ℵω1 +ω1 . Hint: Use the previous questions.
Chapter 3 Ordinal Functions In the Galvin-Hajnal theorem, the question of whether it holds for singular cardinals with countable cofinality was left open. Let ℵδ be singular and ν be a cardinal. If δ = ℵδ , then ℵνδ = |δ|ν < ℵ(|δ|ν )+ , and thus the Galvin-Hajnal theorem holds for the case that δ is a fixed point of the aleph function. Let us now turn to the case that δ < ℵδ . Then |δ| < ℵδ , and for every regular cardinal λ with |δ| < λ < ℵδ , the set a := [λ, ℵδ )reg is an interval of regular cardinals satisfying |a| < min(a), since |a| ≤ |δ|. Shelah defines an operator pcf which assigns to each set a of regular cardinals and each cardinal μ a set pcfμ (a) of regular cardinals satisfying the following properties for μ ≥ 1: a) b) c) d)
a ⊆ pcfμ (a). min(a) = min pcfμ (a). If |a| < min(a), then |pcfμ (a)| ≤ |a|μ . If a is an interval of regular cardinals with |a| < min(a), then pcfμ (a) is an interval of regular cardinals.
Now we continue the discussion of the special case that a = [λ, ℵδ )reg . We have λ = ℵα for some ordinal α < δ, and therefore sup pcfμ (a) < ℵα+|pcfμ (a)|+ by a), b) and d). If λ is a μ-strong cardinal, then Theorem 6.2.4, which is of course due to Shelah and represents a main result of this book, tells us that sup pcfμ (a) = ℵμδ . So we obtain ℵμδ < ℵα+|pcfμ (a)|+ . By c) we have |pcfμ (a)| ≤ |a|μ ≤ |δ|μ , and α < δ < (|δ|μ )+ implies (∗)
ℵμδ < ℵ(|δ|μ )+ .
With Lemma 1.7.3 one can show, roughly speaking, that a μ-strong cardinal λ with |δ| < λ < ℵδ can always be found (for details see Section 8.1). Therefore (∗) is a powerful generalization of the Galvin-Hajnal theorem. If in particular μ = |δ|, then |pcfμ (a)| < |a|+4 by Theorem 7.2.6. In the case that ℵδ ≤ 2|δ| we
130
Chapter 3. Ordinal Functions |δ|
have ℵδ ≤ 2|δ| . If 2|δ| < ℵδ , we can conclude, using the fact that λ := (2|δ| )+ |δ| is a |δ|-strong cardinal and the estimate ℵδ < ℵα+|pcfμ (a)|+ from above, that |δ|
ℵδ < ℵ|δ|+4 , since α < |δ|+4 . Altogether we obtain |δ|
ℵδ < max{ℵ|δ|+4 , (2|δ| )+ }.
(∗∗) cf(δ)
|δ|
≤ ℵδ , (∗∗) yields an estimate for the gimel function at singular Since ℵδ arguments. The proofs of the assertions (∗) and (∗∗) are complicated, and the methods and techniques used for it are manifold. The theory developed solely for these proofs, the so-called pcf-theory, originates with Saharon Shelah. It is selfcontained and allows further interesting applications which will be treated in Chapter 8. In this chapter, we define first in Section 3.1 the fundamental notion of the true cofinality of a set S ⊆ A ON of ordinal functions modulo I, written as tcf (S/I), The special case where I is an ideal on their common domain A. A function f ∈ ON, will play the that S = f := a∈A f (a) for some ordinal decisive role in our investigations. If tcf ( f /I) exists, then it is a cardinal, namely 0 in the trivial case that f = ∅, 1 if f has a maximum under ≤I , and a regular cardinal in all other cases. If I is a maximal ideal on A and D is the dualultrafilter of I, then tcf ( f /I) exists, and we also write cf ( f /I) and cf ( f /D) instead of tcf ( f /I). If the cardinal λ = tcf ( f /I) exists, then it turns out that the partial or every subset S of f whose cardinality dering ( f,
3.1. Suprema and Cofinalities
131
3.1 Suprema and Cofinalities For the rest of this chapter, A denotes a nonempty set and I an ideal on A. The domain of the considered ordinal functions is A if it is not explicitly specified otherwise. We remind the reader of the fact that we often omit the addition “modulo I” when we are dealing with assertions on ordinal functions. Definition Let S be a set (or a family) of ordinal functions and h be an ordinal function. h is called an upper bound of S modulo I iff f ≤I h for all members f of S. We call h a supremum of S modulo I iff h is an upper bound of S modulo I and h ≤I g holds for every upper bound g of S. If T is a subset (subfamily) of S, then T is called unbounded in S modulo I iff no member of S is an upper bound of T modulo I. For ordinal functions f and g, we use the following denotations: B(f, g) := {a ∈ A : f (a) < g(a)}, B[f, g] := {a ∈ A : f (a) ≤ g(a)}. Remark In general, the relation ≤I is not antisymmetric, and therefore suprema are not uniquely determined. On the other hand, modulo I all suprema of S are equal. Further we note: g ≤I f ⇐⇒ B(f, g) ∈ I
and g
A simple and practical necessary and sufficient condition for the existence of suprema is given by the following lemma. Lemma 3.1.1 If S is a set of ordinal functions, then an ordinal function g is a supremum of S iff g is an upper bound of S and there is no upper bound h of S satisfying h I g. Proof Let g be an upper bound of S with the property that there is no upper bound h of S such that h I g. We assume, to get a contradiction, that g is not a supremum of S. Then there is an upper bound h of S such that ¬(g ≤I h). Put p := min{g, h}. Obviously p is an upper bound of S, and we get p ≤ g. Since g ≤I h is not the case and p ≤ h, g ≤I p cannot hold, and therefore we have in particular not p =I g. So we get p I g, contradicting the assumption. Consequently, g is a supremum of S. The proof of the reverse direction of the equivalence is trivial. Definition If S is a set of ordinal functions and T ⊆ S, then T is called cofinal in S modulo I iff T is cofinal in S with respect to the relation ≤I on S, that means iff for all f ∈ S there is g ∈ T such that f ≤I g. The cardinal number
132
Chapter 3. Ordinal Functions
cf (S, ≤I ) from Section 1.5 is also called the cofinality of S modulo I; remember that cf (S, ≤I ) = min{|T | : T is a cofinal subset of S modulo I}. A sequence (fξ : ξ < σ) of ordinal functions is called increasing modulo I (strictly increasing modulo I) iff fα ≤I fβ (fα
Obviously we have g < f iffg is a member of f . If a sequence of members of f is cofinal in the set f we also say that it is cofinal in f . The following lemma is a direct consequence of Lemma 2.1.2. It says that the values of members of sequences which are cofinal in f (or more general, which are cofinal in arbitrary sets S of ordinal functions) may be changed appropriately on sets which are members of I. It is a simple stand