Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (gpt-6-sol)
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 steenrod uniqueness on finite dimensional cw pairs

Statement

For ordinary homology theories h,k and a specified isomorphism u:h0(∗)→k0(∗), there is a unique boundary-compatible natural equivalence on finite-dimensional CW pairs normalized by u. Infinitely many cells in bounded dimensions are allowed.

Facts & Assumptions

Given: The objects and hypotheses in the statement above.

[F1]

For ordinary homology theories h,k and a specified isomorphism u:h0(∗)→k0(∗), there is a unique natural equivalence on finite CW pairs normalized by u and commuting with connecting homomorphisms. (Coefficient comparison on finite cw pairs)

[F2]

For a finite-dimensional CW pair (X,A) and ordinary h, the canonical map colim⁡K⊂X finite subcomplex hn(K,K∩A)⟶hn(X,A) is an isomorphism for every integer n. (Finite dimensional axiomatic homology has finite subcomplex support)

[F3]

A continuous image of a compact space in a CW complex lies in a finite CW subcomplex, without a choice premise (Compact CW images have finite cell support without choice).

Proof

1.1F1F2

For every finite subcomplex K⊂X, the intersection K∩A is a finite subcomplex, so F1 gives a comparison hn(K,K∩A)→kn(K,K∩A). Naturality for inclusions makes these maps a morphism of directed systems. F2 for h and k identifies their colimits with the respective groups on (X,A), and hence defines the required isomorphism there. This uses only finite chains of cells to represent a class, not a chosen exhaustion of X.

2.1F1F2F3step 1.1

Every finite K is compact, so a continuous map f:(X,A)→(Y,B) carries K into some finite subcomplex M⊂Y by F3. Since f(K∩A)⊂M∩B, the restriction is a map of finite CW pairs (K,K∩A)→(M,M∩B). F1 makes its comparison square commute. Every class on (X,A) comes from some such K by F2, proving naturality for the original continuous map. A different choice of M gives the same result after inclusion into the finite union of the two choices.

3.1F1F2step 1.1step 2.1∎

The boundary of a class supported on K is supported on K∩A, and F1 makes the boundary square commute there. The pairs (K∩A,∅) are cofinal among finite subcomplex pairs of (A,∅), because any finite subcomplex of A can itself serve as K. Thus the boundary square commutes after passing to the colimits. Any other normalized boundary-compatible natural morphism agrees with this one on every finite pair by F1, and every class of a finite-dimensional pair comes from a finite pair by F2; hence that morphism agrees everywhere. On a point the construction is u.

Depends on

Used by

Dependency tree · two levels

17 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