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.
Singular cohomology satisfies the Eilenberg Steenrod cohomology axioms
Statement
For every abelian group , singular cohomology has functorial pair sequences, homotopy invariance for maps of pairs, pair exactness and excision. It satisfies the dimension axiom and for . Assuming AC for arbitrary-index additivity, the inclusions induce an isomorphism for every set-indexed family of spaces. Finite additivity and the other stated axioms need no AC. These are additive cohomology axioms; multiplication is additional structure.
Facts & Assumptions
Homotopic maps induce equal maps in singular cohomology proves absolute homotopy invariance. Long exact sequence of a pair in singular cohomology, Naturality of the singular cohomology pair sequence and Excision for singular cohomology prove pair exactness, functoriality and excision, choice-free.
The prism operator of a homotopy gives every prism simplex as a composite through the specified homotopy. The singular chain homotopy formula gives in all nonnegative degrees. Relative singular cochain complex identifies relative cochains with Hom on the quotient chains.
Singular cochain complex with coefficients gives the positive coboundary and arbitrary simplex-function description.
Every path-connected space is connected, and every path component lies inside a component includes connectedness of . The Axiom of Choice supplies arbitrary simultaneous selections; Every natural-number-indexed list of nonempty sets has a choice function on its family of values supplies finite selections without AC.
Proof
Given: , spaces and pairs as stated. AC is assumed only in steps concerning arbitrary families of representatives or primitives.
Let be a homotopy of pair maps. If a singular simplex has image in , every prism simplex in [F2] has image in because . Thus descends to a degree-one map on relative chains, and its identity descends to . Precomposing relative cochains with gives for and . Direct composition yields , with the first term zero in degree zero. On a cocycle the difference is a coboundary, proving relative homotopy invariance. Absolute invariance and all pair exactness/naturality and excision assertions are those of [F1], with the same actual restriction and connecting maps.
There is exactly one singular simplex of a point in every degree . Its boundary for is , equal to for even and zero for odd . Hence its cochain group is in every nonnegative degree, and is zero for even and identity for odd . At the kernel is all of and there are no incoming coboundaries. At odd positive the kernel is zero; at even positive the incoming image is all of . Negative cochain groups are zero. These calculations prove the dimension axiom for arbitrary without removing degenerate simplices.
Put . Every simplex lies in exactly one summand. Indeed its first vertex lies in one , and a straight segment from that vertex to any other point of gives a path whose image cannot leave : otherwise the inverse images of the clopen summand and its complement would separate the connected interval of [F4]. Thus the simplex sets form the disjoint union of the summand simplex sets. A cochain on is therefore exactly a tuple of arbitrary cochains on the , by restriction and combination of their functions. Faces remain in the same summand, so this identifies the cochain complex with the product complex, with coordinatewise differential.
For this product complex, a tuple is closed exactly when every coordinate is closed. Sending its class to the tuple of coordinate classes defines the displayed map and is additive. If its image is zero, each coordinate cocycle is a coboundary. When , AC selects a primitive with from each nonempty primitive set; then the tuple is a cochain and . At , there are no incoming boundaries, so every is already zero and . This proves injectivity. Given any tuple of cohomology classes, AC selects one cocycle representative from each nonempty class; the combined tuple is closed and maps to those classes, proving surjectivity. All selections are from sets indexed by the given set .
The isomorphism in step 2.1 is induced by the summand inclusions because step 1.3 defined it by restrictions, so its map is canonical despite the choices used to show bijectivity. For finite the two selections in step 2.1 use only finite choice from [F4]. For empty , both the cochain groups of the empty space and the empty product of abelian groups are zero; the same map is the unique isomorphism. For one index it is the identity. Zero coefficients, empty summands and zero cohomology degrees cause no exception. Together with steps 1.1 and 1.2, this proves the stated axioms and their exact choice boundary, without asserting any multiplication axiom.
Depends on
- Homotopic maps induce equal maps in singular cohomology
- Long exact sequence of a pair in singular cohomology
- Naturality of the singular cohomology pair sequence
- Excision for singular cohomology
- The Axiom of Choice
- Singular cochain complex with coefficients
- Relative singular cochain complex
- The prism operator of a homotopy
- The singular chain homotopy formula
- Every path-connected space is connected, and every path component lies inside a component
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
38 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
- Hatcher, Cohomology Axioms, printed page 202; Miller section27 printed page75 (standard reference, not scraped)