Silver trees and Cohen reals
|
|
- Isabella Charles
- 5 years ago
- Views:
Transcription
1 Silver trees and Cohen reals Otmar Spinas Abstract We prove that the meager ideal M is Tukey reducible to the Mycielski ideal J(Si) which is the ideal associated with Silver forcing Si. This implies add (J(Si)) add (M) and answers a question of Laguzzi and others. 1 Introduction A tree p 2 <ω is called Silver tree if there exist a coinfinite set a ω and a function x : a 2 such that p = {ν 2 <ω : n ν a ν(n) = x(n)}. Then we call a the domain and ω \ a the codomain of p. We call x = x p the Silver function associated with p and p the Silver tree associated with x. By Si we denote the set of all Silver trees ordered by inclusion. Then Si is the well-known Silver forcing. The Silver ideal J(Si) consists of all X 2 ω such that p Si q Si (q p [q] X = ), where [q] = {x 2 ω : n < ω x n p}. It is sometimes called Mycielski ideal and has been studied by many authors (e.g. see [M], [ShSt]). In the same way, to each of the classical tree forcings like Sacks forcing Sa, Laver, Miller forcing etc. a forcing ideal is associated. These as well have been studied extensively (e.g. see [JMSh]). All these can easily be seen to be σ-ideals. Hence their additivity coefficient, i.e. the minimal cardinality of a subfamily whose union does not belong to the ideal, is always uncountable. Clearly it is at most 2 ℵ 0. The natural forcing that can be used to increase add (J(P )) for some tree forcing P, i.e. to construct a model for ℵ 1 < add (J(P )), is an amoeba forcing for P, i.e. a forcing adding a generic tree in P such that each of its branches is P -generic over the ground model. Experience shows that, unless special care is taken, amoeba forcings tend to add Cohen reals, hence to increase cov (M), the covering coefficient of the meager ideal The author is partially supported by DFG grant SP683/3-1. Keywords: Silver tree, Cohen real, Silver ideal, additivity, meager ideal, Tukey reduction. 1
2 M. However, in the case of Sacks forcing (see [LShV]) as well as Laver, Miller forcing respectively (see [Sp]) amoebas not adding Cohen reals have been constructed, hence for these three a model where the additivity of the respective forcing ideal is 2 ℵ 0 = ℵ 2 and cov (M) = ℵ 1 exists. Laguzzi [L] and others have noticed that for Si a similar construction is not known and they asked whether there is an amoeba for Si not adding Cohen reals. Here we prove add (J(Si)) cov (M) in ZFC. This implies that every reasonable amoeba forcing for Si, i.e. one that can be iterated to produce a model for ℵ 1 < add (J(Si)), adds a Cohen real. We actually prove something stronger than this. We show that M is Tukey reducible to J(Si). Recall that given partially ordered sets P, Q a map ϕ : P Q is called a Tukey function iff for every unbounded X P the pointwise image ϕ[x] is unbounded in Q. If such ϕ exists P is called Tukey reducible to Q and we write P T Q. We shall construct a Tukey function ϕ : M J(Si), where M, J(Si) are partially ordered by inclusion. Note that this easily implies add (J(Si)) add (M). By Cichon s diagram (see [BJ]) add (M) = min{b, cov (M)} holds in ZFC, where b is the bounding number. That add (J(Si)) b holds is a result of [SpW]. Note that sets of the form X(A) = 2 ω \ {[p] : p A}, where A is a maximal antichain of Si, form a basis for the ideal J(Si). Therefore, in [SpW] a lot of work has been done to improve our understanding of such antichains. An important result that is essential for the main theorem of this paper as well is the following: Theorem 1 [SpW, Theorem 2.2] Suppose that A Si is a maximal antichain such that for every p A dom(p) is infinite. Then A has size 2 ℵ 0. To be complete we sketch a proof of this result. Let A Si be an antichain such that A < 2 ℵ 0 and dom(p) is infinite for every p A. For p A let x : dom(p) 2 be the associated Silver function. Let e j : j < ω list all finite subsets of ω and let A j be the set of all p A such that e j = {n dom(p) : x p (n) = 1}. Note that, letting B j = {codom(p) : p A j }, B j is an almost disjoint family on ω. We can easily find a [ω] ω such that for every j < ω we have that either a b for some b B j or else a b < ℵ 0 for every b B j. By our assumption A < 2 ℵ 0 we can choose some infinite a 0 a such that a \ a 0 = ℵ 0 and a 0 {n < ω : x p (n) = 1} is infinite for every p A \ A j such that a {n < ω : x p (n) = 1} is infinite. Moreover let a \ a 0 = a 1 a 2 be a partition into two infinite pieces. If we define a Silver function y such that codom(y) = a 2, y is constantly 0 on a 0 and 2
3 constantly 1 on a 1, then, whatever y ω \ a will be, we have guaranteed that p y, the Silver tree associated with y, is incompatible with all p A except for those countably many p A j with a codom(p) and those p A\ A j with a {n < ω : x p (n) = 1} < ℵ 0. The definition of y on ω \ a will take care of these. Let p(k) : k < ω list all p A j with a codom(p). We define a perfect tree T on ω\a such that every n ω\a appears at most once in T and for every k we have T (k) := {ν(k) : ν T } dom(p(k)) \ (e j a) where j is such that p(k) A j. By A < 2 ℵ 0 we choose a branch z of T that is not definable from {A, T } A. We let a 4 = ran(z) and a 5 = (ω \ a) \ a 4, and we define y constantly 1 on a 4 and constantly 0 on a 5. Then for no p A \ A j can it be that {n dom(p) : x p (n) = 1} z, and hence we conclude that p y and p are incompatible for every p A. This finishes the proof of Theorem 1. By an idea of [JMSh] one can easily build maximal antichains A Si such that given p Si with [p] {[q] : q A} there exists B A such that B < 2 ℵ 0 and [p] {[q] : q B}. As then B induces a maximal antichain below p, we know by Theorem 1 that some member q of B has codom(q) codom(p). This observation has been crucial for the result add (J(Si)) b in [SpW]. It will again be crucial for the construction of a Tukey function ϕ : M J(Si) below. Moreover we apply a new idea how to encode a Cohen real using the Hamming weights of the splitnodes of a Silver tree. Notation We shall use the following notation to deal with Silver trees. Given p Si and σ p we let p σ = {τ p : τ σ σ τ}. Obviously p σ Si. We call σ a splitnode of p if σ 0 and σ 1 both belong to p. By split (p) we denote the set of all splitnodes of p. By Lev p (n) we denote the n-th splitlevel of p, i.e. the set of all σ split (p) such that if σ 0 σ 1... σ k = σ is the increasing enumeration of all τ split (p) with τ σ, then k = n. The unique element of Lev p (0) is called the stem of p. Given σ 2 n, ρ = σ k for some k n and ξ 2 k, by σ ξ we denote the unique τ ρ 2n with τ k = ξ and τ(i) = σ(i) for every i [k, n). Note that given ρ Lev p (n) and σ Lev p (m) such that n < m and ρ σ, σ uniquely determines Lev q (n + 1) for any q Si with q p, Lev q (n) = Lev p (n) σ Lev q (n + 1), namely Lev q (n + 1) = {σ ξ i : ξ Lev ρ σ( ρ ) p(n) i < 2}. By C we denote Cohen forcing (2 <ω, ). Given D C we let D = {[σ] : σ D} where [σ] = {x 2 ω : σ x}. 3
4 2 Coding by Hamming weights Definition 2 For n, k < ω we define d(n, k) 2 by letting d(n, k) = 0 iff the unique j < ω such that n [j 2 k, (j +1) 2 k ) is even. Let e(n) be the minimal k < ω with 2 k > n. Let c(n) = d(n, k) : k < ω and c (n) = c(n) e(n). Remark 1 Obviously c(n)(k) = 0 for every k e(n) and e(n) < n for every n < ω. Definition 3 For σ 2 <ω the Hamming weight of σ is defined as HW (σ) = {i < σ : σ(i) = 1}. Remark 2 Note that for every n < ω, σ 2 n and σ i : i < k such that σ 0 σ 1... σ k 1 σ, letting ξ i = c (HW (σ i )), we have that i<k HW (σ i ) n and hence, by the previous remark, ξ 0 ξ 1... ξ k 1 has length < n. Coding Lemma 2 Given D C open dense, I n : n < ω a sequence of intervalls in ω with lim I n = and l, m < ω, for almost every n there is n k I n such that (i) k l I n and (ii) for every ν 2 m, for every i [k l, k] ν c (i) D. Proof: Let t be the number of digits of the binary representation of l. We can find σ 2 <ω such that for every ν 2 m and µ 2 t we have ν µ σ D. Let s = σ. Let n be large enough such that at least three multiples of 2 t+s 1 belong to I n. Then clearly there exists k I n of the form j<s λ j 2 t+j, where λ j ω, such that c (k ) = 0 t σ, where 0 t is the string of t many 0 s, and there exists a multiple of 2 t+s 1 in I n bigger that k. We let k = k + l. Note that k I n and for every i [k l, k] there exists µ 2 t such that c (i) = µ σ. By the choice of σ, k is as desired. Thinning-Out-Lemma 3 Given D n : n < ω a family of open dense sets D n C and p Si, there exists q Si such that q p and for every n < ω and σ Lev q (n + 1), if m = τ for any τ Lev q (n) and k = HW (σ), then ν c (k) D j for every ν 2 m and j n. 4
5 Remark 3 Note that the set of q Si with the property described in the Thinning-Out-Lemma is open, hence open dense. Proof: It is evident that for every p Si and n < ω we have that I p (n) := {HW (σ) : σ Lev p (n)} is an intervall in ω of lenth n + 1. Moreover, given f ω ω we can find q p such that f(n) < min(i q (n)) and max(i q (n)) < min(i q (n + 1)) for every n < ω. Simply delete enough spitlevels of p by deleting there the nodes that go left. Suppose now that we have constructed q p up to Lev q (n) as desired. Let τ be the lexicographically largest element of Lev q (n) and m = τ. We apply the Coding Lemma with D = D j, I pτ 1 (j) : j < ω, l = n + 1 and m and obtain j and σ Lev pτ 1 (j) such that, letting k = HW (σ), we have k l I pτ 1 (j) and ν c (i) D for every ν 2 m and i [k l, k]. Then σ determines Lev q (n + 1) such that it is its lexicographically largest element and {HW (ξ) : ξ Lev q (n + 1)} = [k n 1, k]. Definition 4 Let p Si, let σ n the leftmost element of Lev p (n), m n = σ n, w n = HW (σ n ) and ξ n = c (w n ). Define G n+1 (p) = {[ν ξ n+1 ] : ν 2 mn }, H n+1 (p) = {G j (p) : j n + 1} and H(p) = H n+1 (p). Finally let H (p) = {H(p τ ) : τ split (p)}. Remark 4 Every H n+1 (p) 2 ω is dense open, hence H(p) and H (p) are dense G δ. Lemma 4 Let D n : n < ω, p and q be as in the Thinning-Out-Lemma and let r Si, r q. Then H(r) Dn. Proof: Let ρ n be the leftmost element of Lev r (n), l n = ρ n, v n = HW (ρ n ) and ζ n = c (v n ). Then ρ n+1 Lev q (k + 1) for some k n. Let σ Lev q (k) such that σ ρ n+1 and let m = σ. Clearly ρ n σ and hence l n m. By construction of q we have ν ζ n+1 D j for every ν 2 m and hence j k ν ζ n+1 D j for every ν 2 ln. We conclude G n+1 (r) Dj and hence H n+1 (r) Dj and H(r) Dn. 3 The Tukey function Theorem 5 M T J(Si). 5
6 Proof: We have to define a Tukey function ϕ : M J(Si). Let F 2 ω be any meager set of type F σ. Let E n : n < ω be a family of dense open sets E n 2 ω such that F = 2 ω \ E n. Let D n C be dense open such that Dn = E n. In order to define ϕ(f ) we construct A Si such that (1) A is a maximal antichain of Si; (2) for every q Si, if [q] {[p] : p A} there exists B [A] <2ℵ 0 such that [q] {[p] : p B}; (3) for every q A, for every n < ω and every σ Lev q (n + 1), if m = τ for any τ Lev q (n) and k = HW (σ), then ν c (k) D j for every j n and ν 2 m. The construction is a pretty straightforward application of the Thinning- Out-Lemma. Let q β : β < 2 ℵ 0 enumerate all Silver trees. Suppose that for γ < 2 ℵ 0 we have constructed an increasing sequence B β : β < γ of antichains B β Si with B β = β together with a sequence x β : β < γ of elements of 2 ω. If [q γ ] {[p] : p B β } we fix x γ [q γ ] \ {[p] : p B β }. Otherwise x γ 2 ω is arbitrary. If some p B β is compatible with q γ we let B γ = B β. Otherwise, by the Thinning-Out-Lemma, we first find q q γ as in (3) and then choose q q in Si with x β / [q ] for every β γ. Then we let B γ = B β {q }. Then A = β<2 ℵ 0 B β is as desired. Now we define ϕ(f ) as 2 ω \ {[p] : p A}. We have to show that ϕ is Tukey. let X M be such that ϕ[x] J(Si). We have to show X M. By assumption we find q Si such that [q] ϕ[x] =. We claim that H (q) F = for every F X, which will suffice. Let F X be arbitrary. Let A Si be the maximal antichain we have constructed above to define ϕ(x). Let D n : n < ω as in that construction. We know that [q] {[p] : p A}. By (2) there exists B [A] <2ℵ 0 such that [q] {[p] : p B}. Note that any two incompatible Silver trees have only finitely many branches in common. Therefore no p A \ B is compatible with q. Hence B includes a maximal antichain of Si below q. More precisely, B q := {p q : p B p, q are compatible} is like that. By Theorem 1 there exists r B q that is relatively finite in q, i.e. r = p q for some p B with codom(q) codom(p). Therefore there exists τ split(r) such 6
7 that q τ p. By Lemma 4 and by (3) we conclude H(q τ ) Dn and hence H (q) Dn which means H (q) F = as desired. References [BJ] T. Bartoszynski, H. Judah, Set theory - On the structure of the real line, AK Peters Wellesley (1999). [JMSh] H. Judah, A. Miller, S. Shelah, Sacks forcing, Laver forcing, and Martin s axiom, Arch. Math. Logic (1992) 31, [L] G. Laguzzi, Some considerations on Amoeba forcing notions, Arch. Logic, to appear. [LShV] A. Louveau, S. Shelah, B. Velickovic, Borel partitions of infinite subtrees of a perfect tree, Ann. Pure Appl. Logic (1993) 63, [M] J. Mycielski, Some new ideals of sets on the real line, Coll. (1969) 20, Math. [ShSt] S. Shelah, J. Steprāns, The covering numbers of Mycielski ideals are all equal, J. Symb. Logic (2001) 66, [Sp] O. Spinas, Generic trees, J. Symb. Logic (1995) 60, [SpW] O. Spinas, M. Wyszkowski, Silver antichains, J. Symb. Logic, to appear. Mathematisches Seminar Christian-Albrechts-Universität zu Kiel Ludewig-Meyn-Str. 4, Kiel, Germany 7
No Tukey reduction of Lebesgue null to Silver null sets
No Tukey reduction of Lebesgue null to Silver null sets Otmar Spinas 1 Abstract We prove that consistently the Lebesgue null ideal is not Tukey reducible to the Silver null ideal. This contrasts with the
More informationSMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS
SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS MARCIN KYSIAK AND TOMASZ WEISS Abstract. We discuss the question which properties of smallness in the sense of measure and category (e.g. being a universally
More informationUltrafilters with property (s)
Ultrafilters with property (s) Arnold W. Miller 1 Abstract A set X 2 ω has property (s) (Marczewski (Szpilrajn)) iff for every perfect set P 2 ω there exists a perfect set Q P such that Q X or Q X =. Suppose
More informationCofinalities of Marczewski-like ideals
Cofinalities of Marczewski-like ideals Jörg Brendle Graduate School of System Informatics Kobe University Rokko-dai 1-1, Nada-ku Kobe 657-8501, Japan email: brendle@kobe-u.ac.jp and Yurii Khomskii Hamburg
More informationUncountable trees and Cohen κ-reals
Uncountable trees and Cohen -reals Giorgio Laguzzi (U. Freiburg) January 26, 2017 Abstract We investigate some versions of amoeba for tree forcings in the generalized Cantor and Baire spaces. This answers
More informationCCC Forcing and Splitting Reals
CCC Forcing and Splitting Reals Boban Velickovic Equipe de Logique, Université de Paris 7 2 Place Jussieu, 75251 Paris, France Abstract Prikry asked if it is relatively consistent with the usual axioms
More informationON A THEOREM OF BANACH AND KURATOWSKI AND K-LUSIN SETS. Tomek Bartoszyński
ON A THEOREM OF BANACH AND KURATOWSKI AND K-LUSIN SETS Tomek Bartoszyński Department of Mathematics, Boise State University Boise, ID 83725 (U.S.A.) Email: tomek@diamond.boisestate.edu Lorenz Halbeisen
More informationCardinal characteristics, projective wellorders and large continuum
Cardinal characteristics, projective wellorders and large continuum Vera Fischer a,1,, Sy David Friedman a,1, Lyubomyr Zdomskyy a,1 a Kurt Gödel Research Center, University of Vienna, Währinger Strasse
More informationLusin sequences under CH and under Martin s Axiom
F U N D A M E N T A MATHEMATICAE 169 (2001) Lusin sequences under CH and under Martin s Axiom by Uri Abraham (Beer-Sheva) and Saharon Shelah (Jerusalem) Abstract. Assuming the continuum hypothesis there
More informationTutorial 1.3: Combinatorial Set Theory. Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011
Tutorial 1.3: Combinatorial Set Theory Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011 I. Generalizing Ramsey s Theorem Our proof of Ramsey s Theorem for pairs was
More informationLusin sequences under CH and under Martin s Axiom
arxiv:math/9807178v1 [math.lo] 15 Jul 1998 Lusin sequences under CH and under Martin s Axiom Uri Abraham Department of Mathematics and Computer Science, Ben-Gurion University, Beér-Sheva, Israel Saharon
More informationmany). But no other examples were known even Sacks forcing. Also for e.g. V = V = L, we did not know a forcing making it not proper.
SARAJEVO JOURNAL OF MATHEMATICS Vol.13 (26), No.2, (2017), 141 154 DOI: 10.5644/SJM.13.2.02 PRESERVING OLD ([ω] ℵ0, ) IS PROPER SAHARON SHELAH Abstract. We give some sufficient and necessary conditions
More informationEventually Different Functions and Inaccessible Cardinals
Eventually Different Functions and Inaccessible Cardinals Jörg Brendle 1, Benedikt Löwe 2,3,4 1 Graduate School of Engineering, Kobe University, Rokko-dai 1-1, Nada, Kobe 657-8501, Japan 2 Institute for
More informationDistributivity of Quotients of Countable Products of Boolean Algebras
Rend. Istit. Mat. Univ. Trieste Volume 41 (2009), 27 33. Distributivity of Quotients of Countable Products of Boolean Algebras Fernando Hernández-Hernández Abstract. We compute the distributivity numbers
More informationFORCING AXIOMS AND THE CONTINUUM HYPOTHESIS, PART II: TRANSCENDING ω 1 -SEQUENCES OF REAL NUMBERS
FORCING AXIOMS AND THE CONTINUUM HYPOTHESIS, PART II: TRANSCENDING ω 1 -SEQUENCES OF REAL NUMBERS JUSTIN TATCH MOORE Abstract. The purpose of this article is to prove that the forcing axiom for completely
More informationCompact subsets of the Baire space
Compact subsets of the Baire space Arnold W. Miller Nov 2012 Results in this note were obtained in 1994 and reported on at a meeting on Real Analysis in Lodz, Poland, July 1994. Let ω ω be the Baire space,
More informationMAD FAMILIES CONSTRUCTED FROM PERFECT ALMOST DISJOINT FAMILIES
The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 MAD FAMILIES CONSTRUCTED FROM PERFECT ALMOST DISJOINT FAMILIES Abstract. We prove the consistency of b > ℵ 1 together with the existence of a
More informationProjective measure without projective Baire
Projective measure without projective Baire David Schrittesser Westfälische Wilhems-Universität Münster 4th European Set Theory Conference Barcelona David Schrittesser (WWU Münster) Projective measure
More informationUncountable γ-sets under axiom CPA game
F U N D A M E N T A MATHEMATICAE 176 (2003) Uncountable γ-sets under axiom CPA game by Krzysztof Ciesielski (Morgantown, WV), Andrés Millán (Morgantown, WV) and Janusz Pawlikowski (Wrocław) Abstract. We
More informationA product of γ-sets which is not Menger.
A product of γ-sets which is not Menger. A. Miller Dec 2009 Theorem. Assume CH. Then there exists γ-sets A 0, A 1 2 ω such that A 0 A 1 is not Menger. We use perfect sets determined by Silver forcing (see
More informationA DIRECT PROOF OF THE FIVE ELEMENT BASIS THEOREM
A DIRECT PROOF OF THE FIVE ELEMENT BASIS THEOREM BOBAN VELIČKOVIĆ AND GIORGIO VENTURI Abstract. We present a direct proof of the consistency of the existence of a five element basis for the uncountable
More informationMore forcing notions imply diamond
More forcing notions imply diamond Andrzej Ros lanowski Dept. of Mathematics and Computer Science Bar-Ilan University 52900 Ramat-Gan, Israel and Mathematical Institute of Wroclaw University 50384 Wroclaw,
More informationSelective Ultrafilters on FIN
Selective Ultrafilters on FIN Yuan Yuan Zheng Abstract We consider selective ultrafilters on the collection FIN of all finite nonempty subsets of N. If countablesupport side-by-side Sacks forcing is applied,
More informationSOME REMARKS ON NON-SPECIAL COHERENT ARONSZAJN TREES
SOME REMARKS ON NON-SPECIAL COHERENT ARONSZAJN TREES MICHAEL HRUŠÁK AND CARLOS MARTÍNEZ RANERO Abstract. We introduce some guessing principles sufficient for the existence of non-special coherent Aronszajn
More informationPSEUDO P-POINTS AND SPLITTING NUMBER
PSEUDO P-POINTS AND SPLITTING NUMBER ALAN DOW AND SAHARON SHELAH Abstract. We construct a model in which the splitting number is large and every ultrafilter has a small subset with no pseudo-intersection.
More informationTitle Covering a bounded set of functions by Author(s) Kada, Masaru Editor(s) Citation Topology and its Applications. 2007, 1 Issue Date 2007-01 URL http://hdl.handle.net/10466/12488 Rights c2007 Elsevier
More informationA BOREL SOLUTION TO THE HORN-TARSKI PROBLEM. MSC 2000: 03E05, 03E20, 06A10 Keywords: Chain Conditions, Boolean Algebras.
A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM STEVO TODORCEVIC Abstract. We describe a Borel poset satisfying the σ-finite chain condition but failing to satisfy the σ-bounded chain condition. MSC 2000:
More informationAn introduction to OCA
An introduction to OCA Gemma Carotenuto January 29, 2013 Introduction These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of
More informationA variant of Namba Forcing
A variant of Namba Forcing Moti Gitik School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Science Tel Aviv University Ramat Aviv 69978, Israel August 0, 009 Abstract Ronald Jensen
More informationTHE TREE PROPERTY AND THE FAILURE OF THE SINGULAR CARDINAL HYPOTHESIS AT ℵ ω 2
THE TREE PROPERTY AND THE FAILURE OF THE SINGULAR CARDINAL HYPOTHESIS AT ℵ ω 2 DIMA SINAPOVA Abstract. We show that given ω many supercompact cardinals, there is a generic extension in which the tree property
More informationSELF-DUAL UNIFORM MATROIDS ON INFINITE SETS
SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS NATHAN BOWLER AND STEFAN GESCHKE Abstract. We extend the notion of a uniform matroid to the infinitary case and construct, using weak fragments of Martin s Axiom,
More informationIrredundant Generators
rredundant Generators Jonathan Cancino, Osvaldo Guzmán, Arnold W. Miller May 21, 2014 Abstract We say that is an irredundant family if no element of is a subset mod finite of a union of finitely many other
More informationUniversal graphs and functions on ω 1
Universal graphs and functions on ω 1 Saharon Shelah a,1, Juris Steprāns b,2 a Department of Mathematics, Rutgers University, Hill Center, Piscataway, New Jersey, U.S.A. 08854-8019 and Institute of Mathematics,
More informationA model with no magic set
A model with no magic set Krzysztof Ciesielski Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA KCies@wvnvms.wvnet.edu Saharon Shelah Institute of Mathematics, the Hebrew
More informationINSEPARABLE SEQUENCES AND FORCING
Novi Sad J. Math. Vol. 43, No. 2, 2013, 185-189 INSEPARABLE SEQUENCES AND FORCING Boris Šobot 1 Abstract. An inseparable sequence is an almost disjoint family A ξ : ξ < ω 1 of subsets of ω such that for
More informationTHE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES
THE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES NATASHA DOBRINEN Abstract. The universal homogeneous triangle-free graph H 3 has finite big Ramsey degrees : For each finite triangle-free
More informationTHE STRONG TREE PROPERTY AND THE FAILURE OF SCH
THE STRONG TREE PROPERTY AND THE FAILURE OF SCH JIN DU Abstract. Fontanella [2] showed that if κ n : n < ω is an increasing sequence of supercompacts and ν = sup n κ n, then the strong tree property holds
More informationUNIFORMIZING LADDER SYSTEM COLORINGS AND THE RECTANGLE REFINING PROPERTY
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 138, Number 8, August 2010, Pages 2961 2971 S 0002-9939(10)10330-X Article electronically published on March 17, 2010 UNIFORMIZING LADDER SYSTEM
More informationRegularity and Definability
Regularity and Definability Yurii Khomskii University of Amsterdam PhDs in Logic III Brussels, 17 February 2011 Yurii Khomskii (University of Amsterdam) Regularity and definability PhDs in Logic III 1
More informationWojciech Stadnicki. On Laver extension. Uniwersytet Wrocławski. Praca semestralna nr 2 (semestr letni 2010/11) Opiekun pracy: Janusz Pawlikowski
Wojciech Stadnicki Uniwersytet Wrocławski On Laver extension Praca semestralna nr 2 (semestr letni 2010/11) Opiekun pracy: Janusz Pawlikowski On Laver extension Wojciech Stadnicki Abstract We prove that
More informationMaharam Algebras. Equipe de Logique, Université de Paris 7, 2 Place Jussieu, Paris, France
Maharam Algebras Boban Veličković Equipe de Logique, Université de Paris 7, 2 Place Jussieu, 75251 Paris, France Abstract Maharam algebras are complete Boolean algebras carrying a positive continuous submeasure.
More informationITERATIONS WITH MIXED SUPPORT
ITERATIONS WITH MIXED SUPPORT VERA FISCHER Abstract. In this talk we will consider three properties of iterations with mixed (finite/countable) supports: iterations of arbitrary length preserve ω 1, iterations
More informationarxiv:math.gn/ v1 6 Dec 2003
SPM BULLETIN ISSUE NUMBER 6: NOVEMBER 2003 CE arxiv:math.gn/0312140 v1 6 Dec 2003 Contents 1. Editor s note 1 Previous issues 1 Contributions 2 Subscription 2 2. Research announcements 2 2.1. The Topological
More informationPCF THEORY AND CARDINAL INVARIANTS OF THE REALS
PCF THEORY AND CARDINAL INVARIANTS OF THE REALS LAJOS SOUKUP Abstract. The additivity spectrum ADD(I) of an ideal I P(I) is the set of all regular cardinals κ such that there is an increasing chain {A
More informationDistributivity of the algebra of regular open subsets of βr \ R
Topology and its Applications 149 (2005) 1 7 www.elsevier.com/locate/topol Distributivity of the algebra of regular open subsets of βr \ R Bohuslav Balcar a,, Michael Hrušák b a Mathematical Institute
More informationA NOTE ON THE EIGHTFOLD WAY
A NOTE ON THE EIGHTFOLD WAY THOMAS GILTON AND JOHN KRUEGER Abstract. Assuming the existence of a Mahlo cardinal, we construct a model in which there exists an ω 2 -Aronszajn tree, the ω 1 -approachability
More informationSacks forcing, Laver forcing, and Martin s Axiom 1
Sacks forcing, Laver forcing, and Martin s Axiom 1 Haim Judah, Arnold W. Miller 2, Saharon Shelah Abstract In this paper we study the question assuming MA+ CH does Sacks forcing or Laver forcing collapse
More informationA NEW LINDELOF SPACE WITH POINTS G δ
A NEW LINDELOF SPACE WITH POINTS G δ ALAN DOW Abstract. We prove that implies there is a zero-dimensional Hausdorff Lindelöf space of cardinality 2 ℵ1 which has points G δ. In addition, this space has
More informationIsomorphism of free G-subflows (preliminary draft)
Isomorphism of free G-subflows (preliminary draft) John D. Clemens August 3, 21 Abstract We show that for G a countable group which is not locally finite, the isomorphism of free G-subflows is bi-reducible
More informationMONOTONICALLY COMPACT AND MONOTONICALLY
MONOTONICALLY COMPACT AND MONOTONICALLY LINDELÖF SPACES GARY GRUENHAGE Abstract. We answer questions of Bennett, Lutzer, and Matveev by showing that any monotonically compact LOT S is metrizable, and any
More informationNon-trivial automorphisms from variants of small d
Non-trivial automorphisms from variants of small d Fields October 24, 2012 Notation If A and B are subsets of N let denote the equivalence relation defined by A B if and only if A B is finite. Let [A]
More informationINCREASING THE GROUPWISE DENSITY NUMBER BY C.C.C. FORCING HEIKE MILDENBERGER AND SAHARON SHELAH
INCREASING THE GROUPWISE DENSITY NUMBER BY C.C.C. FORCING HEIKE MILDENBERGER AND SAHARON SHELAH Abstract. We show that ℵ 2 b < g is consistent. This work is dedicated to James Baumgartner on the occasion
More informationStat 451: Solutions to Assignment #1
Stat 451: Solutions to Assignment #1 2.1) By definition, 2 Ω is the set of all subsets of Ω. Therefore, to show that 2 Ω is a σ-algebra we must show that the conditions of the definition σ-algebra are
More informationInfinite Combinatorics, Definability, and Forcing
Infinite Combinatorics, Definability, and Forcing David Schrittesser University of Copenhagen (Denmark) RIMS Workshop on Infinite Combinatorics and Forcing Theory Schrittesser (Copenhagen) Combinatorics,
More informationIndependence of Boolean algebras and forcing
Annals of Pure and Applied Logic 124 (2003) 179 191 www.elsevier.com/locate/apal Independence of Boolean algebras and forcing Milos S. Kurilic Department of Mathematics and Informatics, University of Novi
More informationAnnals of Pure and Applied Logic
Annals of Pure and Applied Logic 161 (2010) 916 922 Contents lists available at ScienceDirect Annals of Pure and Applied Logic journal homepage: www.elsevier.com/locate/apal Cardinal characteristics and
More informationKatětov and Katětov-Blass orders on F σ -ideals
Katětov and Katětov-Blass orders on F σ -ideals Hiroaki Minami and Hiroshi Sakai Abstract We study the structures (F σ ideals, K ) and (F σ ideals, KB ), where F σideals is the family of all F σ-ideals
More informationBorel cardinals and Ramsey ultrafilters (draft of Sections 1-3)
Borel cardinals and Ramsey ultrafilters (draft of Sections 1-3) Richard Ketchersid Paul Larson Jindřich Zapletal May 17, 2012 Abstract This is a draft of the first three sections of a paper in preparation
More informationHECHLER'S THEOREM FOR TALL ANALYTIC P-IDEALS
HECHLER'S THEOREM FOR TALL ANALYTIC P-IDEALS BARNABÁS FARKAS Abstract. We prove the following version of Hechler's classical theorem: For each partially ordered set (Q, ) with the property that every countable
More informationGREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM
The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 GREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM KENNETH KUNEN AND DILIP RAGHAVAN Abstract. We continue the investigation of Gregory trees and
More informationTHE TREE PROPERTY AT ℵ ω+1 DIMA SINAPOVA
THE TREE PROPERTY AT ℵ ω+1 DIMA SINAPOVA Abstract. We show that given ω many supercompact cardinals, there is a generic extension in which there are no Aronszajn trees at ℵ ω+1. This is an improvement
More informationSMALL COMBINATORIAL CARDINAL CHARACTERISTICS AND THEOREMS OF EGOROV AND BLUMBERG
Real Analysis Exchange Vol. 26(2), 2000/2001, pp. 905 911 Krzysztof Ciesielski, Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA, email: K Cies@math.wvu.edu, internet:
More informationBeyond the Axiom of Completeness
Peter Fekete Beyond the Axiom of Completeness Supplement to On the Continuum exploring alternative structures to the continuum other than that provided by the Axiom of Completeness. Peter Fekete, February
More informationSelective ultrafilters in N [ ], FIN [ ], and R α
Selective ultrafilters in N [ ], FIN [ ], and R α Yuan Yuan Zheng University of Toronto yyz22@math.utoronto.ca October 9, 2016 Yuan Yuan Zheng (University of Toronto) Selective ultrafilters October 9,
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationOn sums of Darboux and nowhere constant continuous functions
On sums of Darboux and nowhere constant continuous functions Krzysztof Ciesielski Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA e-mail: K Cies@math.wvu.edu; web page:
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationTOPOLOGY PROCEEDINGS Volume 28, No. 1, 2004 Pages
TOPOLOGY PROCEEDINGS Volume 28, No. 1, 2004 Pages 113-132 A FAMILY OF TREES WITH NO UNCOUNTABLE BRANCHES MIRNA DŽAMONJA AND JOUKO VÄÄNÄNEN Abstract. We construct a family of 2 ℵ 1 trees of size ℵ 1 and
More informationTemplate iterations with non-definable ccc forcing notions
Template iterations with non-definable ccc forcing notions Diego Alejandro Mejía Graduate School of System Informatics, Kobe University, Kobe, Japan. damejiag@kurt.scitec.kobe-u.ac.jp arxiv:1305.4740v4
More informationISOLATING CARDINAL INVARIANTS
Journal of Mathematical Logic, Vol. 3, No. 1 (2003) 143 162 c World Scientific Publishing Company & Singapore University Press ISOLATING CARDINAL INVARIANTS JINDŘICH ZAPLETAL Department of Mathematics,
More informationAn Iterated Forcing Extension In Which All Aleph-1 Dense Sets of Reals Are Isomorphic
San Jose State University SJSU ScholarWorks Master's Theses Master's Theses and Graduate Research Summer 2010 An Iterated Forcing Extension In Which All Aleph-1 Dense Sets of Reals Are Isomorphic Michael
More informationClassical Theory of Cardinal Characteristics
Classical Theory of Cardinal Characteristics Andreas Blass University of Michigan 22 August, 2018 Andreas Blass (University of Michigan) Classical Theory of Cardinal Characteristics 22 August, 2018 1 /
More informationForcing Axioms and Inner Models of Set Theory
Forcing Axioms and Inner Models of Set Theory Boban Veličković Equipe de Logique Université de Paris 7 http://www.logique.jussieu.fr/ boban 15th Boise Extravaganza in Set Theory Boise State University,
More informationSACKS FORCING AND THE SHRINK WRAPPING PROPERTY
SACKS FORCING AND THE SHRINK WRAPPING PROPERTY DAN HATHAWAY Abstract. We consider a property stronger than the Sacks property which holds between the ground model and the Sacks forcing extension. 1. The
More informationAn analogy between cardinal characteristics and highness properties of oracles
1/1013 An analogy between cardinal characteristics and highness properties of oracles André Nies CCR 2014 What would a new open questions paper on randomness contain? 2/1013 3/1013 Randomness connecting
More informationThe axiom of choice and two-point sets in the plane
A.Miller AC and 2-point sets The axiom of choice and two-point sets in the plane Abstract Arnold W. Miller In this paper we prove that it consistent to have a two-point set in a model of ZF in which the
More informationCovering a bounded set of functions by an increasing chain of slaloms
Topology and its Applications 154 (2007) 277 281 www.elsevier.com/locate/topol Covering a bounded set of functions by an increasing chain of slaloms Masaru Kada Graduate School of Science, Osaka Prefecture
More informationAxioms of separation
Axioms of separation These notes discuss the same topic as Sections 31, 32, 33, 34, 35, and also 7, 10 of Munkres book. Some notions (hereditarily normal, perfectly normal, collectionwise normal, monotonically
More informationLuzin and Sierpiński sets meet trees
, based on joint work with R. Ra lowski & Sz. Żeberski Wroc law University of Science and Technology Winter School in Abstract Analysis 2018, section Set Theory and Topology 01.02.2018, Hejnice Definition
More informationComplexity of Ramsey null sets
Available online at www.sciencedirect.com Advances in Mathematics 230 (2012) 1184 1195 www.elsevier.com/locate/aim Complexity of Ramsey null sets Marcin Sabok Instytut Matematyczny Uniwersytetu Wrocławskiego,
More informationarxiv:math/ v1 [math.lo] 3 Nov 1992
arxiv:math/9211202v1 [math.lo] 3 Nov 1992 Combinatorial properties of Hechler forcing Jörg Brendle 1,, Haim Judah 1, and Saharon Shelah 2, 1 Abraham Fraenkel Center for Mathematical Logic, Department of
More informationUniquely Universal Sets
Uniquely Universal Sets 1 Uniquely Universal Sets Abstract 1 Arnold W. Miller We say that X Y satisfies the Uniquely Universal property (UU) iff there exists an open set U X Y such that for every open
More informationFORCING WITH SEQUENCES OF MODELS OF TWO TYPES
FORCING WITH SEQUENCES OF MODELS OF TWO TYPES ITAY NEEMAN Abstract. We present an approach to forcing with finite sequences of models that uses models of two types. This approach builds on earlier work
More informationCombinatorial Variants of Lebesgue s Density Theorem
Combinatorial Variants of Lebesgue s Density Theorem Philipp Schlicht joint with David Schrittesser, Sandra Uhlenbrock and Thilo Weinert September 6, 2017 Philipp Schlicht Variants of Lebesgue s Density
More informationOn the class of perfectly null sets and its transitive version
On the class of perfectly null sets and its transitive version arxiv:1609.04005v1 [math.lo] 13 Sep 2016 Micha l Korch Institute of Mathematics University of Warsaw 02-097 Warszawa, Poland E-mail: m korch@mimuw.edu.pl
More informationThe ideal of Sierpiński-Zygmund sets on the plane
The ideal of Sierpiński-Zygmund sets on the plane Krzysztof P lotka Department of Mathematics, West Virginia University Morgantown, WV 26506-6310, USA kplotka@math.wvu.edu and Institute of Mathematics,
More informationClub degrees of rigidity and almost Kurepa trees
Club degrees of rigidity and almost Kurepa trees Gunter Fuchs The College of Staten Island/CUNY August 25, 2012 Abstract A highly rigid Souslin tree T is constructed such that forcing with T turns T into
More informationarxiv: v1 [math.lo] 12 Apr 2017
FORCING IN RAMSEY THEORY NATASHA DOBRINEN arxiv:1704.03898v1 [math.lo] 12 Apr 2017 Abstract. Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and
More informationPRODUCTS OF SPECIAL SETS OF REAL NUMBERS
Real Analysis Exchange Vol. 30(2), 2004/2005, pp. 819 836 Boaz Tsaban, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel. email: boaz.tsaban@weizmann.ac.il
More informationCANONICALIZATION BY ABSOLUTENESS
CANONICALIZATION BY ABSOLUTENESS WILLIAM CHAN Abstract. This note will give the argument of Neeman and Norwood to show Σ 1 1 (Π1 1 or 1 1 ) canonicalization of equivalence relation in L(R) with all Σ 1
More informationDENSELY k-separable COMPACTA ARE DENSELY SEPARABLE
DENSELY k-separable COMPACTA ARE DENSELY SEPARABLE ALAN DOW AND ISTVÁN JUHÁSZ Abstract. A space has σ-compact tightness if the closures of σ-compact subsets determines the topology. We consider a dense
More informationWeak Choice Principles and Forcing Axioms
Weak Choice Principles and Forcing Axioms Elizabeth Lauri 1 Introduction Faculty Mentor: David Fernandez Breton Forcing is a technique that was discovered by Cohen in the mid 20th century, and it is particularly
More informationDiagonalize This. Iian Smythe. Department of Mathematics Cornell University. Olivetti Club November 26, 2013
Diagonalize This Iian Smythe Department of Mathematics Cornell University Olivetti Club November 26, 2013 Iian Smythe (Cornell) Diagonalize This Nov 26, 2013 1 / 26 "Surprised Again on the Diagonal", Lun-Yi
More informationSouslin s Hypothesis
Michiel Jespers Souslin s Hypothesis Bachelor thesis, August 15, 2013 Supervisor: dr. K.P. Hart Mathematical Institute, Leiden University Contents 1 Introduction 1 2 Trees 2 3 The -Principle 7 4 Martin
More informationVon Neumann s Problem
Von Neumann s Problem Boban Velickovic Equipe de Logique, Université de Paris 7 2 Place Jussieu, 75251 Paris, France Abstract A well known problem of Von Neumann asks if every ccc weakly distributive complete
More information4. CLASSICAL FORCING NOTIONS.
4. CLASSICAL FORCING NOTIONS. January 19, 2010 BOHUSLAV BALCAR, balcar@math.cas.cz 1 TOMÁŠ PAZÁK, pazak@math.cas.cz 1 JONATHAN VERNER, jonathan.verner@matfyz.cz 2 We introduce basic examples of forcings,
More informationOctober 12, Complexity and Absoluteness in L ω1,ω. John T. Baldwin. Measuring complexity. Complexity of. concepts. to first order.
October 12, 2010 Sacks Dicta... the central notions of model theory are absolute absoluteness, unlike cardinality, is a logical concept. That is why model theory does not founder on that rock of undecidability,
More information1. Introduction Definition 1.1. For an L ω1,ω-sentence φ, the spectrum of φ is the set
KUREPA TREES AND SPECTRA OF L ω1,ω-sentences DIMA SINAPOVA AND IOANNIS SOULDATOS Abstract. We construct a single L ω1,ω-sentence ψ that codes Kurepa trees to prove the consistency of the following: (1)
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationTopological Algebraic Structure on Souslin and Aronszajn Lines
Topological Algebraic Structure on Souslin and Aronszajn Lines Gary Gruenhage (1), Thomas Poerio (2) and Robert W. Heath(2) (1) Department of Mathematics, Auburn University, Auburn, AL 36849 (2) Department
More information