Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

Transferred maps are functorial up to homotopy, with strict naturality limits

Statement

Let A be an additive category and let chosen strong deformation retract data be given as in Explicit strong deformation retract from Gaussian cancellation: (pX,ıX,hX) for X∙ onto Xˉ∙,(pY,ıY,hY) for Y∙ onto Yˉ∙,(pZ,ıZ,hZ) for Z∙ onto Zˉ∙. For every cochain map f:X∙→Y∙ define the transfer fˉ:=pYfıX:Xˉ∙→Yˉ∙, and for every homotopy s:f≃g define sˉ:=pYsıX.

  1. Maps and homotopies. Each transfer fˉ is a cochain map, each sˉ is a homotopy fˉ≃gˉ of degree −1, and consequently transfer is well defined on homotopy classes of cochain maps.
  2. Functoriality up to homotopy. The identity transfers strictly, 1X∙‾=1Xˉ∙, and for composable cochain maps f:X∙→Y∙, g:Y∙→Z∙, (gf)‾−gˉfˉ=dk+kd,k:=pZghYfıX, so (gf)‾≃gˉfˉ: transfer preserves identities and composition on homotopy classes, but it is not asserted to be a strict functor on cochain maps.
  3. Strictness fails. Transfer need not preserve composition strictly: for over a field k, take Y∙=K=(k→1k) in degrees 0,1 and X∙=Y∙⊕K. The split-off retract onto Xˉ∙=Y∙ admits cochain maps f,g with fˉ=0=gˉ and (gf)‾=1Xˉ∙, so (gf)‾−gˉfˉ≠0.
  4. Strict naturality, and what is not claimed. If cochain maps f:X∙→Y∙ and g:Y∙→Z∙ commute with the chosen retract data, that is fıX=ıYfˉ, pYf=fˉpX, gıY=ıZgˉ and pZg=gˉpY, then (gf)‾=gˉfˉ strictly. Transfer depends on the chosen retracts and homotopies; no choice-free, canonical or confluent transfer, and no independence of the chosen data, is claimed.

Facts & Assumptions

Given: An additive category A with three chosen strong deformation retract data (pX,ıX,hX), (pY,ıY,hY), (pZ,ıZ,hZ) as in the statement, composable cochain maps f:X∙→Y∙ and g:Y∙→Z∙, and, separately, parallel cochain maps u,v:X∙→Y∙ with a homotopy s:u≃v.

[L1]

For each of the three pairs, p and ı are cochain maps, h has degree −1, and pı=1, 1−ıp=dh+hd, ph=0, hı=0, h2=0 (Explicit strong deformation retract from Gaussian cancellation).

[L2]

The split-off retract of the theorem: if X∙=Xˉ∙⊕K is a biproduct in which K is the contractible two-term complex with differential the identity in degrees n,n+1, then the projection p, the inclusion ı and the homotopy h with hn+1=(0001) and hj=0 for j≠n+1 are strong deformation retract data of X∙ onto Xˉ∙ (Gaussian elimination splits a contractible two-term complex, Explicit strong deformation retract from Gaussian cancellation).

[L3]

A homotopy s of degree −1 between cochain maps satisfies f−g=ds+sd; composites and sums of cochain maps are cochain maps, and a cochain map u satisfies du=ud in the graded sense; homotopy is an equivalence relation compatible with composition, so the homotopy classes of cochain maps are the morphisms of the homotopy category under the reindexing dictionary of Complexes, homotopies and contractibility in an additive category (Homotopy classes of chain maps, The homotopy category of chain complexes).

Proof

technique · direct
1.1

Transfer of maps and homotopies. The composite fˉ=pYfıX of cochain maps is a cochain map, so dfˉ=fˉd by [L3]. If f−g=ds+sd, then fˉ−gˉ=pY(f−g)ıX=pYdsıX+pYsdıX=d(pYsıX)+(pYsıX)d, using pYd=dpY and dıX=ıXd; hence sˉ=pYsıX is a degree-(−1) homotopy fˉ≃gˉ. Therefore homotopic maps have homotopic transfers, and transfer is well defined on homotopy classes.

L1L3algebra
1.2

Functoriality up to homotopy. The identity transfers strictly: 1X∙‾=pX1X∙ıX=pXıX=1Xˉ∙. For composable f,g set k:=pZghYfıX; then gˉfˉ=pZgıYpYfıX=pZg(1Y∙−(dhY+hYd))fıX=(gf)‾−(pZgdhYfıX+pZghYdfıX), and since pZ,g,f,ıX are cochain maps the two correction terms are d(pZghYfıX) and (pZghYfıX)d, that is dk and kd. Hence gˉfˉ=(gf)‾−(dk+kd), equivalently (gf)‾−gˉfˉ=dk+kd, so (gf)‾≃gˉfˉ with this sign convention.

L1L3algebra
1.3

Strictness fails. Take A the category of vector spaces over a field, let K be the two-term complex k→1k concentrated in degrees 0,1 with zero neighbouring terms, let Xˉ∙ be a second copy of it and X∙=Xˉ∙⊕K, and use the split-off retract of [L2] with ı the inclusion of the first summand, p the projection onto it and h1=(0001), h0=h2=0. In each degree let f=(0010) and g=(0100) in the coordinates Xˉ0⊕K0 respectively Xˉ1⊕K1; the components in degrees 0 and 1 agree, so both maps commute with the only nonzero differential d0=1, so f and g are cochain maps. Then gf=(1000)=ıp, and the transfers are fˉ=pfı=0 and gˉ=pgı=0 because fı and gı land in the complementary summand killed by p, while (gf)‾=p(gf)ı=pı=1Xˉ∙. Hence (gf)‾−gˉfˉ=1Xˉ∙≠0, so transfer is not a strict functor on cochain maps.

L2L3algebra
1.4

Strict naturality for commuting morphisms. Let f:X∙→Y∙ and g:Y∙→Z∙ satisfy fıX=ıYfˉ, pYf=fˉpX, gıY=ıZgˉ and pZg=gˉpY. Then (gf)‾=pZgfıX=pZgıYfˉ=gˉpYıYfˉ=gˉfˉ, the last step by [L1]; under these hypotheses the transfer pYfıX=fˉpXıX=fˉ is the given fˉ, so the computation compares the transfer of the composite with the composite of the transfers. In this situation identity and composition are preserved strictly, not merely up to homotopy.

L1L3algebra
2.1

Conclusion. Step 1.1 shows that transfer sends cochain maps to cochain maps and homotopic maps to homotopic maps, so it is well defined on homotopy classes of cochain maps; step 1.2 shows that it preserves identities strictly and composition up to the explicit homotopy pZghYfıX, so it is functorial on homotopy classes while not being a strict functor on cochain maps; step 1.3 exhibits cochain maps with fˉ=gˉ=0 and (gf)‾=1, which establishes that failure; and step 1.4 gives strict functoriality on the subcategory of morphisms commuting with the chosen retract data. Since the transfer uses the chosen projections and inclusions, while the displayed comparison homotopy also uses the chosen homotopies, clause 4 records that no choice-free, canonical or confluent transfer and no independence of the chosen data is being claimed. ∎

step 1.1step 1.2step 1.3step 1.4L3

Depends on

Used by

Dependency tree · two levels

13 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