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.
Cap duality passes to increasing open unions
Statement
Let be an -oriented boundaryless -manifold with open, oriented by restriction; is commutative unital. The open-extension and inclusion maps induce canonical isomorphisms Under them is the colimit of the maps . If every is an isomorphism in every degree, so is . This implication and both colimit identifications are choice-free; any assumptions needed to prove the stage isomorphisms remain assumptions when they are invoked.
Facts & Assumptions
Compactly supported singular cohomology gives explicit representatives, equality at a common larger compact support, and the colimit universal property.
Cap product and the Mayer–Vietoris duality ladder constructs extension under every open inclusion by support excision and proves for open.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line makes each standard simplex compact, since it is a closed bounded subset of a finite-dimensional Euclidean space.
Proof
Given: The increasing open sets and coefficients of the statement. For any sequential system of modules, its colimit can be constructed from pairs , with exactly when their images agree at some . Reflexivity, symmetry and transitivity follow using maxima of finitely many indices. Addition is performed after moving to a common stage; independence and the module laws follow at a common larger stage. A compatible family of homomorphisms defines a unique map on these classes. This is the same representative construction as [F1], here with index set the positive integers.
Every compact lies in one . The cover by the increasing opens has a finite subcover on , and the maximum index of this subcover suffices. If is empty any index suffices. A finite singular chain has compact image support: each of its finitely many simplex images is compact by [F3] and the continuous-image cover argument, and a finite union of compact sets is compact by taking the union of their finite subcovers. Thus every finite chain in lies in one . The same statement applies simultaneously to finitely many chains.
The extension maps [F2] define a map from the sequential colimit of to . A target class is represented on a compact support by [F1]. By step 1.1 take ; support excision identifies its relative group with the one inside , so the class is in the image. If a stage class maps to zero, represent it at compact . By [F1] it becomes zero in the ambient relative group at some larger compact . Take with by step 1.1. The support-excision isomorphisms of [F2] identify this vanishing with vanishing at support inside . Hence the original stage class is zero in the sequential colimit. This proves bijectivity and also identifies the map with the canonical support-extension map.
Inclusion of singular chains defines the homology colimit map. Every target homology class has a finite cycle representative lying in some by step 1.1, so the map is onto. If a stage cycle becomes zero in , it is the boundary of one finite chain in . A later contains that chain and the original stage, so the class becomes zero there. Thus the map is injective by the sequential common-stage criterion. This proves the second isomorphism without asserting that an exactness theorem commutes with homology. In negative degrees all these groups are zero by the singular-chain convention.
The square for each open inclusion commutes by [F2]. Consequently the canonical maps in steps 2.1 and 2.2 intertwine the colimit of the with : evaluate the square on a representative from any stage, and every colimit class is such a representative. If the stage duality maps are all bijective, their induced colimit map is onto since a homology representative at stage has a preimage under that particular . It is injective since if becomes zero at a later stage , commutativity gives , whence by injectivity there. The original class is zero in the colimit.
The arguments include repeated or empty stages, an empty union, zero coefficients and zero classes. If a stage is already all of , the colimits agree with that eventual constant system by the same common-stage relation. Point spaces use finite zero-chains and their ordinary boundaries. At the target is and the finite boundary-witness argument remains valid; at or the respective group is zero and the argument still applies. Degenerate simplices have compact domains too. Only a finite subcover, a maximum index, and a representative or preimage for one given class were used. There is no simultaneous selection of stage inverses or representatives, so no new AC assumption is introduced.
Depends on
- Compactly supported singular cohomology
- Cap product and the Mayer–Vietoris duality ladder
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
Used by
Dependency tree · two levels
43 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, Algebraic Topology, proof of Theorem 3.35, increasing-union step (B), p.248 (standard reference, not scraped)