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.

Continuous singular simplex and real singular chain group

Definition

For a topological space X and integer k0, let Sk(X) be the set of continuous maps ΔkX from the standard simplex, as in Singular simplices and singular chain groups with coefficients. Define Ck(X;R)=R(Sk(X))={a:Sk(X)R:{σ:a(σ)0} is finite}. Addition and scalar multiplication are pointwise. Write [σ] for the function equal to 1 at σ and 0 elsewhere. Every chain has the unique expression σaσ[σ] over its finite support. Set Ck(X;R)=0 for k<0.

This is the real specialization of the cited tensor convention: the balanced bilinear map (nσ[σ],r)rnσ[σ] induces Ck(X;Z)ZRR(Sk(X)). Its inverse sends aσ[σ] to [σ]aσ. Additivity follows by collecting the finite union of supports; the tensor relations show the composites fix every [σ]r and every a[σ]. Thus these are inverse real-linear maps. No basis selection or axiom of choice is used: the simplex basis is part of the definition.

If X= there are no simplices and the chain space is zero in every degree. If X is one point, there is one simplex in every nonnegative degree and its chain space is R. Constant and degenerate simplices are retained; this is the unnormalized convention.

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