Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)
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)=HomR(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 k0, (δkφ)([σ])=i=0k+1(1)iφ([σδi]). There is no extra degree sign. For every chain c, (δk+1δkφ)(c)=φ(k+1k+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 HomZ(Ck(X;Z),R), not HomZ(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

Used by

Dependency tree · two levels

4 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