Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-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 chains are covariantly functorial

Statement

For a continuous map f:X→Y, postcomposition defines a real-linear chain map f#:C∙(X;R)→C∙(Y;R). These maps satisfy (g∘f)#=g#f# and (id⁡X)#=id⁡, so real singular chains are covariantly functorial.

Facts & Assumptions

Given: Topological spaces and continuous maps f:X→Y, g:Y→Z.

[F1]

Real chains have a supplied simplex basis and signed face differential, with zero groups in negative degrees (Real singular chain complex).

[F2]

The coefficient-chain functor sends f to postcomposition and respects identities and composition (Singular chains and singular homology are covariantly functorial).

Proof

1.1givenF1F2

Define f#(∑aσ[σ])=∑aσ[f∘σ]. Composites are continuous, the sum is finite, and collecting equal images preserves addition and real scalar multiplication. Under the real tensor identification this is exactly the map in [F2]. In negative degrees it is the unique map between zero spaces.

2.1F1step 1.1algebra

For k≥1, ∂f#[σ]=∑i=0k(−1)i[f∘σ∘δi]=f#∂[σ]. Real linearity extends equality to all chains; for k≤0 both composites are zero. This includes constant and degenerate simplices because the computation does not discard any face.

3.1step 1.1step 2.1algebra∎

On every generator, g#f#[σ]=[g∘f∘σ]=(g∘f)#[σ] and (id⁡X)#[σ]=[σ]. Finite linear extension proves both laws. They also hold on zero groups, including all chains of the empty space. On a point each nonnegative chain map induced by its identity is the identity of R. All maps are given by formulas on supplied generators; no AC is used.

Depends on

Dependency tree · 2 levels

Sources