Topology Homework 3. Section Section 3.3. Samuel Otten
|
|
- Isaac Higgins
- 6 years ago
- Views:
Transcription
1 Topology Homework 3 Section Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that S 1 S 2 S 3 S n = (((S 1 S 2 ) S 3 ) S n ) for any family of sets {S i }, i N, and any natural number n. Thus, for an intersection of finitely many open sets we can take the intersection pairwise and, by Definition 1(ii), each set along the way is open and the end result is open. Similarly, S 1 S 2 S 3 S n = (((S 1 S 2 ) S 3 ) S n ). Thus, for a union of finitely many closed sets we can take the union pairwise and, by Proposition 1(b), each set along the way is closed and the end result is closed. (6) Proposition. Let F N be closed if F contains a finite number of positive integers or F = N. Then the set F of all closed subsets of N thus defined forms a topology on N. Moreover, this topology is not induced by any metric. Proof. We shall employ Proposition 2 of the text to demonstrate that (N, F) is a topological space. First, by definition, F = N is closed and φ is closed because it contains a finite number of positive integers, namely zero. Second, let F 1 and F 2 be elements of F. If at least one of F 1 and F 2 is equal to all of N, then F 1 F 2 = N which is closed. If this is not the case, then both contain a finite number of positive integers. Thus, their union contains a finite number of positive integers and is closed by definition. Third, we consider the intersection of a family of elements of F. The intersection of sets containing finitely many elements must itself contain finitely many elements. The worst that the intersection could do is result in N itself, but this is closed. Therefore, F defines a topology on N. Suppose a metric D on N did induce (N, F). Since (N, D) is a metric space, it must satisfy Proposition 12 of Chapter 2, which says that for any closed subset of the space and any point in its complement, there exist disjoint open subsets such that the closed subset is contained in one and the point is contained in the other. Consider F = {1, 2, 3} and x = 4. It is obviously the case that F is closed and x N F, so Proposition 12 must hold. Let U be an open set containing F and let V be an open set containing x such that U V = φ. Since U and V are disjoint, both cannot contain infinitely many elements. Therefore, at least one of them must contain finitely many elements, which leads us to two cases. Suppose U is finite. Then U C = N U has infinitely many elements. Moreover, U C N because it lacks the elements 1, 2, and 3. Hence, U C is not closed. (Note that an open set in this topology is defined as the complement to some closed set from F.) Therefore, U is not open, a contradiction. Similarly, if V is finite, then V C is infinite but lacks the element 3. So, in this case, V C is not closed and we also have a contradiction. This implies that this topology is not induced by any metric. 1
2 (7) Proposition. Define a family F of subsets of R 2 as follows: Let F F if and only if F = R 2. F = φ, or F is a set consisting of finitely many points together with the union of finitely many straight lines. Then the topology determined by F is the coarsest in which lines and points are closed sets. Proof. Suppose (R 2, F ) is a topological space such that F is strictly coarser than F. This means F F, so there must exist some F F such that F / F. By definition, F consists of finitely many points and lines. But since F is not an element of F, the points and lines from F are not closed sets in F. If they were individually closed, then their unions taken pairwise would have to be in F by Proposition 1(b). But this union is precisely F, which we just said was not in F. Therefore, any topology that is coarser than F does not have all lines and points as closed sets. It is not possible to have a topology on the real plane in which every line was a closed set, but every one-point subset was not. This fact follows from Proposition 1(b) which states that the union of any two closed sets is closed. Since a one-point subset of the real plane corresponds to an intersection of lines, and lines are closed, the singleton set would also have to be closed. It is possible, however, to have a topology on the real plane in which every one-point set was closed but every line was not. This also follows from Proposition 1(b) which implies that the union of uncountably many closed sets may not be closed, and a line is the union of uncountably many (closed) one-point sets. 3.2 (5) Example 6 of the text made the claim that B 1 = {N(x, q) q Q, x X} and B 2 = {N(x, 1/n) x X and n a positive integer} are both bases for the topology induced on X = R 2 by the Pythagorean metric. We will verify this claim using our in-class definition of a basis. For B 1, let x be any element in X. It is clear that x N(x, q) for any rational q > 0 because a point is always in its own neighborhood. Choose x B 1 B 2 where B 1, B 2 B 1. This means that x is in two overlapping neighborhoods with rational radii. Set p equal to the lesser of the Pythagorean distances from x to the frontiers of the neighborhoods. If p is rational, then we have found a B 3 B 1 such that x B 3. If p is irrational, then we set q equal to a rational number that is less than p, which exists because the rationals are dense. Thus, B 1 is a basis for the real plane with the Pythagorean metric. For B 2, let x be any element in X. Again, x is guaranteed to be in its own neighborhood for any radius 1/n. Choose x B 1 B 2 where B 1, B 2 B 2. As above, set p equal to the lesser of the Pythagorean distances from x to the frontiers of the neighborhoods surrounding it. If p = 1/n for some positive integer n then we are done. If not, then we choose n so that 1/n < p, which exists because the sequence 1/n converges to zero. Thus, x B 3 B 2 and B 2 is also a basis. (6) We will list all the other open sets in the smallest topologies on N for which the following are collections of open sets. N, φ are the only open sets. (trivial topology) N, {1, 2}, {3, 4, 5} and {1, 2, 3, 4, 5}, φ. N, {1, 2}, {3, 4, 5}, {1, 4, 7} and {1, 2, 3, 4, 5, 7}, {1, 2, 3, 4, 5}, {3, 4, 5, 7}, {1, 2, 4, 7}, {1}, {4}, φ. 2
3 3.3 (4) Proposition. For each x R 2, let N x be the set of interiors of all triangles which contain x in the interior. Then the collection N x forms a neighborhood system for a topology on R 2. Moreover, this topology is the same as the topology induced by the Pythagorean metric. Proof. We will use our in-class definition to show that this is a neighborhood system. (i) There are obviously triangle interiors that contain x for any point x R 2. Thus, N x φ. (ii) By definition, x is in the interior of the triangle and so x N for each N N x. (iii) Let N 1 and N 2 be two sets from N x. These sets both necessarily contain x. Since the interior of triangles (excluding the boundary) are open sets in the real plane, and the intersection of N 1 and N 2 is not empty, we know that infinitely many points belong to N 1 N 2. Choosing any three non-collinear points from this set will result in N 3 N x. (iv) Let N be any set from N x and let y be any point from N. Consider the points that lie halfway between y and each of the three vertices of the triangle at the frontier of N. These three points are non-collinear, and if we let N be the interior of the triangle formed by the three points then N contains y. Thus, N N y and N N. It is clear to see that this open neighborhood system determines the same topology as that induced by the Pythagorean metric because circles (D-neighborhoods) can be circumscribed about any triangular interior and a triangle can be described about any circle. (6) Proposition. Let (X, D) be a metric space and {a n } a sequence of positive real numbers which converges to 0. For each x X, set N x = {N(x, a n ) n N}. Then the collection of N x thus formed constitutes an open neighborhood system for the topology induced by D. Proof. (i) Since {a n } comprises positive real numbers, let p = a 1 > 0. Then N(x, p) N x for each x X, and N x φ. (ii) Since D(x, x) = 0 and a n > 0 for each n, we know that x N(x, a n ) for any n. Thus, x N for any N N x. (iii) Suppose N 1 and N 2 are in N x. Then N 1 = N(x, a j ) and N 2 = N(x, a k ) for some j, k N. Without loss of generality, suppose a j a k. Then N 1 N 2 = N(x, a k ). Since a n 0, we can find an a m that is arbitrarily close to 0. In this case, we choose a m < a k and define N 3 = N(x, a m ). Hence, N 3 N x and N 3 N 1 N 2. (iv) Let N = N(x, a p ) be a set from N x and let y be an element in N. If p = a p D(x, y) (note that 0 < p a p ), we know by the convergence of {a n } that there exists an a q such that a q < p. Therefore, N(y, a q ) N y is contained in N(x, a p ). (v) A subset U of X is clearly open if and only if for each x U there is N N x such that N U. This follows because open sets in the topology induced by D are defined in terms of neighborhoods, and it is neighborhoods that make up N x. Also, since a n 0, we will always be able to find N U for any x U. Therefore, N x satisfies the textbook definition of an open neighborhood system. (7) CLAIM: If N x is a neighborhood system of a set X with the property that each member of each N x is finite, then the topology τ on X determined by N x is the discrete topology. This claim is false. We shall consider the following counterexample. Let X = {1, 2, 3} and let N x have only one element for x = 1, 2, 3; specifically, N 1 = {{1, 2}}, N 2 = {{2}}, and N 3 = {{2, 3}}. Clearly, N x is never the empty set and x N for each N x (there is only one). It is true that N 3 N x always exists such that N 3 N 1 N 2 because, in fact, N 1 = N 2 = N 3 for each N x. Moreover, the only element y of an N N x that is distinct from x is 2 (in both N 1 and N 3 ). But N N y is the set containing 2, which is obviously a subset of N in either case. Therefore, N x is a neighborhood system by definition. Also, each member is finite. However, N x does not determine the discrete topology because {1}, {3}, and {1, 3} are subsets of X that are not the union or intersection of sets within N x. 3
4 3.G (1) Let B be a basis for a topology τ on X. a) We will show that τ is the intersection of all topologies containing B. Let T τ. Then, by the definition of a basis (p. 44), T is the union of members of B. Also, by part (iii) of the definition of a topology (p. 40), any topology containing B must also contain the union of any family of its members. This means T is in any topology containing B and T is in the intersection of all topologies containing B. Thus, τ is a subset of that intersection. Conversely, let T be any set from the intersection of all topologies containing B. Since τ is a topology containing B, T τ. Thus, the intersection of all topologies containing B is a subset of τ. Therefore, we can conclude that they are, in fact, equal. b) The conclusion from part (a) also holds when B is a subbasis. The argument is the same, except now we use the definition of subbasis (p. 46) which includes the intersection of finitely many members, and part (ii) of the definition of a basis which also deals with the intersection. (2) For the set of integers Z, let B be the set of all bi-infinite arithmetic sequences. Note that an arithmetic sequence is of the form an + b for n N and some fixed a, b Z. a) We will show that B is a basis for a topology τ on Z. First, observe that {..., 2, 1, 0, 1, 2,... } is an element of B. Thus, for any x Z there is a B B such that x B. Second, let B 1 and B 2 be arbitrary sets from B and let x B 1 B 2. We know that B 1 and B 2 contain elements of the form an + b and cn + d, respectively. Since x belongs to the intersection, x = an 1 + b and x = cn 2 + d for some n 1, n 2 N. But x + ac = a(n 1 + c) + b = c(n 2 + a) + d, so x + ac B 1 B 2. By adding x and all the multiples of ac, we will have generated B 3 B such that B 3 B 1 B 2. Therefore, B is a basis by definition. b) Let us consider some simple closed sets in this topology. By definition, the complement of a closed set is open; in particular, the complement of a closed set is a bi-infinite arithmetic sequence. So {..., 3, 1, 1, 3,... } is closed because its complement is the bi-infinite arithmetic sequence {..., 2, 0, 2,... }. (Note that both sets just mentioned are simultaneously open and closed.) Similarly, {..., 5, 4, 2, 1, 1, 2, 4, 5,... } is closed because its complement is the set of multiples of 3. Furthermore, there are more complicated closed sets whose complements are some union of bi-infinite arithmetic sequences, as we shall see below. c) Proposition. There are infinitely many prime numbers. Proof. Let τ be the topology from part (a). Define m to be the set of multiples of m N. Thus, 2 = {..., 4, 2, 0, 2, 4,... } 3 = {..., 6, 3, 0, 3, 6,... } 5 = {..., 10, 5, 0, 5, 10,... }. p = {..., 2p, p, 0, p, 2p,... }. The sets p for p a prime number are open because they are bi-infinite arithmetic sequences. However, it is important to note that the sets p are also closed. Consider the complement of 2, which is {..., 3, 1, 1, 3,... }. This is the set of all numbers congruent to 1(mod 2). Similarly, the complement of 3 is {..., 2, 1, 1, 2,... }, which is the union of the set of all numbers congruent to 1(mod 3) and the set of all numbers congruent to 2(mod 3). Since both of these complements are open, 2 and 3 themselves are closed. This reasoning can be generalized to p. The complement of p is the union of open sets; namely, the sets containing all numbers congruent to 1(mod p), 2(mod p),..., p 1(mod p). Since this union is open, p is closed. 4
5 Let us observe one more fact before moving on to the heart of the argument. By definition, a prime number is not a multiple of any natural number preceding it. That is, p / p for any p preceding p. Moreover, if q is a composite number, then q p for some p preceding q. Now, suppose to the contrary that the number of prime numbers is finite. Let p be the last prime. Then 2 3 p is the union of finitely many closed sets. We proved in Problem (1) of Section 3.1 that such a union is closed. This means that the complement of this union is open. Note that for any natural number q which is composite, q p for some prime p and, therefore, q is in the union. Certainly all primes are in the union. Since all integers are either prime or composite (other than 1 and -1), it follows that 2 3 p = X { 1, 1}. From this, we see that { 1, 1} is the complement of 2 3 p. But we said the complement has to be open, and { 1, 1} is not open because it is not bi-infinite. This is a contradiction. We conclude, then, that the number of prime numbers is not finite but is indeed infinite. 5
Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012)
Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Michael Tagare De Guzman January 31, 2012 4A. The Sorgenfrey Line The following material concerns the Sorgenfrey line, E, introduced in
More informationTHREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.
THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of
More informationLecture : Topological Space
Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous
More information= [ U 1 \ U 2 = B \ [ B \ B.
5. Mon, Sept. 8 At the end of class on Friday, we introduced the notion of a topology, and I asked you to think about how many possible topologies there are on a 3-element set. The answer is... 29. The
More information2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to
2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to be connected if it is not disconnected. A subset of
More informationMATH 54 - LECTURE 4 DAN CRYTSER
MATH 54 - LECTURE 4 DAN CRYTSER Introduction In this lecture we review properties and examples of bases and subbases. Then we consider ordered sets and the natural order topology that one can lay on an
More informationFinal Test in MAT 410: Introduction to Topology Answers to the Test Questions
Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Stefan Kohl Question 1: Give the definition of a topological space. (3 credits) A topological space (X, τ) is a pair consisting
More informationLectures on Order and Topology
Lectures on Order and Topology Antonino Salibra 17 November 2014 1 Topology: main definitions and notation Definition 1.1 A topological space X is a pair X = ( X, OX) where X is a nonempty set and OX is
More informationChapter 1. Preliminaries
Chapter 1 Preliminaries 1.1 Topological spaces 1.1.1 The notion of topological space The topology on a set X is usually defined by specifying its open subsets of X. However, in dealing with topological
More informationTOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.
TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3. 301. Definition. Let m be a positive integer, and let X be a set. An m-tuple of elements of X is a function x : {1,..., m} X. We sometimes use x i instead
More informationHomework Set #2 Math 440 Topology Topology by J. Munkres
Homework Set #2 Math 440 Topology Topology by J. Munkres Clayton J. Lungstrum October 26, 2012 Exercise 1. Prove that a topological space X is Hausdorff if and only if the diagonal = {(x, x) : x X} is
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationChapter 11. Topological Spaces: General Properties
11.1. Open Sets, Closed Sets, Bases, and Subbases 1 Chapter 11. Topological Spaces: General Properties Section 11.1. Open Sets, Closed Sets, Bases, and Subbases Note. In this section, we define a topological
More informationEDAA40 At home exercises 1
EDAA40 At home exercises 1 1. Given, with as always the natural numbers starting at 1, let us define the following sets (with iff ): Give the number of elements in these sets as follows: 1. 23 2. 6 3.
More informationOn Soft Topological Linear Spaces
Republic of Iraq Ministry of Higher Education and Scientific Research University of AL-Qadisiyah College of Computer Science and Formation Technology Department of Mathematics On Soft Topological Linear
More informationTopology - I. Michael Shulman WOMP 2004
Topology - I Michael Shulman WOMP 2004 1 Topological Spaces There are many different ways to define a topological space; the most common one is as follows: Definition 1.1 A topological space (often just
More informationA Little Point Set Topology
A Little Point Set Topology A topological space is a generalization of a metric space that allows one to talk about limits, convergence, continuity and so on without requiring the concept of a distance
More informationOpen and Closed Sets
Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationMetric and metrizable spaces
Metric and metrizable spaces These notes discuss the same topic as Sections 20 and 2 of Munkres book; some notions (Symmetric, -metric, Ψ-spaces...) are not discussed in Munkres book.. Symmetric, -metric,
More informationNOTES ON GENERAL TOPOLOGY
NOTES ON GENERAL TOPOLOGY PETE L. CLARK 1. The notion of a topological space Part of the rigorization of analysis in the 19th century was the realization that notions like convergence of sequences and
More informationLecture-12: Closed Sets
and Its Examples Properties of Lecture-12: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Introduction and Its Examples Properties of 1 Introduction
More information2. Metric and Topological Spaces
2 Metric and Topological Spaces Topology begins where sets are implemented with some cohesive properties enabling one to define continuity Solomon Lefschetz In order to forge a language of continuity,
More informationMA651 Topology. Lecture 4. Topological spaces 2
MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter
More informationLecture - 8A: Subbasis of Topology
Lecture - 8A: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline 1 Introduction 2 3 4 Introduction I As we know that topology generated by a basis B may
More informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
More informationChapter 2 Topological Spaces and Continuity
Chapter 2 Topological Spaces and Continuity Starting from metric spaces as they are familiar from elementary calculus, one observes that many properties of metric spaces like the notions of continuity
More informationEXTREME POINTS AND AFFINE EQUIVALENCE
EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard
More informationFinal Exam, F11PE Solutions, Topology, Autumn 2011
Final Exam, F11PE Solutions, Topology, Autumn 2011 Question 1 (i) Given a metric space (X, d), define what it means for a set to be open in the associated metric topology. Solution: A set U X is open if,
More information6th Bay Area Mathematical Olympiad
6th Bay Area Mathematical Olympiad February 4, 004 Problems and Solutions 1 A tiling of the plane with polygons consists of placing the polygons in the plane so that interiors of polygons do not overlap,
More informationMath 395: Topology. Bret Benesh (College of Saint Benedict/Saint John s University)
Math 395: Topology Bret Benesh (College of Saint Benedict/Saint John s University) October 30, 2012 ii Contents Acknowledgments v 1 Topological Spaces 1 2 Closed sets and Hausdorff spaces 7 iii iv CONTENTS
More informationTopology notes. Basic Definitions and Properties.
Topology notes. Basic Definitions and Properties. Intuitively, a topological space consists of a set of points and a collection of special sets called open sets that provide information on how these points
More informationM3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements.
M3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements. Chapter 1: Metric spaces and convergence. (1.1) Recall the standard distance function
More informationLecture IV - Further preliminaries from general topology:
Lecture IV - Further preliminaries from general topology: We now begin with some preliminaries from general topology that is usually not covered or else is often perfunctorily treated in elementary courses
More informationDischarging and reducible configurations
Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs
More informationGenerell Topologi. Richard Williamson. May 6, 2013
Generell Topologi Richard Williamson May 6, 2013 1 8 Thursday 7th February 8.1 Using connectedness to distinguish between topological spaces I Proposition 8.1. Let (, O ) and (Y, O Y ) be topological spaces.
More informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationComparing sizes of sets
Comparing sizes of sets Sets A and B are the same size if there is a bijection from A to B. (That was a definition!) For finite sets A, B, it is not difficult to verify that there is a bijection from A
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationLecture 11 COVERING SPACES
Lecture 11 COVERING SPACES A covering space (or covering) is not a space, but a mapping of spaces (usually manifolds) which, locally, is a homeomorphism, but globally may be quite complicated. The simplest
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More informationReal Analysis, 2nd Edition, G.B.Folland
Real Analysis, 2nd Edition, G.B.Folland Chapter 4 Point Set Topology Yung-Hsiang Huang 4.1 Topological Spaces 1. If card(x) 2, there is a topology on X that is T 0 but not T 1. 2. If X is an infinite set,
More informationUNM - PNM STATEWIDE MATHEMATICS CONTEST XLI. February 7, 2009 Second Round Three Hours
UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI February 7, 009 Second Round Three Hours (1) An equilateral triangle is inscribed in a circle which is circumscribed by a square. This square is inscribed in
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationT. Background material: Topology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 T. Background material: Topology For convenience this is an overview of basic topological ideas which will be used in the course. This material
More informationarxiv: v2 [math.co] 13 Aug 2013
Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed
More information4 Basis, Subbasis, Subspace
4 Basis, Subbasis, Subspace Our main goal in this chapter is to develop some tools that make it easier to construct examples of topological spaces. By Definition 3.12 in order to define a topology on a
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationReview of Sets. Review. Philippe B. Laval. Current Semester. Kennesaw State University. Philippe B. Laval (KSU) Sets Current Semester 1 / 16
Review of Sets Review Philippe B. Laval Kennesaw State University Current Semester Philippe B. Laval (KSU) Sets Current Semester 1 / 16 Outline 1 Introduction 2 Definitions, Notations and Examples 3 Special
More information2 A topological interlude
2 A topological interlude 2.1 Topological spaces Recall that a topological space is a set X with a topology: a collection T of subsets of X, known as open sets, such that and X are open, and finite intersections
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationINTRODUCTION TO TOPOLOGY
INTRODUCTION TO TOPOLOGY MARTINA ROVELLI These notes are an outline of the topics covered in class, and are not substitutive of the lectures, where (most) proofs are provided and examples are discussed
More informationTopology problem set Integration workshop 2010
Topology problem set Integration workshop 2010 July 28, 2010 1 Topological spaces and Continuous functions 1.1 If T 1 and T 2 are two topologies on X, show that (X, T 1 T 2 ) is also a topological space.
More information2017 SOLUTIONS (PRELIMINARY VERSION)
SIMON MARAIS MATHEMATICS COMPETITION 07 SOLUTIONS (PRELIMINARY VERSION) This document will be updated to include alternative solutions provided by contestants, after the competition has been mared. Problem
More informationCONNECTED SPACES AND HOW TO USE THEM
CONNECTED SPACES AND HOW TO USE THEM 1. How to prove X is connected Checking that a space X is NOT connected is typically easy: you just have to find two disjoint, non-empty subsets A and B in X, such
More informationModule 11. Directed Graphs. Contents
Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................
More information2 Geometry Solutions
2 Geometry Solutions jacques@ucsd.edu Here is give problems and solutions in increasing order of difficulty. 2.1 Easier problems Problem 1. What is the minimum number of hyperplanar slices to make a d-dimensional
More informationThis article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the author s benefit and for the benefit of the author s institution, for non-commercial
More informationSimplicial Complexes: Second Lecture
Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,
More informationHW Graph Theory SOLUTIONS (hbovik)
Diestel 1.3: Let G be a graph containing a cycle C, and assume that G contains a path P of length at least k between two vertices of C. Show that G contains a cycle of length at least k. If C has length
More informationElementary Topology. Note: This problem list was written primarily by Phil Bowers and John Bryant. It has been edited by a few others along the way.
Elementary Topology Note: This problem list was written primarily by Phil Bowers and John Bryant. It has been edited by a few others along the way. Definition. properties: (i) T and X T, A topology on
More informationInterleaving Schemes on Circulant Graphs with Two Offsets
Interleaving Schemes on Circulant raphs with Two Offsets Aleksandrs Slivkins Department of Computer Science Cornell University Ithaca, NY 14853 slivkins@cs.cornell.edu Jehoshua Bruck Department of Electrical
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationBounded subsets of topological vector spaces
Chapter 2 Bounded subsets of topological vector spaces In this chapter we will study the notion of bounded set in any t.v.s. and analyzing some properties which will be useful in the following and especially
More informationUniform edge-c-colorings of the Archimedean Tilings
Discrete & Computational Geometry manuscript No. (will be inserted by the editor) Uniform edge-c-colorings of the Archimedean Tilings Laura Asaro John Hyde Melanie Jensen Casey Mann Tyler Schroeder Received:
More informationCS3102 Theory of Computation Problem Set 2, Spring 2011 Department of Computer Science, University of Virginia
CS3102 Theory of Computation Problem Set 2, Spring 2011 Department of Computer Science, University of Virginia Gabriel Robins Please start solving these problems immediately, and work in study groups.
More informationRecognizing Interval Bigraphs by Forbidden Patterns
Recognizing Interval Bigraphs by Forbidden Patterns Arash Rafiey Simon Fraser University, Vancouver, Canada, and Indiana State University, IN, USA arashr@sfu.ca, arash.rafiey@indstate.edu Abstract Let
More informationand this equivalence extends to the structures of the spaces.
Homeomorphisms. A homeomorphism between two topological spaces (X, T X ) and (Y, T Y ) is a one - one correspondence such that f and f 1 are both continuous. Consequently, for every U T X there is V T
More informationMATH 54 - LECTURE 10
MATH 54 - LECTURE 10 DAN CRYTSER The Universal Mapping Property First we note that each of the projection mappings π i : j X j X i is continuous when i X i is given the product topology (also if the product
More informationON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More informationOn vertex types of graphs
On vertex types of graphs arxiv:1705.09540v1 [math.co] 26 May 2017 Pu Qiao, Xingzhi Zhan Department of Mathematics, East China Normal University, Shanghai 200241, China Abstract The vertices of a graph
More informationThe Cut Locus and the Jordan Curve Theorem
The Cut Locus and the Jordan Curve Theorem Rich Schwartz November 19, 2015 1 Introduction A Jordan curve is a subset of R 2 which is homeomorphic to the circle, S 1. The famous Jordan Curve Theorem says
More informationBEHIND THE INTUITION OF TILINGS
BEHIND THE INTUITION OF TILINGS EUGENIA FUCHS Abstract. It may seem visually intuitive that certain sets of tiles can be used to cover the entire plane without gaps or overlaps. However, it is often much
More informationNotes on Topology. Andrew Forrester January 28, Notation 1. 2 The Big Picture 1
Notes on Topology Andrew Forrester January 28, 2009 Contents 1 Notation 1 2 The Big Picture 1 3 Fundamental Concepts 2 4 Topological Spaces and Topologies 2 4.1 Topological Spaces.........................................
More informationor else take their intersection. Now define
Samuel Lee Algebraic Topology Homework #5 May 10, 2016 Problem 1: ( 1.3: #3). Let p : X X be a covering space with p 1 (x) finite and nonempty for all x X. Show that X is compact Hausdorff if and only
More information9 About Intersection Graphs
9 About Intersection Graphs Since this lecture we focus on selected detailed topics in Graph theory that are close to your teacher s heart... The first selected topic is that of intersection graphs, i.e.
More informationIntroduction to Algebraic and Geometric Topology Week 5
Introduction to Algebraic and Geometric Topology Week 5 Domingo Toledo University of Utah Fall 2017 Topology of Metric Spaces I (X, d) metric space. I Recall the definition of Open sets: Definition U
More information4. Definition: topological space, open set, topology, trivial topology, discrete topology.
Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.
More informationDigital Jordan Curve Theorems
Digital Jordan Curve Theorems Christer O. Kiselman Uppsala University, Department of Mathematics P. O. Box 480, SE-751 06 Uppsala, Sweden kiselman@math.uu.se http://www.math.uu.se/~kiselman Abstract. Efim
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationCardinality of Sets. Washington University Math Circle 10/30/2016
Cardinality of Sets Washington University Math Circle 0/0/06 The cardinality of a finite set A is just the number of elements of A, denoted by A. For example, A = {a, b, c, d}, B = {n Z : n } = {,,, 0,,,
More informationPoint-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS
Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following
More informationManifolds. Chapter X. 44. Locally Euclidean Spaces
Chapter X Manifolds 44. Locally Euclidean Spaces 44 1. Definition of Locally Euclidean Space Let n be a non-negative integer. A topological space X is called a locally Euclidean space of dimension n if
More informationOn the packing chromatic number of some lattices
On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department
More informationIntroduction to Rational Billiards II. Talk by John Smillie. August 21, 2007
Introduction to Rational Billiards II Talk by John Smillie August 21, 2007 Translation surfaces and their singularities Last time we described the Zemlyakov-Katok construction for billiards on a triangular
More informationarxiv: v1 [math.gt] 16 Aug 2016
THE GROMOV BOUNDARY OF THE RAY GRAPH JULIETTE BAVARD AND ALDEN WALKER arxiv:1608.04475v1 [math.gt] 16 Aug 2016 Abstract. The ray graph is a Gromov-hyperbolic graph on which the mapping class group of the
More informationProblem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009
Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.
More informationComputational Geometry
Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly
More informationA step towards the Bermond-Thomassen conjecture about disjoint cycles in digraphs
A step towards the Bermond-Thomassen conjecture about disjoint cycles in digraphs Nicolas Lichiardopol Attila Pór Jean-Sébastien Sereni Abstract In 1981, Bermond and Thomassen conjectured that every digraph
More informationNotes on metric spaces and topology. Math 309: Topics in geometry. Dale Rolfsen. University of British Columbia
Notes on metric spaces and topology Math 309: Topics in geometry Dale Rolfsen University of British Columbia Let X be a set; we ll generally refer to its elements as points. A distance function, or metric
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #9 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 14: Set Theory: Definitions and Properties 1. Let C = {n Z n = 6r 5 for
More information[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra
Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph
More informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More informationA Communications Network???
A Communications Network??? A Communications Network What are the desirable properties of the switching box? 1. Every two users must be connected at a switch. 2. Every switch must "look alike". 3. The
More informationA NOTE ON BLOCKING VISIBILITY BETWEEN POINTS
A NOTE ON BLOCKING VISIBILITY BETWEEN POINTS Adrian Dumitrescu János Pach Géza Tóth Abstract Given a finite point set P in the plane, let b(p) be the smallest number of points q 1,q 2,... not belonging
More informationI-CONTINUITY IN TOPOLOGICAL SPACES. Martin Sleziak
I-CONTINUITY IN TOPOLOGICAL SPACES Martin Sleziak Abstract. In this paper we generalize the notion of I-continuity, which was defined in [1] for real functions, to maps on topological spaces. We study
More informationMath 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)
Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.
More informationLecture Notes on Graph Theory
Lecture Notes on Graph Theory Vadim Lozin 1 Introductory concepts A graph G = (V, E) consists of two finite sets V and E. The elements of V are called the vertices and the elements of E the edges of G.
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More information