Hurewicz theorem

From Wikipedia, the free encyclopedia

In mathematics, the Hurewicz theorem is a basic result of algebraic topology, connecting homotopy theory with homology theory via a map known as the Hurewicz homomorphism. The theorem is due to Witold Hurewicz.

For any n-connected CW-complex or Kan complex X and integer k ≥ 1 such that n ≥ 0, there exists a homomorphism

h_*: \pi_k(X) \rightarrow \tilde{H}_k(X)

called the Hurewicz homomorphism from homotopy to reduced homology (with integer coefficients), which turns out to be isomorphic to the canonical abelianization map

\pi_1(X) \rightarrow \pi_1(X)/[\pi_1(X), \pi_1(X)]\,

if k = 1. The Hurewicz theorem states that under the above conditions, the Hurewicz map is an isomorphism if kn and an epimorphism if k = n + 1.

In particular, if the first homotopy group (the fundamental group) is nonabelian, this theorem says that its abelianization is isomorphic to the first reduced homology group:

\pi_1(X)/[\pi_1(X), \pi_1(X)] \cong \tilde{H}_1(X).

The first reduced homology group therefore vanishes if π1 is perfect and X is connected.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.