A Note on Singular Cardinals in Set Theory without Choice

Similar documents
A variant of Namba Forcing

ALL UNCOUNTABLE CARDINALS IN THE GITIK MODEL ARE ALMOST RAMSEY AND CARRY ROWBOTTOM FILTERS

Diamond, non-saturation, and weak square principles

Tallness and Level by Level Equivalence and Inequivalence

Projective well-orderings of the reals and forcing axioms

Set Theory and the Foundation of Mathematics. June 19, 2018

Forcing Axioms and Inner Models of Set Theory

Erdös-Rado without choice

INTRODUCTION TO CARDINAL NUMBERS

FRAGILITY AND INDESTRUCTIBILITY II

Description of the book Set Theory

A Sharp for the Chang Model

Generalizing Gödel s Constructible Universe:

A Sharp for the Chang Model

FORCING AXIOMS AND THE CONTINUUM HYPOTHESIS, PART II: TRANSCENDING ω 1 -SEQUENCES OF REAL NUMBERS

Two sets X, Y have the same cardinality (cardinal number, cardinal),

Well Ordered Sets (continued)

Singular Failures of GCH and Level by Level Equivalence

Violating the Singular Cardinals Hypothesis Without Large Cardinals

Unsolvable problems, the Continuum Hypothesis, and the nature of infinity

Diamond on successors of singulars

SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS

The axiom of choice and two-point sets in the plane

A Logician s Toolbox

Outer Model Satisfiability. M.C. (Mack) Stanley San Jose State

Extremely large cardinals in the absence of Choice

Section 0. Sets and Relations

A simple maximality principle

FORCING WITH SEQUENCES OF MODELS OF TWO TYPES

Classical Theory of Cardinal Characteristics

ON A THEOREM OF BANACH AND KURATOWSKI AND K-LUSIN SETS. Tomek Bartoszyński

On the Length of Borel Hierarchies

Outside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis

A Note on Superamorphous Sets and Dual Dedekind-Infinity

Jónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy

Six lectures on the stationary tower

Part II. Logic and Set Theory. Year

Slow P -point Ultrafilters

Axioms for Set Theory

THE STRONG TREE PROPERTY AND THE FAILURE OF SCH

The length-ω 1 open game quantifier propagates scales

An inner model from Ω-logic. Daisuke Ikegami

Short Introduction to Admissible Recursion Theory

Informal Statement Calculus

THE LENGTH OF THE FULL HIERARCHY OF NORMS

WHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST?

Modal Logic of Forcing Classes

AMS regional meeting Bloomington, IN April 1, 2017

Forcing axioms and inner models

EXTERNAL AUTOMORPHISMS OF ULTRAPRODUCTS OF FINITE MODELS

ITERATING ALONG A PRIKRY SEQUENCE

Part II Logic and Set Theory

MATH 3300 Test 1. Name: Student Id:

Violating the Singular Cardinals Hypothesis Without Large Cardinals

Statue of Aristotle at the Aristotle University of Thessaloniki, Greece

Short notes on Axioms of set theory, Well orderings and Ordinal Numbers

Forcing notions in inner models

Trees and generic absoluteness

Open covers and a polarized partition relation

Math 109 September 1, 2016

arxiv: v1 [math.lo] 7 Dec 2017

Cofinality and Measurability of the First Three Uncountable Cardinals

Gleason s Theorem for non-separable Hilbert spaces: Extended abstract

Homogeneous spaces and Wadge theory

Optimal generic absoluteness results from strong cardinals

Initial Ordinals. Proposition 57 For every ordinal α there is an initial ordinal κ such that κ α and α κ.

On the Length of Borel Hierarchies

Chapter I. Some choiceless results

DO FIVE OUT OF SIX ON EACH SET PROBLEM SET

SOME TRANSFINITE INDUCTION DEDUCTIONS

DEFINITIONS OF FINITENESS BASED ON ORDER PROPERTIES

Ordinal Ranks on the Baire and non-baire class functions. Takayuki Kihara

Successive cardinals with the tree property

SET THEORY. 0.1 A Brief History of Mathematical Logic. Cantor s Set Theory. Russell s Paradox. Hilbert s Formalism and Gödel s Work

The Ultrapower Axiom implies GCH above a supercompact cardinal

Scales, topological reflections, and large cardinal issues by Peter Nyikos

20 Ordinals. Definition A set α is an ordinal iff: (i) α is transitive; and. (ii) α is linearly ordered by. Example 20.2.

Large Cardinals and Higher Degree Theory

Restricted versions of the Tukey-Teichmüller Theorem that are equivalent to the Boolean Prime Ideal Theorem

NOTES ON WELL ORDERING AND ORDINAL NUMBERS. 1. Logic and Notation Any formula in Mathematics can be stated using the symbols

VARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES

5 Set Operations, Functions, and Counting

Exercises for Unit VI (Infinite constructions in set theory)

MARTIN S MAXIMUM AND DEFINABILITY IN H(ℵ 2 ) Keywords: Forcing Axioms; Definability; Large Cardinals. 1. Introduction

CITS2211 Discrete Structures (2017) Cardinality and Countability

Jónsson posets and unary Jónsson algebras

Ultrafilters and Set Theory. Andreas Blass University of Michigan Ann Arbor, MI

ITERATIONS WITH MIXED SUPPORT

Inner models and ultrafilters in

Cantor s Letter to Dedekind

Cardinal invariants of closed graphs

Properties of the real line and weak forms of the Axiom of Choice

0 Logical Background. 0.1 Sets

On Recognizable Languages of Infinite Pictures

Cardinality and ordinal numbers

Axioms of separation

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)

RELATIONS BETWEEN SOME CARDINALS IN THE ABSENCE OF THE AXIOM OF CHOICE

Tutorial 1.3: Combinatorial Set Theory. Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011

Sets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University

Transcription:

arxiv:0709.2436v1 [math.lo] 15 Sep 2007 A Note on Singular Cardinals in Set Theory without Choice Denis I. Saveliev 2007 August 11, Beijing Partially supported by grant 06-01-00608-a of Russian Foundation for Basic Research

In this talk, I discuss how singular can cardinals be in absence of AC, the axiom of choice. I shall show that, contrasting with known negative consistency results (of Gitik and others), certain positive results are provable. At the end, I pose some problems.

Preliminaries

Definition. Given a set X, its cardinal number X is the class of all sets of the same size that X, i.e., admitting a one-to-one map onto X. Thus X = Y means There is a bijection of X onto Y.

Cardinals of nonempty sets are proper classes; so, we have a little technical obstacle: How quantify cardinals? In some happy cases we can represent them by sets: If X is a well-ordered cardinal, i.e., meets the class of (von Neumann s) ordinals, take the least such ordinal (an initial ordinal). If X is a well-founded cardinal, i.e., meets the class of well-founded sets, take the lower level of the intersection (so-called Scott s trick).

What is in general? The answer is No matter because instead of cardinals, we can say about sets and bijections. Thus ϕ( X, Y,...) means ϕ(x, Y,...) whenever X = X, Y = Y,...

Notations: The German letters l, m, n,... denote arbitrary cardinals. The Greek letters λ, µ, ν,... denote well-ordered ones (i.e., initial ordinals), while the Greek letters α, β, γ,... denote arbitrary ordinals.

Two basic relations on cardinals (dual in a sense): X Y means X is empty or there is an injection of X into Y, and X Y means X is empty or there is a surjection of Y onto X. Equivalently, X Y means There is a subset of Y of size X, X Y means X is empty or there is a partition of Y into X pieces.

Clearly: (i) Both and are reflexive and transitive. (ii) is antisymmetric (Dedekind; Bernstein), is not necessarily. (iii) is stronger than. Both relations coincide on well-ordered cardinals.

Two important functions on cardinals (Hartogs and Lindenbaum resp.): ℵ(n) = {α : α n}, ℵ (n) = {α : α n}. Equivalently, ℵ(n) is the least α such that on a set of size n there is no well-ordering of length α, ℵ (n) is the least α such that on a set of size n there is no pre-well-ordering of length α. Customarily, ν + denotes ℵ(ν) for ν well-ordered.

Clearly: (i) ℵ(n) and ℵ (n) are well-ordered cardinals. (ii) ℵ(n) n and ℵ (n) n. It follows ν < ν + and so ℵ 0 < ℵ 1 <... < ℵ ω <... < ℵ ω1 <... (where ℵ α is αth iteration of ℵ starting from ℵ 0 ). (iii) ℵ(n) ℵ (n), and both operations coincide on well-ordered cardinals. On other cardinals, the gap can be very large: Example.Assume AD. Then ℵ(2 ℵ 0) = ℵ 1 while ℵ (2 ℵ 0) is a very large cardinal (customarily denoted Θ).

Results on Singularity

Notations: Cov(l, m, n) means A set of size n can be covered by m sets of size l. Cov(<l,m, n) and Cov(L, m, n) (where L is a class of cardinals) have the appropriate meanings. Definition. A cardinal n is singular iff Cov(< n, < n, n), and regular otherwise.

What is under AC? Fact. Assume AC. Then Cov(l, m, n) implies n l m. Corollary. Assume AC. Then all the successor alephs are regular. Thus Cov(λ, λ, λ + ) for all λ ℵ 0.

What happens without AC? Theorem (Feferman Lévy). ℵ 1 can be singular. Thus Cov(ℵ 0, ℵ 0, ℵ 1 ) is consistent. Moreover, under a large cardinal hypothesis, so can be all uncountable alephs: Theorem (Gitik). All uncountable alephs can be singular. Clearly, then Cov(<λ, ℵ 0, λ) for all λ ℵ 0.

Remark. What is the consistency strength? Without successive singular alephs: The same as of ZFC. With λ, λ + both singular: Between 1 Woodin cardinal (Schindler improving Mitchell) and ω Woodin cardinals (Martin Steel Woodin). So, in general case: A proper class of Woodins.

Specker s problem: Is Cov(ℵ α, ℵ 0,2 ℵ α ) consistent for all α simultaneously? Partial answer: Theorem (Apter Gitik). Let A Ord consist either (i) of all successor ordinals; or (ii) of all limit ordinals and all successor ordinals of form α = 3n,3n+1, γ+3n, or γ+3n+2, where γ is a limit ordinal. Then ( α A)Cov(ℵ α, ℵ 0,2 ℵα ) is consistent (modulo large cardinals). (Really, their technique gives slightly more.) In general, the problem remains open.

Question: How singular can cardinals be without AC? in the following sense: How small are l n and m n satisfying (i) Cov(<l, <n,n)? (ii) Cov(<n, <m, n)? (iii) Cov(<l, <m,n)? On (iii): Specker s problem is a partial case. On (ii): The answer is As small as possible since Gitik s model satisfies Cov(< n, ℵ 0, n) for all (not only well-ordered) n.

On (i): For well-ordered n, the answer is l < n is impossible. Theorem 1. Cov(<λ, m, ν) implies ν λ m, and so ν + ℵ (λ m). Corollary. Cov(<λ, λ, λ + ) for all λ ℵ 0. Since Cov(λ, λ, λ + ) is consistent, the result is exact. Remark. Cov(ℵ 0, ℵ 0, ℵ 2 ) is an old result of Jech. (I am indebted to Prof. Blass who informed me.) By Corollary, really Cov(ℵ 0, ℵ 1, ℵ 2 ).

Next question: Let Cov(l, m, n), is n estimated via l and m? (when n is not well-ordered). Without Foundation, the answer is No Even in the simplest case l = 2 and m = ℵ 0 such an estimation of n is not provable: Theorem 2. It is consistent that for any p there exists n p such that Cov(2, ℵ 0, n). The proof uses a generalization of permutation model technique to the case of a proper class of atoms. We use non-well-founded sets instead of atoms.

On the other hand, ℵ(n) and ℵ (n) are estimated via ℵ(l), ℵ (l), and ℵ (m): Theorem 3. Cov(L, m, n) implies and ℵ(n) ℵ (sup l L ℵ (n) ℵ (sup l L ℵ(l) m) ℵ (l) m). Corollary 1. Cov(<λ, λ,2 λ ) and Cov(n,2 n2,2 2n2 2 ). In particular: Cov(λ,2 λ,2 2λ ) and Cov(ℶ α, ℶ α+1, ℶ α+2 ). Since Cov(n, n,2 n ) is consistent, the result is near optimal.

Another corollary is that Specker s request, even in a weaker form, gives the least possible evaluation of ℵ (2 λ ) (which is λ ++ ): Corollary 2. Cov(λ, λ +,2 λ ) implies ℵ (2 λ ) = ℵ(2 λ ) = λ ++. So, if there exists a model which gives the positive answer to Specker s problem, then in it, all the cardinals ℵ (2 λ ) have the least possible values.

As the last corollary, we provide a pathology when a set admits neither well-ordered covering (of arbitrary size) by sets of smaller size, nor covering of smaller size by well-orderable sets (of arbitrary size). Moreover, it can be the real line: Corollary 3. Assume CH holds and Θ is limit. (E.g., assume AD.) Then for any well-ordered λ Cov(<2 ℵ 0, λ,2 ℵ 0) and Cov(λ,<2 ℵ 0,2 ℵ 0). (Here CH means There is no m such that ℵ 0 < m < 2 ℵ 0.)

Problems

Problem 1. Is Cov(n,2 n,2 2n ) true for all n? That holds if n = n 2 (by Corollary 1 of Theorem 3). Problem 2. Is Cov(< ℶ α, ℶ α, ℶ α+1 ) true for all α? That near holds if α is successor (again by Corollary 1 of Theorem 3). Problem 3. Is Cov(n, ℵ 0,2 n2 ) consistent for all n simultaneously? This sharps Specker s problem of course. Problem 4. Can Theorem 2 be proved assuming Foundation? More generally, expand the Transfer Theorem (Jech Sohor) to the case of a proper class of atoms.

Problem 5. Is it true that on successor alephs the cofinality can behave anyhow, in the following sense: Let F be any function such that and F satisfies F : SuccOrd SuccOrd {0} (i) F(α) α and (ii) F(F(α)) = F(α) for all successor α. Is it consistent for all successor α? cf ℵ α = ℵ F(α) Perhaps if F makes no successive cardinals singular, it is rather easy; otherwise very hard.

References

[1] Arthur W. Apter and Moti Gitik. Some results on Specker s problem. Pacific Journal of Mathematics, 134, 2 (1988), 227 249. [2] Solomon Feferman and Azriel Lévy. Independences results in set theory by Cohen s method, II. Notices of the American Mathematical Society, 10 (1963), 593. Abstract. [3] Moti Gitik. All uncountable cardinals can be singular. Israel Journal of Mathematics, 35, 1 2 (1980), 61 88. [4] Moti Gitik. Regular cardinals in models of ZF. Transactions of the American Mathematical Society, 290, 1 (1985), 41 68. [5] Donald A. Martin and John R. Steel. Projective determinacy. Proceedings of the National Academy of Sciences of U.S.A., 85, 18 (1988), 6582 6586.

[6] Donald A. Martin and John R. Steel. A proof of projective determinacy. Journal of the American Mathematical Society, 2, 1 (1989), 71 125. [7] Ralf Dieter Schindler. Successive weakly compact or singular cardinals. Journal of Symbolic Logic, 64 (1999), 139 146. [8] Ernst P. Specker. Zur Axiomatik der Mengenlehre (Fundierungs- und Auswahlaxiom). Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 3, 3 (1957), 173 210. [9] W. Hugh Woodin. Supercompact cardinals, sets of reals, and weakly homogeneous trees. Proceedings of the National Academy of Sciences of U.S.A., 85, 18 (1988), 6587 6591.