Chapter 3 – Cohomology

Total Page:16

File Type:pdf, Size:1020Kb

Chapter 3 – Cohomology Chapter 3 { Cohomology 3.0 { Cohomology Introduction Let X be a 1-dimensional ∆-complex, so X is an oriented graph (or pseudo-graph if edges that begin and end at the same vertex are allowed). If v0 and v1 are two vertices in X and e is an oriented edge from v0 to v1, then notationally we'll denote e by [v0; v1]. Recall that, formally, 0 1 a \vertex" is a map σα : ∆ ! X, and an \edge" is a map τβ : ∆ ! X that, when restricted 1 to each endpoint (or \face") of ∆ , becomes one of the maps σα when pre-composed with the appropriate canonical linear homeomorphism ∆0 7! (face of ∆1). So our edge e is in fact a 1 1 map σe : ∆ ! X such that, if we denote ∆ by [u0; u1] (a line segment), then σe(u0) = v0 1 and σe(u1) = v1; thus, if indeed v0 6= v1, it follows that σe(∆ )|truly our edge e in X in the graphical sense|is homeomorphic to the standard 1-simplex ∆1, and so it makes sense to represent e using the simplex notation [v0; v1] (especially since it conveys information about the orientation of e). If v0 = v1 it still makes sense to represent e by [v0; v1] = [v0; v0] to maintain consistent notation even though the corresponding edge is not homeomorphic to any kind of simplex.1 Let G be an abelian group (not necessarily free), V the set of vertices of X, and E the set of edges of X. Define ∆0(X; G) = f' : V ! G j ' is a functiong and ∆1(X; G) = f : E ! G j is a functiong 0 0 Note ∆ (X; G) forms an abelian group: if '1;'2 2 ∆ (X; G), then '1 + '2 given by ('1 + '2)(v) = '1(v) + '2(v) 0 shows that '1 + '2 2 ∆ (X; G) since '1(v) 2 G and '2(v) 2 G implies that '1(v) + '2(v) 2 G. In similar fashion ∆1(X; G) is also an abelian group. 0 1 0 Now define a homomorphism δ1 : ∆ (X; G) ! ∆ (X; G) as follows: for ' 2 ∆ (X; G) let 1 δ1' 2 ∆ (X; G) be such that, for [v0; v1] 2 E, δ1'([v0; v1]) = '(v1) − '(v0). Set up a chain complex · · · −! 0 −−−!δ0 ∆0(X; G) −−−!δ1 ∆1(X; G) −−−!δ2 0 −! · · · : By definition the homology groups associated with this chain complex are the simplicial n cohomology groups H∆(X; G) of X. In particular we have 0 1 0 Ker[δ1 : ∆ (X; G) ! ∆ (X; G)] ∼ H∆(X; G) = 0 = Ker δ1 (1) Im[δ0 : 0 ! ∆ (X; G)] since Im δ0 = 0, and 1 1 1 Ker[δ2 : ∆ (X; G) ! 0] ∼ ∆ (X; G) H∆(X; G) = 0 1 = 0 1 : (2) Im[δ1 : ∆ (X; G) ! ∆ (X; G)] Im[δ1 : ∆ (X; G) ! ∆ (X; G)] 1 Recall that the map σe is also called a 1-simplex. 2 0 ∼ 0 So H∆(X; G) = f' 2 ∆ (X; G): δ1' = 0g, where 0(e) := 0 2 G for every e 2 E. Thus 0 ' 2 H∆(X; G) implies that δ1'([v1; v0]) = '(v1) − '(v0) = 0; or '(v1) = '(v0) for every vertex v0 and v1 that is connected by an edge in X. This in turn implies that ' must be constant on each component of X. Let fXαgα2I be the components of X, and let Vα be the set of vertices for the subgraph Xα. Then 0 Ker δ1 = f' 2 ∆ (X; G): 8 α 2 I' is constant on Vαg 0 = f' 2 ∆ (X; G): 8 α 2 I 9 gα 2 G s.t. ' ≡ gα on Vαg: Q 2 It follows that each element of the group Ker δ1 corresponds to some fgαgα2I 2 α2I G; where it is necessary to consider the direct product of copies of G as opposed to the direct sum since it may well be that gα 6= 0 for an infinite number of index values α. The one-to-one Q correspondence Ker δ1 7! α2I G can easily be shown to be an isomorphism, so therefore from (1) we obtain 0 ∼ ∼ Y H∆(X; G) = Ker δ1 = G: α2I 1 Next, from (2) is can be seen that H∆(X; G) = 0 iff δ1 is surjective, which is to say that for 1 0 each 2 ∆ (X; G) there exists some ' 2 ∆ (X; G) such that δ1' = . This will be the case whenever the components fXαgα2I of X are trees since the path between any two vertices in a 1 tree is unique: for a given α 2 I,[v0; v1] = e 2 Eα (the set of edges in Xα) and 2 ∆ (X; G), 0 we need only define ' 2 ∆ (X; G) such that '(v1) − '(v0) = (e), with the choice of definition being unique up to a constant; then the values of ' at all other vertices in Xα are set as dictated by the values of on the edges of the unique paths leading to those vertices. The process is repeated for the other components of X to get δ1' = . If a particular component Xα of X is not a tree, then we designate a maximal tree that is a subgraph of Xα which includes all of its vertices but not all edges. It is a fact that, for any choice of maximal tree for a graph, the cardinality of the set of edges omitted from the tree will be the same. For the sake of argument suppose that X is a connected graph that is not a tree, let Y ⊂ X be a maximal tree, let E0 be the set of edges not in Y , and let E00 be the set of edges in Y . The claim will be that 1 ∼ Y H∆(X; G) = G: e2E0 For the construction of the appropriate isomorphism, note that for any 2 ∆1(X; G) there 0 can be found some ' 2 ∆ (X; G) (unique up to a constant) such that δ1'jE00 = jE00 . Now 1 Q define F : H∆(X; G) ! e2E0 G by F ( + Im δ1) = f( − δ1')(e)ge2E0 for some ' such that δ1'jE00 = jE00 (3) 2 Recall that formally fgαgα2I is a function g : I ! G given by g(α) = gα for each α 2 I. 3 The choice for ' is irrelevant since the difference must be a constant: if' ^ = ' + g for some fixed g 2 G (more precisely g : E ! fgg), then δ1'^([v0; v1]) = (' + g)(v1) − (' + g)(v0) = ('(v1) + g(v1)) − ('(v0) + g(v0)) = '(v1) + g − '(v0) − g = δ1'([v0; v1]); and so − δ1'^ = − δ1'. It should first be verified that F is well-defined. We start with a simple case when X is a graph with three vertices and three edges as shown in the figure, so E = fe0; e1; e2g. To 0 00 construct a maximal tree Y we need only omit e0, so that E = fe0g and E = fe1; e2g. 0 Suppose 1 + Im δ1 = 2 + Im δ1. There exist '1;'2 2 ∆ (X; G) such that δ1'1jE00 = 1jE00 and δ1'2jE00 = 2jE00 . To show F ( 1 + Im δ1) = F ( 2 + Im δ1) means to show that ( 1 − δ1'1)(e0) = ( 2 − δ1'2)(e0); or ( 1 − 2)(e0) = ('1(v1) − '1(v0) − ('2(v1) − '2(v0) : (4) Now, 1 + Im δ1 = 2 + Im δ1 implies that 1 − 2 2 Im δ1, and so there exists some ' : V ! G such that (δ1')(ei) = ( 1 − 2)(ei) for all ei 2 E. Hence 1(e0) − 2(e0) = '(v1) − '(v0) (5) 1(e1) − 2(e1) = '(v2) − '(v0) (6) 1(e2) − 2(e2) = '(v2) − '(v1); (7) while from δ1'1jE00 = 1jE00 and δ1'2jE00 = 2jE00 we obtain 1(e1) = '1(v2) − '1(v0) and 2(e1) = '2(v2) − '2(v0) (8) 1(e2) = '1(v2) − '1(v1) and 2(e2) = '2(v2) − '2(v1): (9) Combining (6) and (8) gives '(v2) − '(v0) = ('1(v2) − '1(v0) − ('2(v2) − '2(v0) ; (10) and combining (7) and (9) gives '(v2) − '(v1) = ('1(v2) − '1(v1) − ('2(v2) − '2(v1) : (11) Now, if we subtract (11) from (10) we obtain '(v1) − '(v0) = ('1(v1) − '1(v0) − ('2(v1) − '2(v0) : (12) 4 We now put (12) into (5) and get precisely (4), as desired. A simpler analysis can be employed to show that F is well-defined in the case when a maximal tree is formed by deleting one edge and retaining one edge, which becomes the \base case" for an inductive argument that will establish that F is well-defined when one edge is deleted and n edges are retained, n 2 N arbitrary. This result, once obtained, in turn becomes the base case for another inductive argument that establishes the well-definedness of F in the general case when m edges are deleted and n edges are retained in the forming of a maximal tree, m; n 2 N both arbitrary. All of this can be done under the assumption that X is connected (i.e. has just one component), after which it is easy to extend to an arbitrary number of components. To show that F is a homomorphism of groups, along with addition and integer multiplication of cosets in a quotient group we assume the usual (componentwise) definitions for addition and integer multiplication of elements in a direct product of groups. In what follows X is not assumed to be connected, so E00 is taken to be the set of edges included in the maximal tree for some component of X, and E0 = E − E00. Let m; n 2 Z and ; ^ 2 ∆1(X; G).
Recommended publications
  • 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]
  • Derived Functors and Homological Dimension (Pdf)
    DERIVED FUNCTORS AND HOMOLOGICAL DIMENSION George Torres Math 221 Abstract. This paper overviews the basic notions of abelian categories, exact functors, and chain complexes. It will use these concepts to define derived functors, prove their existence, and demon- strate their relationship to homological dimension. I affirm my awareness of the standards of the Harvard College Honor Code. Date: December 15, 2015. 1 2 DERIVED FUNCTORS AND HOMOLOGICAL DIMENSION 1. Abelian Categories and Homology The concept of an abelian category will be necessary for discussing ideas on homological algebra. Loosely speaking, an abelian cagetory is a type of category that behaves like modules (R-mod) or abelian groups (Ab). We must first define a few types of morphisms that such a category must have. Definition 1.1. A morphism f : X ! Y in a category C is a zero morphism if: • for any A 2 C and any g; h : A ! X, fg = fh • for any B 2 C and any g; h : Y ! B, gf = hf We denote a zero morphism as 0XY (or sometimes just 0 if the context is sufficient). Definition 1.2. A morphism f : X ! Y is a monomorphism if it is left cancellative. That is, for all g; h : Z ! X, we have fg = fh ) g = h. An epimorphism is a morphism if it is right cancellative. The zero morphism is a generalization of the zero map on rings, or the identity homomorphism on groups. Monomorphisms and epimorphisms are generalizations of injective and surjective homomorphisms (though these definitions don't always coincide). It can be shown that a morphism is an isomorphism iff it is epic and monic.
    [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]
  • On the Cohomology of the Finite Special Linear Groups, I
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF ALGEBRA 54, 216-238 (1978) On the Cohomology of the Finite Special Linear Groups, I GREGORY W. BELL* Fort Lewis College, Durango, Colorado 81301 Communicated by Graham Higman Received April 1, 1977 Let K be a finite field. We are interested in determining the cohomology groups of degree 0, 1, and 2 of various KSL,+,(K) modules. Our work is directed to the goal of determining the second degree cohomology of S&+,(K) acting on the exterior powers of its standard I + l-dimensional module. However, our solution of this problem will involve the study of many cohomology groups of degree 0 and 1 as well. These groups are of independent interest and they are useful in many other cohomological calculations involving SL,+#) and other Chevalley groups [ 11. Various aspects of this problem or similar problems have been considered by many authors, including [l, 5, 7-12, 14-19, 211. There have been many techni- ques used in studing this problem. Some are ad hoc and rely upon particular information concerning the groups in question. Others are more general, but still place restrictions, such as restrictions on the characteristic of the field, the order of the field, or the order of the Galois group of the field. Our approach is general and shows how all of these problems may be considered in a unified. way. In fact, the same method may be applied quite generally to other Chevalley groups acting on certain of their modules [l].
    [Show full text]
  • Math 231Br: Algebraic Topology
    algebraic topology Lectures delivered by Michael Hopkins Notes by Eva Belmont and Akhil Mathew Spring 2011, Harvard fLast updated August 14, 2012g Contents Lecture 1 January 24, 2010 x1 Introduction 6 x2 Homotopy groups. 6 Lecture 2 1/26 x1 Introduction 8 x2 Relative homotopy groups 9 x3 Relative homotopy groups as absolute homotopy groups 10 Lecture 3 1/28 x1 Fibrations 12 x2 Long exact sequence 13 x3 Replacing maps 14 Lecture 4 1/31 x1 Motivation 15 x2 Exact couples 16 x3 Important examples 17 x4 Spectral sequences 19 1 Lecture 5 February 2, 2010 x1 Serre spectral sequence, special case 21 Lecture 6 2/4 x1 More structure in the spectral sequence 23 x2 The cohomology ring of ΩSn+1 24 x3 Complex projective space 25 Lecture 7 January 7, 2010 x1 Application I: Long exact sequence in H∗ through a range for a fibration 27 x2 Application II: Hurewicz Theorem 28 Lecture 8 2/9 x1 The relative Hurewicz theorem 30 x2 Moore and Eilenberg-Maclane spaces 31 x3 Postnikov towers 33 Lecture 9 February 11, 2010 x1 Eilenberg-Maclane Spaces 34 Lecture 10 2/14 x1 Local systems 39 x2 Homology in local systems 41 Lecture 11 February 16, 2010 x1 Applications of the Serre spectral sequence 45 Lecture 12 2/18 x1 Serre classes 50 Lecture 13 February 23, 2011 Lecture 14 2/25 Lecture 15 February 28, 2011 Lecture 16 3/2/2011 Lecture 17 March 4, 2011 Lecture 18 3/7 x1 Localization 74 x2 The homotopy category 75 x3 Morphisms between model categories 77 Lecture 19 March 11, 2011 x1 Model Category on Simplicial Sets 79 Lecture 20 3/11 x1 The Yoneda embedding 81 x2 82
    [Show full text]
  • Introduction to Homology
    Introduction to Homology Matthew Lerner-Brecher and Koh Yamakawa March 28, 2019 Contents 1 Homology 1 1.1 Simplices: a Review . .2 1.2 ∆ Simplices: not a Review . .2 1.3 Boundary Operator . .3 1.4 Simplicial Homology: DEF not a Review . .4 1.5 Singular Homology . .5 2 Higher Homotopy Groups and Hurweicz Theorem 5 3 Exact Sequences 5 3.1 Key Definitions . .5 3.2 Recreating Groups From Exact Sequences . .6 4 Long Exact Homology Sequences 7 4.1 Exact Sequences of Chain Complexes . .7 4.2 Relative Homology Groups . .8 4.3 The Excision Theorems . .8 4.4 Mayer-Vietoris Sequence . .9 4.5 Application . .9 1 Homology What is Homology? To put it simply, we use Homology to count the number of n dimensional holes in a topological space! In general, our approach will be to add a structure on a space or object ( and thus a topology ) and figure out what subsets of the space are cycles, then sort through those subsets that are holes. Of course, as many properties we care about in topology, this property is invariant under homotopy equivalence. This is the slightly weaker than homeomorphism which we before said gave us the same fundamental group. 1 Figure 1: Hatcher p.100 Just for reference to you, I will simply define the nth Homology of a topological space X. Hn(X) = ker @n=Im@n−1 which, as we have said before, is the group of n-holes. 1.1 Simplices: a Review k+1 Just for your sake, we review what standard K simplices are, as embedded inside ( or living in ) R ( n ) k X X ∆ = [v0; : : : ; vk] = xivi such that xk = 1 i=0 For example, the 0 simplex is a point, the 1 simplex is a line, the 2 simplex is a triangle, the 3 simplex is a tetrahedron.
    [Show full text]
  • Homology Groups of Homeomorphic Topological Spaces
    An Introduction to Homology Prerna Nadathur August 16, 2007 Abstract This paper explores the basic ideas of simplicial structures that lead to simplicial homology theory, and introduces singular homology in order to demonstrate the equivalence of homology groups of homeomorphic topological spaces. It concludes with a proof of the equivalence of simplicial and singular homology groups. Contents 1 Simplices and Simplicial Complexes 1 2 Homology Groups 2 3 Singular Homology 8 4 Chain Complexes, Exact Sequences, and Relative Homology Groups 9 ∆ 5 The Equivalence of H n and Hn 13 1 Simplices and Simplicial Complexes Definition 1.1. The n-simplex, ∆n, is the simplest geometric figure determined by a collection of n n + 1 points in Euclidean space R . Geometrically, it can be thought of as the complete graph on (n + 1) vertices, which is solid in n dimensions. Figure 1: Some simplices Extrapolating from Figure 1, we see that the 3-simplex is a tetrahedron. Note: The n-simplex is topologically equivalent to Dn, the n-ball. Definition 1.2. An n-face of a simplex is a subset of the set of vertices of the simplex with order n + 1. The faces of an n-simplex with dimension less than n are called its proper faces. 1 Two simplices are said to be properly situated if their intersection is either empty or a face of both simplices (i.e., a simplex itself). By \gluing" (identifying) simplices along entire faces, we get what are known as simplicial complexes. More formally: Definition 1.3. A simplicial complex K is a finite set of simplices satisfying the following condi- tions: 1 For all simplices A 2 K with α a face of A, we have α 2 K.
    [Show full text]
  • Arithmetical Birational Invariants of Linear Algebraic Groups Over Two-Dimensional Geometric fields ✩
    Journal of Algebra 276 (2004) 292–339 www.elsevier.com/locate/jalgebra Arithmetical birational invariants of linear algebraic groups over two-dimensional geometric fields ✩ Mikhail Borovoi,a,1,∗ Boris Kunyavski˘ı,b,2 and Philippe Gille c,3 a Raymond and Beverly Sackler School of Mathematical Sciences, Tel Aviv University, 69978 Tel Aviv, Israel b Department of Mathematics and Statistics, Bar-Ilan University, 52900 Ramat Gan, Israel c CNRS, UMR 8628, Mathématiques, Bâtiment 425, Université de Paris-Sud, F-91405 Orsay, France Received 5 May 2003 Communicated by Eva Bayer-Fluckiger To Valentin Evgenyevich Voskresenski˘ı on the occasion of his 75th birthday Abstract Let G be a connected linear algebraic group over a geometric field k of cohomological dimension 2 of one of the types which were considered by Colliot-Thélène, Gille and Parimala. Basing on their results, we compute the group of classes of R-equivalence G(k)/R, the defect of weak approximation 1 1 AΣ (G), the first Galois cohomology H (k, G), and the Tate–Shafarevich kernel x (k, G) (for suitable k) in terms of the algebraic fundamental group π1(G). We prove that the groups G(k)/R 1 and AΣ (G) and the set x (k, G) are stably k-birational invariants of G. 2004 Elsevier Inc. All rights reserved. Keywords: Two-dimensional geometric field; Linear algebraic group; Birational invariants; R-equivalence; Weak approximation; Tate–Shafarevich kernel ✩ This research was supported by the Israel Science Foundation founded by the Israel Academy of Sciences and Humanities—Center of Excellence Program and by EU RTN HPRN-CT-2002-00287.
    [Show full text]
  • Etale Cohomology of Curves
    ETALE COHOMOLOGY OF CURVES SIDDHARTH VENKATESH Abstract. These are notes for a talk on the etale cohomology of curves given in a grad student seminar on etale cohomology held in Spring 2016 at MIT. The talk follows Chapters 13 and 14 of Milne ([Mil3]). Contents 1. Outline of Talk 1 2. The Kummer Exact Sequence 2 3. Cohomology of Gm 4 4. Cohomology of µn 7 4.1. For Projective Curves 7 4.2. Lefschetz Trace Formula and Rationality of Zeta Function 7 4.3. For Affine Curves 10 5. Compactly Supported Cohomology for Curves 10 6. Poincare Duality 11 6.1. Local Systems in the Etale Topology 11 6.2. Etale Fundamental Group 11 6.3. The Duality Statement 13 7. Curves over Finite Fields 17 7.1. Hochschild-Serre Spectral Sequence 17 7.2. Poincare Duality 17 References 18 1. Outline of Talk The main goal of this talk is to prove a Poincare duality result for smooth curves over algebraically closed fields. Eventually, we will want to get a similar result for higher dimensional varieties as well but for now, we only have the machinery to deal with curves. Let me begin by recalling how Poincare duality works for smooth varieties of dimension n over C. In the analytic topology, we have a perfect pairing r 2n−r 2n H (X; Z) × Hc (X; Z) ! H (X; Z) = Z: More generally, you can replace the sheaf Z with any locally constant sheaf F to get a perfect pairing r 2n−r H (X; F) × H (X; Fˇ(1)) ! Z where Fˇ(1) = Hom(F; Z): This cannot be done in the Zariski topology because the topolgy is contractible (if the variety is irreducible).
    [Show full text]
  • Lecture Notes on Homotopy Theory and Applications
    LAURENTIUMAXIM UNIVERSITYOFWISCONSIN-MADISON LECTURENOTES ONHOMOTOPYTHEORY ANDAPPLICATIONS i Contents 1 Basics of Homotopy Theory 1 1.1 Homotopy Groups 1 1.2 Relative Homotopy Groups 7 1.3 Homotopy Extension Property 10 1.4 Cellular Approximation 11 1.5 Excision for homotopy groups. The Suspension Theorem 13 1.6 Homotopy Groups of Spheres 13 1.7 Whitehead’s Theorem 16 1.8 CW approximation 20 1.9 Eilenberg-MacLane spaces 25 1.10 Hurewicz Theorem 28 1.11 Fibrations. Fiber bundles 29 1.12 More examples of fiber bundles 34 1.13 Turning maps into fibration 38 1.14 Exercises 39 2 Spectral Sequences. Applications 41 2.1 Homological spectral sequences. Definitions 41 2.2 Immediate Applications: Hurewicz Theorem Redux 44 2.3 Leray-Serre Spectral Sequence 46 2.4 Hurewicz Theorem, continued 50 2.5 Gysin and Wang sequences 52 ii 2.6 Suspension Theorem for Homotopy Groups of Spheres 54 2.7 Cohomology Spectral Sequences 57 2.8 Elementary computations 59 n 2.9 Computation of pn+1(S ) 63 3 2.10 Whitehead tower approximation and p5(S ) 66 Whitehead tower 66 3 3 Calculation of p4(S ) and p5(S ) 67 2.11 Serre’s theorem on finiteness of homotopy groups of spheres 70 2.12 Computing cohomology rings via spectral sequences 74 2.13 Exercises 76 3 Fiber bundles. Classifying spaces. Applications 79 3.1 Fiber bundles 79 3.2 Principal Bundles 86 3.3 Classification of principal G-bundles 92 3.4 Exercises 97 4 Vector Bundles. Characteristic classes. Cobordism. Applications. 99 4.1 Chern classes of complex vector bundles 99 4.2 Stiefel-Whitney classes of real vector bundles 102 4.3 Stiefel-Whitney classes of manifolds and applications 103 The embedding problem 103 Boundary Problem.
    [Show full text]
  • 1 Homotopy Groups
    Math 752 Week 13 1 Homotopy Groups Definition 1. For n ≥ 0 and X a topological space with x0 2 X, define n n πn(X) = ff :(I ; @I ) ! (X; x0)g= ∼ where ∼ is the usual homotopy of maps. Then we have the following diagram of sets: f (In; @In) / (X; x ) 6 0 g (In=@In; @In=@In) n n n n n Now we have (I =@I ; @I =@I ) ' (S ; s0). So we can also define n πn(X; x0) = fg :(S ; s0) ! (X; x0)g= ∼ where g is as above. 0 Remark 1. If n = 0, then π0(X) is the set of connected components of X. Indeed, we have I = pt 0 and @I = ?, so π0(X) consists of homotopy classes of maps from a point into the space X. Now we will prove several results analogous to the n = 1 case. Proposition 1. If n ≥ 1, then πn(X; x0) is a group with respect to the following operation +: 8 > 1 <f(2s1; s2; : : : ; sn) 0 ≤ s1 ≤ 2 (f + g)(s1; s2; : : : ; sn) = > 1 :g(2s1 − 1; s2; : : : ; sn) 2 ≤ s1 ≤ 1 (Note that if n = 1, this is the usual concatenation of paths/loops.) Proof. First note that since only the first coordinate is involved in this operation, the same argument used to prove π1 is a group is valid here as well. Then the identity element is the constant map n taking all of I to x0 and inverses are given by −f = f(1 − s1; s2; : : : ; sn). 1 2 Proposition 2. If n ≥ 2, then πn(X; x0) is abelian.
    [Show full text]
  • Exact Sequences with a Flat Cokernel and A
    Exact Sequences with a flat cokernel and a sketch of properties of Tor We give two arguments to prove the following fact: Lemma. Let 0 ! N ! M ! F ! 0 be an exact sequence of R-modules such that F is R-flat. Then for every R-module A, 0 ! A ⊗R N ! A ⊗R M ! A ⊗R F ! 0 is exact. The first proof is completely elementary. The second uses properties of Tor, and is quite straightforward if one is familiar with Tor. Prior to giving the argument, we give a brief treatment of properties of Tor. Elementary proof. Map a free R-module G onto A, and let B denote the kernel, so that 0 ! B ! G ! A ! 0 is exact. Think of this exact sequence as written as a column. We may tensor the row and column together to obtain a double array (all tensor products are over R) in which the squares commute: 0 ? ? y B ⊗ N −−−−! B ⊗ M −−−−! B ⊗ F −−−−! 0 ? ? ? ? ? ?α y y y g 0 −−−−! G ⊗ N −−−−! G ⊗ M −−−−! G ⊗ F −−−−! 0 ? ? ? ? ? ? y y y f A ⊗ N −−−−! A ⊗ M −−−−! A ⊗ F −−−−! 0 ? ? ? ? ? ? y y y 0 0 0 By the right exactness of tensor product, the rows are exact except at the left and the columns are exact except at the top. However, because G is free, the middle row is exact, and because F is flat, the rightmost column is exact. We want to show that f is injective. Suppose that u 2 Ker (f). Pick v 2 G ⊗ N that maps to u.
    [Show full text]