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.
Functoriality with coefficient morphisms
Statement
Let be a map of pairs.
- A coefficient morphism induces
- A coefficient morphism induces
At a fixed space, both theories are covariant in coefficient morphisms. These maps preserve identities and composition. If is a homotopy of pair maps, transport along gives ; the homology maps agree when , and the cohomology maps agree when .
Facts & Assumptions
Given: The map, local systems, and correctly directed coefficient morphism in the relevant clause.
Homology and cohomology with local coefficients uses intrinsic local chains with coefficients at the first vertex and intrinsic local cochains with values at the first vertex.
Local systems and pullback gives pullback transports and the naturality equation for coefficient morphisms.
Proof
Define . On the exceptional zeroth face, [F2] says ; all other faces use the same first vertex. Hence this is a chain map and carries the subcomplex on into that on , so [F1] gives the asserted .
For a cochain on , define . The same naturality square, inverted on the exceptional face, makes this commute with coboundary. It preserves the relative kernel because , and hence induces the asserted . Taking proves covariance in a coefficient morphism for both theories.
Substitution in the two displayed chain-level formulas proves the identity laws. For composable maps , the homology coefficient morphism is , and the cohomology coefficient morphism is the reverse composite; componentwise substitution proves the composition laws without a basepoint or lift choice.
For a homotopy , define . A path square shows by its two boundary routes that these components satisfy the naturality equation, so is a coefficient isomorphism. Triangulate each prism as in the ordinary prism operator and transport the coefficient from its initial first vertex along the corresponding prism edge. The usual oriented-prism cancellation is unchanged; the only new comparisons are transports along the two boundary routes of a triangular face, and those are equal because the face supplies an endpoint-fixed homotopy. Thus the resulting satisfies when .
Precomposing a local cochain with the prism operator and applying the coefficient map in the reverse direction gives a cochain homotopy when . Chain- or cochain-homotopic maps induce equal maps on (co)homology by applying the identity to cycles/cocycles and observing that the difference is a boundary/coboundary. This proves the homotopy clauses. Empty pairs, zero systems, degree zero, degenerate simplices, and constant homotopies obey the same formulas, and no AC is used.
Depends on
Used by
- Compactly supported cohomology with local coefficients Definition
- Canonical twisted fundamental classes over compact subsets Lemma
- Cellular cochains compute cohomology with local coefficients Theorem
- Pair exact sequences with local coefficients Theorem
- Poincare duality with the orientation local system Theorem
- Poincare–Lefschetz duality with local coefficients Theorem
Dependency tree · two levels
8 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
- Davis and Kirk, Lecture Notes in Algebraic Topology, Chapter 5 §4, pp.105–109 (standard reference, not scraped)