Čech type approach to computing homology of maps (Q603858): Difference between revisions

The article is devoted to the new types of algorithms dealing with computing homology of spaces and maps as well as to the research of various properties. The approach the author presents is based on a combinatorial version of a Čech homology and the Nerve theorem. The main result of the article is the algorithm for computing the homology of continuous maps. The Mayer-Vietoris theorem for Čech structures is thoroughly presented. The author constructs the chain map between the chain complex of a Čech structure and the singular chain complex. The author shows that the homologies of all Čech structures of a given Čech polyhedron are the so-called connected simple system. We present some of major results. Theorem 4.1. Let \(\chi\) be a Čech structure. There is a well defined chain map \(\varphi^\chi:C_\#(\chi)\to C_\#(|\chi|)\) which induces an isomorphism of the homology \(H_*(|\chi|)\) of the Čech structure \(\chi\) and the singular homology \(H_*(|\chi|)\) of the support of \(\chi\). Theorem 11.3. Let \(\chi\) be a Čech structure. Then the map \(\varphi^\chi:C_\#(\chi)\to C_\#(|\chi|)\) induces an isomorphism in homology.