Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Real singular cochain complex

Definition

For a topological space X, the real singular cochain complex is Ck(X;R)=Hom⁡R(Ck(X;R),R),δkφ=φ∘∂k+1. Here the chains and boundary are Real singular chain complex, so Ck=0 for k<0. Addition and scalar multiplication of cochains are pointwise. Precomposition with the real-linear boundary is real-linear. Explicitly, for k≥0, (δkφ)([σ])=∑i=0k+1(−1)iφ([σ∘δi]). There is no extra degree sign. For every chain c, (δk+1δkφ)(c)=φ(∂k+1∂k+2c)=0, so δ2=0. The same assertion in negative degrees follows from the zero source, including δ−1=0.

By Real singular cochains identify with functions on the supplied simplex basis, evaluation on the supplied basis identifies this with Singular cochain complex with coefficients for coefficient group R: it is Hom⁡Z(Ck(X;Z),R), not Hom⁡Z(Ck(X;R),R). That lemma verifies the identification commutes with coboundary. A cochain may have arbitrary values on infinitely many simplices; it is not required to have finite support.

At degree zero a cochain is a function on points, and its coboundary on a path is the final value minus the initial value. For the empty space all cochains vanish. For a point the unnormalized cochain groups are R in each nonnegative degree, with δk=0 for even k and δk=id⁡ for odd k. No choice is involved.

Depends on

Dependency tree · 2 levels

Sources