Math 2.0

Algebraic topology Definition

Eilenberg–MacLane space

Builds on GroupAbelian groupPath-connected spaceHomotopy group

Definition

Let n≥1n \ge 1 and let GG be a group, abelian if n≥2n \ge 2. An Eilenberg–MacLane space of type K(G,n)K(G, n) is a path-connected space XX with base point x0x_0 such that πn(X,x0)≅Gandπk(X,x0)=0 for all k≠n, k≥1,\pi_n(X, x_0) \cong G \quad \text{and} \quad \pi_k(X, x_0) = 0 \text{ for all } k \ne n, \ k \ge 1, where πk\pi_k is the kk-th homotopy group.

Remarks

The condition that GG be abelian for n≥2n \ge 2 is needed, since πn\pi_n is abelian for n≥2n \ge 2. For every such GG and nn there is a CW complex of type K(G,n)K(G, n), and any two CW complexes of type K(G,n)K(G, n) are homotopy equivalent. One often writes K(G,n)K(G, n) for any such CW complex.

Example: the circle S1S^1 is a K(ℤ,1)K(\Z, 1). It is path-connected, π1(S1)≅ℤ\pi_1(S^1) \cong \Z, and πk(S1)=0\pi_k(S^1) = 0 for k≥2k \ge 2 because its universal cover ℝ\R is contractible.

Non-example: the sphere S2S^2 is path-connected with π2(S2)≅ℤ\pi_2(S^2) \cong \Z and π1(S2)=0\pi_1(S^2) = 0, but π3(S2)≅ℤ\pi_3(S^2) \cong \Z, so it is not a K(ℤ,2)K(\Z, 2).

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Abelian group concept
  2. Group concept
  3. Homotopy group concept
  4. Path-connected space concept
  5. Eilenberg–MacLane space definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Eilenberg–MacLane_space
About this page
TagWAS9NHKMYD
URIm2://WAS9NHKMYD
Kinddefinition
WritingW0 stub
MSC55P20
DefinesEilenberg–MacLane space
UsesGroup, Abelian group, Path-connected space, Homotopy group
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.