Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

Gaussian transfer is not strictly functorial on arbitrary cochain maps

Statement refuted

Transfer of cochain maps along a Gaussian reduction is strictly functorial: for every pair of composable cochain maps f,g and every chosen retract data, (gf)‾=gˉfˉ.

Facts & Assumptions

Given: A field k, the two-term cochain complex Y∙ with Y0=Y1=k, d0=1, d1=0 and Yj=0 otherwise, a second copy K∙ of it, the biproduct X∙=Y∙⊕K∙, and the projection p, inclusion ı and homotopy h displayed below.

[L1]

For chosen retract data the transfer of a cochain map f is fˉ=pYfıX, the identity transfers strictly, and (gf)‾−gˉfˉ=dk+kd with k=pZghYfıX; hence transfer is functorial on homotopy classes but is not asserted to be strictly functorial (Transferred maps are functorial up to homotopy, with strict naturality limits).

[L2]

Cochain maps are the morphisms commuting with the differentials; a biproduct of complexes has the differentials acting componentwise and its projection and inclusion as cochain maps; a homotopy s satisfies f−g=ds+sd, and a complex is contractible when 1=dh+hd for a suitable h (Complexes, homotopies and contractibility in an additive category).

Counterexample

1.1

Retract data for X∙ onto Y∙. Write elements of Xj=k⊕k as pairs with the first coordinate in Yj and the second in Kj, and let ı=(10), p=(1 0) in both degrees, with h1=(0001), h0=0 and h2=0. Then pı=1k and 1−ıp=(0001). Here d0=1k2 and d1=0: in degree 1, d0h1+h2d1=1k2h1+0=(0001), and in degree 0, d−1h0+h1d0=0+h11k2=(0001). Thus 1−ıp=dh+hd, and the displayed data is a strong deformation retract of X∙ onto Y∙.

L2algebra
1.2

Two cochain maps. In both nonzero degrees set f=(0010) and g=(0100). At the only nonzero differential d0=1k2, f1=f0 and g1=g0, so f1d0=d0f0 and g1d0=d0g0; at d1=0 the cochain-map equations hold trivially. Thus f and g are cochain maps. Here f sends the Y-coordinate isomorphically onto the K-coordinate and kills the K-coordinate, while g sends the K-coordinate isomorphically onto the Y-coordinate and kills the Y-coordinate.

L2algebra
2.1

The individual transfers vanish. Since ı=(10), one has fı=(01) and gı=0; applying p=(1 0) gives fˉ=pfı=0 and gˉ=pgı=0 as cochain maps Y∙→Y∙.

L1step 1.2algebra
3.1

The transfer of the composite does not vanish. Since gf=(0100)(0010)=(1000)=ıp, one has (gf)‾=p(gf)ı=pıpı=pı=1Y∙, the identity cochain map of Y∙, which is nonzero. Hence (gf)‾−gˉfˉ=1Y∙≠0, so transfer is not strictly functorial on cochain maps, and the statement refuted is false.

L1step 1.2step 2.1algebra
4.1

The failure is consistent with the proposition. The complex Y∙ is contractible, with contracting homotopy hˉ1=1k and hˉ0=hˉ2=0, because in degree 0 one has d−1hˉ0+hˉ1d0=1k and in degree 1 one has d0hˉ1+hˉ2d1=1k. Consequently every endomorphism u of Y∙, in particular the discrepancy (gf)‾−gˉfˉ of step 3.1, is null-homotopic: from 1Y∙−0=dhˉ+hˉd and ud=du one obtains u=u(dhˉ+hˉd)=d(uhˉ)+(uhˉ)d, so u≃0 with homotopy uhˉ. This is exactly the up-to-homotopy functoriality asserted by [L1], so the counterexample refutes strictness only, not the homotopy-class statement. ∎

L1L2step 3.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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