DOCSLIB.ORG

Chapter 9 Convergence

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chapter 9 Convergence Chapter IX Theory of Convergence 1. Introduction In Chapters II and III, we discussed the convergence of sequences. Sequential convergence is very useful in working with first countable spaces (in particular, with metric spaces). In any space \, if Ð+Ñ88is a sequence in E and Ð+ÑÄB, then B−cl EÞ But in a first countable space, the converse is also trueÀ B − cl Eiff there is a sequence Ð+88 Ñ in E with Ð+ Ñ Ä BÞ Therefore convergent sequences determine the set clE , so sequences can be used to check whether of not cl EœE, that is, whether or not E is closed. we can determine whether of not Eis closed using sequences. (See Theorem III.9.6 ). So in a first countable space “sequences determine the topology.” However, sequences are not sufficient in general to describe closures: for example, in Ò!ß=" Ó we have ==""−cl Ò!ß Ñ but no sequence Ð α= 8" Ñ in Ò!ß ß Ñconverges to = ". The basic neighborhoods Ð α= ß " Ó of =" are very nicely ordered, but there are just “too many” of them: no mere sequence ÐÑα=8" in Ò!ßÑ is “long enough” to be eventually inside every neighborhood of =". A second example (see Example III.9.8 ): Ð!ß !Ñ −cl ÐP ÖÐ!ß !Ñ×Ñ but no sequence in ÐP ÖÐ!ß !Ñ×Ñ converges to Ð!ß !Ñ. Here the problem is different. Pis a “small” space ( lPl œ i! ) but the neighborhood system aÐ!ß!Ñ ÐÑordered either by inclusion or by reverse inclusion is a very complicated poset so complicated that a mere sequence Ð+8 Ñ in P ÖÐ!ß !Ñ× cannot eventually be in every neighborhood of Ð!ß !ÑÞ In this chapter we develop a theory of convergence that is sufficient to describe the topology in any space \Þ0−\. We define a kind of “generalized sequence” called a net A sequence is a function , A and we write 0Ð8ÑœB8 Þ A net is a function 0−\, where ÐA ß ŸÑis a more general kind of ordered set. Informally, we write a sequence 0ÐBÑ as 8 ; similarly, when 0 is a net, then we informally write the net as ÐB- ÑÞ Thinking of \œÒ!ß=" Ó, we might hope that it would be a sufficient generalization to replace with an initial segment of ordinals AαœÒ!ß Ñ: in other words, to replace sequences with “transfinite sequences” with domain some well-ordered set “longer” than . In fact, this is a sufficient generalization to deal with a case like Ò!ß=="" Ó À if ÐBα Ñ is the “transfinite sequence” in Ò!ß Ñ given by Bœαααα Ð ="" Ñ, then ÐBÑÄ = Ðin the sense that ÐBÑ αis eventually in every neighborhood of =" Ñ. But as we will see below, such a generalization does not go far enough (see Example 2.9 ). We need a generalization that uses some kind of ordered set Aα more complicated than just initial segments Ò!ß Ñ of ordinals. The theory of nets turns out to have a “dual” formulation in the theory of filters. In this chapter we will discuss both formulations. It turns out that nets and filters are fully equivalent formulations of convergence, but sometimes one is more natural to use than the other. 2. Nets 388 Definition 2.1 A nonempty ordered set ÐߟÑA is called a directed set if 1) Ÿ is transitive and reflexive 2) for all --"#, −− A, there exists - $ A such that - $ -" and - $ - #. Example 2.2 1) Any chain (for example, ) is a directed set. 2) In ‘‘, define BŸ‡‡‡ C if lBl lClÞ Then Ð, Ÿ Ñ is a directed set and BŸ C means that “ B is at least as far from the origin as C"Ÿ""Ÿ"Ÿ.” Notice that ‡‡ and , so that ‡ is not antisymmetric. A directed set might not be a poset. 3) Let aB be the neighborhood system at B\ß in ordered by “reverse inclusion” that is, RŸR"# iff RªRÞ "#B a Ág and condition 1) in the definition clearly holds. Condition 2) is satisfied because for RßR"# −aa B ßwe have R " ∩R # œR $ − Band R $ R " and R $ R2 . Therefore ÐߟÑaB is a directed set. This example hints at why replacing A (in the definition of a sequence) with a directed set (in the definition of net) will give a tool strong enough to describe the topology in any space \À the directed set A can chosen to be as complicated as the most complicated system of neighborhoods at a point B. 4) Let A œÖJ©Ò!ß"ÓÀ!−Jß"−J and J is finite ×Þ In analysis, J is called a partition of the interval Ò!ß "Ó. Order A by inclusion: a “larger” partition is a “finer” one one with more subdivision points. Then A is a directed set. Definition 2.3 i) A net in a set \ is a function 0ÀÐAA ߟÑÄ\, where Ð ßŸÑ is directed. We write 0Ð- Ñ œ B-- and, informally, denote the net by ÐB Ñ. ii) A net ÐB-- Ñ in a space \ converges to B − \ if ÐB Ñ is eventually in every neighborhood of Bthat is, aR−a-AB! b − such that B- −R wherever -- !. iii) A point B\ in a space is a cluster point of a net ÐBÑ- if the net is frequently in every neighborhood of BR−− , that is: for all a-A--B! and all there is a ! for which B−R- . Clearly, every sequence is a net, and when Aœ , the definitions ii), and iii) are the same as the old definitions for convergence and cluster point of a sequence. Example 2.4 A---œÖßß×"#$ and define an order in which -- $" and -- $# but - " and - # are not comparable. ÐߟÑAA‘- is a directed set Þ We can define a net 0À Ä by 0ÐÑœ!$ and assigning any real values to 0Ð--"# Ñ and 0Ð Ñ. Since B-- − Ð %%-- ß Ñ for all $, we have ÐB Ñ Ä !Þ ()Notice that a net can have a finite domain and can have a “last term.” 389 Example 2.5 The following examples indicate how several different kinds of limit that come up in analysis can all be reformulated in terms of net convergence. In other words, many different “limit” definitions in analysis are “unified” by the concept of net convergence. 1) Let A‘œ Ö+× and define BŸ‡ C (in A) iff ±B+± ±C+± (in ‘). Suppose 0ÀA‘ Ä is a net. Then the net ÐBÑÄP−- ‘ ‡ iff for all %-A%%--! there exists !! −such that B- −ÐP ßP Ñ if iff for all %-A%%--! there exists ! −such that B- −ÐP ßP Ñ if !l +lŸl! +l iff for all %$! there exists !such that l0Ð -%-$ ÑPl if !l +l ÅÐÊÀuse $-œl! +lÎ# Ñ iff lim 0ÐBÑ œ P (in the usual sense of analysis). BÄ+ 2) Let A‘œŸ0ÀÄ0 with the usual order . If ‘ ‘, we can think of as a net, and write 0Ð<Ñ œ B<< Þ Then the net ÐB Ñ Ä P − ‘ iff for all %A‘%%! there exists <!< − œsuch that B −ÐP ßP Ñ if < < ! iff for all %‘! there exists <!! −such that | 0Ð<ÑPl % if < < iff lim 0ÐBÑ œ P (in the usual sense of analysis). BÄ∞ Parts 1) and 2) show how two different limits in analysis can each be expressed as convergence of a net. In fact each of the limits lim0ÐBÑ œ P, lim 0ÐBÑ œ P, lim 0ÐBÑ œ P, lim 0ÐBÑ œ Pß BÄ+BÄ+ BÄ+ BÄ∞ and lim 0ÐBÑ œ P can be expressed as the convergence of some net. In each case, the trick is to BÄ∞ choose the proper directed set. 3) Integrals can also be defined in terms of the convergence of nets. Let 1 be a bounded real valued function defined on Ò!ß "Ó and let A œ ÖJ © Ò!ß "Ó À J is finite and !−Jß"−J×. Order A by inclusion: J"# ŸJ iff J "# ©J iff J # is a “finer” partition than JÞ " For J −A?, enumerate J as !œB!" B ÞÞÞB 8"8 B œ"Þ Let B 333" œB B and 8 inf . 0ÐJÑ œ Ð 1 ц?‘ B3J œ B − 3œ" ÒB3" ß B 3 Ó 0ÀA‘ Ä is a net in ‘ and we can write 0ÐJÑœBJ ÞThen ÐBJ! Ñ Ä P iff for all % ! there is a partition J such that for all partitions JJßlBPl finer than !J % One can show that such an P always exists: P is called the lower integral of 1 over Ò!ß "Óß denoted Pœ" 1. ! If we replace “inf” by “sup” in defining 0Y, then the limit of the net is called the upper integral of 1 " over Ò!ß "Ó, denoted Y œ 1. If P œ Y, we say that 1 is (Riemann) integrable on Ò!ß "Ó and write ! "1œPÐœYÑÞ ! 390 A sequence can have more than one limit: for example, if l\l " and \ has the trivial topology, every sequence ÐB8 Ñ in \ converges to every point in \. Since a sequence is a net (with A œ ), a net can have more than one limit. We also proved that a sequence in a Hausdorff space can have at most one limit (Theorem III.9.3). This theorem still holds for nets, but then even more is true: uniqueness of net limits actually characterizes Hausdorff spaces. Theorem 2.6 A space \\ is Hausdorff iff every net in has at most one limit. Proof Suppose \ is Hausdorff and BÁC−\. Choose disjoint open sets YßZ with B−Y and C−ZÞ If a net ÐBÑÄB--, then ÐBÑ is eventually in Y and therefore ÐBÑ - is eventually outside Z.
Load more

Recommended publications
  • Completeness in Quasi-Pseudometric Spaces—A Survey
    mathematics Article Completeness in Quasi-Pseudometric Spaces—A Survey ¸StefanCobzas Faculty of Mathematics and Computer Science, Babe¸s-BolyaiUniversity, 400 084 Cluj-Napoca, Romania; [email protected] Received:17 June 2020; Accepted: 24 July 2020; Published: 3 August 2020 Abstract: The aim of this paper is to discuss the relations between various notions of sequential completeness and the corresponding notions of completeness by nets or by filters in the setting of quasi-metric spaces. We propose a new definition of right K-Cauchy net in a quasi-metric space for which the corresponding completeness is equivalent to the sequential completeness. In this way we complete some results of R. A. Stoltenberg, Proc. London Math. Soc. 17 (1967), 226–240, and V. Gregori and J. Ferrer, Proc. Lond. Math. Soc., III Ser., 49 (1984), 36. A discussion on nets defined over ordered or pre-ordered directed sets is also included. Keywords: metric space; quasi-metric space; uniform space; quasi-uniform space; Cauchy sequence; Cauchy net; Cauchy filter; completeness MSC: 54E15; 54E25; 54E50; 46S99 1. Introduction It is well known that completeness is an essential tool in the study of metric spaces, particularly for fixed points results in such spaces. The study of completeness in quasi-metric spaces is considerably more involved, due to the lack of symmetry of the distance—there are several notions of completeness all agreing with the usual one in the metric case (see [1] or [2]). Again these notions are essential in proving fixed point results in quasi-metric spaces as it is shown by some papers on this topic as, for instance, [3–6] (see also the book [7]).
    [Show full text]
  • Basic Properties of Filter Convergence Spaces
    Basic Properties of Filter Convergence Spaces Barbel¨ M. R. Stadlery, Peter F. Stadlery;z;∗ yInstitut fur¨ Theoretische Chemie, Universit¨at Wien, W¨ahringerstraße 17, A-1090 Wien, Austria zThe Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA ∗Address for corresponce Abstract. This technical report summarized facts from the basic theory of filter convergence spaces and gives detailed proofs for them. Many of the results collected here are well known for various types of spaces. We have made no attempt to find the original proofs. 1. Introduction Mathematical notions such as convergence, continuity, and separation are, at textbook level, usually associated with topological spaces. It is possible, however, to introduce them in a much more abstract way, based on axioms for convergence instead of neighborhood. This approach was explored in seminal work by Choquet [4], Hausdorff [12], Katˇetov [14], Kent [16], and others. Here we give a brief introduction to this line of reasoning. While the material is well known to specialists it does not seem to be easily accessible to non-topologists. In some cases we include proofs of elementary facts for two reasons: (i) The most basic facts are quoted without proofs in research papers, and (ii) the proofs may serve as examples to see the rather abstract formalism at work. 2. Sets and Filters Let X be a set, P(X) its power set, and H ⊆ P(X). The we define H∗ = fA ⊆ Xj(X n A) 2= Hg (1) H# = fA ⊆ Xj8Q 2 H : A \ Q =6 ;g The set systems H∗ and H# are called the conjugate and the grill of H, respectively.
    [Show full text]
  • 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]
  • Basic Topologytaken From
    Notes by Tamal K. Dey, OSU 1 Basic Topology taken from [1] 1 Metric space topology We introduce basic notions from point set topology. These notions are prerequisites for more sophisticated topological ideas—manifolds, homeomorphism, and isotopy—introduced later to study algorithms for topological data analysis. To a layman, the word topology evokes visions of “rubber-sheet topology”: the idea that if you bend and stretch a sheet of rubber, it changes shape but always preserves the underlying structure of how it is connected to itself. Homeomorphisms offer a rigorous way to state that an operation preserves the topology of a domain, and isotopy offers a rigorous way to state that the domain can be deformed into a shape without ever colliding with itself. Topology begins with a set T of points—perhaps the points comprising the d-dimensional Euclidean space Rd, or perhaps the points on the surface of a volume such as a coffee mug. We suppose that there is a metric d(p, q) that specifies the scalar distance between every pair of points p, q ∈ T. In the Euclidean space Rd we choose the Euclidean distance. On the surface of the coffee mug, we could choose the Euclidean distance too; alternatively, we could choose the geodesic distance, namely the length of the shortest path from p to q on the mug’s surface. d Let us briefly review the Euclidean metric. We write points in R as p = (p1, p2,..., pd), d where each pi is a real-valued coordinate. The Euclidean inner product of two points p, q ∈ R is d Rd 1/2 d 2 1/2 hp, qi = Pi=1 piqi.
    [Show full text]
  • Topological Spaces and Neighborhood Filters
    Topological spaces and neighborhood filters Jordan Bell [email protected] Department of Mathematics, University of Toronto April 3, 2014 If X is a set, a filter on X is a set F of subsets of X such that ; 62 F; if A; B 2 F then A \ B 2 F; if A ⊆ X and there is some B 2 F such that B ⊆ A, then A 2 F. For example, if x 2 X then the set of all subsets of X that include x is a filter on X.1 A basis for the filter F is a subset B ⊆ F such that if A 2 F then there is some B 2 B such that B ⊆ A. If X is a set, a topology on X is a set O of subsets of X such that: ;;X 2 O; S if Uα 2 O for all α 2 I, then Uα 2 O; if I is finite and Uα 2 O for all α 2 I, T α2I then α2I Uα 2 O. If N ⊆ X and x 2 X, we say that N is a neighborhood of x if there is some U 2 O such that x 2 U ⊆ N. In particular, an open set is a neighborhood of every element of itself. A basis for a topology O is a subset B of O such that if x 2 X then there is some B 2 B such that x 2 B, and such that if B1;B2 2 B and x 2 B1 \ B2, then there is some B3 2 B such that 2 x 2 B3 ⊆ B1 \ B2.
    [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]
  • "Mathematics for Computer Science" (MCS)
    “mcs” — 2016/9/28 — 23:07 — page i — #1 Mathematics for Computer Science revised Wednesday 28th September, 2016, 23:07 Eric Lehman Google Inc. F Thomson Leighton Department of Mathematics and the Computer Science and AI Laboratory, Massachussetts Institute of Technology; Akamai Technologies Albert R Meyer Department of Electrical Engineering and Computer Science and the Computer Science and AI Laboratory, Massachussetts Institute of Technology 2016, Eric Lehman, F Tom Leighton, Albert R Meyer. This work is available under the terms of the Creative Commons Attribution-ShareAlike 3.0 license. “mcs” — 2016/9/28 — 23:07 — page ii — #2 “mcs” — 2016/9/28 — 23:07 — page iii — #3 Contents I Proofs Introduction 3 0.1 References4 1 What is a Proof? 5 1.1 Propositions5 1.2 Predicates8 1.3 The Axiomatic Method8 1.4 Our Axioms9 1.5 Proving an Implication 11 1.6 Proving an “If and Only If” 13 1.7 Proof by Cases 15 1.8 Proof by Contradiction 16 1.9 Good Proofs in Practice 17 1.10 References 19 2 The Well Ordering Principle 29 2.1 Well Ordering Proofs 29 2.2 Template for Well Ordering Proofs 30 2.3 Factoring into Primes 32 2.4 Well Ordered Sets 33 3 Logical Formulas 47 3.1 Propositions from Propositions 48 3.2 Propositional Logic in Computer Programs 51 3.3 Equivalence and Validity 54 3.4 The Algebra of Propositions 56 3.5 The SAT Problem 61 3.6 Predicate Formulas 62 3.7 References 67 4 Mathematical Data Types 93 4.1 Sets 93 4.2 Sequences 98 4.3 Functions 99 4.4 Binary Relations 101 4.5 Finite Cardinality 105 “mcs” — 2016/9/28 — 23:07 — page iv — #4 Contentsiv 5 Induction 125 5.1 Ordinary Induction 125 5.2 Strong Induction 134 5.3 Strong Induction vs.
    [Show full text]
  • MTH 304: General Topology Semester 2, 2017-2018
    MTH 304: General Topology Semester 2, 2017-2018 Dr. Prahlad Vaidyanathan Contents I. Continuous Functions3 1. First Definitions................................3 2. Open Sets...................................4 3. Continuity by Open Sets...........................6 II. Topological Spaces8 1. Definition and Examples...........................8 2. Metric Spaces................................. 11 3. Basis for a topology.............................. 16 4. The Product Topology on X × Y ...................... 18 Q 5. The Product Topology on Xα ....................... 20 6. Closed Sets.................................. 22 7. Continuous Functions............................. 27 8. The Quotient Topology............................ 30 III.Properties of Topological Spaces 36 1. The Hausdorff property............................ 36 2. Connectedness................................. 37 3. Path Connectedness............................. 41 4. Local Connectedness............................. 44 5. Compactness................................. 46 6. Compact Subsets of Rn ............................ 50 7. Continuous Functions on Compact Sets................... 52 8. Compactness in Metric Spaces........................ 56 9. Local Compactness.............................. 59 IV.Separation Axioms 62 1. Regular Spaces................................ 62 2. Normal Spaces................................ 64 3. Tietze's extension Theorem......................... 67 4. Urysohn Metrization Theorem........................ 71 5. Imbedding of Manifolds..........................
    [Show full text]
  • 16 Continuous Functions Definition 16.1. Let F
    Math 320, December 09, 2018 16 Continuous functions Definition 16.1. Let f : D ! R and let c 2 D. We say that f is continuous at c, if for every > 0 there exists δ>0 such that jf(x)−f(c)j<, whenever jx−cj<δ and x2D. If f is continuous at every point of a subset S ⊂D, then f is said to be continuous on S. If f is continuous on its domain D, then f is said to be continuous. Notice that in the above definition, unlike the definition of limits of functions, c is not required to be a limit point of D. It is clear from the definition that if c is an isolated point of the domain D, then f must be continuous at c. The following statement gives the interpretation of continuity in terms of neighborhoods and sequences. Theorem 16.2. Let f :D!R and let c2D. Then the following three conditions are equivalent. (a) f is continuous at c (b) If (xn) is any sequence in D such that xn !c, then limf(xn)=f(c) (c) For every neighborhood V of f(c) there exists a neighborhood U of c, such that f(U \D)⊂V . If c is a limit point of D, then the above three statements are equivalent to (d) f has a limit at c and limf(x)=f(c). x!c From the sequential interpretation, one gets the following criterion for discontinuity. Theorem 16.3. Let f :D !R and c2D. Then f is discontinuous at c iff there exists a sequence (xn)2D, such that (xn) converges to c, but the sequence f(xn) does not converge to f(c).
    [Show full text]
  • M2 M'l M2m3 M1 a Net {Sm,Med) in a Uniform Space (X, U) Is Submonotone > M and Relative to a Base V for U If Wheneverm3> M
    AN ABSTRACT OF THE THESIS OF FRANK OLIVER WYSE for the Ph. D.in MATHEMATICS (Name) (Degree) (Major) Date thesis is presented TitleNETS IN UNIFORM SPACES: MONOTONEITY, LIMIT THEOREMS Redacted for Privacy Abstract approved Majcprofessor) After a discussion of nets and subnets (both words are here used in broader senses than are customary) two independent topics are treated. One is a generalization of the concept "monotone," as applied to sequences of real numbers, to a related concept for nets in uniform spaces.(Here the nets are as usual functions on directed sets.) A net {S, meD} in a pseudometric space (X, d)is "sub- monotone" if whenever m d(S , S ) < d(S,S ). 3 m3 m2 m'l m2m3 m1 A net {Sm,mED) in a uniform space (X, U) is submonotone > m and relative to a base V for U if wheneverm3> m (S ,S ) EVEV, also(S ,S ) EV.Various sufficient conditions m1 m3 m2 m3 for a net to be submonotone are developed, the manner of conver- gence of a convergent subrnon.otone net is investigated, conditions for a net to have a submonotone subnet are given, and two theorems are proved in which submonotoneity and a related condition (respectively) appear as hypotheses.(In particular the familiar fact that a bounded monotone sequence of real numbers has a limit finds a generalization: A submonotone net in a compact space converges.) I hope that it may prove useful to hypothesize submonotoneity in other work. The second topic is the justification of changing the order in a repeated limit.
    [Show full text]
  • A TEXTBOOK of TOPOLOGY Lltld
    SEIFERT AND THRELFALL: A TEXTBOOK OF TOPOLOGY lltld SEI FER T: 7'0PO 1.OG 1' 0 I.' 3- Dl M E N SI 0 N A I. FIRERED SPACES This is a volume in PURE AND APPLIED MATHEMATICS A Series of Monographs and Textbooks Editors: SAMUELEILENBERG AND HYMANBASS A list of recent titles in this series appears at the end of this volunie. SEIFERT AND THRELFALL: A TEXTBOOK OF TOPOLOGY H. SEIFERT and W. THRELFALL Translated by Michael A. Goldman und S E I FE R T: TOPOLOGY OF 3-DIMENSIONAL FIBERED SPACES H. SEIFERT Translated by Wolfgang Heil Edited by Joan S. Birman and Julian Eisner @ 1980 ACADEMIC PRESS A Subsidiary of Harcourr Brace Jovanovich, Publishers NEW YORK LONDON TORONTO SYDNEY SAN FRANCISCO COPYRIGHT@ 1980, BY ACADEMICPRESS, INC. ALL RIGHTS RESERVED. NO PART OF THIS PUBLICATION MAY BE REPRODUCED OR TRANSMITTED IN ANY FORM OR BY ANY MEANS, ELECTRONIC OR MECHANICAL, INCLUDING PHOTOCOPY, RECORDING, OR ANY INFORMATION STORAGE AND RETRIEVAL SYSTEM, WITHOUT PERMISSION IN WRITING FROM THE PUBLISHER. ACADEMIC PRESS, INC. 11 1 Fifth Avenue, New York. New York 10003 United Kingdom Edition published by ACADEMIC PRESS, INC. (LONDON) LTD. 24/28 Oval Road, London NWI 7DX Mit Genehmigung des Verlager B. G. Teubner, Stuttgart, veranstaltete, akin autorisierte englische Ubersetzung, der deutschen Originalausgdbe. Library of Congress Cataloging in Publication Data Seifert, Herbert, 1897- Seifert and Threlfall: A textbook of topology. Seifert: Topology of 3-dimensional fibered spaces. (Pure and applied mathematics, a series of mono- graphs and textbooks ; ) Translation of Lehrbuch der Topologic. Bibliography: p. Includes index. 1.
    [Show full text]
  • General Topology
    General Topology Tom Leinster 2014{15 Contents A Topological spaces2 A1 Review of metric spaces.......................2 A2 The definition of topological space.................8 A3 Metrics versus topologies....................... 13 A4 Continuous maps........................... 17 A5 When are two spaces homeomorphic?................ 22 A6 Topological properties........................ 26 A7 Bases................................. 28 A8 Closure and interior......................... 31 A9 Subspaces (new spaces from old, 1)................. 35 A10 Products (new spaces from old, 2)................. 39 A11 Quotients (new spaces from old, 3)................. 43 A12 Review of ChapterA......................... 48 B Compactness 51 B1 The definition of compactness.................... 51 B2 Closed bounded intervals are compact............... 55 B3 Compactness and subspaces..................... 56 B4 Compactness and products..................... 58 B5 The compact subsets of Rn ..................... 59 B6 Compactness and quotients (and images)............. 61 B7 Compact metric spaces........................ 64 C Connectedness 68 C1 The definition of connectedness................... 68 C2 Connected subsets of the real line.................. 72 C3 Path-connectedness.......................... 76 C4 Connected-components and path-components........... 80 1 Chapter A Topological spaces A1 Review of metric spaces For the lecture of Thursday, 18 September 2014 Almost everything in this section should have been covered in Honours Analysis, with the possible exception of some of the examples. For that reason, this lecture is longer than usual. Definition A1.1 Let X be a set. A metric on X is a function d: X × X ! [0; 1) with the following three properties: • d(x; y) = 0 () x = y, for x; y 2 X; • d(x; y) + d(y; z) ≥ d(x; z) for all x; y; z 2 X (triangle inequality); • d(x; y) = d(y; x) for all x; y 2 X (symmetry).
    [Show full text]