Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

FALSE: every acyclic complex of projective objects is contractible

Statement

False. Every acyclic complex of projective objects is contractible.

Facts & Assumptions

Given: The bi-infinite chain complex over R=Z/4Z with Cn=R for every n and differential dn equal to multiplication by 2.

[L1]

Contractibility is the existence of a homotopy from the identity to zero (A contractible complex).

[L2]

A bounded-below acyclic complex of projectives is contractible once its cycle epimorphisms split (A bounded below acyclic complex of projective objects is contractible when its cycle epimorphisms split).

Refutation

technique · direct
1.1

Since 22=4=0 in R, the displayed differentials satisfy dn1dn=0. Also ker(dn)=2R=im(dn+1), so the complex is acyclic. Each term R is a free rank-one R-module and hence projective.

givenalgebra
2.1

If a contracting homotopy existed, then for each n one would have 1R=dn+1sn+sn1dn=2sn+2sn1. But every endomorphism of the free rank-one module R is multiplication by an element of R, and the right-hand side is always even while 1R is not. Contradiction.

L1step 1.1algebra
3.1

Therefore the complex is acyclic and degreewise projective but not contractible. The positive theorem [L2] does not apply because this standard counterexample is not bounded below with the required splitting data.

L2step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

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