Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedaudited 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.

G-acyclic object for a left-exact functor

Definition

Let B and C be abelian categories, let G:BC be additive and left exact, and let XB. Fix a supplied injective resolution datum I whose domain contains X. The object X is G-acyclic relative to I if RIpG(X)=0 for every integer p>0, where RIpG(X) is defined by Right derived objects relative to supplied injective resolution data. A complex is termwise G-acyclic relative to supplied data if each term Xn lies in the domain of a specified datum In and satisfies RInpG(Xn)=0 for every p>0.

The condition imposes no vanishing on G(X), which is canonically isomorphic to RI0G(X) by left exactness and the resolution augmentation; it does not assert literal equality of these objects. It is distinct from exactness of a complex: exactness concerns its differentials, whereas termwise G-acyclicity concerns the higher derived objects of its individual terms. The zero object with its zero resolution is G-acyclic relative to that datum; a complex with no terms satisfies termwise acyclicity vacuously. No choice of a family of resolutions or independence assertion is part of this definition.

Depends on

Used by

Dependency tree · two levels

9 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