Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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 cochains identify with functions on the supplied simplex basis

Statement

For any set S, evaluation on the supplied formal generators gives real-linear bijections HomR(R(S),R)RSHomZ(Z(S),R). For S=Sk(X) these identify real-linear cochains on real singular chains with additive cochains on integer singular chains. They commute with precomposition by every real extension of an integer matrix having finite columns, in particular the signed singular boundary. No basis choice is needed.

Facts & Assumptions

Given: A set S and, for the compatibility assertion, an integer homomorphism D:Z(T)Z(S) specified by finite columns.

[F1]

Real singular chains are finite-support functions with unique formal coefficients and the explicit integer-tensor identification (Continuous singular simplex and real singular chain group).

Proof

1.1

For a:SR define La(rs[s])=rsa(s) and Aa(ns[s])=nsa(s). Unique finite coefficients make both sums well-defined; finite distributivity proves real linearity of La and additivity of Aa. Scalar multiplication of additive maps is pointwise.

givenF1algebra
2.1

Evaluation sends La and Aa back to a because their value on [s] is a(s). Conversely every real-linear L satisfies L(rs[s])=rsL([s]), and every additive A satisfies A(ns[s])=nsA([s]), including negative integers by additive inverses. Thus evaluation and extension are inverse in both cases and are real-linear. There is no finite-support condition on a.

step 1.1algebra
3.1

Write D[t]=sdst[s] with each column finite, and let DR use the same formula over R. Both LaDR and AaD have value sdsta(s) on [t], so the identifications commute with these maps. A signed face sum is such a finite column, even when repeated faces combine. Zero columns and the degree-zero boundary give zero values.

step 1.1step 2.1algebra
4.1

If S=, all three spaces are zero, with the unique empty function. If S is a singleton, evaluation is the usual identification with R; in negative singular degrees the groups are zero by convention. All inverse maps have specified formulas on the supplied formal generators, so no representative or basis selection and no AC is used.

F1step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

2 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