Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 colimKX finite subcomplexhn(K,KA)hn(X,A) is an isomorphism for every integer n. (Finite dimensional axiomatic homology has finite subcomplex support)

[F3]

Let η:hk be an existing morphism of ordinary theories, natural on CW pairs and commuting with connecting maps. For a CW skeleton stage Fr1Fr, if ηq(Fr1) and ηq(Fr,Fr1) are isomorphisms for every q, then ηq(Fr) is an isomorphism for every q. (A comparison isomorphism propagates over one skeleton stage)

Proof

1.1

F1 constructs the normalized comparison on every finite CW pair and makes it natural for inclusions of finite subcomplex pairs. By F2, take the colimit of these maps over all finite KX to define an isomorphism on a finite-dimensional pair (X,A). Its inverse is the colimit of the inverse comparisons.

F1F2
2.1

Every finite K is compact, so a continuous map f:(X,A)(Y,B) carries K into a finite subcomplex MY by compact-cell support as used in F2. The restricted map (K,KA)(M,MB) is a map of finite pairs. Naturality there, followed by the two colimit maps, gives naturality on the class represented in K. Every class has such a representative, proving naturality for all continuous maps.

F1F2step 1.1
3.1

The boundary of a class supported on K is supported on KA, and F1 makes the boundary square commute on that finite pair. Therefore it commutes on the colimit. Any other normalized natural morphism agrees on every finite pair by F1, and hence on every class by F2. At a point its component remains u. The one-stage five-lemma principle F3 also propagates invertibility of this already constructed morphism through each finite skeletal stage; it is not needed to invent the comparison maps.

F1F2F3step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

13 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