Questions and Speculation on Learning and Cohomology, Version 3

Total Page:16

File Type:pdf, Size:1020Kb

Questions and Speculation on Learning and Cohomology, Version 3 Questions and speculation on learning and cohomology, Version 3 Joshua Tan April 23, 2018 Abstract I have tried to formulate a draft of some things I have been thinking at the beginning of my doctorate, in order to be able to get some feedback. Any comments or corrections are more than welcome. In particular, I would be very grateful for concrete (possibly partial) answers, for opinions on whether questions are interesting or not interesting, and for advice on things to read which I am unaware of. I apologize in advance for being too brief and not defining things in many places. I expect to revise this document as I get feedback and learn more. Version 3 will be the last major update to this document, as I focus attention on my doctoral thesis. I am still very interested in obtaining feedback on the ideas expressed here! Contents 1 Introduction 4 1.1 How to read this essay ........................ 4 1.2 Acknowledgements .......................... 5 1.3 Examples of connections between AI and geometry ........ 5 1.4 Examples of questions related to AI ................ 6 1.5 A question ............................... 7 1.6 Reasons for studying cohomology as an AI researcher ....... 7 2 Very brief review of AI 8 2.1 Approach: symbolic methods .................... 8 2.2 The extension to knowledge representation, part I ........ 9 2.3 Approach: statistical inference ................... 13 2.4 Approach: connectionism ...................... 16 2.5 Approach: situated cognition .................... 18 3 Very brief review of algebraic topology 22 3.1 Axiomatics .............................. 24 3.2 The category of spectra ....................... 25 3.3 The derived setting .......................... 28 1 3.4 Model categories ........................... 30 3.5 Brown representability ........................ 32 3.6 A list of topological constructions .................. 34 4 Organizing principles in algebraic geometry 36 4.1 A very brief review of sheaf theory ................. 39 4.2 Good cohomology, part 1 ...................... 46 4.3 A very brief review of sheaf cohomology .............. 51 4.4 Coherent algebraic sheaves ...................... 54 4.5 Serre duality ............................. 56 4.6 Good cohomology, part 2 ...................... 59 4.7 The Weil conjectures ......................... 62 5 Organizing principles in machine learning 67 5.1 A very brief review of computational learning theory ....... 69 5.2 A very brief review of sample compression ............. 72 5.3 A very brief review of AdaBoost .................. 77 5.4 Sheaf cohomology for AdaBoost ................... 87 5.4.1 Background .......................... 89 5.4.2 An analogy .......................... 92 5.4.3 Cohomology .......................... 93 5.4.4 Conjectures .......................... 94 5.5 Sample compression schemes via cubical complexes ........ 98 5.6 Invariant methods for machine learning .............. 99 6 What is a mathematical model? 100 6.1 The extension to knowledge representation, part II ........101 6.2 Interaction and intervention .....................108 6.3 Invariant methods ..........................110 6.3.1 The role of simulation ....................112 6.4 How to begin .............................116 A Sheaf theory for distributed systems 117 B A very brief review of probabilistic programming 118 B.1 Learning in probabilistic programming ...............119 C A very brief review of homotopy type theory 119 C.1 Very brief review of type theory ...................120 C.2 Propositions as (some) types ....................121 C.3 Univalent foundations ........................121 D Topological data analysis 123 D.1 Persistent homology .........................123 D.2 Persistent cohomology ........................125 D.3 Mapper ................................125 D.4 Quantitative homotopy ........................128 2 E TQFT 129 E.1 Very brief review of TQFT .....................129 E.2 A few questions ............................130 E.3 Very brief review of neural networks ................131 F Localization 132 F.1 Analogs of localization ........................133 G Motives 134 G.1 The emergence of sheaf theory ...................135 G.2 The search for a universal cohomology theory ...........135 G.3 A very brief review of SGA .....................137 G.4 Universality ..............................137 G.5 The standard conjectures ......................138 H Very brief review of QBism 139 I Miscellaneous 141 I.1 Homomorphic learning ........................141 I.2 Geometric complexity theory ....................141 I.3 Asynchoronous computation .....................142 3 “For an answer which cannot be expressed, the question too cannot be expressed. The riddle does not exist. If a question can be put at all, then it can also be answered.” – Wittgenstein 1 Introduction The reason for putting artificial intelligence (AI) and geometry together in the first place is due to an intuition I had very early on in 2011 as a student in robotics: what AI needed was a systematic way of putting together logic (in the form of algorithms, proofs, and engineering design) with real-world data, and that the statistical algorithms popular in machine learning comprised only one class of options. Geometry, I hoped, could be another—after all, somehow there was a “logic” embedded in the geometry of space-time called the physical laws. More than the hope for new algorithms, however, I wanted to construct the same sort of mathematical semantics for AI as there exists for the theory of compu- tation. I believed that the field of geometry could give an organizing principle for AI. By organizing principle I mean not just a classification of objects but some means of comparing and combining tools and methods in the discipline. Concretely, I wanted not just a classification of di↵erent mathematical models in AI (from ontologies to dynamical systems to Bayesian networks to simple, Boolean functions) but some means of comparing and combining “learning algo- rithms” meant to construct those models from data. The intuition for applying geometry is supported in part by the success of category theory in combining and composing tools and methods from many di↵erent areas of math, and in part by formal similarities between algebraic geometry and model theory (and now between homotopy theory and type theory) which illustrate how problems posed in logic and computer science could be transposed to cleaner frameworks of geometry, number theory, and category theory. Existing applications also show that such connections can be fruitful, from information geometry to per- sistent homology to geometric complexity to the use of topoi in categorial logic. In any case, AI is a jigsaw puzzle, and I need a way of organizing the pieces. Geometry seems like a good bet. For this to work, first o↵I need to find some non-trivial “isomorphic” struc- tures in AI and in geometry. Given such structures, it should be possible to apply organizing principles in geometry to AI. This hope is the subject of this brief essay. So far there isn’t much understanding, but rather a list of things I would like to understand in the future. 1.1 How to read this essay Sections 1-4 form the core narrative, reviewing developments across AI, algebraic topology, and algebraic geometry. Section 5 contains a few concrete proposals for future work. The lettered sections in the appendix discuss some particu- lar research topics related to geometric intelligence and should be regarded as pointers to further reading. 4 1.2 Acknowledgements I’ve had many interesting discussions in the course of this research. In particular, I would like to thank Samson Abramsky, Bob Coecke, David Spivak, Misha Gromov, Yiannis Vassolopoulos, Mehryar Mohri, Sylvain Cappell, and Brian Scassellati for help in developing some of these ideas. This essay is based on a similar document [52] by Andreas Holmstrom on cohomology theories in arithmetic geometry. 1.3 Examples of connections between AI and geometry To motivate the problem, we list some examples (in no particular order): in- variant methods in computer vision, motion tracking and planning, configu- ration spaces in kinematics, foldable robots and surfaces, grid cell geometry in the hippocampus, di↵erential geometry of neuronal networks, mobile sensor networks, topological measures of complexity, geometric optimization, Herlihy and Shavit’s application of topology to asynchronous computation, informa- tion geometry, topoi in categorial logic, vector logic, homotopy type theory and -groupoid structure of types, topological data analysis, persistent homology, quantitative1 homotopy theory, disconnectivity graphs, Morse theory in neural networks, Conley index theory in noise detection, manifold learning (dimen- sionality reduction) techniques like projection pursuit and Isomap, hierarchical clustering and any number of clustering algorithms on a metric space, topolog- ical clustering methods like Mapper, “partial clustering”, functorial clustering, kernel PCA, one-inclusion graphs for concept classes, cubical complexes and hy- perplane arrangements in sample compression, restricted Boltzmann machines and the renormalization group, herding and discrepancy theory, a variety of optimization scenarios like gradient descent or convex minimization, SVM, any variety of kernel methods, graphical models, k-nearest-neighbor search, random matrices in computational neuroscience, o-minimal theory and real algebraic geometry, sheaf theory for contextuality [1]. Given the interconnected nature of geometry
Recommended publications
  • Double Categories of Open Dynamical Systems (Extended Abstract)
    Double Categories of Open Dynamical Systems (Extended Abstract) David Jaz Myers Johns Hopkins University A (closed) dynamical system is a notion of how things can be, together with a notion of how they may change given how they are. The idea and mathematics of closed dynamical systems has proven incredibly useful in those sciences that can isolate their object of study from its environment. But many changing situations in the world cannot be meaningfully isolated from their environment – a cell will die if it is removed from everything beyond its walls. To study systems that interact with their environment, and to design such systems in a modular way, we need a robust theory of open dynamical systems. In this extended abstract, we put forward a general definition of open dynamical system. We define two general sorts of morphisms between these systems: covariant morphisms which include trajectories, steady states, and periodic orbits; and contravariant morphisms which allow for plugging variables of some systems into parameters of other systems. We define an indexed double category of open dynamical systems indexed by their interface and use a double Grothendieck construction to construct a double category of open dynamical systems. In our main theorem, we construct covariantly representable indexed double functors from the indexed double category of dynamical systems to an indexed double category of spans. This shows that all covariantly representable structures of dynamical systems — including trajectories, steady states, and periodic orbits — compose according to the laws of matrix arithmetic. 1 Open Dynamical Systems The notion of a dynamical system pervades mathematical modeling in the sciences.
    [Show full text]
  • Applied Category Theory for Genomics – an Initiative
    Applied Category Theory for Genomics { An Initiative Yanying Wu1,2 1Centre for Neural Circuits and Behaviour, University of Oxford, UK 2Department of Physiology, Anatomy and Genetics, University of Oxford, UK 06 Sept, 2020 Abstract The ultimate secret of all lives on earth is hidden in their genomes { a totality of DNA sequences. We currently know the whole genome sequence of many organisms, while our understanding of the genome architecture on a systematic level remains rudimentary. Applied category theory opens a promising way to integrate the humongous amount of heterogeneous informations in genomics, to advance our knowledge regarding genome organization, and to provide us with a deep and holistic view of our own genomes. In this work we explain why applied category theory carries such a hope, and we move on to show how it could actually do so, albeit in baby steps. The manuscript intends to be readable to both mathematicians and biologists, therefore no prior knowledge is required from either side. arXiv:2009.02822v1 [q-bio.GN] 6 Sep 2020 1 Introduction DNA, the genetic material of all living beings on this planet, holds the secret of life. The complete set of DNA sequences in an organism constitutes its genome { the blueprint and instruction manual of that organism, be it a human or fly [1]. Therefore, genomics, which studies the contents and meaning of genomes, has been standing in the central stage of scientific research since its birth. The twentieth century witnessed three milestones of genomics research [1]. It began with the discovery of Mendel's laws of inheritance [2], sparked a climax in the middle with the reveal of DNA double helix structure [3], and ended with the accomplishment of a first draft of complete human genome sequences [4].
    [Show full text]
  • Cohomological Descent on the Overconvergent Site
    COHOMOLOGICAL DESCENT ON THE OVERCONVERGENT SITE DAVID ZUREICK-BROWN Abstract. We prove that cohomological descent holds for finitely presented crystals on the overconvergent site with respect to proper or fppf hypercovers. 1. Introduction Cohomological descent is a robust computational and theoretical tool, central to p-adic cohomology and its applications. On one hand, it facilitates explicit calculations (analo- gous to the computation of coherent cohomology in scheme theory via Cechˇ cohomology); on another, it allows one to deduce results about singular schemes (e.g., finiteness of the cohomology of overconvergent isocrystals on singular schemes [Ked06]) from results about smooth schemes, and, in a pinch, sometimes allows one to bootstrap global definitions from local ones (for example, for a scheme X which fails to embed into a formal scheme smooth near X, one actually defines rigid cohomology via cohomological descent; see [lS07, comment after Proposition 8.2.17]). The main result of the series of papers [CT03,Tsu03,Tsu04] is that cohomological descent for the rigid cohomology of overconvergent isocrystals holds with respect to both flat and proper hypercovers. The barrage of choices in the definition of rigid cohomology is burden- some and makes their proofs of cohomological descent very difficult, totaling to over 200 pages. Even after the main cohomological descent theorems [CT03, Theorems 7.3.1 and 7.4.1] are proved one still has to work a bit to get a spectral sequence [CT03, Theorem 11.7.1]. Actually, even to state what one means by cohomological descent (without a site) is subtle. The situation is now more favorable.
    [Show full text]
  • Homological Algebra
    Homological Algebra Donu Arapura April 1, 2020 Contents 1 Some module theory3 1.1 Modules................................3 1.6 Projective modules..........................5 1.12 Projective modules versus free modules..............7 1.15 Injective modules...........................8 1.21 Tensor products............................9 2 Homology 13 2.1 Simplicial complexes......................... 13 2.8 Complexes............................... 15 2.15 Homotopy............................... 18 2.23 Mapping cones............................ 19 3 Ext groups 21 3.1 Extensions............................... 21 3.11 Projective resolutions........................ 24 3.16 Higher Ext groups.......................... 26 3.22 Characterization of projectives and injectives........... 28 4 Cohomology of groups 32 4.1 Group cohomology.......................... 32 4.6 Bar resolution............................. 33 4.11 Low degree cohomology....................... 34 4.16 Applications to finite groups..................... 36 4.20 Topological interpretation...................... 38 5 Derived Functors and Tor 39 5.1 Abelian categories.......................... 39 5.13 Derived functors........................... 41 5.23 Tor functors.............................. 44 5.28 Homology of a group......................... 45 1 6 Further techniques 47 6.1 Double complexes........................... 47 6.7 Koszul complexes........................... 49 7 Applications to commutative algebra 52 7.1 Global dimensions.......................... 52 7.9 Global dimension of
    [Show full text]
  • Lecture 15. De Rham Cohomology
    Lecture 15. de Rham cohomology In this lecture we will show how differential forms can be used to define topo- logical invariants of manifolds. This is closely related to other constructions in algebraic topology such as simplicial homology and cohomology, singular homology and cohomology, and Cechˇ cohomology. 15.1 Cocycles and coboundaries Let us first note some applications of Stokes’ theorem: Let ω be a k-form on a differentiable manifold M.For any oriented k-dimensional compact sub- manifold Σ of M, this gives us a real number by integration: " ω : Σ → ω. Σ (Here we really mean the integral over Σ of the form obtained by pulling back ω under the inclusion map). Now suppose we have two such submanifolds, Σ0 and Σ1, which are (smoothly) homotopic. That is, we have a smooth map F : Σ × [0, 1] → M with F |Σ×{i} an immersion describing Σi for i =0, 1. Then d(F∗ω)isa (k + 1)-form on the (k + 1)-dimensional oriented manifold with boundary Σ × [0, 1], and Stokes’ theorem gives " " " d(F∗ω)= ω − ω. Σ×[0,1] Σ1 Σ1 In particular, if dω =0,then d(F∗ω)=F∗(dω)=0, and we deduce that ω = ω. Σ1 Σ0 This says that k-forms with exterior derivative zero give a well-defined functional on homotopy classes of compact oriented k-dimensional submani- folds of M. We know some examples of k-forms with exterior derivative zero, namely those of the form ω = dη for some (k − 1)-form η. But Stokes’ theorem then gives that Σ ω = Σ dη =0,sointhese cases the functional we defined on homotopy classes of submanifolds is trivial.
    [Show full text]
  • Lecture 3. Resolutions and Derived Functors (GL)
    Lecture 3. Resolutions and derived functors (GL) This lecture is intended to be a whirlwind introduction to, or review of, reso- lutions and derived functors { with tunnel vision. That is, we'll give unabashed preference to topics relevant to local cohomology, and do our best to draw a straight line between the topics we cover and our ¯nal goals. At a few points along the way, we'll be able to point generally in the direction of other topics of interest, but other than that we will do our best to be single-minded. Appendix A contains some preparatory material on injective modules and Matlis theory. In this lecture, we will cover roughly the same ground on the projective/flat side of the fence, followed by basics on projective and injective resolutions, and de¯nitions and basic properties of derived functors. Throughout this lecture, let us work over an unspeci¯ed commutative ring R with identity. Nearly everything said will apply equally well to noncommutative rings (and some statements need even less!). In terms of module theory, ¯elds are the simple objects in commutative algebra, for all their modules are free. The point of resolving a module is to measure its complexity against this standard. De¯nition 3.1. A module F over a ring R is free if it has a basis, that is, a subset B ⊆ F such that B generates F as an R-module and is linearly independent over R. It is easy to prove that a module is free if and only if it is isomorphic to a direct sum of copies of the ring.
    [Show full text]
  • Arithmetic Duality Theorems
    Arithmetic Duality Theorems Second Edition J.S. Milne Copyright c 2004, 2006 J.S. Milne. The electronic version of this work is licensed under a Creative Commons Li- cense: http://creativecommons.org/licenses/by-nc-nd/2.5/ Briefly, you are free to copy the electronic version of the work for noncommercial purposes under certain conditions (see the link for a precise statement). Single paper copies for noncommercial personal use may be made without ex- plicit permission from the copyright holder. All other rights reserved. First edition published by Academic Press 1986. A paperback version of this work is available from booksellers worldwide and from the publisher: BookSurge, LLC, www.booksurge.com, 1-866-308-6235, [email protected] BibTeX information @book{milne2006, author={J.S. Milne}, title={Arithmetic Duality Theorems}, year={2006}, publisher={BookSurge, LLC}, edition={Second}, pages={viii+339}, isbn={1-4196-4274-X} } QA247 .M554 Contents Contents iii I Galois Cohomology 1 0 Preliminaries............................ 2 1 Duality relative to a class formation . ............. 17 2 Localfields............................. 26 3 Abelianvarietiesoverlocalfields.................. 40 4 Globalfields............................. 48 5 Global Euler-Poincar´echaracteristics................ 66 6 Abelianvarietiesoverglobalfields................. 72 7 An application to the conjecture of Birch and Swinnerton-Dyer . 93 8 Abelianclassfieldtheory......................101 9 Otherapplications..........................116 AppendixA:Classfieldtheoryforfunctionfields............126
    [Show full text]
  • Diagrammatics in Categorification and Compositionality
    Diagrammatics in Categorification and Compositionality by Dmitry Vagner Department of Mathematics Duke University Date: Approved: Ezra Miller, Supervisor Lenhard Ng Sayan Mukherjee Paul Bendich Dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Mathematics in the Graduate School of Duke University 2019 ABSTRACT Diagrammatics in Categorification and Compositionality by Dmitry Vagner Department of Mathematics Duke University Date: Approved: Ezra Miller, Supervisor Lenhard Ng Sayan Mukherjee Paul Bendich An abstract of a dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Mathematics in the Graduate School of Duke University 2019 Copyright c 2019 by Dmitry Vagner All rights reserved Abstract In the present work, I explore the theme of diagrammatics and their capacity to shed insight on two trends|categorification and compositionality|in and around contemporary category theory. The work begins with an introduction of these meta- phenomena in the context of elementary sets and maps. Towards generalizing their study to more complicated domains, we provide a self-contained treatment|from a pedagogically novel perspective that introduces almost all concepts via diagrammatic language|of the categorical machinery with which we may express the broader no- tions found in the sequel. The work then branches into two seemingly unrelated disciplines: dynamical systems and knot theory. In particular, the former research defines what it means to compose dynamical systems in a manner analogous to how one composes simple maps. The latter work concerns the categorification of the slN link invariant. In particular, we use a virtual filtration to give a more diagrammatic reconstruction of Khovanov-Rozansky homology via a smooth TQFT.
    [Show full text]
  • 2019 AMS Prize Announcements
    FROM THE AMS SECRETARY 2019 Leroy P. Steele Prizes The 2019 Leroy P. Steele Prizes were presented at the 125th Annual Meeting of the AMS in Baltimore, Maryland, in January 2019. The Steele Prizes were awarded to HARUZO HIDA for Seminal Contribution to Research, to PHILIppE FLAJOLET and ROBERT SEDGEWICK for Mathematical Exposition, and to JEFF CHEEGER for Lifetime Achievement. Haruzo Hida Philippe Flajolet Robert Sedgewick Jeff Cheeger Citation for Seminal Contribution to Research: Hamadera (presently, Sakai West-ward), Japan, he received Haruzo Hida an MA (1977) and Doctor of Science (1980) from Kyoto The 2019 Leroy P. Steele Prize for Seminal Contribution to University. He did not have a thesis advisor. He held po- Research is awarded to Haruzo Hida of the University of sitions at Hokkaido University (Japan) from 1977–1987 California, Los Angeles, for his highly original paper “Ga- up to an associate professorship. He visited the Institute for Advanced Study for two years (1979–1981), though he lois representations into GL2(Zp[[X ]]) attached to ordinary cusp forms,” published in 1986 in Inventiones Mathematicae. did not have a doctoral degree in the first year there, and In this paper, Hida made the fundamental discovery the Institut des Hautes Études Scientifiques and Université that ordinary cusp forms occur in p-adic analytic families. de Paris Sud from 1984–1986. Since 1987, he has held a J.-P. Serre had observed this for Eisenstein series, but there full professorship at UCLA (and was promoted to Distin- the situation is completely explicit. The methods and per- guished Professor in 1998).
    [Show full text]
  • A Algebraic Varieties
    A Algebraic Varieties A.1 Basic definitions Let k[X1,X2,...,Xn] be a polynomial algebra over an algebraically closed field k with n indeterminates X1,...,Xn. We sometimes abbreviate it as k[X]= k[X1,X2,...,Xn]. Let us associate to each polynomial f(X)∈ k[X] its zero set n V(f):= {x = (x1,x2,...,xn) ∈ k | f(x)= f(x1,x2,...,xn) = 0} n 2in the n-fold product set k of k. For any subset S ⊂ k[X] we also set V(S) = f ∈S V(f). Then we have the following properties: n (i) 2V(1) =∅,V(0) =k . = (ii) i∈I V(Si) V( i∈I Si). (iii) V(S1) ∪ V(S2) = V(S1S2), where S1S2 := {fg | f ∈ S1,g∈ S2}. The inclusion ⊂ of (iii) is clear. We will prove only the inclusion ⊃. For x ∈ V(S1S2) \ V(S2) there is an element g ∈ S2 such that g(x) = 0. On the other hand, it ∀ ∀ follows from x ∈ V(S1S2) that f(x)g(x) = 0( f ∈ S1). Hence f(x)= 0( f ∈ S1) and x ∈ V(S1). So the part ⊃ was also proved. By (i), (ii), (iii) the set kn is endowed with the structure of a topological space by taking {V(S) | S ⊂ k[X]} to be its closed subsets. We call this topology of kn the Zariski topology. The closed subsets V(S) of kn with respect to it are called algebraic sets in kn. Note that V(S)= V(S), where S denotes the ideal of k[X] generated by S.
    [Show full text]
  • Arxiv:2008.10677V3 [Math.CT] 9 Jul 2021 Space Ha Hoyepiil Ea Ihtewr Fj Ea N194 in Leray J
    On sheaf cohomology and natural expansions ∗ Ana Luiza Tenório, IME-USP, [email protected] Hugo Luiz Mariano, IME-USP, [email protected] July 12, 2021 Abstract In this survey paper, we present Čech and sheaf cohomologies – themes that were presented by Koszul in University of São Paulo ([42]) during his visit in the late 1950s – we present expansions for categories of generalized sheaves (i.e, Grothendieck toposes), with examples of applications in other cohomology theories and other areas of mathematics, besides providing motivations and historical notes. We conclude explaining the difficulties in establishing a cohomology theory for elementary toposes, presenting alternative approaches by considering constructions over quantales, that provide structures similar to sheaves, and indicating researches related to logic: constructive (intuitionistic and linear) logic for toposes, sheaves over quantales, and homological algebra. 1 Introduction Sheaf Theory explicitly began with the work of J. Leray in 1945 [46]. The nomenclature “sheaf” over a space X, in terms of closed subsets of a topological space X, first appeared in 1946, also in one of Leray’s works, according to [21]. He was interested in solving partial differential equations and build up a strong tool to pass local properties to global ones. Currently, the definition of a sheaf over X is given by a “coherent family” of structures indexed on the lattice of open subsets of X or as étale maps (= local homeomorphisms) into X. Both arXiv:2008.10677v3 [math.CT] 9 Jul 2021 formulations emerged in the late 1940s and early 1950s in Cartan’s seminars and, in modern terms, they are intimately related by an equivalence of categories.
    [Show full text]
  • Algebraic Topology
    Algebraic Topology John W. Morgan P. J. Lamberson August 21, 2003 Contents 1 Homology 5 1.1 The Simplest Homological Invariants . 5 1.1.1 Zeroth Singular Homology . 5 1.1.2 Zeroth deRham Cohomology . 6 1.1.3 Zeroth Cecˇ h Cohomology . 7 1.1.4 Zeroth Group Cohomology . 9 1.2 First Elements of Homological Algebra . 9 1.2.1 The Homology of a Chain Complex . 10 1.2.2 Variants . 11 1.2.3 The Cohomology of a Chain Complex . 11 1.2.4 The Universal Coefficient Theorem . 11 1.3 Basics of Singular Homology . 13 1.3.1 The Standard n-simplex . 13 1.3.2 First Computations . 16 1.3.3 The Homology of a Point . 17 1.3.4 The Homology of a Contractible Space . 17 1.3.5 Nice Representative One-cycles . 18 1.3.6 The First Homology of S1 . 20 1.4 An Application: The Brouwer Fixed Point Theorem . 23 2 The Axioms for Singular Homology and Some Consequences 24 2.1 The Homotopy Axiom for Singular Homology . 24 2.2 The Mayer-Vietoris Theorem for Singular Homology . 29 2.3 Relative Homology and the Long Exact Sequence of a Pair . 36 2.4 The Excision Axiom for Singular Homology . 37 2.5 The Dimension Axiom . 38 2.6 Reduced Homology . 39 1 3 Applications of Singular Homology 39 3.1 Invariance of Domain . 39 3.2 The Jordan Curve Theorem and its Generalizations . 40 3.3 Cellular (CW) Homology . 43 4 Other Homologies and Cohomologies 44 4.1 Singular Cohomology .
    [Show full text]