Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

cex-an-unbounded-complex-of-projectives-that-is-not-k-projective.md

Statement refuted

Every unbounded complex whose terms are projective modules is K-projective.

Facts & Assumptions

Given: Every unbounded complex whose terms are projective modules is K-projective.

[F1]

K-projectivity annihilates Hom into every acyclic complex and all its shifts (Homotopically projective bounded above complex).

Counterexample

1.1

Set R=Z/4, and take Pi=R and di=2 for every integer i. The terms are free of rank one and thus projective (a map out of R lifts by lifting its value at 1). Also di+1di=4=0, and kerdi=2R=imdi1. Thus P is an acyclic doubly infinite complex.

givenalgebra
2.1

Every proposed homotopy hi:RR is multiplication by an element ai. The identity-homotopy equation at degree i would require 1=2ai+2ai+1, impossible modulo two. Hence 1P is nonzero in HomK(P,P). Since P itself is acyclic, this contradicts the vanishing required for a K-projective source. The obstruction is an equation at every degree, not evidence from a finite truncation.

F1step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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