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.
The universal coefficient theorem for cohomology over a PID
Statement
Assume the Axiom of Choice. Let be a PID, a chain complex of free -modules, and an -module. Then naturally is exact.
Proof
Given: the free PID-complex , the evaluation map, and the cycle-boundary sequences.
By the boundary-and-cycle lemma under Choice, is free and therefore projective. Hence splits. Every map pulls back to a map vanishing on and extends across a chosen projection to a cocycle. Thus is surjective.
A cocycle lies in exactly when its restriction to vanishes modulo . Subtracting a representative that is zero on shows that the kernel is Applying to the free presentation identifies this quotient with . The inclusion is the extension map of the preceding lemma, and all constructions before the optional splitting are natural, proving the exact sequence.
Depends on
Used by
- Cohomology over a field is dual to homology for finite-dimensional complexes Corollary
- Cohomology with a divisible abelian coefficient group is Hom of homology Corollary
- Universal-coefficient cohomology of a two-term free complex Example
- The homological and cohomological UCT correction terms are not reversed False statement
- The cohomology universal-coefficient sequence splits nonnaturally Theorem
- Universal coefficients in degree two 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
- Weibel, An Introduction to Homological Algebra (standard reference, not scraped)