Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Existence and homotopy uniqueness of Eilenberg--Mac Lane spaces

Statement

Assume AC. Every group G has a connected CW model K(G,1). For every abelian group A and every n2, there is a connected CW model K(A,n). If two models carry identifications with the same group, they are homotopy equivalent by maps inducing the prescribed identification (with the usual basepoint transport in degree one).

Facts & Assumptions

[F1]

Van Kampen computes the fundamental group of a presentation 2-complex (Seifert–van Kampen identifies the fundamental group with a group pushout).

[F2]

For n2, the wedge aASan is (n1)-connected and its πn is the free abelian group Z(A) on the sphere inclusions (The first potentially nonzero homotopy group of a wedge of higher spheres has its cell basis).

[F3]

Attaching cells of dimension r+1 does not change πi for i<r (High relative cells do not change lower homotopy); relative Hurewicz and the exact sequence identify the selected attaching classes and kill the generated πr (Relative Hurewicz theorem in the simple-connectivity range).

[F4]

Every sphere map, disk map, or homotopy into a CW union has image in a finite subcomplex and hence occurs at a finite construction stage (Each homotopy representative is supported on a finite CW subcomplex).

[F5]

A weak equivalence between CW complexes is a homotopy equivalence under AC (Whitehead theorem).

[A1]

AC selects simultaneous representatives, nullhomotopies, and attaching maps indexed by arbitrary sets (The Axiom of Choice).

Proof

Given: G, or A and n2, together with [A1].

1.1

For G, begin with a wedge W of one oriented circle xg for every gG. Attach a 2-cell along the word xgxhxgh1 for every ordered pair (g,h). By [F1], the resulting complex Q2 has presentation

F1

xg (gG)xgxh=xgh (g,hG).

Sending xg to g defines a surjective homomorphism to G. Conversely g[xg] is a homomorphism by the relations and is inverse to it; the relation with g=h=1 also forces x1=1. Thus π1(Q2)G. [F1]

1.2

Now let n2. Put W=aASan. By [F2], πn(W)=Z(A). Let ϵ:Z(A)A send the basis vector ea to a. Choose a sphere representative for every element of kerϵ and attach an (n+1)-cell along it, obtaining Qn+1. The pair (Qn+1,W) is n-connected and W is simply connected. Relative Hurewicz identifies its relative πn+1 with the free relative cell group, and the boundary map sends each cell generator to its attaching class. Exactness therefore gives

A1F2F3

πn(Qn+1)Z(A)/kerϵA.

No lower positive homotopy group appears by [F3]. [A1, F2, F3]

2.1

Starting from the degree-one presentation in Step 1.1, inductively choose one based map SrQr representing every element of πr(Qr) and attach an (r+1)-cell along each, for r2. The relative exact sequence makes πr(Qr)πr(Qr+1) zero and surjective, hence πr(Qr+1)=0, while [F3] preserves all lower groups. Put Q=r2Qr. For fixed i>1, later cells do not recreate πi. By [F4], every representative and nullhomotopy in Q occurs at a finite stage; consequently π1(Q)=G and πi(Q)=0 for i>1. Thus Q is a K(G,1).

A1F3F4step 1.1
3.1

Starting from the degree-n complex in Step 1.2, attach one (r+1)-cell along a representative of every element of πr at the current stage, beginning with r=n+1. The argument of Step 2.1, now preserving πn=A, kills each higher group successively. The increasing union Q has πn(Q)=A and every other positive homotopy group zero by [F4]. This is a K(A,n).

A1F3F4step 1.2step 2.1
3.2

Let K be any other degree-one model with the same identified group. From the completed model in Step 2.1, map each circle xg to a based loop representing the corresponding gπ1(K). Each multiplication relator maps to a nullhomotopic loop, so choose fillings of the 2-cells. Every higher attaching sphere maps trivially because πr(K)=0 for r>1, and induction extends the map to u:QK. It induces the prescribed isomorphism on π1.

A1F1step 2.1
4.1

For a degree-n model K, begin with the completed model in Step 3.1 and map the sphere indexed by a to a representative of the corresponding element of πn(K). Every attaching map indexed by kerϵ becomes nullhomotopic, so the map extends over the (n+1)-cells. All later attaching maps extend because the corresponding higher homotopy groups of K vanish. The resulting u:QK induces the prescribed isomorphism on πn.

A1step 3.1
5.1

In either case, Q and K are connected, u is an isomorphism on their sole possibly nonzero positive homotopy group, and all their other positive homotopy groups vanish. Thus u is a weak equivalence. By [F5], it is a homotopy equivalence. Applying Steps 3.2 and 4.1 to two models gives a zigzag of homotopy equivalences through Q; choosing a homotopy inverse for one leg gives a homotopy equivalence between the models. Its induced group map is the prescribed identification, with the basepoint track supplying the standard conjugacy transport when n=1.

A1F5step 3.2step 4.1
6.1

The construction also covers the trivial group. In that case the resulting connected CW complex has every positive homotopy group zero, and its map to a point is a weak equivalence, hence a homotopy equivalence by [F5]. No countability, finite generation, or finite-dimensionality has been assumed. Every infinite selection is accounted for by [A1], while the passage to the union uses the individual compact-support statement [F4], not an unproved interchange of homotopy groups with an arbitrary colimit.

A1F4F5step 2.1step 3.1step 5.1

Depends on

Used by

Dependency tree · two levels

47 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources