Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

A bounded above complex of projectives is homotopically projective

Statement

A bounded-above cochain complex P of projective objects is K-projective. Assume dependent choice for the countable successive homotopy choices, or supply those lifts as data.

Facts & Assumptions

Given: A bounded-above cochain complex P of projective objects is K-projective. Assume dependent choice for the countable successive homotopy choices, or supply those lifts as data.

[F1]

K-projectivity means vanishing of Hom in the homotopy category into every shift of every acyclic complex (Homotopically projective bounded above complex).

[F2]

A projective object lifts maps through every epimorphism (Projective object).

[F3]

DC supplies a sequence through an entire relation on a nonempty set from a prescribed starting point (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Proof

1.1

Let A be acyclic and f:PA a chain map; shifting the target will give the same argument for any A[r]. Choose an upper bound b for P, and set hn=0 for n>b. We seek hn:PnAn1 satisfying fn=dAn1hn+hn+1dPn. The zero complex permits all choices to be zero.

F1given
2.1

Suppose the equation holds in degrees above n. Put un=fnhn+1dPn. The chain-map equation and the equation at n+1 give dAnun=0. Acyclicity makes An1Zn(A) epic, so projectivity of Pn lifts un to hn. This establishes the equation in degree n, including the initial degree b.

F2step 1.1algebra
3.1

The partial homotopies form a nonempty set of finite sequences of maps (all relevant Hom collections are sets), with an entire extension relation. DC, or the supplied successive lifts, gives the infinite descending homotopy. Thus every PA[r] is nullhomotopic for every r, which is K-projectivity. The recursion requires an upper bound; no assertion for arbitrary unbounded projectives follows.

F1F3step 2.1

Depends on

Used by

Dependency tree · two levels

12 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