Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Right hyperderived functor of a complex

Definition

Let F:AB be additive and left exact between abelian categories. For a bounded-below complex K with supplied Cartan–Eilenberg resolution I, define the right hyperderived object relative to I by RInF(K)=Hn(Tot(FI)),(FI)p,q=F(Ip,q),D=F(h)+(1)pF(v). Additivity preserves the two square-zero equations and the commuting square, so the total differential squares to zero. Each diagonal is finite, and the canonical finite-biproduct comparison identifies Tot(FI) with F(TotI).

The totalization lemma gives a bounded-below termwise injective replacement KTotI. With its DC or supplied homotopy-extension qualification, this is a K-injective model, so the same formula is Hn(RF(K)). Without comparison data the subscript I is retained: the definition alone asserts neither independence nor a choice of a resolution for every complex. This extends Right derived objects relative to supplied injective resolution data: an object in degree zero resolved in one column gives precisely RInF of that object.

If K and the supplied resolution are zero, every value is zero. For lower bound b, the values vanish for n<b, and the total diagonal at n=b has one term. Translating the first index to pb changes the total degree to nb, not the original degree n in the formula.

Depends on

Used by

Dependency tree · two levels

20 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