An Elementary Approach To Homological Algebra

Homological algebra was developed as an area of study almost 50 years ago, and many books on the subject exist. However, few, if any, of these books are written at a level appropriate for students approaching the subject for the first time. An Elementary Approach to Homological Algebra fills that void. Designed to meet the needs of beginning

The landscape of homological algebra has evolved over the last half-century into a fundamental tool for the working mathematician. This book provides a unified account of homological algebra as it exists today. The historical connection with topology, regular local rings, and semi-simple Lie algebras are also described. This book is suitable for second or third year graduate students. The first half of the book takes as its subject the canonical topics in homological algebra: derived functors, Tor and Ext, projective dimensions and spectral sequences. Homology of group and Lie algebras illustrate these topics. Intermingled are less canonical topics, such as the derived inverse limit functor lim1, local cohomology, Galois cohomology, and affine Lie algebras. The last part of the book covers less traditional topics that are a vital part of the modern homological toolkit: simplicial methods, Hochschild and cyclic homology, derived categories and total derived functors. By making these tools more accessible, the book helps to break down the technological barrier between experts and casual users of homological algebra.

'The book under review is an interesting elaboration that fills the gaps in libraries for concisely written and student-friendly books about essentials in computer science … I recommend this book for anyone who would like to study algorithms, learn a lot about computer science or simply would like to deepen their knowledge … The book is written in very simple English and can be understood even by those with limited knowledge of the English language. It should be emphasized that, despite the fact that the book consists of many examples, mathematical formulas and theorems, it is very hard to find any mistakes, errors or typos.'zbMATHIn computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks.As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing 'output' and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single-Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.

In this chapter we are largely influenced in our choice of material by the demands of the rest of the book. However, we take the view that this is an opportunity for the student to grasp basic categorical notions which permeate so much of mathematics today, including, of course, algebraic topology, so that we do not allow ourselves to be rigidly restricted by our immediate objectives. A reader totally unfamiliar with category theory may find it easiest to restrict his first reading of Chapter II to Sections 1 to 6; large parts of the book are understandable with the material presented in these sections. Another reader, who had already met many examples of categorical formulations and concepts might, in fact, prefer to look at Chapter II before reading Chapter I. Of course the reader thoroughly familiar with category theory could, in principal, omit Chapter II, except perhaps to familiarize himself with the notations employed. In Chapter III we begin the proper study of homological algebra by looking in particular at the group ExtA(A, B), where A and Bare A-modules. It is shown how this group can be calculated by means of a projective presentation of A, or an injective presentation of B; and how it may also be identified with the group of equivalence classes of extensions of the quotient module A by the submodule B.

This book proposes a study of semi-exact homological categories as a basis for a generalized homological algebra. The aim is to extend homological notions to deeply non-abelian situations, where satellites and spectral sequences produced by unstable homotopy can still be studied.

An Introduction to Homological Algebra discusses the origins of algebraic topology. It also presents the study of homological algebra as a two-stage affair. First, one must learn the language of Ext and Tor and what it describes. Second, one must be able to compute these things, and often, this involves yet another language: spectral sequences. Homological algebra is an accessible subject to those who wish to learn it, and this book is the author’s attempt to make it lovable. This book comprises 11 chapters, with an introductory chapter that focuses on line integrals and independence of path, categories and functors, tensor products, and singular homology. Succeeding chapters discuss Hom and ?; projectives, injectives, and flats; specific rings; extensions of groups; homology; Ext; Tor; son of specific rings; the return of cohomology of groups; and spectral sequences, such as bicomplexes, Kunneth Theorems, and Grothendieck Spectral Sequences. This book will be of interest to practitioners in the field of pure and applied mathematics.

Graduate mathematics students will find this book an easy-to-follow, step-by-step guide to the subject. Rotman’s book gives a treatment of homological algebra which approaches the subject in terms of its origins in algebraic topology. In this new edition the book has been updated and revised throughout and new material on sheaves and cup products has been added. The author has also included material about homotopical algebra, alias K-theory. Learning homological algebra is a two-stage affair. First, one must learn the language of Ext and Tor. Second, one must be able to compute these things with spectral sequences. Here is a work that combines the two.

This modern approach to homological algebra by two leading writers in the field is based on the systematic use of the language and ideas of derived categories and derived functors. It describes relations with standard cohomology theory and provides complete proofs. Coverage also presents basic concepts and results of homotopical algebra. This second edition contains numerous corrections.