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.
Integral cohomology detects adjacent homology torsion
Statement
Assume AC. Let and suppose and are finitely generated, with . The torsion subgroup of is abstractly isomorphic to the torsion subgroup of , and its free rank equals the rank of . No canonical identification of the two finite torsion groups is asserted.
Facts & Assumptions
Topological universal coefficient short exact sequence for cohomology and The cohomology universal coefficient sequence splits nonnaturally identify cohomology abstractly with the direct sum of its Hom and Ext terms under The Axiom of Choice.
The fundamental theorem of finitely generated abelian groups from PID modules supplies a finite direct sum of copies of and cyclic groups , with .
Ext via a projective resolution of the first variable computes Ext as Hom cohomology. Singular UCT extension from cycle projections proves canonical comparison with any length-one projective resolution, so the explicit resolutions below compute the Ext in [F1].
Proof
Given: and finite generation as stated; write and as in [F2]. Assume AC.
A homomorphism is uniquely determined by the arbitrary integer image of , so its Hom group is . A homomorphism sends to an integer with , which implies when ; its Hom group is zero. Hom from a finite direct sum is the direct sum of the Hom groups: restriction to each summand and summing their values are inverse homomorphisms. Therefore .
For , use the resolution ; its degree-one Hom group is zero, hence its Ext is zero. For with , use . Multiplication by is injective and its image is precisely the quotient kernel. Applying Hom into yields in degrees zero and one, because evaluation at takes precomposition to multiplication by . Thus Ext in degree one is . Taking the finite direct sum of these resolutions gives an exact free resolution of : each kernel and image is computed coordinatewise. Hom and then cohomology also split coordinatewise for this finite sum, giving . The comparison in [F3] identifies this calculation with the UCT term.
Apply the splitting in [F1] and substitute steps 1.1 and 1.2 to obtain . In this direct sum a finite-order element has zero free coordinate, since a nonzero integer vector has infinite order. Conversely every element with zero free coordinate is killed by the product of the finitely many (or by if there are none). The torsion subgroup is therefore exactly the displayed finite summand, abstractly the torsion subgroup of , and the free rank is .
At , gives , so is free of rank under the stated finite-generation hypothesis. Empty gives . Empty torsion data in either input is allowed; a single cyclic summand contributes exactly one in the next cohomology degree. The same resolution computation for gives a zero cyclic group and zero Ext, so omitted trivial summands do not change the formula; is not treated as torsion and belongs to the separate free case. The isomorphism of torsion groups uses chosen decompositions and the UCT splitting; no canonical duality for finite groups is claimed. AC is inherited from [F1] and the comparison in [F3]; the finite cyclic calculations add no choice requirement.
Depends on
- Topological universal coefficient short exact sequence for cohomology
- The cohomology universal coefficient sequence splits nonnaturally
- The Axiom of Choice
- The fundamental theorem of finitely generated abelian groups from PID modules
- Singular UCT extension from cycle projections
- Ext via a projective resolution of the first variable
Used by
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
- Miller, section 27, Example 27.4 and Theorem 27.1, printed pages 73–74 (standard reference, not scraped)