DOCSLIB.ORG

Commutative Algebra

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Commutative Algebra Appendix A Commutative Algebra In this chapter we will summarise various results from commutative algebra for the reader’s convenience. Some are well known, but others are not easily available despite being standard in the specialist literature. Our main reference is Eisenbud’s book [Eis95]. A.1 Inductive Limits We refer to [Eis95, Appendices 5 and 6] for an introduction to categories and limits: the reader should be aware that our inductive limits are called filtered colimits in Eisenbud’s book. We recall some basic definitions. Definition A.1.1 (Inductive system)LetC be a category and let (J, ) be a partially ordered set such that ∀(i, j) ∈ J 2, ∃k ∈ J | i k and j k. We then call (J, ) a filtered set,adirected set or a directed preorder.Aninductive system indexed by J is the data of a family {M j } j∈J of objects of C and morphisms ϕij : Mi → M j for all pairs of indices (i, j) ∈ J 2 such that i j which satisfy ∀ ∈ = 1. j J, ϕ jj idM j ; 3 2. ∀(i, j, k) ∈ J , i j k =⇒ ϕ jk ◦ ϕij = ϕik. Definition A.1.2 (Inductive limit)Let{M j } j∈J be an inductive system in a category C. A object M in C is the inductive limit, direct limit or colimit of a filtered set of the system {M j } if it is equipped with morphisms ϕ j : M j → M satisfying the com- patibility relations ϕi = ϕ j ◦ ϕij for every i j and having the following universal property: if N is an object in C equipped with morphisms ψ j : M j → N which are compatible with the inductive system structure then there is a unique map M → N such that for all j the morphism ψ j factors © Springer Nature Switzerland AG 2020 313 F. Mangolte, Real Algebraic Varieties, Springer Monographs in Mathematics, https://doi.org/10.1007/978-3-030-43104-4 314 Appendix A: Commutative Algebra ψ j M j N ϕ j M When the inductive limit of the system {M } ∈ exists we denote it by lim M . j j J −→ j∈J j Example A.1.3 If the category C is the category of groups, rings or A-modules/ algebras for some given ring A then the inductive limit exists: it is simply the quotient of the disjoint union of the M j s modulo an equivalence relation = ∼ −lim→ M j M j j∈J j∈J where xi ∈ Mi is equivalent to x j ∈ M j if and only if there is a k ∈ J such that ϕik(xi ) = ϕ jk(x j ). Example A.1.4 Let F be a sheaf (see Appendix C) of elements of C over a topo- logical space X. For any given x ∈ X the set of open neighbourhoods of x ordered by inclusion (U V if and only if U ⊇ V ) is a filtered set and {F(U)}U x is an inductive system. The limit of this system is called the stalk of F at x and is denoted Fx . For every open neighbourhood of x the canonical morphism F(U) → Fx sends a section s of F over U to the germ sx ∈ Fx of s at x. A.2 Rings, Prime Ideals, Maximal Ideals and Modules By convention all our rings are assumed to be commutative with a multiplicative unit, and ring morphisms are required to send the multiplicative unit to the multiplicative unit. The set of invertible elements of A is denoted U(A).IfK is a ring then a K -algebra A is a ring equipped with a ring morphism K → A. For example, K [X1,...,Xn] is the K -algebra of polynomials in n variables with coefficients in K and K (X1,...,Xn) is the K -algebra of rational functions in n variables with coefficients in K . Definition A.2.1 A non zero element a in a ring A is said to be a zero divisor in A if and only if there is a non zero element b ∈ A such that ab = 0. Aringissaidtobeanintegral domain if and only if it has at least two elements and does not contain a zero divisor. A field is a ring with at least two elements such that all its non zero elements are invertible. Appendix A: Commutative Algebra 315 Definition A.2.2 Let A be a ring. 1. An ideal I in A is said to be prime if and only if it satisfies the following properties: (a) I is not equal to A (b) If a and b are elements of A such that ab ∈ I then a ∈ I or b ∈ I . 2. An ideal I in A is said to be maximal if and only if it is different from A and the only ideals in A containing I are I and A. √ Definition A.2.3 For any ideal I in a ring A,theradical I of I in A is the ideal of roots of elements of I . √ I := {a ∈ A | there is a natural number n 1, an ∈ I } . √ An ideal I ⊂ A is said to be radical if and only if I = I . Exercise A.2.4 (See Remark 1.2.29)LetK be a field. Prove that if F is a Zariski closed subset of An(K ) then I(F) is radical. Definition A.2.5 An element a inaringA is said to be nilpotent if and only if there is a natural number n > 1 such that an = 0. The nilradical of a ring A is the set of its nilpotent elements. A ring is said to be reduced if and only if its nilradical is the zero ideal, or in other words if it has no non zero nilpotent elements. Exercise A.2.6 The nilradical of a ring A is an ideal, namely the radical ideal of the zero ideal of A. Proposition A.2.7 Let A be a ring and let I be an ideal of A. 1. The ideal I is radical if and only if the quotient ring A/Iisreduced. 2. The ideal I is prime if and only if the quotient ring A/Iisanintegral domain. 3. The ideal I is maximal if and only if the quotient ring A/Iisafield. Proof Easy exercise. Proposition A.2.8 (Correspondence theorem) Let A be a ring and let I ⊂ Abe an ideal. The canonical surjection A → A/I induces a one-to-one correspondence between prime ideals of A/I and prime ideals of A containing I and a similar one-to-one correspondence between maximal ideals of A/I and maximal ideals of A containing I . Proof Easy exercise. The following lemma is extremely useful despite its simplicity. Lemma A.2.9 Let A be a ring and let B ⊂ A be a sub-ring. If I is a prime ideal of A then I ∩ B is a prime ideal of B. 316 Appendix A: Commutative Algebra Proof Let a and b be elements of B such that ab ∈ I ∩ B and a ∈/ I ∩ B.Asa ∈ B and a ∈/ I ∩ B, a does not belong to I .Itfollowsthatb ∈ I because I is a prime ideal of A and hence b belongs to I ∩ B. Example A.2.10 We calculate the dimension of the ideal I := (x2 + y2) from Example 1.5.20. There is a unique chain (Definition 1.5.2) of prime ideals in R[x, y] containing (x2 + y2) which is of maximal length (x2 + y2) ⊂ (x, y). There is therefore only one chain of prime ideals of R[x, y]/(x2 + y2) of maximal length. The dimension of the ring R[x, y]/(x2 + y2) is therefore equal to 1 and according to Definition 1.5.9 dim I = 1. Lemma A.2.11 (Nakayama’s Lemma) Let A be a ring, let a ⊂ A be an ideal and let M be a finitely generated A-module such that M = aM. There is then an element a ∈ 1 + a such that aM = 0: in particular, if A is local and a is its maximal ideal then M = 0. Proof See [Eis95, Corollary 4.8]. Definition A.2.12 AringS is said to be graded if and only if it has a decomposi- tion S =⊕d0 Sd as a direct sum of abelian groups Sd such that for any d, e 0, Sd · Se ⊂ Sd+e. An ideal I ⊂ S is said to be a homogeneous ideal if and only if I =⊕d0(I ∩ Sd ). A.3 Localisation Definition A.3.1 Let A be a ring, let M be an A-module and let S ⊂ A be a multi- plicative subset1 or in other words a subset stable under multiplication. The localised module (or localisation)ofM in S, denoted S−1 M, is the set of equivalence classes of pairs (m, s) ∈ M × S for the relation (m, s) ∼ (m, s) if and only if there is an element t ∈ S such that t(sm − sm) = 0. This set is equipped with an obvious A-module structure. The equivalence class of (m, s) is denoted by m/s. When M = A, this construction yields the localisation S−1 A of A at S. If f is an element of A,thesetS ={1, f, f 2,..., f k ,...,} is a multiplica- −1 tive subset of A and we denote these special localisations by A f := S A and −1 M f := S M.If f is nilpotent then A f is the zero ring.
Load more

Recommended publications
  • Directed Sets and Topological Spaces Definable in O-Minimal Structures
    Directed sets and topological spaces definable in o-minimal structures. Pablo And´ujarGuerrero∗ Margaret E. M. Thomas ∗ Erik Walsbergy 2010 Mathematics Subject Classification. 03C64 (Primary), 54A20, 54A05, 54D30 (Secondary). Key words. o-minimality, directed sets, definable topological spaces. Abstract We study directed sets definable in o-minimal structures, show- ing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue holds in full generality. We use the theory of tame pairs to extend the results in the field case to definable families of sets with the finite intersection property. We then apply our results to the study of definable topologies. We prove that all de- finable topological spaces display properties akin to first countability, and give several characterizations of a notion of definable compactness due to Peterzil and Steinhorn [PS99] generalized to this setting. 1 Introduction The study of objects definable in o-minimal structures is motivated by the notion that o-minimality provides a rich but \tame" setting for the theories of said objects. In this paper we study directed sets definable in o-minimal structures, focusing on expansions of groups and fields. By \directed set" we mean a preordered set in which every finite subset has a lower (if downward ∗Department of Mathematics, Purdue University, 150 N. University Street, West Lafayette, IN 47907-2067, U.S.A. E-mail addresses: [email protected] (And´ujarGuer- rero), [email protected] (Thomas) yDepartment of Mathematics, Statistics, and Computer Science, Department of Math- ematics, University of California, Irvine, 340 Rowland Hall (Bldg.# 400), Irvine, CA 92697-3875, U.S.A.
    [Show full text]
  • Scott Spaces and the Dcpo Category
    SCOTT SPACES AND THE DCPO CATEGORY JORDAN BROWN Abstract. Directed-complete partial orders (dcpo’s) arise often in the study of λ-calculus. Here we investigate certain properties of dcpo’s and the Scott spaces they induce. We introduce a new construction which allows for the canonical extension of a partial order to a dcpo and give a proof that the dcpo introduced by Zhao, Xi, and Chen is well-filtered. Contents 1. Introduction 1 2. General Definitions and the Finite Case 2 3. Connectedness of Scott Spaces 5 4. The Categorical Structure of DCPO 6 5. Suprema and the Waybelow Relation 7 6. Hofmann-Mislove Theorem 9 7. Ordinal-Based DCPOs 11 8. Acknowledgments 13 References 13 1. Introduction Directed-complete partially ordered sets (dcpo’s) often arise in the study of λ-calculus. Namely, they are often used to construct models for λ theories. There are several versions of the λ-calculus, all of which attempt to describe the ‘computable’ functions. The first robust descriptions of λ-calculus appeared around the same time as the definition of Turing machines, and Turing’s paper introducing computing machines includes a proof that his computable functions are precisely the λ-definable ones [5] [8]. Though we do not address the λ-calculus directly here, an exposition of certain λ theories and the construction of Scott space models for them can be found in [1]. In these models, computable functions correspond to continuous functions with respect to the Scott topology. It is thus with an eye to the application of topological tools in the study of computability that we investigate the Scott topology.
    [Show full text]
  • A Guide to Topology
    i i “topguide” — 2010/12/8 — 17:36 — page i — #1 i i A Guide to Topology i i i i i i “topguide” — 2011/2/15 — 16:42 — page ii — #2 i i c 2009 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 2009929077 Print Edition ISBN 978-0-88385-346-7 Electronic Edition ISBN 978-0-88385-917-9 Printed in the United States of America Current Printing (last digit): 10987654321 i i i i i i “topguide” — 2010/12/8 — 17:36 — page iii — #3 i i The Dolciani Mathematical Expositions NUMBER FORTY MAA Guides # 4 A Guide to Topology Steven G. Krantz Washington University, St. Louis ® Published and Distributed by The Mathematical Association of America i i i i i i “topguide” — 2010/12/8 — 17:36 — page iv — #4 i i DOLCIANI MATHEMATICAL EXPOSITIONS Committee on Books Paul Zorn, Chair Dolciani Mathematical Expositions Editorial Board Underwood Dudley, Editor Jeremy S. Case Rosalie A. Dance Tevian Dray Patricia B. Humphrey Virginia E. Knight Mark A. Peterson Jonathan Rogness Thomas Q. Sibley Joe Alyn Stickles i i i i i i “topguide” — 2010/12/8 — 17:36 — page v — #5 i i The DOLCIANI MATHEMATICAL EXPOSITIONS series of the Mathematical Association of America was established through a generous gift to the Association from Mary P. Dolciani, Professor of Mathematics at Hunter College of the City Uni- versity of New York. In making the gift, Professor Dolciani, herself an exceptionally talented and successfulexpositor of mathematics, had the purpose of furthering the ideal of excellence in mathematical exposition.
    [Show full text]
  • Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1
    Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1: A directed set I is a set with a partial order ≤ such that for every i; j 2 I there is k 2 I such that i ≤ k and j ≤ k. Let R be a ring. A directed system of R-modules indexed by I is a collection of R modules fMi j i 2 Ig with a R module homomorphisms µi;j : Mi ! Mj for each pair i; j 2 I where i ≤ j, such that (i) for any i 2 I, µi;i = IdMi and (ii) for any i ≤ j ≤ k in I, µi;j ◦ µj;k = µi;k. We shall denote a directed system by a tuple (Mi; µi;j). The direct limit of a directed system is defined using a universal property. It exists and is unique up to a unique isomorphism. Theorem 2 (Direct limits). Let fMi j i 2 Ig be a directed system of R modules then there exists an R module M with the following properties: (i) There are R module homomorphisms µi : Mi ! M for each i 2 I, satisfying µi = µj ◦ µi;j whenever i < j. (ii) If there is an R module N such that there are R module homomorphisms νi : Mi ! N for each i and νi = νj ◦µi;j whenever i < j; then there exists a unique R module homomorphism ν : M ! N, such that νi = ν ◦ µi. The module M is unique in the sense that if there is any other R module M 0 satisfying properties (i) and (ii) then there is a unique R module isomorphism µ0 : M ! M 0.
    [Show full text]
  • Directed Sets and Cofinal Types by Stevo Todorcevic
    transactions of the american mathematical society Volume 290, Number 2, August 1985 DIRECTED SETS AND COFINAL TYPES BY STEVO TODORCEVIC Abstract. We show that 1, w, ax, u x ux and ["iF" are the only cofinal types of directed sets of size S,, but that there exist many cofinal types of directed sets of size continuum. A partially ordered set D is directed if every two elements of D have an upper bound in D. In this note we consider some basic problems concerning directed sets which have their origin in the theory of Moore-Smith convergence in topology [12, 3, 19, 9]. One such problem is to determine "all essential kind of directed sets" needed for defining the closure operator in a given class of spaces [3, p. 47]. Concerning this problem, the following important notion was introduced by J. Tukey [19]. Two directed sets D and E are cofinally similar if there is a partially ordered set C in which both can be embedded as cofinal subsets. He showed that this is an equivalence relation and that D and E are cofinally similar iff there is a convergent map from D into E and also a convergent map from E into D. The equivalence classes of this relation are called cofinal types. This concept has been extensively studied since then by various authors [4, 13, 7, 8]. Already, from the first introduc- tion of this concept, it has been known that 1, w, ccx, w X cox and [w1]<" represent different cofinal types of directed sets of size < Kls but no more than five such types were known.
    [Show full text]
  • Partial Orders — Basics
    Partial Orders — Basics Edward A. Lee UC Berkeley — EECS EECS 219D — Concurrent Models of Computation Last updated: January 23, 2014 Outline Sets Join (Least Upper Bound) Relations and Functions Meet (Greatest Lower Bound) Notation Example of Join and Meet Directed Sets, Bottom Partial Order What is Order? Complete Partial Order Strict Partial Order Complete Partial Order Chains and Total Orders Alternative Definition Quiz Example Partial Orders — Basics Sets Frequently used sets: • B = {0, 1}, the set of binary digits. • T = {false, true}, the set of truth values. • N = {0, 1, 2, ···}, the set of natural numbers. • Z = {· · · , −1, 0, 1, 2, ···}, the set of integers. • R, the set of real numbers. • R+, the set of non-negative real numbers. Edward A. Lee | UC Berkeley — EECS3/32 Partial Orders — Basics Relations and Functions • A binary relation from A to B is a subset of A × B. • A partial function f from A to B is a relation where (a, b) ∈ f and (a, b0) ∈ f =⇒ b = b0. Such a partial function is written f : A*B. • A total function or just function f from A to B is a partial function where for all a ∈ A, there is a b ∈ B such that (a, b) ∈ f. Edward A. Lee | UC Berkeley — EECS4/32 Partial Orders — Basics Notation • A binary relation: R ⊆ A × B. • Infix notation: (a, b) ∈ R is written aRb. • A symbol for a relation: • ≤⊂ N × N • (a, b) ∈≤ is written a ≤ b. • A function is written f : A → B, and the A is called its domain and the B its codomain.
    [Show full text]
  • TARSKI MEASURE 3 Quantity Spaces
    TARSKI MEASURE BRYSON Contents 1. Introduction 1 2. Stationarily Measurable Spaces 3 3. Tarski Measure 4 4. Construction of the Type co-Functor 7 5. Structure of the Type Monoid 14 6. Hierarchical Measures & Minimal σ-ideals 21 7. Closing 22 8. Acknowledgements 22 Appendix A. Symmetry: Inverse Semigroups 22 Appendix B. Some Categorical Concepts 27 References 31 1. Introduction This work investigates the intrinsic properties of measurements defined by symmetries of spaces. Its genesis lies in Tarski’s measure theoretic work on stationary measures and the attendant duplication theorems. Our purpose is twofold. Firstly, we wish to identify natural monoids of sizes or quantities given a measurable space with some symmetries and elucidate the structure of these monoids. And second, we would like to present a suitable category theoretic framework within which to study the relationships between such spaces with symmetry. This second goal is a byproduct of the current atmosphere in Mathematics. For some time it has been clear that it is fruitful to study not only objects of interest but the connections between them. Categories formalize this. The first goal stands in sharp contrast with the historical efforts which additionally arXiv:1306.2985v2 [math.PR] 29 Jul 2013 assume a model for quantities: namely, the non-negative real numbers. While this view has some roots in antiquity, since the introduction of Measure Theory just over a century ago, its been axiomatic. Henr´ıLebesgue is the father of modern measure and integration theory. His celebrated 1902 dissertation Intgrale, longueur, aire is foundational. Within its pages and the lectures following it, Lebesgue introduced σ-algebras, Lebesgue measure, integration, the dominated convergence theorem, etc.
    [Show full text]
  • Complete Topologized Posets and Semilattices
    COMPLETE TOPOLOGIZED POSETS AND SEMILATTICES TARAS BANAKH, SERHII BARDYLA Abstract. In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices. 1. Introduction In this paper we discuss a notion of completeness for topologized posets and semilattices. By a poset we understand a set X endowed with a partial order ≤. A topologized poset is a poset endowed with a topology. A topologized poset X is defined to be complete if each non-empty chain C in X has inf C ∈ C¯ and sup C ∈ C¯, where C¯ stands for the closure of C in X. More details on this definition can be found in Section 2, where we prove that complete topologized posets can be equivalently defined using directed sets instead of chains. In Section 4 we study the interplay between complete and chain-compact topologized posets and in Section 5 we study complete topologized semilattices. In Section 6 we survey some known results on the absolute closedness of complete semitopological semilattices and in Section 7 we survey recent results on the closedness of the partial order in complete semitopological semilattices. 2. The completeness of topologized posets In this section we define the notion of a complete topologized poset, which is a topological counterpart of the standard notion of a complete poset, see [10]. First we recall some concepts and notations from the theory of partially ordered sets. A subset C of a poset (X, ≤) is called a chain if any two points x,y ∈ X are comparable in the partial order of X.
    [Show full text]
  • On Lattices and Their Ideal Lattices, and Posets and Their Ideal Posets
    This is the final preprint version of a paper which appeared at Tbilisi Math. J. 1 (2008) 89-103. Published version accessible to subscribers at http://www.tcms.org.ge/Journals/TMJ/Volume1/Xpapers/tmj1_6.pdf On lattices and their ideal lattices, and posets and their ideal posets George M. Bergman 1 ∗ 1 Department of Mathematics, University of California, Berkeley, CA 94720-3840, USA E-mail: [email protected] Abstract For P a poset or lattice, let Id(P ) denote the poset, respectively, lattice, of upward directed downsets in P; including the empty set, and let id(P ) = Id(P )−f?g: This note obtains various results to the effect that Id(P ) is always, and id(P ) often, \essentially larger" than P: In the first vein, we find that a poset P admits no <-respecting map (and so in particular, no one-to-one isotone map) from Id(P ) into P; and, going the other way, that an upper semilattice P admits no semilattice homomorphism from any subsemilattice of itself onto Id(P ): The slightly smaller object id(P ) is known to be isomorphic to P if and only if P has ascending chain condition. This result is strength- ened to say that the only posets P0 such that for every natural num- n ber n there exists a poset Pn with id (Pn) =∼ P0 are those having ascending chain condition. On the other hand, a wide class of cases is noted where id(P ) is embeddable in P: Counterexamples are given to many variants of the statements proved.
    [Show full text]
  • Continuous Monoids and Semirings
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 318 (2004) 355–372 www.elsevier.com/locate/tcs Continuous monoids and semirings Georg Karner∗ Alcatel Austria, Scheydgasse 41, A-1211 Vienna, Austria Received 30 October 2002; received in revised form 11 December 2003; accepted 19 January 2004 Communicated by Z. Esik Abstract Di1erent kinds of monoids and semirings have been deÿned in the literature, all of them named “continuous”. We show their relations. The main technical tools are suitable topologies, among others a variant of the well-known Scott topology for complete partial orders. c 2004 Elsevier B.V. All rights reserved. MSC: 68Q70; 16Y60; 06F05 Keywords: Distributive -algebras; Distributive multioperator monoids; Complete semirings; Continuous semirings; Complete partial orders; Scott topology 1. Introduction Continuous semirings were deÿned by the “French school” (cf. e.g. [16,22]) using a purely algebraic deÿnition. In a recent paper, Esik and Kuich [6] deÿne continuous semirings via the well-known concept of a CPO (complete partial order) and claim that this is a generalisation of the established notion. However, they do not give any proof to substantiate this claim. In a similar vein, Kuich deÿned continuous distributive multioperator monoids (DM-monoids) ÿrst algebraically [17,18] and then, again with Esik, via CPOs. (In the latter paper, DM-monoids are called distributive -algebras.) Also here the relation between the two notions of continuity remains unclear. The present paper clariÿes these issues and discusses also more general concepts. A lot of examples are included.
    [Show full text]
  • 3 Limits of Sequences and Filters
    3 Limits of Sequences and Filters The Axiom of Choice is obviously true, the well-ordering theorem is obviously false; and who can tell about Zorn’s Lemma? —Jerry Bona (Schechter, 1996) Introduction. Chapter 2 featured various properties of topological spaces and explored their interactions with a few categorical constructions. In this chapter we’ll again discuss some topological properties, this time with an eye toward more fine-grained ideas. As introduced early in a study of analysis, properties of nice topological spaces X can be detected by sequences of points in X. We’ll be interested in some of these properties and the extent to which sequences suffice to detect them. But take note of the adjective “nice” here. What if X is any topological space, not just a nice one? Unfortunately, sequences are not well suited for characterizing properties in arbitrary spaces. But all is not lost. A sequence can be replaced with a more general construction—a filter—which is much better suited for the task. In this chapter we introduce filters and highlight some of their strengths. Our goal is to spend a little time inside of spaces to discuss ideas that may be familiar from analysis. For this reason, this chapter contains less category theory than others. On the other hand, we’ll see in section 3.3 that filters are a bit like functors and hence like generalizations of points. This perspective thus gives us a coarse-grained approach to investigating fine-grained ideas. We’ll go through some of these basic ideas—closure, limit points, sequences, and more—rather quickly in sections 3.1 and 3.2.
    [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]