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 chain complex

Definition

For every topological space X, use Continuous singular simplex and real singular chain group and the real-linear instance of The singular boundary operator: k[σ]=i=0k(1)i[σδi](k1),k=0(k0). Each sum is finite. The real singular chain complex is C(X;R) with these differentials. In degree one, a path has boundary [σ(1)][σ(0)].

For completeness, if k2, in the expansion of k1k[σ], a pair of omitted vertices i<j occurs as σδjδi and σδiδj1. The affine maps insert zeros at the same two positions and leave all other coordinates in order, so they are equal. Their coefficients (1)i+j and (1)i+j1 cancel. Every term belongs to exactly one such pair. Thus 2=0 on every generator and hence on every finite chain. For k=1 the composite is zero because 0=0; all lower groups or maps are zero. This verifies well-definedness as an unaugmented chain complex directly.

Repeated or constant faces are counted with their signed multiplicities; no nondegeneracy assumption is imposed. For a point the boundary coefficient is i=0k(1)i, equal to 1 for positive even k and 0 for odd k, while 0=0. For the empty space the entire complex is zero. No choice is used.

Depends on

Used by

Dependency tree · two levels

3 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