DOCSLIB.ORG

ULTRAFILTERS and HOW to USE THEM Contents 1. Big Sets And

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ULTRAFILTERS and HOW to USE THEM Contents 1. Big Sets And ULTRAFILTERS AND HOW TO USE THEM BURAK KAYA Abstract. These are the lecture notes of a one-week course I taught at the Nesin Mathematics Village in S¸irince, Izmir,_ Turkey during Summer 2019. The aim of the course was to introduce ultrafilters, prove some fundamental facts and cover various constructions and results in algebra, model theory, topology and social choice theory that use ultrafilters. Contents 1. Big sets and small sets 1 2. Fantastic beasts and where to find them 2 3. Ultraproducts andLos'stheorem 5 4. Topologizing ultrafilters and Stone-Cech˘ compactification 9 5. Ultralimits and amenability of Z 11 6. Principal ultrafilters and dictators 11 References 11 The main purpose of this course is to introduce ultrafilters and their basic ap- plications in various fields of mathematics. This course is intended for third and fourth year undergraduate students and beginning graduate students. Although the necessary background from algebra, topology, set theory and model theory was briefly reviewed in class, it is not included in these lectures notes. We refer the reader to [Hun80], [Mun00], [Jec03], [SS17] and [Hod93] for the basic definitions and facts necessary for these lecture notes. 1. Big sets and small sets In this section, we shall introduce ultrafilters on sets, prove some basic facts about them and show their existence. Let X be a non-empty set. A filter on the set X is a collection of sets F ⊆ P(X) such that •; 2= F and X 2 F, • if A 2 F and A ⊆ B ⊆ X, then B 2 F, and • if A 2 F and B 2 F, then A \ B 2 F. The most basic example of a filter is the trivial filter F = fXg. For any non-empty subset X^ ⊆ X, the collection F = fA ⊆ X : X^ ⊆ Ag is also a filter which is called the principal filter generated by X. We shall next make some observations about filters which immediately follow from the definition. The intersection of a collection of filters on X is also a filter on X and the union of a collection of filters which are pairwise ⊆-comparable is 1 2 BURAK KAYA a filter on X. Filters, being closed under intersection of two sets, have the finite intersection property1. It turns out that collections with finite intersection property can be extended to filters as well. Proposition 1. Let X be a non-empty set and C ⊆ P(X) be a non-empty set with the finite intersection property. Then there exists a filter F ⊇ C on X. Proof. It is an exercise to the reader to check that the collection + F = fA : 9n 2 N 9C1;C2;:::;Cn 2 C C1 \ C2 \ :::Cn ⊆ Ag is a filter on X containing C as a subset. A filter U on the set X is said to be an ultrafilter 2 if it satisfies that • A 2 U or X − A 2 U for every A 2 P(X). An ultrafilter on a set can be considered as a tool to split the power set of that set into two: \Big sets" and \small sets". Big sets are those that are in the ultrafilter3. Indeed, in order for the reader to understand this motivation, we expect the reader to check that an ultrafilter U on a set X canonically induces a finitely additive measure µU : P(X) ! f0; 1g and vice versa. Let X be a non-empty set and x 2 X. Then, since x 2 A or x2 = A for every A ⊆ X, the principal filter generated by fxg is an ultrafilter and is called the principal ultrafilter generated by x. It is also clear that any ultrafilter which is also principal has a generating set that is a singleton and has to be of this form. Before we proceed, let us prove a basic but important fact. Proposition 2. Any ultrafilter on a non-empty finite set is principal. Proof. Let X be a non-empty finite set and U be an ultrafilter. Consider the set T A = U2U U. Since X is finite, so is the ultrafilter U. It then follows from the properties of a filter that A 2 U and hence A 6= ;. (Up to now, we have only used that U is a filter and indeed shown that any filter on a non-empty set is principal whose generating set is the intersection of all sets in the filter.) Let a 2 A. Being an ultrafilter, we know that either fag 2 U or X − fag 2 U. If it were the case that X − fag 2 U, then we would have a 2 A ⊆ X − fag which is a contradiction. Thus, fag 2 U. We claim that U is generated by a. If it were not, then there would be B 2 U such that fag * B in which case fag \ B = ; 2 U which is a contradiction. Therefore, U is generated by a and is principal. 2. Fantastic beasts and where to find them What about ultrafilters on infinite sets? Are there any non-principal ultrafilters on infinite sets? As we shall see soon, the answer to this question is affirmative. However, we will not be able to \explicitly see" any of these non-principal ultra- filters. In order to prove the existence of non-principal ultrafilters, we need to introduce a very special filter. 1 + A collection C of sets is said to have the finite intersection property if for every n 2 N and C1;C2;:::;Cn we have that C1 \ C2 \···\ Cn 6= ;. 2Our definition corresponds to the special case of that definition where one considers the Boolean algebra (P(X); \; [; ;; X) 3The notion of a filter has a dual notion, namely, the notion of an ideal. Ideals contain the empty set, are closed ⊆-downwards and with respect to finite unions. Small sets are those that are in the corresponding ideal. ULTRAFILTERS AND HOW TO USE THEM 3 Let X be an infinite set. The collection F = fA ⊆ X : X−A is finiteg consisting of cofinite subsets of X is a filter called the Fr´echetfilter on X. The Fr´echet filter is clearly non-principal. As will be shown in the next proposition, whether an ultrafilter is non-principal is determined by whether it contains the Fr´echet filter as a subset. Proposition 3. Let U be an ultrafilter on an infinite set X. Then U is non- principal if and only if it contains the Fr´echetfilter. Proof. Assume that U is principal, say, U = fA ⊆ X : a 2 Ag. Then, since fag 2 U, we have that X − fag 2= U. On the other hand, X − fag is cofinite. Thus U does not contain the Fr´echet filter. Assume that U does not contain the Fr´echet filter. Then there exists a cofinite A ⊆ X such that A2 = U and hence X − A 2 U. Enumerate the set X − A, say, X − A = fx1; x2; : : : ; xng. If it were that X − fxig 2 U for every 1 ≤ i ≤ n, then we would have n \ X − fxig = X − fx1; x2; : : : ; xng 2 U i=1 which is a contradiction, as the intersection of this set with X − A is empty. There- fore, there exists 1 ≤ i ≤ n such that X − fxig 2= U and hence fxig 2 U. Then, as in the proof of Proposition 2, we necessarily have fA ⊆ X : xi 2 Ag = U. Thus, in order to show the existence of non-principal ultrafilters, we just need to find one that contains the Fr´echet filter. How are we supposed to do that? Let us take the Fr´echet filter on an infinite set X. The Fr´echet filter is clearly not an ultrafilter. We can fix this by extending the Fr´echet filter as transfinitely going through all elements of P(X) and appropriately adding each element or its complement. Although such processes are usually done by transfinite recursion, we are not expecting every person taking this course to be familiar with transfinite recursion and hence we will handle this procedure using Zorn's lemma. Theorem 1 (Tarski). Let X be a non-empty set and F^ ⊆ P(X) be a filter. Then there exists an ultrafilter U on X such that F^ ⊆ U. Proof. Let P = fF : F is a filter and F^ ⊆ Fg and consider the partially ordered S set (P; ⊆). Given a chain C ⊆ P, as pointed out before, the set C is a filter on X containing F^ and is an upper bound for C. Therefore, (P; ⊆) satisfies the hypotheses of Zorn's lemma and has a maximal element, say, U is a maximal element of (P; ⊆). We claim that U is indeed an ultrafilter. Assume towards a contradiction that it is not. Then there exists A ⊆ X such that A2 = U and X − A2 = U. Consider the collection C = U [ fAg. We claim that C has the finite intersection property. Let X1;X2;:::;Xn 2 C. We split into cases. • Case 1: Assume that Xi 2 U for every 1 ≤ i ≤ n. Then X1\X2\· · ·\Xn 2 U ⊆ C since U has the finite intersection property. • Case 2: Assume that Xi 2= U for some 1 ≤ i ≤ n. By replacing these sets without changing their intersection, we can assume without loss of gener- ality that X1 = A and X2;:::;Xn 2 U. As U has the finite intersection property, we have that X2 \···\ Xn 2 U. It follows that any super- set of X2 \···\ Xn is in U. On the other hand, X − A2 = U and hence X2 \···\ Xn * X − A, that is, A \ X2 \···\ Xn 6= ;.
Load more

Recommended publications
  • An Introduction to Nonstandard Analysis 11
    AN INTRODUCTION TO NONSTANDARD ANALYSIS ISAAC DAVIS Abstract. In this paper we give an introduction to nonstandard analysis, starting with an ultrapower construction of the hyperreals. We then demon- strate how theorems in standard analysis \transfer over" to nonstandard anal- ysis, and how theorems in standard analysis can be proven using theorems in nonstandard analysis. 1. Introduction For many centuries, early mathematicians and physicists would solve problems by considering infinitesimally small pieces of a shape, or movement along a path by an infinitesimal amount. Archimedes derived the formula for the area of a circle by thinking of a circle as a polygon with infinitely many infinitesimal sides [1]. In particular, the construction of calculus was first motivated by this intuitive notion of infinitesimal change. G.W. Leibniz's derivation of calculus made extensive use of “infinitesimal” numbers, which were both nonzero but small enough to add to any real number without changing it noticeably. Although intuitively clear, infinitesi- mals were ultimately rejected as mathematically unsound, and were replaced with the common -δ method of computing limits and derivatives. However, in 1960 Abraham Robinson developed nonstandard analysis, in which the reals are rigor- ously extended to include infinitesimal numbers and infinite numbers; this new extended field is called the field of hyperreal numbers. The goal was to create a system of analysis that was more intuitively appealing than standard analysis but without losing any of the rigor of standard analysis. In this paper, we will explore the construction and various uses of nonstandard analysis. In section 2 we will introduce the notion of an ultrafilter, which will allow us to do a typical ultrapower construction of the hyperreal numbers.
    [Show full text]
  • 1. Introduction in a Topological Space, the Closure Is Characterized by the Limits of the Ultrafilters
    Pr´e-Publica¸c˜oes do Departamento de Matem´atica Universidade de Coimbra Preprint Number 08–37 THE ULTRAFILTER CLOSURE IN ZF GONC¸ALO GUTIERRES Abstract: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we cannot replace filters by ultrafilters. It is proven that the ultrafilter convergence determines the open sets for every topological space if and only if the Ultrafilter Theorem holds. More, we can also prove that the Ultrafilter Theorem is equivalent to the fact that uX = kX for every topological space X, where k is the usual Kuratowski Closure operator and u is the Ultrafilter Closure with uX (A) := {x ∈ X : (∃U ultrafilter in X)[U converges to x and A ∈U]}. However, it is possible to built a topological space X for which uX 6= kX , but the open sets are characterized by the ultrafilter convergence. To do so, it is proved that if every set has a free ultrafilter then the Axiom of Countable Choice holds for families of non-empty finite sets. It is also investigated under which set theoretic conditions the equality u = k is true in some subclasses of topological spaces, such as metric spaces, second countable T0-spaces or {R}. Keywords: Ultrafilter Theorem, Ultrafilter Closure. AMS Subject Classification (2000): 03E25, 54A20. 1. Introduction In a topological space, the closure is characterized by the limits of the ultrafilters. Although, in the absence of the Axiom of Choice, this is not a fact anymore.
    [Show full text]
  • An Introduction to Nonstandard Analysis
    An Introduction to Nonstandard Analysis Jeffrey Zhang Directed Reading Program Fall 2018 December 5, 2018 Motivation • Developing/Understanding Differential and Integral Calculus using infinitely large and small numbers • Provide easier and more intuitive proofs of results in analysis Filters Definition Let I be a nonempty set. A filter on I is a nonempty collection F ⊆ P(I ) of subsets of I such that: • If A; B 2 F , then A \ B 2 F . • If A 2 F and A ⊆ B ⊆ I , then B 2 F . F is proper if ; 2= F . Definition An ultrafilter is a proper filter such that for any A ⊆ I , either A 2 F or Ac 2 F . F i = fA ⊆ I : i 2 Ag is called the principal ultrafilter generated by i. Filters Theorem Any infinite set has a nonprincipal ultrafilter on it. Pf: Zorn's Lemma/Axiom of Choice. The Hyperreals Let RN be the set of all real sequences on N, and let F be a fixed nonprincipal ultrafilter on N. Define an (equivalence) relation on RN as follows: hrni ≡ hsni iff fn 2 N : rn = sng 2 F . One can check that this is indeed an equivalence relation. We denote the equivalence class of a sequence r 2 RN under ≡ by [r]. Then ∗ R = f[r]: r 2 RNg: Also, we define [r] + [s] = [hrn + sni] [r] ∗ [s] = [hrn ∗ sni] The Hyperreals We say [r] = [s] iff fn 2 N : rn = sng 2 F . < is defined similarly. ∗ ∗ A subset A of R can be enlarged to a subset A of R, where ∗ [r] 2 A () fn 2 N : rn 2 Ag 2 F : ∗ ∗ ∗ Likewise, a function f : R ! R can be extended to f : R ! R, where ∗ f ([r]) := [hf (r1); f (r2); :::i] The Hyperreals A hyperreal b is called: • limited iff jbj < n for some n 2 N.
    [Show full text]
  • SELECTIVE ULTRAFILTERS and Ω −→ (Ω) 1. Introduction Ramsey's
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 127, Number 10, Pages 3067{3071 S 0002-9939(99)04835-2 Article electronically published on April 23, 1999 SELECTIVE ULTRAFILTERS AND ! ( ! ) ! −→ TODD EISWORTH (Communicated by Andreas R. Blass) Abstract. Mathias (Happy families, Ann. Math. Logic. 12 (1977), 59{ 111) proved that, assuming the existence of a Mahlo cardinal, it is consistent that CH holds and every set of reals in L(R)is -Ramsey with respect to every selective ultrafilter . In this paper, we showU that the large cardinal assumption cannot be weakened.U 1. Introduction Ramsey's theorem [5] states that for any n !,iftheset[!]n of n-element sets of natural numbers is partitioned into finitely many∈ pieces, then there is an infinite set H ! such that [H]n is contained in a single piece of the partition. The set H is said⊆ to be homogeneous for the partition. We can attempt to generalize Ramsey's theorem to [!]!, the collection of infinite subsets of the natural numbers. Let ! ( ! ) ! abbreviate the statement \for every [!]! there is an infinite H ! such−→ that either [H]! or [H]! = ." UsingX⊆ the axiom of choice, it is easy⊆ to partition [!]! into two⊆X pieces in such∩X a way∅ that any two infinite subsets of ! differing by a single element lie in different pieces of the partition. Obviously such a partition can admit no infinite homogeneous set. Thus under the axiom of choice, ! ( ! ) ! is false. Having been stymied in this naive−→ attempt at generalization, we have several obvious ways to proceed. A natural project would be to attempt to find classes of partitions of [!]! that do admit infinite homogeneous sets.
    [Show full text]
  • Adequate Ultrafilters of Special Boolean Algebras 347
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 174, December 1972 ADEQUATEULTRAFILTERS OF SPECIAL BOOLEANALGEBRAS BY S. NEGREPONTIS(l) ABSTRACT. In his paper Good ideals in fields of sets Keisler proved, with the aid of the generalized continuum hypothesis, the existence of countably in- complete, /jf^-good ultrafilters on the field of all subsets of a set of (infinite) cardinality ß. Subsequently, Kunen has proved the existence of such ultra- filters, without any special set theoretic assumptions, by making use of the existence of certain families of large oscillation. In the present paper we succeed in carrying over the original arguments of Keisler to certain fields of sets associated with the homogeneous-universal (and more generally with the special) Boolean algebras. More specifically, we prove the existence of countably incomplete, ogood ultrafilters on certain powers of the ohomogeneous-universal Boolean algebras of cardinality cl and on the a-completions of the ohomogeneous-universal Boolean algebras of cardinality a, where a= rc-^ > w. We then develop a method that allows us to deal with the special Boolean algebras of cardinality ct= 2""". Thus, we prove the existence of an ultrafilter p (which will be called adequate) on certain powers S * of the special Boolean algebra S of cardinality a, and the ex- istence of a specializing chain fC«: ß < a\ for oa, such that C snp is /3+- good and countably incomplete for ß < a. The corresponding result on the existence of adequate ultrafilters on certain completions of the special Boolean algebras is more technical. These results do not use any part of the generalized continuum hypothesis.
    [Show full text]
  • Ultraproducts (Handout April, 2011) G
    Ultraproducts (Handout April, 2011) G. Eric Moorhouse, University of Wyoming Let Mξ ξ∈X be an indexed collection of structures over a common language L. The { } product Π = Qξ∈X Mξ is also a structure over this same language L. Example. Suppose each Mξ is a field. We take for L the language of rings (which serves also as the common language of fields). Thus L has constants 0 and 1, and two binary operations: + and . (Possibly other symbols as well: a unary function × symbol for additive inverses, and a unary function for multiplicative inverses, per- − haps represented by the superscript symbol −1. Let’s not worry about these for now.) Then Π is a structure over the same language L: addition and multiplication are de- fined componentwise. We interpret the symbol 0 in Π as the element having 0 in each component (or more correctly, in component ξ we take the zero element of Mξ, as the interpretation of the symbol 0 may vary from component to component. Similarly 1 is interpreted in Π as the element whose ξ-component is interpreted as the identity element of Mξ. If each Mξ is a field, then it is easily checked that Π = Qξ∈X Mξ is a ring; but not a field for X > 1, since Π has zero divisors. To correct this we need | | ultrafilters. Let U be an ultrafilter on X. Then M = Π/U is also a structure over L; this is known as an ultraproduct of the Mξ’s. Elements of M = Π/U are equivalence classes of Π where two elements x = (xξ )ξ∈X and y = (yξ )ξ∈X in Π are equivalent if ‘almost all’ coordinates agree (relative to U).
    [Show full text]
  • Logical Compactness and Constraint Satisfaction Problems
    Logical Methods in Computer Science Vol. 13(1:1)2017, pp. 1–11 Submitted Jan. 21, 2016 https://lmcs.episciences.org/ Published Jan. 23, 2017 LOGICAL COMPACTNESS AND CONSTRAINT SATISFACTION PROBLEMS DANNY RORABAUGH a, CLAUDE TARDIF b, AND DAVID WEHLAU c a Department of Mathematics and Statistics, Queen’s University, Kingston, Ontario, Canada b,c Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, Ontario, Canada Abstract. We investigate a correspondence between the complexity hierarchy of con- straint satisfaction problems and a hierarchy of logical compactness hypotheses for finite relational structures. It seems that the harder a constraint satisfaction problem is, the stronger the corresponding compactness hypothesis is. At the top level, the NP-complete constraint satisfaction problems correspond to compactness hypotheses that are equiva- lent to the ultrafilter axiom in all the cases we have investigated. At the bottom level, the simplest constraint satisfaction problems correspond to compactness hypotheses that are readily provable from the axioms of Zermelo and Fraenkel. 1. Introduction A relational structure A is said to be compact if for any structure B of the same type, B admits a homomorphism to A whenever every finite substructure B′ of B admits a ho- momorphism to A. The compactness theorem of logic implies that every finite structure is compact. However, the compactness theorem is equivalent to the ultrafilter axiom, a consequence of the axiom of choice that is not provable from the axioms of Zermelo and Fraenkel. In this paper, we restrict our attention to the case where A is finite, but we do not assume the ultrafilter axiom.
    [Show full text]
  • Ultrafilters and Tychonoff's Theorem
    Ultrafilters and Tychonoff's Theorem (October, 2015 version) G. Eric Moorhouse, University of Wyoming Tychonoff's Theorem, often cited as one of the cornerstone results in general topol- ogy, states that an arbitrary product of compact topological spaces is compact. In the 1930's, Tychonoff published a proof of this result in the special case of [0; 1]A, also stating that the general case could be proved by similar methods. The first proof in the gen- eral case was published by Cechˇ in 1937. All proofs rely on the Axiom of Choice in one of its equivalent forms (such as Zorn's Lemma or the Well-Ordering Principle). In fact there are several proofs available of the equiv- alence of Tychonoff's Theorem and the Axiom of Choice|from either one we can obtain the other. Here we provide one of the most popular proofs available for Ty- chonoff's Theorem, using ultrafilters. We see this approach as an opportunity to learn also about the larger role of ultra- filters in topology and in the foundations of mathematics, including non-standard analysis. As an appendix, we also include an outline of an alternative proof of Tychonoff's Theorem using a transfinite induction, using the two-factor case X × Y (previously done in class) for the inductive step. This approach is found in the exercises of the Munkres textbook. The proof of existence of nonprincipal ultrafilters was first published by Tarski in 1930; but the concept of ultrafilters is attributed to H. Cartan. 1. Compactness and the Finite Intersection Property Before proceeding, let us recall that a collection of sets S has the finite intersection property if S1 \···\ Sn 6= ? for all S1;:::;Sn 2 S, n > 0.
    [Show full text]
  • NETS There Are a Number of Footnotes, Which Can Safely Be Ignored
    NETS There are a number of footnotes, which can safely be ignored, especially on the first reading. 1. Nets, convergence, continuity Nets are generalization of sequences needed to deal with convergence in general topological spaces, where convergent sequences are not enough to describe the topology. The idea is to replace the set of natural numbers, which is used to index elements of sequences, by arbitrary sets such that it makes sense to talk about \large" elements. Recall that a partial order on a set I is a binary relation ≺ such that (a) i ≺ i; (b) if i ≺ j and j ≺ i; then i = j; (c) if i ≺ j and j ≺ k; then i ≺ k: Definition 1.1. A set I with a partial order1 ≺ is called directed if for any i; j 2 I there exists k 2 I such that i ≺ k and j ≺ k. The following example will be our main source of directed sets. Example 1.2. Let X be a set and I be a collection of subsets of X closed under finite intersections, so if A; B 2 I then A \ B 2 I. Define a partial order on I by A ≺ B iff B ⊂ A: Then I is a directed set: for any A; B 2 I, we have A ≺ A \ B and B ≺ A \ B. Definition 1.3. A net in a set X is a collection (xi)i2I of elements of X indexed by a nonempty directed set I, or in other words, it is a map I ! X. Definition 1.4.
    [Show full text]
  • Ultrafilters and Topology
    Leiden University Bachelor project Mathematics Ultrafilters and Topology Author: Supervisor: Marius Stekelenburg Dr. Owen Biesel June 13, 2014 Ultrafilters and topology Marius Stekelenburg June 13, 2014 Contents 1 Introduction 2 2 Ultrafilters and topology 3 2.1 Fundamental matters . .3 2.2 Convergence and topological properties . .4 2.3 Application: Tychonov’s theorem . .7 3 A categorical approach 9 3.1 Monads and algebras . .9 3.2 The ultrafilter monad . 12 3.3 Manes’ theorem . 14 4 Barr’s theorem 18 5 The Stone-Čech compactification 21 5.1 Stone-Čech compactification of discrete spaces . 21 5.2 Stone-Čech compactification of arbitrary spaces . 23 1 1 Introduction In this thesis, we will explore a simple, but rich concept, called ultrafilters. This concept has utilities in many areas, such as model theory, logic, and topology (this can be read in [2]). As the title suggests, this thesis has its focus on the latter area, topology. On topological spaces, ultrafilters can converge. Many topological prop- erties can be formulated in terms of this convergence. They work in is similar fashion to the ordinary sequence convergence, with one notable difference: it works for every topological space. This comes with a nice bonus: Tychonov’s theorem, a theorem that is otherwise hard to prove! The main result of this thesis will a reconstruction of the category of compact Hausdorff spaces. Originally proven by Ernest Manes, this con- struction enables a very different way of creating topological spaces, what will come in handy last chapter. When finding a major result, one could do two things with it: general- izing or finding an application.
    [Show full text]
  • ZF, Choice, Zorn, Ordinals, Ultrafilters
    ZF, Choice, Zorn, Ordinals, Ultrafilters Rich Schwartz July 16, 2021 1 Introduction There are various foundations for what you could call everyday mathematics. These foundations usually come as a list of axioms describing the allowable kinds of mathematical reasoning and constructions. The most popular foun- dational axioms are the Zermelo-Frankel Axioms. Most of them sound com- pletely obvious. However, the ZF axioms are not really stand-alone axioms. In order to understand and use them, you need language and logic. Which comes first, the language, the logic, or the axioms? I don't know. In practice, when you do mathematics, you freely use all three things in ways that are not so easy to disentangle. There are some additional axioms which do not follow from the ZF axioms (and language and logic). The most famous is the Axiom of Choice, an axiom which has many reformulations { e.g. Zorn's Lemma. One purpose of these notes is to discuss the ZF axioms, with a view towards putting the Axiom of Choice in context. The main purpose is to show the equivalence of the Axiom of Choice, Zorn's Lemma, and the Well-Ordering Principle, given ZF. Finally, the last purpose is to derive some nice applications of these axioms { e.g., the existence of nonprinciple ultrafilters. I got many of the details about the ZF axioms from Wikipedia and from An introduction to Set Theory by William A.R. Weiss, though these notes are not a perfectly faithful account of what is written there. In particular, the arguments in the notes do not \go all the way back to the axioms", though of course they could be re-written (at length) to do so.
    [Show full text]
  • Nets and Filters (Are Better Than Sequences)
    Nets and filters (are better than sequences) Contents 1 Motivation 2 2 More implications we wish would reverse2 3 Nets 4 4 Subnets 6 5 Filters 9 6 The connection between nets and filters 12 7 The payoff 14 8 Filling in a gap from first year calculus 15 c 2018{ Ivan Khatchatourian 1 Nets and filters (are better than sequences) 2. More implications we wish would reverse 1 Motivation In the Section 5 of the lecture notes we saw the following two results: Theorem 1.1. Let (X; T ) be a Hausdorff space. Then every sequence in X converges to at most one point. Proposition 1.2. Let (X; T ) be a topological space, let A ⊆ X, and let a 2 X. If there is a sequence of points in A that converges to a, then a 2 A. We discussed how both of these implications really feel like they should reverse, but unfor- tunately neither of them do. In both cases, additionally assuming the topological space is first countable allows the implications to reverse. This is fine, but it still feels like sequences are not quite powerful enough to capture the ideas we want to capture. The ideal solution to this problem is to define a more general object than a sequence|called a net|and talk about net convergence. That is what we will do in this note. We will also define a type of object called a filter and show that filters also furnish us with a type of convergence which turns out to be equivalent to net convergence in all ways.
    [Show full text]