Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Finite generation from cap with a finite fundamental cycle

Statement

Assume AC. If M is a closed R-oriented n-manifold and R is a commutative PID, then every Hq(M;R) and Hp(M;R) is finitely generated over R, and these groups vanish outside degrees 0,,n. In particular this applies to R=Z and to every field. Closed means compact and boundaryless; connectedness is not required. The AC use is inherited from Poincaré duality.

Facts & Assumptions

[F1]

Poincaré duality for oriented topological manifolds identifies cap with the fundamental class as an isomorphism Hp(M;R)Hnp(M;R) for compact M, under AC.

[F2]

Cap product with cohomology written first evaluates a degree-p cochain on the front p-face of a simplex and retains its back face; singular chains are finite sums.

[F3]

A submodule of a free module of finite rank over a PID is free of no larger rank proves that a submodule of a finite free PID module is free of finite rank no larger than the ambient rank.

[F4]

The Axiom of Choice is assumed for [F1].

Proof

Given: M,n,R and its orientation. Choose one finite singular cycle z=i=1mriσi representing its fundamental class. Such a representative exists by the definition of the homology class in [F1]. If the class is zero the zero cycle is permitted.

1.1

Fix 0qn, and put p=nq. Let Sq be the submodule of Cq(M;R) freely spanned by the distinct back faces σi[p,,n] occurring in z. It is free of rank at most m: these are a subset of the specified singular simplex basis, and repetitions are removed. For every degree-p cochain a, the cap formula [F2] gives az=i=1mria(σi[0,,p])σi[p,,n]Sq. In particular every cocycle caps to a cycle lying in Sq.

F1F2given
2.1

Put Tq=Sqkerq. This is a submodule of the finite free module Sq, so [F3] makes it finite free. Its map to Hq(M;R), sending a cycle to its homology class, is onto: any homology class is DM[a] by [F1], and a cocycle representative of a gives the cycle in step 1.1. The images of a finite basis of Tq therefore generate Hq(M;R). This uses a finite generating module of cycles, not the unsupported claim that the individual back faces are cycles.

F1F3F4step 1.1
3.1

For q>n, [F1] identifies Hq(M;R) with Hnq(M;R)=0, and negative homology degrees are zero by convention. For 0pn, [F1] identifies Hp(M;R) with the finitely generated Hnp(M;R) of step 2.1. If p>n its target is a negative homology group, and if p<0 the cochain complex is zero, proving the stated vanishings. Since only finitely many degrees survive, even the direct sums over all degrees are finitely generated.

F1step 2.1
4.1

Empty M has z=0, all Sq=Tq=0, and zero homology. A PID is nonzero by definition, so the zero ring is not a hypothesis here. At q=0, 0=0 and T0=S0; at q=n, cap uses degree-zero cochains and retains the original simplices. For n=0 the same proof uses only those vertices. A one-simplex support gives rank at most one for Tq. Degenerate simplices are legitimate basis elements, and duplicate back faces were removed explicitly. Beyond the AC inherited from [F1] for the countable atlas and local UCT, this proof chooses only a single representative cycle and a finite basis in one finite free module; it introduces no further infinite selection.

F1F2F3F4step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

19 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