Applications of Stationary Sets in Set Theoretic Topology
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Forcing Axioms and Stationary Sets
ADVANCES IN MATHEMATICS 94, 256284 (1992) Forcing Axioms and Stationary Sets BOBAN VELICKOVI~ Department of Mathematics, University of California, Evans Hall, Berkeley, California 94720 INTRODUCTION Recall that a partial ordering 9 is called semi-proper iff for every suf- ficiently large regular cardinal 0 and every countable elementary submodel N of H,, where G9 is the canonical name for a Y-generic filter. The above q is called (9, N)-semi-generic. The Semi-Proper Forcing Axiom (SPFA) is the following statement: For every semi-proper 9 and every family 9 of Et, dense subsets of 9 there exists a filter G in 9 such that for every DE 9, GnD#@. SPFA+ states that if in addition a Y-name 3 for a stationary subset of wi is given, then a filter G can be found such that val,(S)= {c(<wi: 3p~Gp I~-EE$) is stationary. In general, if X is any class of posets, the forcing axioms XFA and XFA + are obtained by replacing “semi-proper LY” by “9 E X” in the above definitions. Sometimes we denote these axioms by FA(X) and FA+(.X). Thus, for example, FA(ccc) is the familiar Martin’s Axiom, MAN,. The notion of semi-proper, as an extension of a previous notion of proper, was defined and extensively studied by Shelah in [Shl J. These forcing notions generalize ccc and countably closed forcing and can be iterated without collapsing N, . SPFA is implicit in [Shl] as an obvious strengthening of the Proper Forcing Axiom (PFA), previously formulated and proved consistent by Baumgartner (see [Bal, Del]). -
On Disjoint Stationary Sets in Topological Spaces
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 7, Issue 9, 2019, PP 1-2 ISSN No. (Online) 2454-9444 DOI: http://dx.doi.org/10.20431/2347-3142.0709001 www.arcjournals.org On Disjoint Stationary Sets in Topological Spaces Pralahad Mahagaonkar* Department of Mathematics, Ballari Institute of Technology and Management, Ballari *Corresponding Author: Pralahad Mahagaonkar, Department of Mathematics, Ballari Institute of Technology and Management, Ballari Abstract : In this paper we study some new techniques from set theory to general topology and its applications , here we study some the partition relations ,cardinal functions and its principals and some more theorems . Further we develop the combinatory of stationary sets we have aimed at person with some knowledge of topology and a little knowledge of set theory. Keywords: Stationary sets ,homeomorphic, topologicalspaces, Bairespaces. 1. INTRODUCTION Here we will discuss some interesting subsets of ω1 – sets, Borel subsets, stationary and bi-stationary subsets of ω1 – and some theorems . In addition, we will mention some topological applications of stationary sets . Let us know that ω1 is an uncountable well-ordered set with the special property that if α < ω1, then the initial segment [0, α) of ω1 is countable, and that the countable union of countable sets is countable. Like any linearly ordered set, ω1 has an open interval topology. Le us consider that α is a limit point of the space ω1. 2. MAIN RESULTS Theorem 1.1 : A Borel subset of B(k) which is not in LW( k) is a homeomrphic to B(k). Definition : B(k) is the Baire zero dimensional space of weight k, is a function from k with the given d( f , g) 2n ,where n is the least of f / n g / n. -
A Theory of Stationary Trees and the Balanced Baumgartner-Hajnal-Todorcevic Theorem for Trees
A Theory of Stationary Trees and the Balanced Baumgartner-Hajnal-Todorcevic Theorem for Trees by Ari Meir Brodsky A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Mathematics University of Toronto c Copyright 2014 by Ari Meir Brodsky Abstract A Theory of Stationary Trees and the Balanced Baumgartner-Hajnal-Todorcevic Theorem for Trees Ari Meir Brodsky Doctor of Philosophy Graduate Department of Mathematics University of Toronto 2014 Building on early work by Stevo Todorcevic, we develop a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize arbitrary subsets of a non-special tree as being either stationary or non-stationary. We then use this theory to prove the following partition relation for trees: Main Theorem. Let κ be any infinite regular cardinal, let ξ be any ordinal such that 2jξj < κ, and let k be any natural number. Then <κ 2 non- 2 -special tree ! (κ + ξ)k : This is a generalization to trees of the Balanced Baumgartner-Hajnal-Todorcevic Theorem, which we recover by applying the above to the cardinal (2<κ)+, the simplest example of a non-(2<κ)-special tree. As a corollary, we obtain a general result for partially ordered sets: Theorem. Let κ be any infinite regular cardinal, let ξ be any ordinal such that 2jξj < κ, and let k be <κ 1 any natural number. Let P be a partially ordered set such that P ! (2 )2<κ . -
Lecture Notes: Axiomatic Set Theory
Lecture Notes: Axiomatic Set Theory Asaf Karagila Last Update: May 14, 2018 Contents 1 Introduction 3 1.1 Why do we need axioms?...............................3 1.2 Classes and sets.....................................4 1.3 The axioms of set theory................................5 2 Ordinals, recursion and induction7 2.1 Ordinals.........................................8 2.2 Transfinite induction and recursion..........................9 2.3 Transitive classes.................................... 10 3 The relative consistency of the Axiom of Foundation 12 4 Cardinals and their arithmetic 15 4.1 The definition of cardinals............................... 15 4.2 The Aleph numbers.................................. 17 4.3 Finiteness........................................ 18 5 Absoluteness and reflection 21 5.1 Absoluteness...................................... 21 5.2 Reflection........................................ 23 6 The Axiom of Choice 25 6.1 The Axiom of Choice.................................. 25 6.2 Weak version of the Axiom of Choice......................... 27 7 Sets of Ordinals 31 7.1 Cofinality........................................ 31 7.2 Some cardinal arithmetic............................... 32 7.3 Clubs and stationary sets............................... 33 7.4 The Club filter..................................... 35 8 Inner models of ZF 37 8.1 Inner models...................................... 37 8.2 Gödel’s constructible universe............................. 39 1 8.3 The properties of L ................................... 41 8.4 Ordinal definable sets................................. 42 9 Some combinatorics on ω1 43 9.1 Aronszajn trees..................................... 43 9.2 Diamond and Suslin trees............................... 44 10 Coda: Games and determinacy 46 2 Chapter 1 Introduction 1.1 Why do we need axioms? In modern mathematics, axioms are given to define an object. The axioms of a group define the notion of a group, the axioms of a Banach space define what it means for something to be a Banach space. -
Nonreflecting Stationary Subsets Of
F U N D AM E NTA nnoindentMATHEMATICAEF U N D AM E NTA 1 65 open parenthesis 2 0 0 closing parenthesis nnoindentNonreflectingMATHEMATICAE stationary subsets of P sub kappa lambda by n centerline f1 65 ( 2 0 0 ) g Yoshihiro A b eF open U N D parenthesis AM E NTA Yokohama closing parenthesis Abstract period We explore the possibility of forcing nonreflecting stationary sets of P sub kappa lambda n centerline f NonreflectingMATHEMATICAE stationary subsets of $ P f nkappa g nlambda $ g period 1 65 ( 2 0 0 ) We also present a P sub kappa lambda generalization of Kanamori quoteright s weakly normal filters comma n centerline fby g Nonreflecting stationary subsets of Pκλ which induces by stationary reflection period Yoshihiro A b e ( Yokohama ) n centerline1 period .. Introductionf Yoshihiro period A b .. e Throughout ( Yokohama .. this ) g .. paper .. kappa .. denotes .. a .. regular .. un hyphen Abstract . We explore the possibility of forcing nonreflecting stationary sets of Pκλ. countable cardinal and .... lambda a cardinal .... greater equal kappa period .... For any such pair .... open We also present a Pκλ generalization of Kanamori ' s weakly normal filters , which induces parenthesisn hspace ∗fn kappaf i l l commag Abstract lambda . closing We explore parenthesis the comma possibility P sub kappa of lambda forcing nonreflecting stationary sets of $ P f nkappa stationaryg nlambda reflection. $ denotes .... the .... set .... open1 . brace Introduction x subset lambda . Throughout : bar x bar less this kappa paper closingκ bracedenotes period .... a For .... x in P sub kappa lambdaregular comma un - .... let .... kappa sub x = bar x cap kappa bar comma nnoindentP sub kappaWe sub also x x = present open brace a s $ subset P f x : n barkappa s barg less nlambda kappa sub$ x closing generalization brace comma and of x-hatwideKanamori ' s weakly normal filters , which induces countable cardinal and λ a cardinal ≥ κ. -
FUNCTIONS on STATIONARY SETS Mustapha Alami
Palestine Journal of Mathematics Vol. 7(1)(2018) , 222226 © Palestine Polytechnic University-PPU 2018 FUNCTIONS ON STATIONARY SETS Mustapha Alami Communicated by Najib Mahdou MSC 2010 Classications: Primary: 03G05, 06A06. Secondary: 06E05, 08A05, 54G12. Keywords and phrases: Stationary sets, closed and unbounded sets, Fodor's theorem, combinatorial set theory. The author would like to thank the referees for their helpful remarks and comments. Abstract A characterization of stationary sets is established using regressive functions, se- lection property, continuous functions on ordinals and real continuous functions. 1 Introduction Whenever a number of pigeons, to be put into cages, is greater that the number of cages consid- ered for this purpose; one cage, at least, has to contain more than one pigeon. This self-evident principle inspired many mathematicians over time and has been a basis for many generaliza- tions indeed. The rst extension of this principle to ordinals dates back to P. Alexandroff and P. Uryshon (1926), see [1]:A regressive function f on limit ordinals (i.e., f(α) α) has a constant value on some uncountable set of ordinal numbers. Four years later, Ben Dushnik (1930), see [3], gave a more explicit generalization: Any regressive function on !ν+1 into it- self is constant on some set of size @ν+1. In 1950 P. Erdös extended Ben Dushnik result to any !ν of uncountable conality, see [4]. In the same year (1950) J. Novak, see [9], generalized Alexandroff-Uryshon's theorem to closed (under the order topology) and unbounded subsets of !1: Any regressive function on a club, closed and unbounded, C of !1 into itself is constant on some uncountable subset of C. -
8. Stationary Sets
8. Stationary Sets In this chapter we develop the theory of closed unbounded and stationary subsets of a regular uncountable cardinal, and its generalizations. Closed Unbounded Sets If X is a set of ordinals and α>0 is a limit ordinal then α is a limit point of X if sup(X ∩ α)=α. Definition 8.1. Let κ be a regular uncountable cardinal. A set C ⊂ κ is a closed unbounded subset of κ if C is unbounded in κ and if it contains all its limit points less than κ. AsetS ⊂ κ is stationary if S∩C = ∅ for every closed unbounded subset C of κ. An unbounded set C ⊂ κ is closed if and only if for every sequence α0 <α1 <...<αξ <... (ξ<γ)ofelementsofC,oflengthγ<κ,wehave limξ→γ αξ ∈ C. Lemma 8.2. If C and D are closed unbounded, then C ∩ D is closed un- bounded. Proof. It is immediate that C∩D is closed. To show that C∩D is unbounded, let α<κ.SinceC is unbounded, there exists an α1 >αwith α1 ∈ C. Similarly there exists an α2 >α1 with α2 ∈ D. In this fashion, we construct an increasing sequence (8.1) α<α1 <α2 <...<αn <... such that α1,α3,α5,... ∈ C, α2,α4,α6,... ∈ D.Ifweletβ be the limit of the sequence (8.1), then β<κ,andβ ∈ C and β ∈ D. The collection of all closed unbounded subsets of κ has the finite inter- section property. The filter generated by the closed unbounded sets consists of all X ⊂ κ that contain a closed unbounded subset. -
Mutually Stationary Sequences of Sets and the Non-Saturation of the Non-Stationary Ideal on Px(A)
Acta Math., 186 (2001), 271-300 @ 2001 by Institut Mittag-Leflter. All rights reserved Mutually stationary sequences of sets and the non-saturation of the non-stationary ideal on Px(A) by MATTHEW FOREMAN and MENACHEM MAGIDOR Uniw~rsity of California Hebrew University Irvine, CA, U.S.A. Jerusalem, Israel 1. Introduction and preliminary remarks An important combinatorial property of an ideal I on a set Z is the saturation of the ideal, i.e. the least upper bound on the cardinality of a well-ordered chain in the completion of the Boolean algebra P(Z)/I. This is particularly interesting in the case where I is a naturally defined ideal, such as the non-stationary ideal. It is known to be consistent for the non-stationary ideal on wl to be w2-saturated. This was shown first from strong determinacy hypotheses by Steel and Van Wesep [SV], and later from large cardinals by Foreman, Magidor and Shelah [FMS]. Shelah has the optimal result, showing this property consistent relative to the existence of a Woodin cardinal. Shelah has shown that the non-stationary ideal on a successor cardinal •>wl can never be saturated, by showing that any saturated ideal on a successor cardinal must concentrate on a critical cofinality. Further, Gitik and Shelah (extending earlier work of Shelah) have shown that for x a successor of a singular cardinal, the non-stationary ideal cannot be x+-saturated even when restricted to the critical cofinality. They have also shown that the non-stationary ideal on an inaccessible cardinal can never be saturated. -
The Failure of Diamond on a Reflecting Stationary Set
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 364, Number 4, April 2012, Pages 1771–1795 S 0002-9947(2011)05355-9 Article electronically published on November 17, 2011 THE FAILURE OF DIAMOND ON A REFLECTING STATIONARY SET MOTI GITIK AND ASSAF RINOT Abstract. 1. It is shown that the failure of ♦S ,forasetS ⊆ℵω+1 that reflects stationarily often, is consistent with GCH and APℵω ,relativetothe ∗ existence of a supercompact cardinal. By a theorem of Shelah, GCH and λ + entails ♦S for any S ⊆ λ that reflects stationarily often. 2. We establish the consistency of existence of a stationary subset of ω [ℵω+1] that cannot be thinned out to a stationary set on which the sup- function is injective. This answers a question of K¨onig, Larson and Yoshinobu in the negative. 3. We prove that the failure of a diamond-like principle introduced by Dˇzamonja and Shelah is equivalent to the failure of Shelah’s strong hypothesis. 0. Introduction 0.1. Background. Recall Jensen’s diamond principle [10]: for an infinite cardinal + λ and a stationary set S ⊆ λ , ♦S asserts the existence of a sequence Aδ | δ ∈ S + such that the set {δ ∈ S | A ∩ δ = Aδ} is stationary for all A ⊆ λ . λ + It is easy to see that ♦λ+ implies 2 = λ , and hence it is natural to ask whether the converse holds. Jensen proved that for λ = ℵ0, the inverse implication fails (see [2]). However, for λ>ℵ0, a recent theorem of Shelah [19] indeed establishes the λ + inverse implication, and moreover, it is proved that 2 = λ entails ♦S for every λ+ { + | } stationary S which is a subset of E=cf( λ) := α<λ cf(α) =cf(λ) . -
Saturation of the Closed Unbounded Filter on the Set of Regular Cardinals by Thomas J
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 292, Number 1, November 1985 SATURATION OF THE CLOSED UNBOUNDED FILTER ON THE SET OF REGULAR CARDINALS BY THOMAS J. JECH AND W. HUGH WOODIN1 ABSTRACT. For any a < k+ , the following are equiconsistent: (a) k, is measurable of order a, (b) k is a-Mahlo and the filter C[Reg] is saturated. Introduction. Let re he a regular uncountable cardinal. C is the filter over re generated by closed unbounded subsets of re. If S C re is a stationary set then C[5] = {C n S: C G C} is the restriction of C to S. By a result of Solovay [9], the filter C[5] is not /c-saturated for any stationary set S; i.e. every stationary set is the union of re disjoint stationary subsets. A natural question is whether the filter C can be /c+-saturated, or more generally, whether C[S] can be re+-saturated for some stationary set S. The filter C[S] is re+-saturated if there exists no collection of re+ stationary subsets of S such that any two of them have nonstationary intersection. To simplify the terminology, we call C[S] saturated instead of /c+-saturated. If C is saturated then re is a measurable cardinal in an inner model [3]; moreover, if re is a successor cardinal then considerably stronger properties of re can be deduced [4, 7]. In fact, if re is a successor cardinal and re > Ni, then C itself cannot be saturated [8]. If re is an inaccessible cardinal, let Sing and Reg denote, respectively, the set of all singular and regular cardinals a < re. -
SET THEORY I, FALL 2019 COURSE NOTES Contents 1. Introduction
MATH 145A - SET THEORY I, FALL 2019 COURSE NOTES SEBASTIEN VASEY Contents 1. Introduction: What are sets, and what are they good for? 2 1.1. The sizes of infinity 3 1.2. Ordinals and transfinite induction 4 1.3. Infinite games 5 2. Sets and classes 7 2.1. The natural numbers and the axiom of infinity 9 2.2. Ordered pairs, cartesian product, relations, and functions 11 2.3. Sequences, indexed unions, and the axiom of replacement 14 2.4. Infinite products and the axiom of choice 15 The axiom of choice in action: the prisonners puzzle 17 3. Defining, and counting, sets of numbers 17 3.1. The integers 18 3.2. The rationals 19 3.3. The reals 19 3.4. Countable and uncountable sets 19 4. Linear orderings 22 5. Wellfounded relations, induction, and recursion 27 6. Well-orderings and ordinals 32 6.1. Ordinal arithmetic 36 6.2. An application: Cantor normal form and Goodstein sequences 39 7. The axiom of foundation and the cumulative hierarchy 40 8. Cardinals 41 8.1. Cardinal arithmetic 45 9. Regular and singular cardinals 49 9.1. More cardinal arithmetic 51 10. The Borel hierarchy 53 10.1. The continuum hypothesis for closed sets 55 11. Infinite games: a first introduction 57 12. Trees and topology 61 12.1. More on infinite games 64 12.2. Illfounded and wellfounded trees 65 12.3. The projective sets 68 12.4. Trees of uncountable height 70 12.5. Aronszajn trees and the basis problem for linear orders 73 13. Filters and ideals 74 Date: November 18, 2019. -
Category Forcings, Mm , and Generic Absoluteness For
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Institutional Research Information System University of Turin CATEGORY FORCINGS, MM+++, AND GENERIC ABSOLUTENESS FOR THE THEORY OF STRONG FORCING AXIOMS MATTEO VIALE Abstract. We analyze certain subfamilies of the category of complete boolean algebras with complete homomorphisms, families which are of particular interest in set theory. In particular we study the category whose objects are stationary set preserving, atomless com- plete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We introduce a maximal forcing axiom MM+++ as a combinatorial property of this category. This forcing axiom strengthens Martin’s maximum and can be seen at the same time as a strenghtening of Baire’s category theorem and of the axiom of choice. Our main results show that MM+++ is consistent relative to large cardinal ax- ioms and that MM+++ makes the theory of the Chang model L([Ord]≤ℵ1 ) with parameters in P(!1) generically invariant for stationary set preserving forcings that preserve this ax- iom. We also show that our results give a close to optimal extension to the Chang model L([Ord]≤ℵ1 ) of Woodin’s generic absoluteness results for the Chang model L([Ord]@0 ) and give an a posteriori explanation of the success forcing axioms have met in set theory. The main objective of this paper is to show that there is a natural recursive extension T of ZFC+ large cardinals which gives a complete theory of the Chang model L([Ord]≤ℵ1 ) with respect to the unique efficient method to produce consistency results for this structure, i.e stationary set preserving forcings.