Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Singular cohomology with coefficients

Definition

For a space X and an abelian group G, a degree-n singular cocycle is a cochain in Zn(X;G)=kerδn and a degree-n singular coboundary belongs to Bn(X;G)=imδn1, for the positive coboundary convention of Singular cochain complex with coefficients. The square-zero lemma The singular coboundary squares to zero implies BnZn: if φ=δn1ψ, then δnφ=0.

The singular cohomology group with coefficients in G is Hn(X;G)=Zn(X;G)/Bn(X;G)(n0),Hn(X;G)=0(n<0). This is the abelian quotient with addition [φ]+[ψ]=[φ+ψ]: changing either representative by a coboundary changes the sum by a coboundary. Thus two cocycles represent the same class exactly when their difference is δn1η for some degree-(n1) cochain η. In degree zero, B0=0 because C1=0; hence H0=kerδ0. The zero convention in negative degrees agrees with the same kernel/image construction on the zero cochain groups.

If coefficients are a module over a commutative ring, the same groups and maps are modules and linear maps, and this is their module quotient. Empty X or zero coefficients give zero cohomology in every degree. The notation does not define cohomology as the dual of homology; such identifications require their own theorems. No choice of cocycle representatives and no AC is part of this definition.

Depends on

Used by

Dependency tree · two levels

6 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