Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 n0 and suppose Hn(X;Z) and Hn1(X;Z) are finitely generated, with H1=0. The torsion subgroup of Hn(X;Z) is abstractly isomorphic to the torsion subgroup of Hn1(X;Z), and its free rank equals the rank of Hn(X;Z). No canonical identification of the two finite torsion groups is asserted.

Facts & Assumptions

[F2]

The fundamental theorem of finitely generated abelian groups from PID modules supplies a finite direct sum of copies of Z and cyclic groups Z/m, with m>1.

[F3]

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: X,n and finite generation as stated; write HnZrT and Hn1Zsj=1tZ/mj as in [F2]. Assume AC.

1.1

A homomorphism ZZ is uniquely determined by the arbitrary integer image of 1, so its Hom group is Z. A homomorphism Z/mZ sends 1 to an integer a with ma=0, which implies a=0 when m>0; 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 Hom(Hn,Z)Zr.

F2given
1.2

For Z, use the resolution 00Z1Z0; its degree-one Hom group is zero, hence its Ext is zero. For Z/m with m>0, use 0ZmZZ/m0. Multiplication by m is injective and its image is precisely the quotient kernel. Applying Hom into Z yields ZmZ in degrees zero and one, because evaluation at 1 takes precomposition to multiplication by m. Thus Ext in degree one is Z/m. Taking the finite direct sum of these resolutions gives an exact free resolution of Hn1: each kernel and image is computed coordinatewise. Hom and then cohomology also split coordinatewise for this finite sum, giving Ext1(Hn1,Z)j=1tZ/mj. The comparison in [F3] identifies this calculation with the UCT term.

F2F3given
2.1

Apply the splitting in [F1] and substitute steps 1.1 and 1.2 to obtain Hn(X;Z)Zrj=1tZ/mj. 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 mj (or by 1 if there are none). The torsion subgroup is therefore exactly the displayed finite summand, abstractly the torsion subgroup of Hn1, and the free rank is r.

F1step 1.1step 1.2
3.1

At n=0, H1=0 gives s=t=0, so H0 is free of rank r under the stated finite-generation hypothesis. Empty X gives r=s=t=0. Empty torsion data in either input is allowed; a single cyclic summand contributes exactly one Z/m in the next cohomology degree. The same resolution computation for m=1 gives a zero cyclic group and zero Ext, so omitted trivial summands do not change the formula; m=0 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.

F1F2F3step 1.1step 1.2step 2.1

Depends on

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