Chapter 3. Topology of the Real Numbers. 3.1
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
De Rham Cohomology
De Rham Cohomology 1. Definition of De Rham Cohomology Let X be an open subset of the plane. If we denote by C0(X) the set of smooth (i. e. infinitely differentiable functions) on X and C1(X), the smooth 1-forms on X (i. e. expressions of the form fdx + gdy where f; g 2 C0(X)), we have natural differntiation map d : C0(X) !C1(X) given by @f @f f 7! dx + dy; @x @y usually denoted by df. The kernel for this map (i. e. set of f with df = 0) is called the zeroth De Rham Cohomology of X and denoted by H0(X). It is clear that these are precisely the set of locally constant functions on X and it is a vector space over R, whose dimension is precisley the number of connected components of X. The image of d is called the set of exact forms on X. The set of pdx + qdy 2 C1(X) @p @q such that @y = @x are called closed forms. It is clear that exact forms and closed forms are vector spaces and any exact form is a closed form. The quotient vector space of closed forms modulo exact forms is called the first De Rham Cohomology and denoted by H1(X). A path for this discussion would mean piecewise smooth. That is, if γ : I ! X is a path (a continuous map), there exists a subdivision, 0 = t0 < t1 < ··· < tn = 1 and γ(t) is continuously differentiable in the open intervals (ti; ti+1) for all i. -
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. -
3. Closed Sets, Closures, and Density
3. Closed sets, closures, and density 1 Motivation Up to this point, all we have done is define what topologies are, define a way of comparing two topologies, define a method for more easily specifying a topology (as a collection of sets generated by a basis), and investigated some simple properties of bases. At this point, we will start introducing some more interesting definitions and phenomena one might encounter in a topological space, starting with the notions of closed sets and closures. Thinking back to some of the motivational concepts from the first lecture, this section will start us on the road to exploring what it means for two sets to be \close" to one another, or what it means for a point to be \close" to a set. We will draw heavily on our intuition about n convergent sequences in R when discussing the basic definitions in this section, and so we begin by recalling that definition from calculus/analysis. 1 n Definition 1.1. A sequence fxngn=1 is said to converge to a point x 2 R if for every > 0 there is a number N 2 N such that xn 2 B(x) for all n > N. 1 Remark 1.2. It is common to refer to the portion of a sequence fxngn=1 after some index 1 N|that is, the sequence fxngn=N+1|as a tail of the sequence. In this language, one would phrase the above definition as \for every > 0 there is a tail of the sequence inside B(x)." n Given what we have established about the topological space Rusual and its standard basis of -balls, we can see that this is equivalent to saying that there is a tail of the sequence inside any open set containing x; this is because the collection of -balls forms a basis for the usual topology, and thus given any open set U containing x there is an such that x 2 B(x) ⊆ U. -
Interval Notation and Linear Inequalities
CHAPTER 1 Introductory Information and Review Section 1.7: Interval Notation and Linear Inequalities Linear Inequalities Linear Inequalities Rules for Solving Inequalities: 86 University of Houston Department of Mathematics SECTION 1.7 Interval Notation and Linear Inequalities Interval Notation: Example: Solution: MATH 1300 Fundamentals of Mathematics 87 CHAPTER 1 Introductory Information and Review Example: Solution: Example: 88 University of Houston Department of Mathematics SECTION 1.7 Interval Notation and Linear Inequalities Solution: Additional Example 1: Solution: MATH 1300 Fundamentals of Mathematics 89 CHAPTER 1 Introductory Information and Review Additional Example 2: Solution: 90 University of Houston Department of Mathematics SECTION 1.7 Interval Notation and Linear Inequalities Additional Example 3: Solution: Additional Example 4: Solution: MATH 1300 Fundamentals of Mathematics 91 CHAPTER 1 Introductory Information and Review Additional Example 5: Solution: Additional Example 6: Solution: 92 University of Houston Department of Mathematics SECTION 1.7 Interval Notation and Linear Inequalities Additional Example 7: Solution: MATH 1300 Fundamentals of Mathematics 93 Exercise Set 1.7: Interval Notation and Linear Inequalities For each of the following inequalities: Write each of the following inequalities in interval (a) Write the inequality algebraically. notation. (b) Graph the inequality on the real number line. (c) Write the inequality in interval notation. 23. 1. x is greater than 5. 2. x is less than 4. 24. 3. x is less than or equal to 3. 4. x is greater than or equal to 7. 25. 5. x is not equal to 2. 6. x is not equal to 5 . 26. 7. x is less than 1. 8. -
TOPOLOGY and ITS APPLICATIONS the Number of Complements in The
TOPOLOGY AND ITS APPLICATIONS ELSEVIER Topology and its Applications 55 (1994) 101-125 The number of complements in the lattice of topologies on a fixed set Stephen Watson Department of Mathematics, York Uniuersity, 4700 Keele Street, North York, Ont., Canada M3J IP3 (Received 3 May 1989) (Revised 14 November 1989 and 2 June 1992) Abstract In 1936, Birkhoff ordered the family of all topologies on a set by inclusion and obtained a lattice with 1 and 0. The study of this lattice ought to be a basic pursuit both in combinatorial set theory and in general topology. In this paper, we study the nature of complementation in this lattice. We say that topologies 7 and (T are complementary if and only if 7 A c = 0 and 7 V (T = 1. For simplicity, we call any topology other than the discrete and the indiscrete a proper topology. Hartmanis showed in 1958 that any proper topology on a finite set of size at least 3 has at least two complements. Gaifman showed in 1961 that any proper topology on a countable set has at least two complements. In 1965, Steiner showed that any topology has a complement. The question of the number of distinct complements a topology on a set must possess was first raised by Berri in 1964 who asked if every proper topology on an infinite set must have at least two complements. In 1969, Schnare showed that any proper topology on a set of infinite cardinality K has at least K distinct complements and at most 2” many distinct complements. -
Interval Computations: Introduction, Uses, and Resources
Interval Computations: Introduction, Uses, and Resources R. B. Kearfott Department of Mathematics University of Southwestern Louisiana U.S.L. Box 4-1010, Lafayette, LA 70504-1010 USA email: [email protected] Abstract Interval analysis is a broad field in which rigorous mathematics is as- sociated with with scientific computing. A number of researchers world- wide have produced a voluminous literature on the subject. This article introduces interval arithmetic and its interaction with established math- ematical theory. The article provides pointers to traditional literature collections, as well as electronic resources. Some successful scientific and engineering applications are listed. 1 What is Interval Arithmetic, and Why is it Considered? Interval arithmetic is an arithmetic defined on sets of intervals, rather than sets of real numbers. A form of interval arithmetic perhaps first appeared in 1924 and 1931 in [8, 104], then later in [98]. Modern development of interval arithmetic began with R. E. Moore’s dissertation [64]. Since then, thousands of research articles and numerous books have appeared on the subject. Periodic conferences, as well as special meetings, are held on the subject. There is an increasing amount of software support for interval computations, and more resources concerning interval computations are becoming available through the Internet. In this paper, boldface will denote intervals, lower case will denote scalar quantities, and upper case will denote vectors and matrices. Brackets “[ ]” will delimit intervals while parentheses “( )” will delimit vectors and matrices.· Un- derscores will denote lower bounds of· intervals and overscores will denote upper bounds of intervals. Corresponding lower case letters will denote components of vectors. -
Math 601 Algebraic Topology Hw 4 Selected Solutions Sketch/Hint
MATH 601 ALGEBRAIC TOPOLOGY HW 4 SELECTED SOLUTIONS SKETCH/HINT QINGYUN ZENG 1. The Seifert-van Kampen theorem 1.1. A refinement of the Seifert-van Kampen theorem. We are going to make a refinement of the theorem so that we don't have to worry about that openness problem. We first start with a definition. Definition 1.1 (Neighbourhood deformation retract). A subset A ⊆ X is a neighbourhood defor- mation retract if there is an open set A ⊂ U ⊂ X such that A is a strong deformation retract of U, i.e. there exists a retraction r : U ! A and r ' IdU relA. This is something that is true most of the time, in sufficiently sane spaces. Example 1.2. If Y is a subcomplex of a cell complex, then Y is a neighbourhood deformation retract. Theorem 1.3. Let X be a space, A; B ⊆ X closed subspaces. Suppose that A, B and A \ B are path connected, and A \ B is a neighbourhood deformation retract of A and B. Then for any x0 2 A \ B. π1(X; x0) = π1(A; x0) ∗ π1(B; x0): π1(A\B;x0) This is just like Seifert-van Kampen theorem, but usually easier to apply, since we no longer have to \fatten up" our A and B to make them open. If you know some sheaf theory, then what Seifert-van Kampen theorem really says is that the fundamental groupoid Π1(X) is a cosheaf on X. Here Π1(X) is a category with object pints in X and morphisms as homotopy classes of path in X, which can be regard as a global version of π1(X). -
Open Sets in Topological Spaces
International Mathematical Forum, Vol. 14, 2019, no. 1, 41 - 48 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2019.913 ii – Open Sets in Topological Spaces Amir A. Mohammed and Beyda S. Abdullah Department of Mathematics College of Education University of Mosul, Mosul, Iraq Copyright © 2019 Amir A. Mohammed and Beyda S. Abdullah. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper, we introduce a new class of open sets in a topological space called 푖푖 − open sets. We study some properties and several characterizations of this class, also we explain the relation of 푖푖 − open sets with many other classes of open sets. Furthermore, we define 푖푤 − closed sets and 푖푖푤 − closed sets and we give some fundamental properties and relations between these classes and other classes such as 푤 − closed and 훼푤 − closed sets. Keywords: 훼 − open set, 푤 − closed set, 푖 − open set 1. Introduction Throughout this paper we introduce and study the concept of 푖푖 − open sets in topological space (푋, 휏). The 푖푖 − open set is defined as follows: A subset 퐴 of a topological space (푋, 휏) is said to be 푖푖 − open if there exist an open set 퐺 in the topology 휏 of X, such that i. 퐺 ≠ ∅,푋 ii. A is contained in the closure of (A∩ 퐺) iii. interior points of A equal G. One of the classes of open sets that produce a topological space is 훼 − open. -
Math 501. Homework 2 September 15, 2009 ¶ 1. Prove Or
Math 501. Homework 2 September 15, 2009 ¶ 1. Prove or provide a counterexample: (a) If A ⊂ B, then A ⊂ B. (b) A ∪ B = A ∪ B (c) A ∩ B = A ∩ B S S (d) i∈I Ai = i∈I Ai T T (e) i∈I Ai = i∈I Ai Solution. (a) True. (b) True. Let x be in A ∪ B. Then x is in A or in B, or in both. If x is in A, then B(x, r) ∩ A , ∅ for all r > 0, and so B(x, r) ∩ (A ∪ B) , ∅ for all r > 0; that is, x is in A ∪ B. For the reverse containment, note that A ∪ B is a closed set that contains A ∪ B, there fore, it must contain the closure of A ∪ B. (c) False. Take A = (0, 1), B = (1, 2) in R. (d) False. Take An = [1/n, 1 − 1/n], n = 2, 3, ··· , in R. (e) False. ¶ 2. Let Y be a subset of a metric space X. Prove that for any subset S of Y, the closure of S in Y coincides with S ∩ Y, where S is the closure of S in X. ¶ 3. (a) If x1, x2, x3, ··· and y1, y2, y3, ··· both converge to x, then the sequence x1, y1, x2, y2, x3, y3, ··· also converges to x. (b) If x1, x2, x3, ··· converges to x and σ : N → N is a bijection, then xσ(1), xσ(2), xσ(3), ··· also converges to x. (c) If {xn} is a sequence that does not converge to y, then there is an open ball B(y, r) and a subsequence of {xn} outside B(y, r). -
Isolated Points, Duality and Residues
JOURNAL OF PURE AND APPLIED ALGEBRA Journal of Pure and Applied Algebra 117 % 118 (1997) 469-493 Isolated points, duality and residues B . Mourrain* INDIA, Projet SAFIR, 2004 routes des Lucioles, BP 93, 06902 Sophia-Antipolir, France This work is dedicated to the memory of J. Morgenstem. Abstract In this paper, we are interested in the use of duality in effective computations on polynomials. We represent the elements of the dual of the algebra R of polynomials over the field K as formal series E K[[a]] in differential operators. We use the correspondence between ideals of R and vector spaces of K[[a]], stable by derivation and closed for the (a)-adic topology, in order to construct the local inverse system of an isolated point. We propose an algorithm, which computes the orthogonal D of the primary component of this isolated point, by integration of polynomials in the dual space K[a], with good complexity bounds. Then we apply this algorithm to the computation of local residues, the analysis of real branches of a locally complete intersection curve, the computation of resultants of homogeneous polynomials. 0 1997 Elsevier Science B.V. 1991 Math. Subj. Class.: 14B10, 14Q20, 15A99 1. Introduction Considering polynomials as algorithms (that compute a value at a given point) in- stead of lists of terms, has lead to recent interesting developments, both from a practical and a theoretical point of view. In these approaches, evaluations at points play an im- portant role. We would like to pursue this idea further and to study evaluations by themselves. -
Math 3283W: Solutions to Skills Problems Due 11/6 (13.7(Abc)) All
Math 3283W: solutions to skills problems due 11/6 (13.7(abc)) All three statements can be proven false using counterexamples that you studied on last week's skills homework. 1 (a) Let S = f n jn 2 Ng. Every point of S is an isolated point, since given 1 1 1 n 2 S, there exists a neighborhood N( n ; ") of n that contains no point of S 1 1 1 different from n itself. (We could, for example, take " = n − n+1 .) Thus the set P of isolated points of S is just S. But P = S is not closed, since 0 is a boundary point of S which nevertheless does not belong to S (every neighbor- 1 hood of 0 contains not only 0 but, by the Archimedean property, some n , thus intersects both S and its complement); if S were closed, it would contain all of its boundary points. (b) Let S = N. Then (as you saw on the last skills homework) int(S) = ;. But ; is closed, so its closure is itself; that is, cl(int(S)) = cl(;) = ;, which is certainly not the same thing as S. (c) Let S = R n N. The closure of S is all of R, since every natural number n is a boundary point of R n N and thus belongs to its closure. But R is open, so its interior is itself; that is, int(cl(S)) = int(R) = R, which is certainly not the same thing as S. (13.10) Suppose that x is an isolated point of S, and let N = (x − "; x + ") (for some " > 0) be an arbitrary neighborhood of x. -
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).