Alphabeta Math
PropositionStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passaudited 2026-09-14
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.

Functoriality with coefficient morphisms

Statement

Let f:(X,A)→(Y,B) be a map of pairs.

  1. A coefficient morphism η:L→f∗K induces f∗:Hn(X,A;L)⟶Hn(Y,B;K).
  2. A coefficient morphism θ:f∗K→L induces f∗:Hn(Y,B;K)⟶Hn(X,A;L).

At a fixed space, both theories are covariant in coefficient morphisms. These maps preserve identities and composition. If H:f0≃f1 is a homotopy of pair maps, transport along t↦H(x,t) gives τH:f0∗K→f1∗K; the homology maps agree when η1=τHη0, and the cohomology maps agree when θ0=θ1τH.

Facts & Assumptions

Given: The map, local systems, and correctly directed coefficient morphism in the relevant clause.

[F1]

Homology and cohomology with local coefficients uses intrinsic local chains with coefficients at the first vertex and intrinsic local cochains with values at the first vertex.

[F2]

Local systems and pullback gives pullback transports and the naturality equation for coefficient morphisms.

Proof

technique · direct
1.1F1F2

Define (f,η)#(mσ)=ησ(e0)(m)(fσ). On the exceptional zeroth face, [F2] says ησ(e1)Tσ[0,1]L=Tfσ[0,1]Kησ(e0); all other faces use the same first vertex. Hence this is a chain map and carries the subcomplex on A into that on B, so [F1] gives the asserted f∗.

1.2F1F2

For a cochain φ on Y, define ((f,θ)#φ)(σ)=θσ(e0)(φ(fσ)). The same naturality square, inverted on the exceptional face, makes this commute with coboundary. It preserves the relative kernel because f(A)⊆B, and hence induces the asserted f∗. Taking f=1X proves covariance in a coefficient morphism for both theories.

2.1F2step 1.1step 1.2

Substitution in the two displayed chain-level formulas proves the identity laws. For composable maps X→fY→gZ, the homology coefficient morphism is L→f∗K→f∗g∗N=(gf)∗N, and the cohomology coefficient morphism is the reverse composite; componentwise substitution proves the composition laws without a basepoint or lift choice.

2.2F1F2step 1.1

For a homotopy H, define (τH)x=Tt↦H(x,t)K. A path square (s,t)↦H(γ(s),t) shows by its two boundary routes that these components satisfy the naturality equation, so τH is a coefficient isomorphism. Triangulate each prism Δn×I as in the ordinary prism operator and transport the coefficient from its initial first vertex along the corresponding prism edge. The usual oriented-prism cancellation is unchanged; the only new comparisons are transports along the two boundary routes of a triangular face, and those are equal because the face supplies an endpoint-fixed homotopy. Thus the resulting PH satisfies (f1,η1)#−(f0,η0)#=∂PH+PH∂ when η1=τHη0.

3.1step 1.2step 2.2∎

Precomposing a local cochain with the prism operator and applying the coefficient map in the reverse direction gives a cochain homotopy (f1,θ1)#−(f0,θ0)#=PH∗δ+δPH∗ when θ0=θ1τH. Chain- or cochain-homotopic maps induce equal maps on (co)homology by applying the identity to cycles/cocycles and observing that the difference is a boundary/coboundary. This proves the homotopy clauses. Empty pairs, zero systems, degree zero, degenerate simplices, and constant homotopies obey the same formulas, and no AC is used.

Depends on

Dependency tree · 2 levels

Sources