Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Topological universal coefficient short exact sequence for cohomology

Statement

Assume AC. For every space X, abelian group G and n0 there is a natural short exact sequence 0ExtZ1(Hn1(X;Z),G)ιHn(X;G)βHomZ(Hn(X;Z),G)0. The same assertion holds with (X,A) in every homology and cohomology term for any subspace AX. Here H1=0 and Ext is computed from projective resolutions of the first variable, with the comparison identifications proved in the local extension lemma. The map β is evaluation. Naturality is contravariant in continuous maps of spaces or pairs and covariant in coefficient homomorphisms.

Facts & Assumptions

[F1]

Singular UCT extension from cycle projections proves the natural exact evaluation sequence for nonnegative free PID complexes, including comparison independence and degree zero, under AC as in The Axiom of Choice.

[F2]

Singular cochain complex with coefficients identifies cochains with Hom on integral singular chains, free on the singular simplex set. Singular cohomology with coefficients takes their cohomology.

[F3]

Relative singular cochain complex gives Hom on the relative quotient complex and its complementary simplex basis.

Proof

Given: X,A,G,n as stated, and AC.

1.1

The absolute integral singular complex is nonnegative and free in every degree by [F2]. The ring Z is a PID. Applying [F1] gives the displayed short exact sequence, with its middle group identified as Hn(X;G) by [F2]. On a cycle c, the right map sends [φ] to ([c]φ(c)), so it is precisely the Kronecker evaluation of [F4].

F1F2F4given
1.2

For the pair, the relative chain group is freely generated by those singular simplices of X whose image is not contained in A: discard the coefficients on simplices in A from a finite chain. Equality of the resulting complementary coefficients is exactly equality modulo chains in A. This basis identification is degreewise; its differential is the induced quotient differential, which need not preserve zero extensions. Thus [F3] supplies a nonnegative free complex whose Hom cohomology is Hn(X,A;G). Apply [F1] to it. Evaluation on relative cycles descends by the same calculation in [F1], so no absolute cycle lift is required.

F1F3given
2.1

A continuous pair map f:(X,A)(Y,B) sends a simplex in A to a simplex in B, so the absolute chain map of [F4] descends to relative quotients and still commutes with boundaries. Its Hom pullback is exactly relative cochain precomposition. Hence chain naturality in [F1] proves the commuting short-exact-sequence diagram for pairs, as well as for absolute maps. Coefficient postcomposition is the coefficient map in both Hom complexes and in the displayed Ext cokernels, so coefficient naturality in [F1] gives the second type of commuting diagram. These assertions concern canonical evaluation and extension maps, independent of projections used to prove surjectivity.

F1F2F3F4step 1.1step 1.2
3.1

At n=0, the left Ext group is zero by [F1] and evaluation is an isomorphism. For A=, step 1.2 reproduces step 1.1; for A=X, all relative chain groups and all terms of the sequence are zero. Empty X and G=0 are included. On a point, the degree-zero evaluation sends a cochain value g to the homomorphism mmg. AC is inherited from [F1] for arbitrary-rank cycle/boundary freeness and projections, while the complementary simplex basis and the naturality maps require no additional choices. This proves every assertion.

F1F2F3step 1.1step 1.2step 2.1

Depends on

Used by

Dependency tree · two levels

22 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