Mad families, definability, and ideals (Part 2)
|
|
- Damon Washington
- 5 years ago
- Views:
Transcription
1 Mad families, definability, and ideals (Part 2) David Schrittesser (KGRC) joint with Asger Törnquist and Karen Haga Descriptive Set Theory in Torino August 17 Schrittesser Mad families, part 2 DST Torino 17 1 / 15
2 Overview 1 Definable mad families under Projective Determinacy 2 J -mad families, for Borel ideals J other than Fin. Schrittesser Mad families, part 2 DST Torino 17 2 / 15
3 Definable mad families under Projective Determinacy Theorem Assuming the Axiom of Projective Determinacy (PD), there are no infinite projective mad families. Our methods also give results under AD, but not all of them are new: Theorem (Neeman-Norwood) Assuming the Axiom of Determinacy holds in L(R), there are no infinite mad families in L(R). We concentrate on PD. Our proofs use: 1 Every projective set is Suslin 2 Reasonably definable forcing cannot change the projective theory Schrittesser Mad families, part 2 DST Torino 17 3 / 15
4 Definable mad families under Projective Determinacy Theorem Assuming the Axiom of Projective Determinacy (PD), there are no infinite projective mad families. Our methods also give results under AD, but not all of them are new: Theorem (Neeman-Norwood) Assuming the Axiom of Determinacy holds in L(R), there are no infinite mad families in L(R). We concentrate on PD. Our proofs use: 1 Every projective set is Suslin 2 Reasonably definable forcing cannot change the projective theory Schrittesser Mad families, part 2 DST Torino 17 3 / 15
5 Definable mad families under Projective Determinacy Theorem Assuming the Axiom of Projective Determinacy (PD), there are no infinite projective mad families. Our methods also give results under AD, but not all of them are new: Theorem (Neeman-Norwood) Assuming the Axiom of Determinacy holds in L(R), there are no infinite mad families in L(R). We concentrate on PD. Our proofs use: 1 Every projective set is Suslin 2 Reasonably definable forcing cannot change the projective theory Schrittesser Mad families, part 2 DST Torino 17 3 / 15
6 The analytic case Theorem There are no infinite Σ 1 1 mad families. Proof ideas Suppose A = p[t ] is an infinite a.d.-family. Let M A + be Mathias forcing relative to A. MA + ẋg is a.d. from every x (p[t ]) V [G]. The formula Σ 1 2 formula V [G] ( x)( y A) x y x y Fin is true in V [G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ 1 n using PD. Schrittesser Mad families, part 2 DST Torino 17 4 / 15
7 The analytic case Theorem There are no infinite Σ 1 1 mad families. Proof ideas Suppose A = p[t ] is an infinite a.d.-family. Let M A + be Mathias forcing relative to A. MA + ẋg is a.d. from every x (p[t ]) V [G]. The formula Σ 1 2 formula V [G] ( x)( y A) x y x y Fin is true in V [G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ 1 n using PD. Schrittesser Mad families, part 2 DST Torino 17 4 / 15
8 The analytic case Theorem There are no infinite Σ 1 1 mad families. Proof ideas Suppose A = p[t ] is an infinite a.d.-family. Let M A + be Mathias forcing relative to A. MA + ẋg is a.d. from every x (p[t ]) V [G]. The formula Σ 1 2 formula V [G] ( x)( y A) x y x y Fin is true in V [G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ 1 n using PD. Schrittesser Mad families, part 2 DST Torino 17 4 / 15
9 The analytic case Theorem There are no infinite Σ 1 1 mad families. Proof ideas Suppose A = p[t ] is an infinite a.d.-family. Let M A + be Mathias forcing relative to A. MA + ẋg is a.d. from every x (p[t ]) V [G]. The formula Σ 1 2 formula V [G] ( x)( y A) x y x y Fin is true in V [G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ 1 n using PD. Schrittesser Mad families, part 2 DST Torino 17 4 / 15
10 The analytic case Theorem There are no infinite Σ 1 1 mad families. Proof ideas Suppose A = p[t ] is an infinite a.d.-family. Let M A + be Mathias forcing relative to A. MA + ẋg is a.d. from every x (p[t ]) V [G]. The formula Σ 1 2 formula V [G] ( x)( y A) x y x y Fin is true in V [G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ 1 n using PD. Schrittesser Mad families, part 2 DST Torino 17 4 / 15
11 The analytic case Theorem There are no infinite Σ 1 1 mad families. Proof ideas Suppose A = p[t ] is an infinite a.d.-family. Let M A + be Mathias forcing relative to A. MA + ẋg is a.d. from every x (p[t ]) V [G]. The formula Σ 1 2 formula V [G] ( x)( y A) x y x y Fin is true in V [G] and so by Shoenfied absoluteness, also in V. This proof straightforwardly lifts to Σ 1 n using PD. Schrittesser Mad families, part 2 DST Torino 17 4 / 15
12 Lemma MA + ẋg is a.d. from every x (p[t ]) V [G]. Note that it is easier to see that MA + ẋg is a.d. from every x (p[t ]) V, i.e., from A. Proof ideas Let Z = {x p[t ] x x G / Fin}. Show Z 1. Supposing Z, let x be its unique element. x is definable from [x G ] E0. Show that x V, i.e., x A. Contradiction! Schrittesser Mad families, part 2 DST Torino 17 5 / 15
13 Lemma MA + ẋg is a.d. from every x (p[t ]) V [G]. Note that it is easier to see that MA + ẋg is a.d. from every x (p[t ]) V, i.e., from A. Proof ideas Let Z = {x p[t ] x x G / Fin}. Show Z 1. Supposing Z, let x be its unique element. x is definable from [x G ] E0. Show that x V, i.e., x A. Contradiction! Schrittesser Mad families, part 2 DST Torino 17 5 / 15
14 Lemma MA + ẋg is a.d. from every x (p[t ]) V [G]. Note that it is easier to see that MA + ẋg is a.d. from every x (p[t ]) V, i.e., from A. Proof ideas Let Z = {x p[t ] x x G / Fin}. Show Z 1. Supposing Z, let x be its unique element. x is definable from [x G ] E0. Show that x V, i.e., x A. Contradiction! Schrittesser Mad families, part 2 DST Torino 17 5 / 15
15 Lemma MA + ẋg is a.d. from every x (p[t ]) V [G]. Note that it is easier to see that MA + ẋg is a.d. from every x (p[t ]) V, i.e., from A. Proof ideas Let Z = {x p[t ] x x G / Fin}. Show Z 1. Supposing Z, let x be its unique element. x is definable from [x G ] E0. Show that x V, i.e., x A. Contradiction! Schrittesser Mad families, part 2 DST Torino 17 5 / 15
16 Lemma MA + ẋg is a.d. from every x (p[t ]) V [G]. Note that it is easier to see that MA + ẋg is a.d. from every x (p[t ]) V, i.e., from A. Proof ideas Let Z = {x p[t ] x x G / Fin}. Show Z 1. Supposing Z, let x be its unique element. x is definable from [x G ] E0. Show that x V, i.e., x A. Contradiction! Schrittesser Mad families, part 2 DST Torino 17 5 / 15
17 There are two non-trivial steps in the previous sketch: 1 {x p[t ] x x G / Fin} 1. This uses heavily some property of the ideal Fin. 2 If a real x in V [G] is definable from [x G ] E0, x is in V. This uses that that A + is σ-closed (uses that A is infinite!) thus, MA + is σ -closed in second component that MA + is homogeneous under finite changes Schrittesser Mad families, part 2 DST Torino 17 6 / 15
18 Other ideals Let J be an ideal on ω. Two sets A, A ω are called J -almost disjoint iff A A J. Let J + = P(ω) \ J A set A P(ω) is called a J -almost disjoint family iff A J + and any two distinct sets in A are J -almost disjoint. J -mad families are defined analogously. Schrittesser Mad families, part 2 DST Torino 17 7 / 15
19 Other Borel ideals Martin Goldstern asked: Question: Is there an analytic J -mad family where J is the harmonic ideal: X J n X 1/n < The answer in this case is no; and as before the proof lifts under PD (and lifts further under AD). Schrittesser Mad families, part 2 DST Torino 17 8 / 15
20 Fix a σ -closed Borel ideal J and a Suslin infinite J -a.d. family A P(ω), A = p[t ]. Denote (J, A) + by the co-ideal of the ideal generated by A J. Lemma (J, A) + is σ -closed. The obvious forcing M (J,A) + is homogeneous under changes in J and σ -closed in the second part We need more to show two more crucial properties: M(J,A) + ẋg / J V [G] M(J,A) + {x p[t ] ẋ G x J V [G] } has at most one element. Schrittesser Mad families, part 2 DST Torino 17 9 / 15
21 Fix a σ -closed Borel ideal J and a Suslin infinite J -a.d. family A P(ω), A = p[t ]. Denote (J, A) + by the co-ideal of the ideal generated by A J. Lemma (J, A) + is σ -closed. The obvious forcing M (J,A) + is homogeneous under changes in J and σ -closed in the second part We need more to show two more crucial properties: M(J,A) + ẋg / J V [G] M(J,A) + {x p[t ] ẋ G x J V [G] } has at most one element. Schrittesser Mad families, part 2 DST Torino 17 9 / 15
22 Fix a σ -closed Borel ideal J and a Suslin infinite J -a.d. family A P(ω), A = p[t ]. Denote (J, A) + by the co-ideal of the ideal generated by A J. Lemma (J, A) + is σ -closed. The obvious forcing M (J,A) + is homogeneous under changes in J and σ -closed in the second part We need more to show two more crucial properties: M(J,A) + ẋg / J V [G] M(J,A) + {x p[t ] ẋ G x J V [G] } has at most one element. Schrittesser Mad families, part 2 DST Torino 17 9 / 15
23 Fix a σ -closed Borel ideal J and a Suslin infinite J -a.d. family A P(ω), A = p[t ]. Denote (J, A) + by the co-ideal of the ideal generated by A J. Lemma (J, A) + is σ -closed. The obvious forcing M (J,A) + is homogeneous under changes in J and σ -closed in the second part We need more to show two more crucial properties: M(J,A) + ẋg / J V [G] M(J,A) + {x p[t ] ẋ G x J V [G] } has at most one element. Schrittesser Mad families, part 2 DST Torino 17 9 / 15
24 Submeasures and ideals A submeasure is a function Φ: P(ω) [0, ] such that X Y Φ(X) Φ(Y ) for any X, Y P(ω) Φ(X Y ) Φ(X) + Φ(Y ) for any X, Y P(ω) Φ({n}) < for any n ω Φ is lower semi-continuous. I.e., Φ(X) = lim Φ(X n) n Any submeasure gives rise to an ideal Fin(Φ) by letting Fin(Φ) = {X P(ω) Φ(X) < } Schrittesser Mad families, part 2 DST Torino / 15
25 Generalization to finite part of submeasure The previous arguments go through for ideals of the form Fin(Φ) where Φ is a submeasure. In particular this answers Goldstern s question. If J = Fin(Φ) + J is σ -closed. For any J -a.d. family A, M J,A + is homogeneous under changes on sets in J and σ -closed on the second part. MJ,A + φ(ẋ G ) =, i.e., ẋ G / J V [G] MJ,A + {x p[t ] ẋ G x J V [G] } has at most one element. Schrittesser Mad families, part 2 DST Torino / 15
26 What about ideals which are not of this form? Let J be any ideal. Define an ideal J ω on ω ω by: X J ω ( n ω) X(n) J That is, J ω the ideal generated by sets of the form {n} J n, n ω where (J n ) n ω is any sequence from J. Observation Let J be any non-trivial ideal. There is a countable J ω -mad family, namely {{ n} ω n ω}. In particular such ideals appear cofinally in the Borel hierarchy. Schrittesser Mad families, part 2 DST Torino / 15
27 What about ideals which are not of this form? Let J be any ideal. Define an ideal J ω on ω ω by: X J ω ( n ω) X(n) J That is, J ω the ideal generated by sets of the form {n} J n, n ω where (J n ) n ω is any sequence from J. Observation Let J be any non-trivial ideal. There is a countable J ω -mad family, namely {{ n} ω n ω}. In particular such ideals appear cofinally in the Borel hierarchy. Schrittesser Mad families, part 2 DST Torino / 15
28 What about ideals which are not of this form? Let J be any ideal. Define an ideal J ω on ω ω by: X J ω ( n ω) X(n) J That is, J ω the ideal generated by sets of the form {n} J n, n ω where (J n ) n ω is any sequence from J. Observation Let J be any non-trivial ideal. There is a countable J ω -mad family, namely {{ n} ω n ω}. In particular such ideals appear cofinally in the Borel hierarchy. Schrittesser Mad families, part 2 DST Torino / 15
29 Fubini product ideals Consider the ideal Fin Fin on ω ω, defined as follows: For X ω ω (letting X(n) = {m (n, m) X}), define X Fin Fin {n ω X(n) / Fin} Fin Using Fubini products, we can define Fin α, for every α < ω 1. Each Fin α is a definable ideal (in fact, Borel). The Fin α appear cofinally in the Borel hierarchy. Theorem For each α < ω 1, There is no analytic Fin α -mad family Under the Axiom of Projective Determinacy, there is no infinite projective Fin α -mad family Under the Axiom of Determinacy, there is no infinite Fin α -mad family in L(R). Schrittesser Mad families, part 2 DST Torino / 15
30 Question: Can we characterize the analytic, or at least the Borel ideals J P(ω) such that there is no analytic infinite J -mad family? Schrittesser Mad families, part 2 DST Torino / 15
31 Grazie mille! Schrittesser Mad families, part 2 DST Torino / 15
Lecture 3: Probability Measures - 2
Lecture 3: Probability Measures - 2 1. Continuation of measures 1.1 Problem of continuation of a probability measure 1.2 Outer measure 1.3 Lebesgue outer measure 1.4 Lebesgue continuation of an elementary
More informationHomogeneous spaces and Wadge theory
Homogeneous spaces and Wadge theory Andrea Medini Kurt Gödel Research Center University of Vienna July 18, 2018 Everybody loves homogeneous stuff! Topological homogeneity A space is homogeneous if all
More informationUltrafilters and Set Theory. Andreas Blass University of Michigan Ann Arbor, MI
Ultrafilters and Set Theory Andreas Blass University of Michigan Ann Arbor, MI 48109 ablass@umich.edu Ultrafilters and Set Theory Ultrafilters and Set Theory But not large cardinals (Itay Neeman) Ultrafilters
More informationSocial welfare relations and descriptive set theory
Albert-Ludwigs-Universität Freiburg AILA meeting - September 2017 Infinite utility streams We consider: a set of utility levels Y with some given topology (e.g., Y = {0, 1}, [0, 1], ω) X := Y ω the space
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 informationThe topology of ultrafilters as subspaces of 2 ω
Many non-homeomorphic ultrafilters Basic properties Overview of the results Andrea Medini 1 David Milovich 2 1 Department of Mathematics University of Wisconsin - Madison 2 Department of Engineering, Mathematics,
More informationProjective well-orderings of the reals and forcing axioms
Projective well-orderings of the reals and forcing axioms Andrés Eduardo Department of Mathematics Boise State University 2011 North American Annual Meeting UC Berkeley, March 24 27, 2011 This is joint
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 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 informationUNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS TREVOR M. WILSON
UNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS TREVOR M. WILSON Abstract. We prove several equivalences and relative consistency results involving notions of generic absoluteness beyond Woodin s ) (Σ
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 informationContinuous and Borel Dynamics of Countable Borel Equivalence Relations
Continuous and Borel Dynamics of Countable Borel Equivalence Relations S. Jackson (joint with S. Gao, E. Krohne, and B. Seward) Department of Mathematics University of North Texas June 9, 2015 BLAST 2015,
More informationTOWERS IN FILTERS, CARDINAL INVARIANTS, AND LUZIN TYPE FAMILIES
TOWERS IN FILTERS, CARDINAL INVARIANTS, AND LUZIN TYPE FAMILIES JÖRG BRENDLE, BARNABÁS FARKAS, AND JONATHAN VERNER ABSTRACT. We investigate which filters on ω can contain towers, that is, a modulo finite
More informationUnsolvable problems, the Continuum Hypothesis, and the nature of infinity
Unsolvable problems, the Continuum Hypothesis, and the nature of infinity W. Hugh Woodin Harvard University January 9, 2017 V : The Universe of Sets The power set Suppose X is a set. The powerset of X
More informationA NEW CLASS OF RAMSEY-CLASSIFICATION THEOREMS AND THEIR APPLICATION IN THE TUKEY THEORY OF ULTRAFILTERS, PART 1
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9947(XX)0000-0 A NEW CLASS OF RAMSEY-CLASSIFICATION THEOREMS AND THEIR APPLICATION IN THE TUKEY THEORY OF ULTRAFILTERS,
More informationJónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy
Jónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy Fifth NY Graduate Student Logic Conference The Jónsson Property For κ a cardinal and n ω, [κ] n = {(α 1,, α n ) κ n : α 1 < < α n
More informationHigher dimensional Ellentuck spaces
Higher dimensional Ellentuck spaces Natasha Dobrinen University of Denver Forcing and Its Applications Retrospective Workshop Fields Institute, April 1, 2015 Dobrinen Higher dimensional Ellentuck spaces
More informationChase Joyner. 901 Homework 1. September 15, 2017
Chase Joyner 901 Homework 1 September 15, 2017 Problem 7 Suppose there are different types of coupons available when buying cereal; each box contains one coupon and the collector is seeking to collect
More informationThe Metamathematics of Randomness
The Metamathematics of Randomness Jan Reimann January 26, 2007 (Original) Motivation Effective extraction of randomness In my PhD-thesis I studied the computational power of reals effectively random for
More informationWHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST?
WHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST? Solomon Feferman CSLI Workshop on Logic, Rationality and Intelligent Interaction Stanford, June 1, 2013 Why isn t the Continuum
More informationarxiv: v2 [math.lo] 29 Mar 2015
DEFINABILITY AND ALMOST DISJOINT FAMILIES ASGER TÖRNQUIST arxiv:1503.07577v2 [math.lo] 29 Mar 2015 Abstract. We show that there are no infinite maximal almost disjoint ( mad ) families in Solovay s model,
More informationEffective Randomness and Continuous Measures
Effective Randomness and Continuous Measures Theodore A. Slaman (on joint work with Jan Reimann) C University of California, Berkeley Review Let NCR n be the set of X 2 2! such that there is no (representation
More informationSet Theory and the Foundation of Mathematics. June 19, 2018
1 Set Theory and the Foundation of Mathematics June 19, 2018 Basics Numbers 2 We have: Relations (subsets on their domain) Ordered pairs: The ordered pair x, y is the set {{x, y}, {x}}. Cartesian products
More informationExtensions of the Axiom of Determinacy. Paul B. Larson
Extensions of the Axiom of Determinacy Paul B. Larson November 7, 2018 2 Contents 0.1 Introduction.............................. 5 0.2 Notation................................ 7 0.3 Prerequisites.............................
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 3 9/10/2008 CONDITIONING AND INDEPENDENCE
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 3 9/10/2008 CONDITIONING AND INDEPENDENCE Most of the material in this lecture is covered in [Bertsekas & Tsitsiklis] Sections 1.3-1.5
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 informationIndex sets of universal codes
Index sets of universal codes Konstantinos Beros (UNT) joint with Achilles Beros (University of Hawai i) Medvedev reductions Definition Suppose A, B are subsets of 2 ω or families of functions on ω. Say
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
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 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 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 informationNECESSARY USE OF Σ 1 1 INDUCTION IN A REVERSAL
NECESSARY USE OF Σ 1 1 INDUCTION IN A REVERSAL ITAY NEEMAN Abstract. Jullien s indecomposability theorem states that if a scattered countable linear order is indecomposable, then it is either indecomposable
More informationInner models from extended logics
1 / 43 Inner models from extended logics Joint work with Juliette Kennedy and Menachem Magidor Department of Mathematics and Statistics, University of Helsinki ILLC, University of Amsterdam January 2017
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More informationSix lectures on the stationary tower
Six lectures on the stationary tower Paul B. Larson November 19, 2012 1 The stationary tower 1.1 Definition. Let X be a nonempty set. A set c P(X) is club in P(X) if there is a function f : X
More informationST5215: Advanced Statistical Theory
Department of Statistics & Applied Probability Thursday, August 15, 2011 Lecture 2: Measurable Function and Integration Measurable function f : a function from Ω to Λ (often Λ = R k ) Inverse image of
More informationarxiv: v1 [math.lo] 6 Oct 2018
MAXIMAL ALMOST DISJOINT FAMILIES, DETERMINACY, AND FORCING KAREN BAKKE HAGA, DAVID SCHRITTESSER, ASGER TÖRNQUIST arxiv:1810.03016v1 [math.lo] 6 Oct 2018 Abstract. We study the notion of J-MAD families
More informationHandbook of Set Theory. Foreman, Kanamori, and Magidor (eds.)
Handbook of Set Theory Foreman, Kanamori, and Magidor (eds.) August 5, 2006 2 Contents I Forcing over models of determinacy 5 by Paul B. Larson 1 Iterations............................... 7 2 P max.................................
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 informationLecture 11: Random Variables
EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 11: Random Variables Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan, Gopal, Arjun B, Debayani The study of random
More informationRamsey theory with and withoutpigeonhole principle
Ramsey theory with and without pigeonhole principle Université Paris VII, IMJ-PRG Workshop Set Theory and its Applications in Topology Casa Matemática Oaxaca September 16, 2016 Two examples of infinite-dimensional
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 informationRandomness Beyond Lebesgue Measure
Randomness Beyond Lebesgue Measure Jan Reimann Department of Mathematics University of California, Berkeley November 16, 2006 Measures on Cantor Space Outer measures from premeasures Approximate sets from
More informationA Semantics of Evidence for Classical Arithmetic
Thierry Coquand Chambery, June 5, 2009 Intuitionistic analysis of classical logic This work is motivated by the first consistency proof of arithmetic by Gentzen (1936) Unpublished by Gentzen (criticisms
More informationIncreasing δ 1 2 and Namba-style forcing
Increasing δ 1 2 and Namba-style forcing Richard Ketchersid Miami University Jindřich Zapletal University of Florida April 17, 2007 Paul Larson Miami University Abstract We isolate a forcing which increases
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 informationOrdinal Ranks on the Baire and non-baire class functions. Takayuki Kihara
Ordinal Ranks on the Baire and non-baire class functions Takayuki Kihara Nagoya University, Japan Second Workshop on Mathematical Logic and its Applications, Kanazawa Mar 6th, 218 There are various notions
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 informationA HIERARCHY OF NORMS DEFINED VIA BLACKWELL GAMES
A HIERARCHY OF NORMS DEFINED VIA BLACKWELL GAMES BENEDIKT LÖWE Abstract We define a hierarchy of norms using strongly optimal strategies in Blackwell games and prove that the resulting hierarchy is a prewellordering
More informationA Descriptive View of Combinatorial Group Theory
A Descriptive View of Combinatorial Group Theory Simon Thomas Rutgers University May 12th 2014 Introduction The Basic Theme: Descriptive set theory provides a framework for explaining the inevitable non-uniformity
More information20 Ordinals. Definition A set α is an ordinal iff: (i) α is transitive; and. (ii) α is linearly ordered by. Example 20.2.
20 Definition 20.1. A set α is an ordinal iff: (i) α is transitive; and (ii) α is linearly ordered by. Example 20.2. (a) Each natural number n is an ordinal. (b) ω is an ordinal. (a) ω {ω} is an ordinal.
More informationComplexity of infinite tree languages
Complexity of infinite tree languages when automata meet topology Damian Niwiński University of Warsaw joint work with André Arnold, Szczepan Hummel, and Henryk Michalewski Liverpool, October 2010 1 Example
More informationarxiv: v1 [math.lo] 7 Dec 2017
CANONICAL TRUTH MERLIN CARL AND PHILIPP SCHLICHT arxiv:1712.02566v1 [math.lo] 7 Dec 2017 Abstract. We introduce and study a notion of canonical set theoretical truth, which means truth in a transitive
More informationGENERALIZED ELLENTUCK SPACES AND INITIAL CHAINS IN THE TUKEY STRUCTURE OF NON-P-POINTS
GENERALIZED ELLENTUCK SPACES AND INITIAL CHAINS IN THE TUKEY STRUCTURE OF NON-P-POINTS NATASHA DOBRINEN Abstract. In [1], it was shown that the generic ultrafilter G 2 forced by P(ω ω)/(fin Fin) is neither
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 informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More information18.175: Lecture 2 Extension theorems, random variables, distributions
18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing
More informationVARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES
P max VARIATIONS FOR SEPARATING CLUB GUESSING PRINCIPLES TETSUYA ISHIU AND PAUL B. LARSON Abstract. In his book on P max [6], Woodin presents a collection of partial orders whose extensions satisfy strong
More informationTHE MEASURE ALGEBRA DOES NOT ALWAYS EMBED
THE MEASURE ALGEBRA DOES NOT ALWAYS EMBED ALAN DOW* AND KLAAS PIETER HART Abstract. The Open Colouring Axiom implies that the measure algebra cannot be embedded into P(N)/fin. We also discuss the errors
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 informationFunctional Analysis HW #1
Functional Analysis HW #1 Sangchul Lee October 9, 2015 1 Solutions Solution of #1.1. Suppose that X
More informationSuslin Cardinals and Scales From AD
Suslin Cardinals and Scales From AD S. Jackson Department of Mathematics University of North Texas jackson@unt.edu Conference on the Core Model Induction and HOD Mice July-August, 2010, Muenster Basic
More informationOn the Length of Borel Hierarchies
University of Wisconsin, Madison July 2016 The Borel hierachy is described as follows: open = Σ 0 1 = G closed = Π 0 1 = F Π 0 2 = G δ = countable intersections of open sets Σ 0 2 = F σ = countable unions
More informationOptimal generic absoluteness results from strong cardinals
Optimal generic absoluteness results from strong cardinals University of California, Irvine Spring 204 MAMLS Miami University April 27, 204 Trees and generic absoluteness Sharps and 3 generic absoluteness
More informationTHE LENGTH OF THE FULL HIERARCHY OF NORMS
Rend. Sem. Mat. Univ. Pol. Torino - Vol. 63, 2 (2005) B. Löwe THE LENGTH OF THE FULL HIERARCHY OF NORMS Abstract. We give upper and lower bounds for the length of the Full Hierarchy of Norms. 1. Introduction
More informationSynthetic Probability Theory
Synthetic Probability Theory Alex Simpson Faculty of Mathematics and Physics University of Ljubljana, Slovenia PSSL, Amsterdam, October 2018 Gian-Carlo Rota (1932-1999): The beginning definitions in any
More informationOn the Length of Borel Hierarchies
On the Length of Borel Hierarchies Arnold W. Miller November 7, 2016 This is a survey paper on the lengths of Borel hierarchies and related hierarchies. It consists of lecture notes of a lecture given
More informationContinuous reducibility for the real line
Continuous reducibility for the real line Daisuke Ikegami Philipp Schlicht Hisao Tanaka May 29, 2012 Department of Mathematics, University of California, Berkeley 970 Evans Hall, Berkeley CA 94720, USA
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
More informationThe length-ω 1 open game quantifier propagates scales
The length-ω 1 open game quantifier propagates scales John R. Steel June 5, 2006 0 Introduction We shall call a set T an ω 1 -tree if only if T α
More informationIDEAL GAMES AND RAMSEY SETS
IDEAL GAMES AND RAMSEY SETS CARLOS DI PRISCO, JOSÉ G. MIJARES, AND CARLOS UZCÁTEGUI Abstract. It is shown that Matet s characterization ([9]) of the Ramsey property relative to a selective co-ideal H,
More informationON A QUESTION OF SIERPIŃSKI
ON A QUESTION OF SIERPIŃSKI THEODORE A. SLAMAN Abstract. There is a set of reals U such that for every analytic set A there is a continuous function f which maps U bijectively to A. 1. Introduction A set
More informationCardinal Invariants of Analytic P-Ideals
Canad. J. Math. Vol. 59 (3), 2007 pp. 575 595 Cardinal Invariants of Analytic P-Ideals Fernando Hernández-Hernández and Michael Hrušák Abstract. We study the cardinal invariants of analytic P-ideals, concentrating
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 informationA PECULIAR COIN-TOSSING MODEL
A PECULIAR COIN-TOSSING MODEL EDWARD J. GREEN 1. Coin tossing according to de Finetti A coin is drawn at random from a finite set of coins. Each coin generates an i.i.d. sequence of outcomes (heads or
More informationLebesgue Measure. Dung Le 1
Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its
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 informationTOPOLOGICAL RAMSEY SPACES DENSE IN FORCINGS
TOPOLOGICAL RAMSEY SPACES DENSE IN FORCINGS NATASHA DOBRINEN Abstract. Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological
More informationMathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
More informationHOD IN INNER MODELS WITH WOODIN CARDINALS
HOD IN INNER MODELS WITH WOODIN CARDINALS SANDRA MÜLLER AND GRIGOR SARGSYAN Abstract. We analyze the hereditarily ordinal definable sets HOD in the canonical inner model with n Woodin cardinals M n(x,
More informationNote that in the example in Lecture 1, the state Home is recurrent (and even absorbing), but all other states are transient. f ii (n) f ii = n=1 < +
Random Walks: WEEK 2 Recurrence and transience Consider the event {X n = i for some n > 0} by which we mean {X = i}or{x 2 = i,x i}or{x 3 = i,x 2 i,x i},. Definition.. A state i S is recurrent if P(X n
More informationConvergence and submeasures in Boolean algebras
Convergence and submeasures in Boolean algebras Thomas Jech e-mail: jech@math.psu.edu January 30, 2018 In memory of Bohuslav Balcar Abstract A Boolean algebra carries a strictly positive exhaustive submeasure
More informationNotes 1 : Measure-theoretic foundations I
Notes 1 : Measure-theoretic foundations I Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Section 1.0-1.8, 2.1-2.3, 3.1-3.11], [Fel68, Sections 7.2, 8.1, 9.6], [Dur10,
More informationBuilding Infinite Processes from Finite-Dimensional Distributions
Chapter 2 Building Infinite Processes from Finite-Dimensional Distributions Section 2.1 introduces the finite-dimensional distributions of a stochastic process, and shows how they determine its infinite-dimensional
More informationSolution. 1 Solutions of Homework 1. 2 Homework 2. Sangchul Lee. February 19, Problem 1.2
Solution Sangchul Lee February 19, 2018 1 Solutions of Homework 1 Problem 1.2 Let A and B be nonempty subsets of R + :: {x R : x > 0} which are bounded above. Let us define C = {xy : x A and y B} Show
More informationOn the complexity of infinite computations
On the complexity of infinite computations Damian Niwiński, Warsaw University joint work with Igor Walukiewicz and Filip Murlak Newton Institute, Cambridge, June 2006 1 Infinite computations Büchi (1960)
More informationA D VA N C E D P R O B A B I L - I T Y
A N D R E W T U L L O C H A D VA N C E D P R O B A B I L - I T Y T R I N I T Y C O L L E G E T H E U N I V E R S I T Y O F C A M B R I D G E Contents 1 Conditional Expectation 5 1.1 Discrete Case 6 1.2
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 informationGeneralizing Gödel s Constructible Universe:
Generalizing Gödel s Constructible Universe: Ultimate L W. Hugh Woodin Harvard University IMS Graduate Summer School in Logic June 2018 Ordinals: the transfinite numbers is the smallest ordinal: this is
More informationCardinal Preserving Elementary Embeddings
Outline Andrés E. Department of Mathematics California Institute of Technology XIII SLALM, Oaxaca, México, August 2006 Outline Outline 1 : Forcing axioms and inner models 2 Inner models M with ω1 M = ω
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 informationThe descriptive set theory of the Lebesgue density theorem. joint with A. Andretta
The descriptive set theory of the Lebesgue density theorem joint with A. Andretta The density function Let (X, d, µ) be a Polish metric space endowed with a Borel probability measure giving positive measures
More informationCONVERGENCE OF RANDOM SERIES AND MARTINGALES
CONVERGENCE OF RANDOM SERIES AND MARTINGALES WESLEY LEE Abstract. This paper is an introduction to probability from a measuretheoretic standpoint. After covering probability spaces, it delves into the
More information4 Expectation & the Lebesgue Theorems
STA 205: Probability & Measure Theory Robert L. Wolpert 4 Expectation & the Lebesgue Theorems Let X and {X n : n N} be random variables on a probability space (Ω,F,P). If X n (ω) X(ω) for each ω Ω, does
More informationSTAT 7032 Probability Spring Wlodek Bryc
STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,
More informationElementary Probability. Exam Number 38119
Elementary Probability Exam Number 38119 2 1. Introduction Consider any experiment whose result is unknown, for example throwing a coin, the daily number of customers in a supermarket or the duration of
More informationHomework 11. Solutions
Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue
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 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 informationMATH 418: Lectures on Conditional Expectation
MATH 418: Lectures on Conditional Expectation Instructor: r. Ed Perkins, Notes taken by Adrian She Conditional expectation is one of the most useful tools of probability. The Radon-Nikodym theorem enables
More information