On The Model Of Hyperrational Numbers With Selective Ultrafilter
|
|
- Ariel Griffin
- 5 years ago
- Views:
Transcription
1 MSC 03H05 On The Model Of Hyperrational Numbers With Selective Ultrafilter A. Grigoryants Moscow State University Yerevan Branch February 27, 2019 Abstract In standard construction of hyperrational numbers using ultrapower we assume that the ultrafilter is selective. It makes possible to assign real value to any finite hyperrational number. So, we can consider hyperrational numbers with selective ultrafilter as extension of traditional real numbers. Also proved the existence of strictly monotonic or stationary representing sequence for any hyperrational number. Keywords: hyperrational number, selective ultrafilter, non-standard analysis, ultrapower 1 Notation and definitions We use standard set theoretic notation (see [3]). Let us give some well-known definition for convenience. Partition of a set S is a pairwise disjoint family {S i } i I of nonempty subsets such that i I S i = S. Let F 2 ω be non-principal ultrafilter on ω. We ll call elements in F big subsets (relative to F) and elements not in F small subsets (relative to F). F is called selective ultrafilter if for every partition {S n } n ω of ω into ℵ 0 pieces such that S n / F for all n (small partition) there exists B F (big selection) such that B S n is singleton for all n ω. Equivalently, F is selective if for every function f : ω ω such 1
2 that f 1 (i) is small for every i, there exists a big subset B such that restriction f B is injective. The restriction of F to a big subset B ω defined as F B = {J B J F} 2 B is selective ultrafilter on B. Continuum hypothesis (CH) implies existence of selective ultrafilters due to Galvin [3, theor. 7.8]. The result of Shelah [4] shows that existence of selective ultrafilters is unprovable in ZFC. So, we continue with ZFC & CH to ensure the existence of selective ultrafilter. Let [S] k = {X S : X = k} is the set of all subsets of S that have exactly k elements. If {X i } i I is a partition of [S] k then a subset H S is homogeneous for the partition if for some i : [H] k X i. The following fact is special case of Kunen s theorem proven in [5, theor. 9.6]: Theorem 1. An ultrafilter on ω is selective if and only if for every partition of [ω] 2 into two pieces there is a big homogeneous set. Due to this theorem selective ultrafilters are also called Ramsey ultrafilters. We ll give simplified proof of theorem 1. We say that filter F 2 ω is normal if for any collection {A i } i ω F there exists B F such that for any i, j B : i < j = j A i. Equally, we can say that F is normal if there exists I F such that above definition holds for any collection {A i } i I F. Indeed we can expand given collection adding A k = ω for k / I, then apply definition to {A i } i ω and intersect obtained B with I. We continue with fixed selective ultrafilter F on ω. Let us denote Q = Q ω / F the quotient of Q ω = {(x i ) i ω i : x i Q} by the following equivalence relation: (x i ) F (y i ) {i I x i = y i } F. This is well-known ultrapower construction widely used in model theory and in Robinson s non-standard analysis (see [1], [2]). We only added the property of selectivity to F. So, we call elements of Q hyperrational numbers. There is natural embedding ι : Q Q where ι(q) is the equivalence class of constant sequence (q, q,..., q,... ). We ll identify Q with ι(q). Also Q satisfies the transfer principle. So, all true first order statements about Q are also valid in Q. In particular, Q is ordered field. We call element x Q infinitely large if x > q for all q Q, infinitesimal if x < q for all q Q. Otherwise x is called finite. We write x < if x is finite or infinitesimal. We use short notation x n for some representative (x n ) n ω of equivalence class x = [(x n ) n ω ] Q. So, we can make arbitrary changes to sequence x n on arbitrary small set without changing appropriate 2
3 x Q. Allowing some inaccuracy we ll talk about hyperrational number x = x n. Let us call subsequence x nk = x J of x n big subsequence if the subset J = {n k : k ω} of indexes is big. The hyperrational number x = x n is infinitely large if and only if any big subsequence x nk is unbounded, is infinitesimal if and only if 1/x is infinitely large. 2 Propositions Theorem 2. For any x = x n Q, there exists big subsequence x nk, which is strictly increasing or strictly decreasing or stationary. The cases are mutually exclusive. In case of x < the subsequence is fundamental and any two such subsequences x nk and x mk are equivalent in traditional metric sense lim k (x n k x mk ) = 0 Hyperrational numbers given by increasing (decreasing) sequences we call left (right) numbers. Hyperrational numbers given by stationary sequences are exactly rational numbers. Let Q fin = {x Q x < } be the set of all finite hyperrational numbers and infinitesimals. Theorem 3. The set Q fin is local ring, which unique maximal ideal is the set of infinitesimals I. The factor ring of Q fin modulo I is the field isomorphic to the field of real numbers: 3 Proofs Q fin /I R We give the proof of the theorem 1 which is a bit more simple than the one from [5] in part of implication selective normal. Proof of theorem 1. We use following proof schema: selective normal Ramsey selective. selective normal. Let {A i } i ω F be arbitrary collection of big sets. We can assume with no loss of generality that i A k : i > k, because we can replace A k with big subsets A k = {i A k i > k}. Let us define mapping f : ω ω, f(i) = min{j ω i / A j }. Thus f(i) i because i / A i. Obviously, f 1 (j) A j = and, so, sets f 1 (j) are small for all j. Then there exists big set B such that f is injective on B. We ll construct big set A with the property: i, j A : i < j i < f(j) j. Such a set satisfies the conditions of the statement. 3
4 Now let us construct subsets P k of B as follows: m 0 = f(b 0 ) = min f(b), P 0 = {b 0 }, k 1 S k = {s f(b) s > max P i }, k 1, i=0 m k = f(b k ) = min S k, k 1, P k = {b B m k 1 < f(b) m k }, k 1 All P k are finite because f B is injective. Obviously, k i=0 P i = {b B f(b) m k }. All S k are infinite because f(b) is infinite. Thus S k and all m k are correctly defined. Note that S k+1 S k and so m k m k+1 for all k. In fact m k = f(b k ) b k < m k+1 because b k P k and m k+1 > max k i=0 P i. So, the sequence m k is strictly increasing. The sets P k are not empty because at least b k P k. Now if y P k+2 then max( k i=0 P i) < m k+1 < f(y) and so x < f(y) y for all x k i=0 P i. We have k P k = B. One of two sets k P 2k and k P 2k+1 is big and partitioned with small sets P n where n is odd or even. Let A be big selection from this partition. Let i < j be arbitrary elements of A. Then i P k and j P k+2s for some k and s > 0. So, i < f(j) j and j A i. normal Ramsey. Let [ω] 2 = P Q be some partition of [ω] 2. We consider following subsets of ω: P i = {j ω {i, j} P and j > i} Q i = {j ω {i, j} Q and j > i} Obviously, ω = P i Qi {1,..., i} for all i. So, for fixed i one and only one of P i and Q i is big. Let B = {i ω P i F} and C = {i ω Q i F}. One of B and C is big. Let it be B. So, we have family {P i } i B of big sets. By the definition of normal ultrafilter there exists big set A such that for any two elements i < j from A we have j P i which means {i, j} P. So, A is homogeneous. Ramsey selective. Let {S i } i ω be a small partition of ω. Consider Q = {{i, j} [ω] 2 k : i S k and j S k } and P = ω Q. There exists big subset H ω such that [H] 2 Q or [H] 2 P. But [H] 2 Q implies H S k for some k which is impossible because S k is small. Thus, [H] 2 P and the intersection H S k can not contain more than one element for any k. We can add elements to H if some of the intersections are empty. So, H is the desired big selection. Lemma 1. For any injection π : ω ω there exists big subset B such that π B is increasing. 4
5 Proof. We define the partition [ω] 2 = P Q as follows P = {{i, j} [ω] 2 i < j and π(i) < π(j)} and Q = [ω] 2 P. There exists homogeneous big set B for this partition. But [B] 2 can not be subset of Q because there is no infinitely decreasing sequences in ω. So, [B] 2 P and π B is increasing. Proof of theorem 2. Let x = x n Q be arbitrary hyperrational number. First of all let us consider the equivalence relation on ω : n k if and only if x n = x k. If the partition corresponding to this relation have big subset then there is big stationary subsequence of x n. Otherwise, we consider D ω be big selection from this partition. So, for k, n D if k n then x k x n. For any k Z we define subsets I k = {n D x n (k, k + 1]}. It is clear that choosing nonempty subsets I k we get the partition of D. If this partition is small then there exists big selection B. One and only one of two sets B 1 = {n B x n > 0} and B 2 = {n B x n < 0} is big. Note that the set {x n n B i } for big B i has order type ω in case of B 1 and ω in case of B 2. Otherwise, I k is big for some k. Thus, x Ik is big bounded subsequence and number x is finite or infinitesimal. Only one of two sets E 1 = {n B x n < x} and E 2 = {n B x n > x} is big. Let show that if E 1 is big then there exists big subset B 3 E 1 such that {x n n B 3 } has order type ω and x B3 is fundamental. For this purpose let us define the partition of E 1 as follows: J s = {i E 1 x 1 n x i < x 1 n+1 }. J s subsets are small for all s because if J s is big for some s then the number x given by x Js is equal to x but on other hand x < x. Contradiction. Thus, we can get big selection B 3 from the partition {J s } s ω. The sequence x B3 is obviously fundamental and the set {x n n B 3 } has order type ω. Similarly If E 2 is big we can get big subset B 4 E 2 such that the sequence x B4 is fundamental and the set {x n n B 4 } has order type ω. If x K and x L are big fundamental subsequences then x K L is big fundamental subsequence of both x K and x L. Thus, x K and x L are equivalent in traditional metric sense. Let C be the only big subset from subsets B i and X = {x n } n C Q subset of sequence elements. We define injection π : ω ω as follows: π(n) = { index of min(x {x π(1),..., x π(n 1) }), if C = B 1 or C = B 3 index of max(x {x π(1),..., x π(n 1) }), if C = B 2 or C = B 4 Thus, π is descending or ascending ordering of X and for any i < j we have x π(i) < x π(j) in first case and x π(i) > x π(j) in second case. 5
6 According to lemma 1 there exists big subset E ω such that π E is increasing and subsequence x E C is monotonic. We call ν(x) R the value of number x Q fin. Proof of theorem 3. Let us define mapping ν : Q fin R. For any x = x n Q fin we set ν(x) equal to limit of some big fundamental subsequence of x n. This limit is uniquely defined as follows from the theorem 2. It is easy to see that ν is epimorphism of Q-algebras and ker ν = I is the ideal of all infinitesimals in Q fin. All elements of compliment of I in Q fin are invertible. Thus, I is only maximal ideal in local ring Q fin and Q fin /I R. References [1] Robinson, Abraham Non-standard analysis, Proc. Roy. Acad. Sci. Amst., ser. A 64 (1961), [2] Robinson, Abraham Non-standard analysis, Princeton University Press, 1996, ISBN: [3] Jech, Thomas Set theory, Springer, 2006, ISBN [4] Wimmers, Edward (March 1982), The Shelah P-point independence theorem, Israel Journal of Mathematics, Hebrew University Magnes Press, 43 (1): 28 48, doi: /bf [5] Comfort W. W., Negrepontis S., The theory of ultrafilters, Springer-Verlag Berlin Heidelberg, 1974, ISBN-10:
Jó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 informationSlow P -point Ultrafilters
Slow P -point Ultrafilters Renling Jin College of Charleston jinr@cofc.edu Abstract We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin s Axiom,
More informationDO FIVE OUT OF SIX ON EACH SET PROBLEM SET
DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,
More information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationAn Introduction to Non-Standard Analysis and its Applications
An Introduction to Non-Standard Analysis and its Applications Kevin O Neill March 6, 2014 1 Basic Tools 1.1 A Shortest Possible History of Analysis When Newton and Leibnitz practiced calculus, they used
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 informationTEST GROUPS FOR WHITEHEAD GROUPS
TEST GROUPS FOR WHITEHEAD GROUPS PAUL C. EKLOF, LÁSZLÓ FUCHS, AND SAHARON SHELAH Abstract. We consider the question of when the dual of a Whitehead group is a test group for Whitehead groups. This turns
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 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 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 informationA RING HOMOMORPHISM IS ENOUGH TO GET NONSTANDARD ANALYSIS
A RING HOMOMORPHISM IS ENOUGH TO GET NONSTANDARD ANALYSIS VIERI BENCI AND MAURO DI NASSO Abstract. It is shown that assuming the existence of a suitable ring homomorphism is enough to get an algebraic
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 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 informationTHE NEXT BEST THING TO A P-POINT
THE NEXT BEST THING TO A P-POINT ANDREAS BLASS, NATASHA DOBRINEN, AND DILIP RAGHAVAN Abstract. We study ultrafilters on ω 2 produced by forcing with the quotient of P(ω 2 ) by the Fubini square of the
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 informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
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 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 informationEXTERNAL AUTOMORPHISMS OF ULTRAPRODUCTS OF FINITE MODELS
EXTERNAL AUTOMORPHISMS OF ULTRAPRODUCTS OF FINITE MODELS PHILIPP LÜCKE AND SAHARON SHELAH Abstract. Let L be a finite first-order language and M n n < ω be a sequence of finite L-models containing models
More informationA local Ramsey theory for block sequences
A local Ramsey theory for block sequences Iian Smythe Cornell University Ithaca, NY, USA Transfinite methods in Banach spaces and algebras of operators Będlewo, Poland July 22, 2016 Iian Smythe (Cornell)
More informationNonstandard Methods in Combinatorics of Numbers: a few examples
Nonstandard Methods in Combinatorics of Numbers: a few examples Università di Pisa, Italy RaTLoCC 2011 Bertinoro, May 27, 2011 In combinatorics of numbers one can find deep and fruitful interactions among
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 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 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 informationWalker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015
Problem 1. Take any mapping f from a metric space X into a metric space Y. Prove that f is continuous if and only if f(a) f(a). (Hint: use the closed set characterization of continuity). I make use of
More informationHyperreal Calculus MAT2000 Project in Mathematics. Arne Tobias Malkenes Ødegaard Supervisor: Nikolai Bjørnestøl Hansen
Hyperreal Calculus MAT2000 Project in Mathematics Arne Tobias Malkenes Ødegaard Supervisor: Nikolai Bjørnestøl Hansen Abstract This project deals with doing calculus not by using epsilons and deltas, but
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationTRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY
TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY John T. Baldwin Department of Mathematics University of Illinois at Chicago Chicago, IL 60680 Rami Grossberg Department of Mathematics Carnegie
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationLarge Sets in Boolean and Non-Boolean Groups and Topology
axioms Article Large Sets in Boolean and Non-Boolean Groups and Topology Ol ga V. Sipacheva ID Department of General Topology and Geometry, Lomonosov Moscow State University, Leninskie Gory 1, Moscow 119991,
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 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 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 informationA DISCUSSION OF KEISLER S ORDER
A DISCUSSION OF KEISLER S ORDER ADELE PADGETT Abstract. In model theory, the complex numbers as an algebraically closed field are often given as an example of a simple, well-behaved mathematical structure,
More informationRestricted versions of the Tukey-Teichmüller Theorem that are equivalent to the Boolean Prime Ideal Theorem
Restricted versions of the Tukey-Teichmüller Theorem that are equivalent to the Boolean Prime Ideal Theorem R.E. Hodel Dedicated to W.W. Comfort on the occasion of his seventieth birthday. Abstract We
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 informationClass Notes on Poset Theory Johan G. Belinfante Revised 1995 May 21
Class Notes on Poset Theory Johan G Belinfante Revised 1995 May 21 Introduction These notes were originally prepared in July 1972 as a handout for a class in modern algebra taught at the Carnegie-Mellon
More informationFilters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
More informationTHE KERNELS OF RADICAL HOMOMORPHISMS AND INTERSECTIONS OF PRIME IDEALS
THE KERNELS OF RADICAL HOMOMORPHISMS AND INTERSECTIONS OF PRIME IDEALS HUNG LE PHAM Abstract. We establish a necessary condition for a commutative Banach algebra A so that there exists a homomorphism θ
More informationINTRODUCTION TO CARDINAL NUMBERS
INTRODUCTION TO CARDINAL NUMBERS TOM CUCHTA 1. Introduction This paper was written as a final project for the 2013 Summer Session of Mathematical Logic 1 at Missouri S&T. We intend to present a short discussion
More informationREAL VARIABLES: PROBLEM SET 1. = x limsup E k
REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
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 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 informationThe Proper Forcing Axiom: a tutorial
Young Set Theory Workshop 2010, Raach, Austria. The Proper Forcing Axiom: a tutorial Justin Tatch Moore 1 Notes taken by Giorgio Venturi In these notes we will present an exposition of the Proper Forcing
More information3 COUNTABILITY AND CONNECTEDNESS AXIOMS
3 COUNTABILITY AND CONNECTEDNESS AXIOMS Definition 3.1 Let X be a topological space. A subset D of X is dense in X iff D = X. X is separable iff it contains a countable dense subset. X satisfies the first
More informationLocally Connected HS/HL Compacta
Locally Connected HS/HL Compacta Question [M.E. Rudin, 1982]: Is there a compact X which is (1) non-metrizable, and (2) locally connected, and (3) hereditarily Lindelöf (HL)? (4) and hereditarily separable
More informationLecture 10: Limit groups
Lecture 10: Limit groups Olga Kharlampovich November 4 1 / 16 Groups universally equivalent to F Unification Theorem 1 Let G be a finitely generated group and F G. Then the following conditions are equivalent:
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationwith the topology generated by all boxes that are determined by countably many coordinates. Then G is a topological group,
NONNORMALITY OF ČECH-STONE-REMAINDERS OF TOPOLOGICAL GROUPS A. V. ARHANGEL SKII AND J. VAN MILL Abstract. It is known that every remainder of a topological group is Lindelöf or pseudocompact. Motivated
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 informationLecture 2. (1) Every P L A (M) has a maximal element, (2) Every ascending chain of submodules stabilizes (ACC).
Lecture 2 1. Noetherian and Artinian rings and modules Let A be a commutative ring with identity, A M a module, and φ : M N an A-linear map. Then ker φ = {m M : φ(m) = 0} is a submodule of M and im φ is
More informationUltrafilters maximal for finite embeddability
1 16 ISSN 1759-9008 1 Ultrafilters maximal for finite embeddability LORENZO LUPERI BAGLINI Abstract: In this paper we study a notion of preorder that arises in combinatorial number theory, namely the finite
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationIsomorphisms of Non-Standard Fields and Ash s Conjecture
Isomorphisms of Non-Standard Fields and Ash s onjecture Rumen Dimitrov 1, Valentina Harizanov 2, Russell Miller 3, and K.J. Mourad 4 1 Department of Mathematics, Western Illinois University, Macomb, IL
More informationInfinite Strings Generated by Insertions
Programming and Computer Software, Vol. 30, No. 2, 2004, pp. 110 114. Translated from Programmirovanie, Vol. 30, No. 2, 2004. Original Russian Text Copyright 2004 by Golubitsky, Falconer. Infinite Strings
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationHINDMAN S COLORING THEOREM IN ARBITRARY SEMIGROUPS
HINDMAN S COLORING THEOREM IN ARBITRARY SEMIGROUPS GILI GOLAN AND BOAZ TSABAN Abstract. Hindman s Theorem asserts that, for each finite coloring of the natural numbers, there are distinct natural numbers
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
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 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 informationarxiv: v1 [math.gn] 27 Oct 2018
EXTENSION OF BOUNDED BAIRE-ONE FUNCTIONS VS EXTENSION OF UNBOUNDED BAIRE-ONE FUNCTIONS OLENA KARLOVA 1 AND VOLODYMYR MYKHAYLYUK 1,2 Abstract. We compare possibilities of extension of bounded and unbounded
More informationvan Rooij, Schikhof: A Second Course on Real Functions
vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationSuccessive cardinals with the tree property
UCLA March 3, 2014 A classical theorem Theorem (König Infinity Lemma) Every infinite finitely branching tree has an infinite path. Definitions A tree is set T together with an ordering < T which is wellfounded,
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
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 informationGap Embedding for Well-Quasi-Orderings 1
WoLLIC 2003 Preliminary Version Gap Embedding for Well-Quasi-Orderings 1 Nachum Dershowitz 2 and Iddo Tzameret 3 School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel Abstract Given a
More informationStatistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006
Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006 Topics What is a set? Notations for sets Empty set Inclusion/containment and subsets Sample spaces and events Operations
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 informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationTHE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY. by arxiv: v1 [math.ca] 29 Jan 2017 MAGNUS D. LADUE
THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY by arxiv:170109087v1 [mathca] 9 Jan 017 MAGNUS D LADUE 0 Abstract In [1] Grossman Turett define the Cantor game In [] Matt Baker proves several results
More informationThe small ball property in Banach spaces (quantitative results)
The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence
More informationFixed Points & Fatou Components
Definitions 1-3 are from [3]. Definition 1 - A sequence of functions {f n } n, f n : A B is said to diverge locally uniformly from B if for every compact K A A and K B B, there is an n 0 such that f n
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 informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationRELATIONS BETWEEN SOME CARDINALS IN THE ABSENCE OF THE AXIOM OF CHOICE
RELATIONS BETWEEN SOME CARDINALS IN THE ABSENCE OF THE AXIOM OF CHOICE DEDICATED TO THE MEMORY OF PROF. HANS LÄUCHLI LORENZ HALBEISEN 1 AND SAHARON SHELAH 2 Abstract. If we assume the axiom of choice,
More informationJoseph Muscat Universal Algebras. 1 March 2013
Joseph Muscat 2015 1 Universal Algebras 1 Operations joseph.muscat@um.edu.mt 1 March 2013 A universal algebra is a set X with some operations : X n X and relations 1 X m. For example, there may be specific
More informationOn α-embedded subsets of products
European Journal of Mathematics 2015) 1:160 169 DOI 10.1007/s40879-014-0018-0 RESEARCH ARTICLE On α-embedded subsets of products Olena Karlova Volodymyr Mykhaylyuk Received: 22 May 2014 / Accepted: 19
More informationUNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS
UNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS MICHAEL PINSKER AND SAHARON SHELAH Abstract. The set of all transformation monoids on a fixed set of infinite cardinality λ, equipped with the order
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationP-adic Functions - Part 1
P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant
More informationarxiv: v1 [math.gr] 4 Mar 2015
EVERY COMPACT GROUP CAN HAVE A NON-MEASURABLE SUBGROUP arxiv:1503.01385v1 [math.gr] 4 Mar 2015 W. R. BRIAN AND M. W. MISLOVE Abstract. We show that it is consistent with ZFC that every compact group has
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 informationDefining the Integral
Defining the Integral In these notes we provide a careful definition of the Lebesgue integral and we prove each of the three main convergence theorems. For the duration of these notes, let (, M, µ) be
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationBASIC GROUP THEORY : G G G,
BASIC GROUP THEORY 18.904 1. Definitions Definition 1.1. A group (G, ) is a set G with a binary operation : G G G, and a unit e G, possessing the following properties. (1) Unital: for g G, we have g e
More informationMATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5
MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5.. The Arzela-Ascoli Theorem.. The Riemann mapping theorem Let X be a metric space, and let F be a family of continuous complex-valued functions on X. We have
More informationIRRATIONAL ROTATION OF THE CIRCLE AND THE BINARY ODOMETER ARE FINITARILY ORBIT EQUIVALENT
IRRATIONAL ROTATION OF THE CIRCLE AND THE BINARY ODOMETER ARE FINITARILY ORBIT EQUIVALENT MRINAL KANTI ROYCHOWDHURY Abstract. Two invertible dynamical systems (X, A, µ, T ) and (Y, B, ν, S) where X, Y
More informationUltraproducts of Finite Groups
Ultraproducts of Finite Groups Ben Reid May 11, 010 1 Background 1.1 Ultrafilters Let S be any set, and let P (S) denote the power set of S. We then call ψ P (S) a filter over S if the following conditions
More informationAMS regional meeting Bloomington, IN April 1, 2017
Joint work with: W. Boney, S. Friedman, C. Laskowski, M. Koerwien, S. Shelah, I. Souldatos University of Illinois at Chicago AMS regional meeting Bloomington, IN April 1, 2017 Cantor s Middle Attic Uncountable
More informationAN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES
AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov
More informationON MATCHINGS IN GROUPS
ON MATCHINGS IN GROUPS JOZSEF LOSONCZY Abstract. A matching property conceived for lattices is examined in the context of an arbitrary abelian group. The Dyson e-transform and the Cauchy Davenport inequality
More informationNONSTANDARD ANALYSIS AND AN APPLICATION TO THE SYMMETRIC GROUP ON NATURAL NUMBERS
NONSTANDARD ANALYSIS AND AN APPLICATION TO THE SYMMETRIC GROUP ON NATURAL NUMBERS MAURO DI NASSO AND YI ZHANG Abstract. An introduction of nonstandard analysis in purely algebraic terms is presented. As
More informationAlgebra, selections, and additive Ramsey theory
F U N D A M E N T A MATHEMATICAE 240 (2018) Algebra, selections, and additive Ramsey theory by Boaz Tsaban (Ramat Gan and Rehovot) Abstract. Hindman s celebrated Finite Sums Theorem, and its high-dimensional
More informationTallness and Level by Level Equivalence and Inequivalence
Tallness and Level by Level Equivalence and Inequivalence Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationALGEBRAIC GROUPS. Disclaimer: There are millions of errors in these notes!
ALGEBRAIC GROUPS Disclaimer: There are millions of errors in these notes! 1. Some algebraic geometry The subject of algebraic groups depends on the interaction between algebraic geometry and group theory.
More informationSets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University
Sets, Models and Proofs I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University 2000; revised, 2006 Contents 1 Sets 1 1.1 Cardinal Numbers........................ 2 1.1.1 The Continuum
More informationMORE ABOUT SPACES WITH A SMALL DIAGONAL
MORE ABOUT SPACES WITH A SMALL DIAGONAL ALAN DOW AND OLEG PAVLOV Abstract. Hušek defines a space X to have a small diagonal if each uncountable subset of X 2 disjoint from the diagonal, has an uncountable
More information