DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04‡ 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.

An F-acyclic resolution

Definition

Let $F$ be an additive functor between abelian categories.

If $F$ is left exact and $I$ is a supplied injective resolution datum on a class $D$ , an $F$ -acyclic resolution of $A$ relative to $I$ is a coaugmented exact complex $0 \to A \to J^{0} \to J^{1} \to \dots$ such that every $J^{q}$ lies in $D$ and is $F$ -acyclic in the sense of An acyclic object for a left exact functor.
If $F$ is right exact and $P$ is a supplied projective resolution datum on a class $D$ , an $F$ -acyclic resolution of $A$ relative to $P$ is an augmented exact complex $\dots \to P_{1} \to P_{0} \to A \to 0$ such that every $P_{q}$ lies in $D$ and is $F$ -acyclic in the sense of An acyclic object for a right exact functor.

Thus the phrase keeps both the resolution orientation and the chosen supplied datum visible.

Depends on

Used by

Adapted classes compute derived functors Corollary
An acyclic resolution that is not an injective resolution Example
FALSE: an acyclic resolution is the same thing as an injective resolution False statement
The acyclic-resolution theorem for left derived functors Theorem
The acyclic-resolution theorem for right derived functors Theorem

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

Charles A. Weibel, An Introduction to Homological Algebra, Chapter 2 `Derived Functors` (standard reference, not scraped)