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.
Ordinary cohomology does not give noncompact Poincaré duality
Statement
Let and let be a nonzero commutative unital ring. Then Consequently ordinary cohomology cannot replace compactly supported cohomology in noncompact Poincaré duality. The counterexample calculation is choice-free. Under AC, the correct compact-support cap map for the standard orientation is sending a class normalized to evaluate as on the oriented supported class to the positive point class.
Facts & Assumptions
Cap duality on a Euclidean coordinate ball proves this normalized compact-support cap isomorphism, with AC only in its local universal-coefficient argument.
Contractible nonempty spaces have the homology of a point gives the homology of a point for nonempty contractible spaces.
Singular cohomology with coefficients defines cohomology and in particular , with no degree-zero coboundaries.
Singular cochain complex with coefficients identifies zero-cochains with functions on points and gives .
The Axiom of Choice is assumed only for the positive compact-support conclusion through [F1].
Proof
Given: , as in the statement, and with its standard coordinate orientation.
For any , the straight path joins them. By [F4], a degree-zero cocycle must satisfy , so it is constant. Conversely a constant function has zero endpoint difference on every path, so is a cocycle. There are no degree-zero coboundaries by [F3]. Evaluation at and the assignment of the constant function with value are inverse -linear maps between and . In particular the constant cocycle represents a nonzero class because .
The homotopy contracts nonempty to its origin, so [F2] identifies its homology with that of a point. At a point there is one singular simplex in each degree, and its boundary in degree is multiplication by , equal to for even and for odd . Therefore every positive-degree kernel equals the next boundary image, and for , while . Since , this proves and , the latter with the origin's point class as generator.
An isomorphism cannot exist: by step 1.1 its domain contains the nonzero constant class , while by step 1.2 every element of its codomain is zero, so every homomorphism has that nonzero class in its kernel. This is precisely the degree-zero failure of the proposed replacement of by in dimension . The straight-path and point-chain computations used no AC.
Assume now [F5]. The space is the oriented Euclidean coordinate ball of [F1], which therefore supplies for and the stated normalized cap isomorphism in degree . In particular since , so the correct degree-zero duality is , consistent with step 1.2. In degree , evaluation equal to on the oriented relative class maps to the origin's generator of by [F1]. The AC use is the freeness/projection and free-comparison-lift selections in that lemma's local UCT proof; it is not needed for step 2.1.
The hypotheses exclude both and for a reason: at the space is a point and both ordinary degree-zero groups equal ; over the zero ring both groups in the claimed mismatch are zero. The chosen witness space is nonempty, with the specified origin, and is already a counterexample with the same contraction. The contraction has endpoints the identity and the constant map; the straight paths have their stated endpoints. The point-chain calculation includes degenerate simplices in every positive degree. No infinite selection of points, paths or cocycle representatives is used: all paths and the constant cocycles are given by formulas.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
23 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, Theorem 3.35 (standard reference, not scraped)