Alphabeta Math
PropositionStatement: Literature-sourcedProof: 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 cohomology is contravariantly functorial

Statement

A continuous map f:XY induces f:Hn(Y;G)Hn(X;G) for every integer n and abelian group G, by f[φ]=[φf#]. These maps satisfy (1X)=1 and (gf)=fg. A coefficient homomorphism u:GG induces u:Hn(X;G)Hn(X;G), covariantly functorial in coefficients and commuting with f.

Facts & Assumptions

[F1]

Singular cochain complex with coefficients defines cochains by Hom and coboundary by precomposition with the boundary.

[F2]

Singular cohomology with coefficients forms the quotient of cocycles by coboundaries in every degree.

[F3]

The induced singular chain map of a continuous map sends each simplex σ to fσ; Induced singular chain maps commute with boundaries gives f#=f#, including the zero-degree convention.

Proof

Given: The continuous maps and coefficient homomorphism in the statement; g:YZ is continuous.

1.1

Define fφ=φf# on cochains. It is additive and satisfies δXfφ=φf#X=φYf#=fδYφ by [F1] and [F3]. Thus it takes cocycles to cocycles and a coboundary δYη to δX(fη). It therefore induces the specified homomorphism on [F2] quotients, independently of every representative. In negative degrees use the unique map of zero groups.

F1F2F3
1.2

On each singular simplex, (gf)#σ=gfσ=g#f#σ and (1X)#σ=σ; extending linearly proves the same on chains. Consequently φ(gf)#=(φg#)f# and φ(1X)#=φ on cochains. These equalities also hold in negative degrees by the zero convention.

F1F3
1.3

Postcomposition sends φ to uφ. It is additive and δ(uφ)=uφ=u(δφ). It preserves cocycles and coboundaries and induces u on [F2]. Moreover u(φf#)=(uφ)f#, so the induced coefficient and space maps commute. Postcomposition by 1G is identity, and postcomposition by vu equals successive postcomposition by u and v, giving coefficient functoriality.

F1F2F3
2.1

Step 1.1 supplies the quotient maps, and the cochain equalities of step 1.2 descend to their stated contravariant identity and composition laws. Step 1.3 proves coefficient functoriality and naturality. The formulas cover degree zero without quotient ambiguity since B0=0, and negative degrees by zero maps. For empty source X, pullback lands in zero groups; a map to empty Y exists only when X is empty. Zero coefficients give zero groups. Identity maps on a point satisfy the same literal identity calculation. No representative or basis is selected and no AC is needed.

F1F2step 1.1step 1.2step 1.3

Depends on

Used by

Dependency tree · two levels

9 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