In algebraic topology, a branch of mathematics, the excision theorem is a theorem about relative homology and one of the Eilenberg–Steenrod axioms. Given a topological space and subspaces and such that is also a subspace of , the theorem says that under certain circumstances, we can cut out (excise) from both spaces such that the relative homologies of the pairs into are isomorphic. This assists in computation of singular homology groups, as sometimes after excising an appropriately chosen subspace we obtain something easier to compute. If are as above, we say that can be excised if the inclusion map of the pair into induces an isomorphism on the relative homologies: The theorem states that if the closure of is contained in the interior of , then can be excised. Often, subspaces that do not satisfy this containment criterion still can be excised—it suffices to be able to find a deformation retract of the subspaces onto subspaces that do satisfy it. The proof of the excision theorem is quite intuitive, though the details are rather involved. The idea is to subdivide the simplices in a relative cycle in to get another chain consisting of "smaller" simplices, and continuing the process until each simplex in the chain lies entirely in the interior of or the interior of . Since these form an open cover for and simplices are compact, we can eventually do this in a finite number of steps. This process leaves the original homology class of the chain unchanged (this says the subdivision operator is chain homotopic to the identity map on homology). In the relative homology , then, this says all the terms contained entirely in the interior of can be dropped without affecting the homology class of the cycle. This allows us to show that the inclusion map is an isomorphism, as each relative cycle is equivalent to one that avoids entirely. The excision theorem is taken to be one of the Eilenberg–Steenrod Axioms. The Mayer–Vietoris sequence may be derived with a combination of excision theorem and the long-exact sequence.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.