Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Injective complexes model the bounded below derived category

Statement

With supplied bounded-below injective replacements jX:XIX (and DC or supplied homotopy extensions), K+(InjA)D+(A) is an equivalence of triangulated categories. For a bounded-below complex I, K-injectivity can be tested using only bounded-below acyclic inputs.

Facts & Assumptions

Given: With supplied bounded-below injective replacements jX:XIX (and DC or supplied homotopy extensions), K+(InjA)D+(A) is an equivalence of triangulated categories. For a bounded-below complex I, K-injectivity can be tested using only bounded-below acyclic inputs.

[F1]

A bounded-below injective complex is K-injective under DC or supplied extensions (A bounded below complex of injectives is homotopically injective).

[F2]
[F3]

Enough injectives gives an objectwise bounded-below injective replacement under DC or supplied embeddings (Bounded below complexes admit injective replacements).

[F4]

Canonical truncation realizes the fully faithful bounded embeddings and their cohomological essential images (Bounded derived localizations embed fully faithfully).

Proof

1.1

Bounded-below injective complexes are K-injective; their Hom groups into each other agree in K and D by the no-roof theorem and in D+ by its fully faithful embedding. This proves full faithfulness, including the zero complex.

F1F2F4
2.1

Enough injectives supplies objectwise replacements under the stated choices. For the simultaneously supplied jX, assign R(X)=IX and let R(u) be the unique homotopy class whose image is Q(jY)uQ(jX)1. Full faithfulness proves functoriality and the quasi-inverse identities. Finite sums, cones and shifts stay in bounded-below injectives; cone triangles therefore give exactness of the equivalence, by lifting first arrows and comparing triangle completions.

F3F4step 1.1algebra
3.1

For the testing assertion suppose Ij=0 below a. Fix an acyclic A and an integer r. The three terms in degrees r1,r,r+1 of Hom(A,I), and their differentials, depend only on terms of A strictly above c=ar3. Thus replacing A by τcA leaves these terms and maps unchanged: any factor involving the modified cut has target Ij=0. This truncation is bounded below and acyclic. Its Hom cohomology in degree r vanishes by the restricted test, so the original Hom cohomology does too. Since r was arbitrary, I is K-injective. The converse is immediate by restricting the acyclic inputs.

F4algebra

Depends on

Used by

Dependency tree · two levels

14 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