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.

Eilenberg--Mac Lane spaces represent singular cohomology

Statement

Assume AC. Let A be an abelian group, n1, and let K=K(A,n) be a based CW model with its specified isomorphism πn(K)A. There is a unique fundamental class

ιHn(K;A)

whose Kronecker evaluation corresponds to idA under Hurewicz. For every based CW complex (X,x0) whose basepoint is a vertex, pullback gives a natural bijection

[X,K]  H~n(X;A),[f]fι,

where H~n(X;A)=Hn(X,{x0};A). Since n>0, the map from relative to absolute cohomology identifies this group with Hn(X;A) whenever X is connected, and in fact componentwise for every nonempty X.

Facts & Assumptions

[F1]

Hurewicz gives Hn(K;Z)A: in degree one it is abelianization, and in degrees at least two it is the first-nonzero-degree isomorphism (Absolute Hurewicz theorem at the first nonzero degree).

[F2]

The UCT gives the evaluation map and its Ext kernel (Topological universal coefficient short exact sequence for cohomology); here it is an isomorphism because Hn1(K)=0 for n>1, while for n=1 its Ext term is Ext1(Z,A)=0.

[F3]

Cellular cochains compute singular cohomology, naturally and with the same orientation and local-coefficient incidence rules (Cellular cochains compute cohomology with local coefficients).

[F4]

A K(A,n) has exactly the homotopy groups specified in its definition (Eilenberg--Mac Lane space), so the obstruction groups outside degree n vanish and the coefficient action is simple.

[F5]

Difference classes classify the first possible homotopy obstruction in degree n (Difference cochains classify homotopies of extensions in the stable stage).

[A1]

AC selects representatives and fillers over arbitrary cell families (The Axiom of Choice).

Proof

Given: A,n,K,X,x0 and [A1] as in the statement.

1.1

By [F1], identify Hn(K) with A. In the UCT exact sequence, the group to the left of evaluation vanishes for the reasons in [F2]. Therefore evaluation is an isomorphism, and there is a unique class ι satisfying

F1F2

ι,h(u)=u(uπn(K)A).

This defines the fundamental class without choosing a cocycle representative. [F1, F2]

1.2

For a based map f:XK, let Ψ(f) be the primary difference class from f to the constant map, relative to x0. All lower obstructions vanish by [F4], so the required prior-stage homotopy exists. The difference theorem makes Ψ(f) independent of that homotopy and of the cellular choices and makes it invariant under based homotopy.

F4F5
2.1

For the classes defined in Step 1.2, concatenate a lower-stage homotopy from f to the constant map with the reverse of one from g to the constant map. On each oriented n-cell, the resulting difference sphere splits along its equator into the sphere for f and the oppositely oriented sphere for g. Hence, first as cochains and then as classes,

F5step 1.2

[d(f,g)]=Ψ(f)Ψ(g).

[F5, step 1.2]

2.2

To realize values of Ψ from Step 1.2, let c be a relative cellular n-cocycle representing an arbitrary class in H~n(X;A) under [F3]. Collapse Xn1 and, on the sphere belonging to each relative n-cell e, choose a based map to K representing c(e)A=πn(K). The CW wedge mapping property gives a map on Xn/Xn1. Its obstruction on an (n+1)-cell is exactly (δc)(en+1)=0, so choose nullhomotopies and extend it over Xn+1/Xn1.

A1F3step 1.2
2.3

The construction of Ψ in Step 1.2 is natural for a cellular based map: its value on a source cell is obtained by evaluating the target cochain on the induced cellular chain. Cellular approximation and [F3] therefore give Ψ(fu)=uΨ(f) for every based CW map u.

F3step 1.2
3.1

Extend the map begun in Step 2.2: every later attaching obstruction lies in πr(K)=0 for r>n. Inductively choose fillers and glue them to a based map f:XK, constant on Xn1. By construction, its difference cochain from the constant map is c, so Ψ(f)=[c]. Thus Ψ:[X,K]H~n(X;A) is surjective.

A1F4step 2.2
3.2

If Ψ(f)=Ψ(g), Step 2.1 gives [d(f,g)]=0. By [F5], f and g are homotopic rel x0 through Xn. Every obstruction to extending this homotopy across higher prism cells has coefficient πr(K) with r>n and hence vanishes by [F4]. Induction and [A1] give a based homotopy on all of X. Thus Ψ is injective.

A1F4F5step 2.1
3.3

Apply the natural transformation of Step 2.3 to the identity of K. Choose its lower-skeleton homotopy to the constant map. On a relative Hurewicz n-cell generator, the difference sphere is the characteristic sphere on one hemisphere and constant on the other, so its class is the same element uπn(K). Consequently

F1F3step 2.3

Ψ(idK),h(u)=u.

The uniqueness in Step 1.1 gives Ψ(idK)=ι. By naturality, [F1, step 1.1, step 2.3]

Ψ(f)=fΨ(idK)=fι.

[F1, F3, step 1.1, step 2.3]

4.1

Steps 3.1--3.3 prove the displayed natural bijection. The long exact sequence of (X,{x0}) identifies relative and ordinary cohomology in every positive degree: in degree one the map H0(X;A)H0({x0};A) is surjective, and in higher degrees the point groups on both sides vanish. This proves the final convention. The point, empty relative cell sets, A=0, and disconnected X are covered componentwise. All arbitrary simultaneous choices occur only in Steps 2.2--3.2 and are covered by [A1].

A1step 3.1step 3.2step 3.3

Depends on

Used by

Dependency tree · two levels

46 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