DOCSLIB.ORG

Algebraic Topology M382C

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algebraic Topology M382C Algebraic Topology M382C Michael Starbird Fall 2007 2 Contents 1 Introduction 5 1.1 Basic Examples . 5 1.2 Simplices . 6 1.3 Simplicial Complexes . 7 1.4 2-manifolds . 9 1.4.1 2-manifolds as simplicial complexes . 11 1.4.2 2-manifolds as quotient spaces . 14 1.5 Questions . 17 2 2-manifolds 19 2.1 Classification of 2-manifolds . 19 2.1.1 Classification Proof I . 20 2.1.2 Classification Proof II . 23 2.2 PL Homeomorphism . 27 2.3 Invariants . 28 2.3.1 Euler characteristic . 28 2.3.2 Orientability . 29 2.4 CW complexes . 35 2.5 2-manifolds with boundary . 38 2.6 *Non-compact surfaces . 42 3 Fundamental group and covering spaces 49 3.1 Fundamental group . 50 3.1.1 Cartesian products . 56 3.1.2 Induced homomorphisms . 57 3.2 Retractions and fixed points . 58 3.3 Van Kampen's Theorem, I . 60 3.3.1 Van Kampen's Theorem: simply connected intersec- tion case . 61 3 4 CONTENTS 3.3.2 Van Kampen's Theorem: simply connected pieces case 63 3.4 Fundamental groups of surfaces . 63 3.5 Van Kampen's Theorem, II . 66 3.6 3-manifolds . 67 3.6.1 Lens spaces . 67 3 3.6.2 Knots in S ........................ 69 3.7 Homotopy equivalence of spaces . 72 3.8 Higher homotopy groups . 73 3.9 Covering spaces . 75 3.10 Theorems about groups . 82 4 Homology 83 4.1 Z2 homology . 84 4.1.1 Simplicial Z2 homology . 85 4.1.2 CW Z2-homology . 86 4.2 Homology from parts, special cases . 91 4.3 Chain groups and induced homomorphisms . 93 4.4 Applications of Z2 homology . 96 4.5 Z2 Mayer-Vietoris Theorem . 97 4.6 Introduction to simplicial Z-homology . 100 4.6.1 Chains, boundaries, and definition of simplicial Z- homology . 100 4.7 Chain groups and induced homomorphisms . 105 4.8 Relationship between fundamental group and first homology . 106 4.9 Mayer-Vietoris Theorem . 107 A Review of Point-Set Topology 111 B Review of Group Theory 117 C Review of Graph Theory 125 D The Jordan Curve Theorem 127 Chapter 1 Introduction Abstracting and generalizing essential features of familiar objects often lead to the development of important mathematical ideas. One goal of geomet- rical analysis is to describe the relationships and features that make up the essential qualities of what we perceive as our physical world. The strategy is to find ideas that we view as central and then to generalize those ideas and to explore those more abstract extensions of what we perceive directly. Much of topology is aimed at exploring abstract versions of geometrical objects in our world. The concept of geometrical abstraction dates back at least to the time of Euclid (c. 225 B.C.E.) The most famous and basic spaces are named for him, the Euclidean spaces. All of the objects that we will study in this course will be subsets of the Euclidean spaces. 1.1 Basic Examples n n Definition ( R ). We define real or Euclidean n-space, denoted by R , as the set n R := f(x1; x2; : : : ; xn)jxi 2 R for i = 1; : : : ; ng: n We begin by looking at some basic subspaces of R . n Definition (standard n-disk). The n-dimensional disk, denoted D is de- fined as n n D := f(x1; : : : ; xn) 2 R j0 ≤ xi ≤ 1 for i = 1; : : : ; n g n times ∼ z }| { n = [0; 1] × [0; 1] × · · · × [0; 1] ⊂ R : 5 6 CHAPTER 1. INTRODUCTION 1 1 For example, D = [0; 1]. D is also called the unit interval, sometimes denoted by I. Definition (standard n-ball, standard n-cell). The n-dimensional ball or n cell, denoted B , is defined as: n n 2 2 B := f(x1; : : : ; xn) 2 R jx1 + ::: + xn ≤ 1g: Fact 1.1. The standard n-ball and the standard n-disk are compact and homeomorphic. n Definition (standard n-sphere). The n-dimensional sphere, denoted S , is defined as n n+1 2 2 S := f(x0; : : : ; xn) 2 R jx0 + ::: + xn = 1g: n+1 n Note. Bd B = S As usual, the term n-sphere will apply to any space homeomorphic to the standard n-sphere. 0 1 2 Question 1.2. Describe S , S , and S . Are they homeomorphic? If not, are there any properties that would help you distinguish between them? 1.2 Simplices n One class of spaces in R we will be studying will be manifolds or k- k manifolds, which are made up of pieces that locally look like R , put to- gether in a \nice" way. In particular, we will be studying manifolds that use triangles (or their higher-dimensional equivalents) as the basic building blocks. n Since k-dimensional \triangles" in R (called simplices) are the basic building blocks we will be using, we begin by giving a vector description of them. n Definition (1-simplex). Let v0, v1 be two points in R . If we consider v0 1 and v1 as vectors from the origin, then σ = fµv1 + (1 − µ)v0 j 0 ≤ µ ≤ 1g 1 is the straight line segment between v0 and v1. σ can be denoted by fv0v1g 1 or fv1v0g (the order the vertices are listed in doesn't matter). The set σ is called a 1-simplex or edge with vertices (or 0-simplices) v0 and v1. 1.3. SIMPLICIAL COMPLEXES 7 Definition (2-simplex). Let v0, v1, and v2 be three non-collinear points in n R . Then 2 σ = fλ0v0 + λ1v1 + λ2v2 j λ0 + λ1 + λ2 = 1 and 0 ≤ λi ≤ 18i = 0; 1; 2g is a triangle with edges fv0v1g, fv1v2g, fv0v2g and vertices v0, v1, and v2. 2 The set σ is a 2-simplex with vertices v0, v1, and v2 and edges fv0v1g, 2 fv1v2g, and fv0v2g. fv0v2v2g denotes the 2-simplex σ (where the order the vertices are listed in doesn't matter). Note that the plural of simplex is simplices. Definition (n-simplex and face of a simplex). Let fv0; v2; : : : ; vng be a set N n affine independent points in R . Then an n-simplex σ (of dimension n), N denoted fv0v1v2 : : : vng, is defined to be the following subset of R : ( ) n n X σ = λ0v0 + λ1v1 + ::: + λnvn λi = 1 ; 0 ≤ λi ≤ 1; i = 0; 1; 2; : : : ; n : i=0 An i-simplex whose vertices are any subset of i+1 of the vertices of σn is an n (i-dimensional) face of σ . The face obtained by deleting the vm vertex from n the list of vertices of σ is often denoted by fv0v1v2 ::: vcm : : : vng. (Note that it is an (n − 1)-simplex.) Exercise 1.3. Show that the faces of a simplex are indeed simplices. Fact 1.4. The standard n-ball, standard n-disk and the standard n-simplex are compact and homeomorphic. We will use the terms n-disk, n-cell, n-ball interchangeably to refer to any topological space homeomorphic to the standard n-ball. 1.3 Simplicial Complexes n Simplices can be assembled to create polyhedral subsets of R known as complexes. These simplicial complexes are the principal objects of study for this course. Definition (finite simplicial complex). Let T be a finite collection of sim- n j j plices in R such that for every simplex σi in T , each face of σi is also a simplex in T and any two simplices in T are either disjoint or their inter- n S j section is a face of each. Then the subset K of R defined by K = σi 8 CHAPTER 1. INTRODUCTION j running over all simplices σi in T is a finite simplicial complex with trian- gulation T , denoted (K; T ). The set K is often called the underlying space of the simplicial complex. If n is the maximum dimension of all simplices in T , then we say (K; T ) is of dimension n. Example 1. Consider (K; T ) to be the simplicial complex in the plane where T = f f(0; 0)(0; 1)(1; 0)g; f(0; 0)(0; −1)g; f(0; −1)(1; 0)g; f(0; 0)(0; 1)g; f(0; 1)(1; 0)g; f(1; 0)(0; 0)g; f(0; 0)g; f(0; 1)g; f(1; 0)g; f(0; −1)gg : So K is a filled in triangle and a hollow triangle as pictured. (0,1) (0,0) (1,0) (0,−1) Exercise 1.5. Draw a space made of triangles that is not a simplicial com- plex, and explain why it is not a simplicial complex. We have started by making spaces using simplices as building blocks. But what if we have a space, and we want to break it up into simplices? If J is a topological space homeomorphic to K where K is a the underlying space m of a simplicial complex (K; T ) in R , then we say that J is triangulable. Exercise 1.6. Show that the following space is triangulable: by giving a triangulation of the space. 1.4. 2-MANIFOLDS 9 Definition (subdivision). Let (K; T ) be a finite simplicial complex. Then T 0 is a subdivision of T if (K; T 0) is a finite simplicial complex, and each simplex in T 0 is a subset of a simplex in T. Example 2. The following picture illustrates a finite simplicial complex and a subdivision of it. (K,T) (K,T') There is a standard subdivision of a triangulation that later will be useful: Definition (derived subdivision).
Load more

Recommended publications
  • Note on 6-Regular Graphs on the Klein Bottle Michiko Kasai [email protected]
    Theory and Applications of Graphs Volume 4 | Issue 1 Article 5 2017 Note On 6-regular Graphs On The Klein Bottle Michiko Kasai [email protected] Naoki Matsumoto Seikei University, [email protected] Atsuhiro Nakamoto Yokohama National University, [email protected] Takayuki Nozawa [email protected] Hiroki Seno [email protected] See next page for additional authors Follow this and additional works at: https://digitalcommons.georgiasouthern.edu/tag Part of the Discrete Mathematics and Combinatorics Commons Recommended Citation Kasai, Michiko; Matsumoto, Naoki; Nakamoto, Atsuhiro; Nozawa, Takayuki; Seno, Hiroki; and Takiguchi, Yosuke (2017) "Note On 6-regular Graphs On The Klein Bottle," Theory and Applications of Graphs: Vol. 4 : Iss. 1 , Article 5. DOI: 10.20429/tag.2017.040105 Available at: https://digitalcommons.georgiasouthern.edu/tag/vol4/iss1/5 This article is brought to you for free and open access by the Journals at Digital Commons@Georgia Southern. It has been accepted for inclusion in Theory and Applications of Graphs by an authorized administrator of Digital Commons@Georgia Southern. For more information, please contact [email protected]. Note On 6-regular Graphs On The Klein Bottle Authors Michiko Kasai, Naoki Matsumoto, Atsuhiro Nakamoto, Takayuki Nozawa, Hiroki Seno, and Yosuke Takiguchi This article is available in Theory and Applications of Graphs: https://digitalcommons.georgiasouthern.edu/tag/vol4/iss1/5 Kasai et al.: 6-regular graphs on the Klein bottle Abstract Altshuler [1] classified 6-regular graphs on the torus, but Thomassen [11] and Negami [7] gave different classifications for 6-regular graphs on the Klein bottle. In this note, we unify those two classifications, pointing out their difference and similarity.
    [Show full text]
  • An Introduction to Topology the Classification Theorem for Surfaces by E
    An Introduction to Topology An Introduction to Topology The Classification theorem for Surfaces By E. C. Zeeman Introduction. The classification theorem is a beautiful example of geometric topology. Although it was discovered in the last century*, yet it manages to convey the spirit of present day research. The proof that we give here is elementary, and its is hoped more intuitive than that found in most textbooks, but in none the less rigorous. It is designed for readers who have never done any topology before. It is the sort of mathematics that could be taught in schools both to foster geometric intuition, and to counteract the present day alarming tendency to drop geometry. It is profound, and yet preserves a sense of fun. In Appendix 1 we explain how a deeper result can be proved if one has available the more sophisticated tools of analytic topology and algebraic topology. Examples. Before starting the theorem let us look at a few examples of surfaces. In any branch of mathematics it is always a good thing to start with examples, because they are the source of our intuition. All the following pictures are of surfaces in 3-dimensions. In example 1 by the word “sphere” we mean just the surface of the sphere, and not the inside. In fact in all the examples we mean just the surface and not the solid inside. 1. Sphere. 2. Torus (or inner tube). 3. Knotted torus. 4. Sphere with knotted torus bored through it. * Zeeman wrote this article in the mid-twentieth century. 1 An Introduction to Topology 5.
    [Show full text]
  • Geometric Algorithms
    Geometric Algorithms primitive operations convex hull closest pair voronoi diagram References: Algorithms in C (2nd edition), Chapters 24-25 http://www.cs.princeton.edu/introalgsds/71primitives http://www.cs.princeton.edu/introalgsds/72hull 1 Geometric Algorithms Applications. • Data mining. • VLSI design. • Computer vision. • Mathematical models. • Astronomical simulation. • Geographic information systems. airflow around an aircraft wing • Computer graphics (movies, games, virtual reality). • Models of physical world (maps, architecture, medical imaging). Reference: http://www.ics.uci.edu/~eppstein/geom.html History. • Ancient mathematical foundations. • Most geometric algorithms less than 25 years old. 2 primitive operations convex hull closest pair voronoi diagram 3 Geometric Primitives Point: two numbers (x, y). any line not through origin Line: two numbers a and b [ax + by = 1] Line segment: two points. Polygon: sequence of points. Primitive operations. • Is a point inside a polygon? • Compare slopes of two lines. • Distance between two points. • Do two line segments intersect? Given three points p , p , p , is p -p -p a counterclockwise turn? • 1 2 3 1 2 3 Other geometric shapes. • Triangle, rectangle, circle, sphere, cone, … • 3D and higher dimensions sometimes more complicated. 4 Intuition Warning: intuition may be misleading. • Humans have spatial intuition in 2D and 3D. • Computers do not. • Neither has good intuition in higher dimensions! Is a given polygon simple? no crossings 1 6 5 8 7 2 7 8 6 4 2 1 1 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 2 18 4 18 4 19 4 19 4 20 3 20 3 20 1 10 3 7 2 8 8 3 4 6 5 15 1 11 3 14 2 16 we think of this algorithm sees this 5 Polygon Inside, Outside Jordan curve theorem.
    [Show full text]
  • Categories of Sets with a Group Action
    Categories of sets with a group action Bachelor Thesis of Joris Weimar under supervision of Professor S.J. Edixhoven Mathematisch Instituut, Universiteit Leiden Leiden, 13 June 2008 Contents 1 Introduction 1 1.1 Abstract . .1 1.2 Working method . .1 1.2.1 Notation . .1 2 Categories 3 2.1 Basics . .3 2.1.1 Functors . .4 2.1.2 Natural transformations . .5 2.2 Categorical constructions . .6 2.2.1 Products and coproducts . .6 2.2.2 Fibered products and fibered coproducts . .9 3 An equivalence of categories 13 3.1 G-sets . 13 3.2 Covering spaces . 15 3.2.1 The fundamental group . 15 3.2.2 Covering spaces and the homotopy lifting property . 16 3.2.3 Induced homomorphisms . 18 3.2.4 Classifying covering spaces through the fundamental group . 19 3.3 The equivalence . 24 3.3.1 The functors . 25 4 Applications and examples 31 4.1 Automorphisms and recovering the fundamental group . 31 4.2 The Seifert-van Kampen theorem . 32 4.2.1 The categories C1, C2, and πP -Set ................... 33 4.2.2 The functors . 34 4.2.3 Example . 36 Bibliography 38 Index 40 iii 1 Introduction 1.1 Abstract In the 40s, Mac Lane and Eilenberg introduced categories. Although by some referred to as abstract nonsense, the idea of categories allows one to talk about mathematical objects and their relationions in a general setting. Its origins lie in the field of algebraic topology, one of the topics that will be explored in this thesis. First, a concise introduction to categories will be given.
    [Show full text]
  • 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.
    [Show full text]
  • Pro-Covering Fibrations of the Hawaiian Earring
    Brigham Young University BYU ScholarsArchive Theses and Dissertations 2014-12-01 Pro-Covering Fibrations of the Hawaiian Earring Nickolas Brenten Callor Brigham Young University - Provo Follow this and additional works at: https://scholarsarchive.byu.edu/etd Part of the Mathematics Commons BYU ScholarsArchive Citation Callor, Nickolas Brenten, "Pro-Covering Fibrations of the Hawaiian Earring" (2014). Theses and Dissertations. 4324. https://scholarsarchive.byu.edu/etd/4324 This Thesis is brought to you for free and open access by BYU ScholarsArchive. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of BYU ScholarsArchive. For more information, please contact [email protected], [email protected]. Pro-Covering Fibrations of the Hawaiian Earring Nickolas B. Callor A thesis submitted to the faculty of Brigham Young University in partial fulfillment of the requirements for the degree of Master of Science Greg Conner, Chair Jessica Purcell Eric Swenson Department of Mathematics Brigham Young University December 2014 Copyright c 2014 Nickolas B. Callor All Rights Reserved abstract Pro-Covering Fibrations of the Hawaiian Earring Nickolas B. Callor Department of Mathematics, BYU Master of Science Let H be the Hawaiian Earring, and let H denote its fundamental group. Assume (Bi) is an inverse system of bouquets of circles whose inverse limit is H. We give an explicit bijection between finite normal covering spaces of H and finite normal covering spaces of Bi. This bijection induces a correspondence between a certain family of inverse sequences of these covering spaces. The correspondence preserves the inverse limit of these sequences, thus offering two methods of constructing the same limit.
    [Show full text]
  • Graphs on Surfaces, the Generalized Euler's Formula and The
    Graphs on surfaces, the generalized Euler's formula and the classification theorem ZdenˇekDvoˇr´ak October 28, 2020 In this lecture, we allow the graphs to have loops and parallel edges. In addition to the plane (or the sphere), we can draw the graphs on the surface of the torus or on more complicated surfaces. Definition 1. A surface is a compact connected 2-dimensional manifold with- out boundary. Intuitive explanation: • 2-dimensional manifold without boundary: Each point has a neighbor- hood homeomorphic to an open disk, i.e., \locally, the surface looks at every point the same as the plane." • compact: \The surface can be covered by a finite number of such neigh- borhoods." • connected: \The surface has just one piece." Examples: • The sphere and the torus are surfaces. • The plane is not a surface, since it is not compact. • The closed disk is not a surface, since it has a boundary. From the combinatorial perspective, it does not make sense to distinguish between some of the surfaces; the same graphs can be drawn on the torus and on a deformed torus (e.g., a coffee mug with a handle). For us, two surfaces will be equivalent if they only differ by a homeomorphism; a function f :Σ1 ! Σ2 between two surfaces is a homeomorphism if f is a bijection, continuous, and the inverse f −1 is continuous as well. In particular, this 1 implies that f maps simple continuous curves to simple continuous curves, and thus it maps a drawing of a graph in Σ1 to a drawing of the same graph in Σ2.
    [Show full text]
  • Some Notes About Simplicial Complexes and Homology II
    Some notes about simplicial complexes and homology II J´onathanHeras J. Heras Some notes about simplicial homology II 1/19 Table of Contents 1 Simplicial Complexes 2 Chain Complexes 3 Differential matrices 4 Computing homology groups from Smith Normal Form J. Heras Some notes about simplicial homology II 2/19 Simplicial Complexes Table of Contents 1 Simplicial Complexes 2 Chain Complexes 3 Differential matrices 4 Computing homology groups from Smith Normal Form J. Heras Some notes about simplicial homology II 3/19 Simplicial Complexes Simplicial Complexes Definition Let V be an ordered set, called the vertex set. A simplex over V is any finite subset of V . Definition Let α and β be simplices over V , we say α is a face of β if α is a subset of β. Definition An ordered (abstract) simplicial complex over V is a set of simplices K over V satisfying the property: 8α 2 K; if β ⊆ α ) β 2 K Let K be a simplicial complex. Then the set Sn(K) of n-simplices of K is the set made of the simplices of cardinality n + 1. J. Heras Some notes about simplicial homology II 4/19 Simplicial Complexes Simplicial Complexes 2 5 3 4 0 6 1 V = (0; 1; 2; 3; 4; 5; 6) K = f;; (0); (1); (2); (3); (4); (5); (6); (0; 1); (0; 2); (0; 3); (1; 2); (1; 3); (2; 3); (3; 4); (4; 5); (4; 6); (5; 6); (0; 1; 2); (4; 5; 6)g J. Heras Some notes about simplicial homology II 5/19 Chain Complexes Table of Contents 1 Simplicial Complexes 2 Chain Complexes 3 Differential matrices 4 Computing homology groups from Smith Normal Form J.
    [Show full text]
  • Fixed Point Theory
    Andrzej Granas James Dugundji Fixed Point Theory With 14 Illustrations %1 Springer Contents Preface vii §0. Introduction 1 1. Fixed Point Spaces 1 2. Forming New Fixed Point Spaces from Old 3 3. Topological Transversality 4 4. Factorization Technique 6 I. Elementary Fixed Point Theorems §1. Results Based on Completeness 9 1. Banach Contraction Principle 9 2. Elementary Domain Invariance 11 3. Continuation Method for Contractive Maps 12 4. Nonlinear Alternative for Contractive Maps 13 5. Extensions of the Banach Theorem 15 6. Miscellaneous Results and Examples 17 7. Notes and Comments 23 §2. Order-Theoretic Results 25 1. The Knaster-Tarski Theorem 25 2. Order and Completeness. Theorem of Bishop-Phelps 26 3. Fixed Points for Set-Valued Contractive Maps 28 4. Applications to Geometry of Banach Spaces 29 5. Applications to the Theory of Critical Points 30 6. Miscellaneous Results and Examples 31 7. Notes and Comments 34 X Contents §3. Results Based on Convexity 37 1. KKM-Maps and the Geometric KKM-Principle 37 2. Theorem of von Neumann and Systems of Inequalities 40 3. Fixed Points of Affine Maps. Markoff-Kakutani Theorem 42 4. Fixed Points for Families of Maps. Theorem of Kakutani 44 5. Miscellaneous Results and Examples 46 6. Notes and Comments 48 §4. Further Results and Applications 51 1. Nonexpansive Maps in Hilbert Space 51 2. Applications of the Banach Principle to Integral and Differential Equations 55 3. Applications of the Elementary Domain Invariance 57 4. Elementary KKM-Principle and its Applications 64 5. Theorems of Mazur-Orlicz and Hahn-Banach 70 6.
    [Show full text]
  • Local Homology of Abstract Simplicial Complexes
    Local homology of abstract simplicial complexes Michael Robinson Chris Capraro Cliff Joslyn Emilie Purvine Brenda Praggastis Stephen Ranshous Arun Sathanur May 30, 2018 Abstract This survey describes some useful properties of the local homology of abstract simplicial complexes. Although the existing literature on local homology is somewhat dispersed, it is largely dedicated to the study of manifolds, submanifolds, or samplings thereof. While this is a vital per- spective, the focus of this survey is squarely on the local homology of abstract simplicial complexes. Our motivation comes from the needs of the analysis of hypergraphs and graphs. In addition to presenting many classical facts in a unified way, this survey presents a few new results about how local homology generalizes useful tools from graph theory. The survey ends with a statistical comparison of graph invariants with local homology. Contents 1 Introduction 2 2 Historical discussion 4 3 Theoretical groundwork 6 3.1 Representing data with simplicial complexes . .7 3.2 Relative simplicial homology . .8 3.3 Local homology . .9 arXiv:1805.11547v1 [math.AT] 29 May 2018 4 Local homology of graphs 12 4.1 Basic graph definitions . 14 4.2 Local homology at a vertex . 15 5 Local homology of general complexes 18 5.1 Stratification detection . 19 5.2 Neighborhood filtration . 24 6 Computational considerations 25 1 7 Statistical comparison with graph invariants 26 7.1 Graph invariants used in our comparison . 27 7.2 Comparison methodology . 27 7.3 Dataset description . 28 7.4 The Karate graph . 28 7.5 The Erd}os-R´enyi graph . 30 7.6 The Barabasi-Albert graph .
    [Show full text]
  • DEFINITIONS and THEOREMS in GENERAL TOPOLOGY 1. Basic
    DEFINITIONS AND THEOREMS IN GENERAL TOPOLOGY 1. Basic definitions. A topology on a set X is defined by a family O of subsets of X, the open sets of the topology, satisfying the axioms: (i) ; and X are in O; (ii) the intersection of finitely many sets in O is in O; (iii) arbitrary unions of sets in O are in O. Alternatively, a topology may be defined by the neighborhoods U(p) of an arbitrary point p 2 X, where p 2 U(p) and, in addition: (i) If U1;U2 are neighborhoods of p, there exists U3 neighborhood of p, such that U3 ⊂ U1 \ U2; (ii) If U is a neighborhood of p and q 2 U, there exists a neighborhood V of q so that V ⊂ U. A topology is Hausdorff if any distinct points p 6= q admit disjoint neigh- borhoods. This is almost always assumed. A set C ⊂ X is closed if its complement is open. The closure A¯ of a set A ⊂ X is the intersection of all closed sets containing X. A subset A ⊂ X is dense in X if A¯ = X. A point x 2 X is a cluster point of a subset A ⊂ X if any neighborhood of x contains a point of A distinct from x. If A0 denotes the set of cluster points, then A¯ = A [ A0: A map f : X ! Y of topological spaces is continuous at p 2 X if for any open neighborhood V ⊂ Y of f(p), there exists an open neighborhood U ⊂ X of p so that f(U) ⊂ V .
    [Show full text]
  • INTRODUCTION to ALGEBRAIC TOPOLOGY 1 Category And
    INTRODUCTION TO ALGEBRAIC TOPOLOGY (UPDATED June 2, 2020) SI LI AND YU QIU CONTENTS 1 Category and Functor 2 Fundamental Groupoid 3 Covering and fibration 4 Classification of covering 5 Limit and colimit 6 Seifert-van Kampen Theorem 7 A Convenient category of spaces 8 Group object and Loop space 9 Fiber homotopy and homotopy fiber 10 Exact Puppe sequence 11 Cofibration 12 CW complex 13 Whitehead Theorem and CW Approximation 14 Eilenberg-MacLane Space 15 Singular Homology 16 Exact homology sequence 17 Barycentric Subdivision and Excision 18 Cellular homology 19 Cohomology and Universal Coefficient Theorem 20 Hurewicz Theorem 21 Spectral sequence 22 Eilenberg-Zilber Theorem and Kunneth¨ formula 23 Cup and Cap product 24 Poincare´ duality 25 Lefschetz Fixed Point Theorem 1 1 CATEGORY AND FUNCTOR 1 CATEGORY AND FUNCTOR Category In category theory, we will encounter many presentations in terms of diagrams. Roughly speaking, a diagram is a collection of ‘objects’ denoted by A, B, C, X, Y, ··· , and ‘arrows‘ between them denoted by f , g, ··· , as in the examples f f1 A / B X / Y g g1 f2 h g2 C Z / W We will always have an operation ◦ to compose arrows. The diagram is called commutative if all the composite paths between two objects ultimately compose to give the same arrow. For the above examples, they are commutative if h = g ◦ f f2 ◦ f1 = g2 ◦ g1. Definition 1.1. A category C consists of 1◦. A class of objects: Obj(C) (a category is called small if its objects form a set). We will write both A 2 Obj(C) and A 2 C for an object A in C.
    [Show full text]