Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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.

An exact base functor has the trivial universal delta functor

Statement

Assume the Axiom of Dependent Choice.

Let F:A→B be an exact functor between abelian categories. Then both of the following are universal delta functors:

  1. the homological delta functor with degree-zero term F, all higher terms 0, and all connecting maps 0,
  2. the cohomological delta functor with degree-zero term F, all higher terms 0, and all connecting maps 0.

Facts & Assumptions

Given: An exact functor F.

[L1]

An exact functor is additive, left exact, and right exact (Exact functor between abelian categories).

[L2]

Universality for delta functors is the unique extension property from degree zero (Universal delta functor).

Proof

technique · direct
1.1L1givenalgebra

Fix a short exact sequence 0→A→B→C→0. Because F is exact, [L1] gives an exact sequence 0→F(A)→F(B)→F(C)→0. Therefore the homological family with degree zero F, higher degrees 0, and zero connecting maps has the required long exact sequences and naturality squares, so it is a homological delta functor.

2.1L1L2step 1.1givenalgebra

Let S=(Sn,∂S) be any homological delta functor and let u0:S0⇒F be a natural transformation. Define un=0 for n>0. In every connecting square with n>1 this is automatic. For n=1, exactness of S gives im⁡(∂1S)=ker⁡(S0(A)→S0(B)), while step 1.1 gives ker⁡(F(A)→F(B))=0; naturality of u0 therefore implies u0(A)∂1S=0, so the degree-one connecting square also commutes. The extension is unique because there is only one morphism into the zero object in each positive degree. Hence the trivial homological delta functor is universal by [L2].

3.1L1L2step 1.1step 2.1algebra∎

The cohomological case is dual. Step 1.1 already gives exact sequences 0→F(A)→F(B)→F(C)→0, so the family with T0=F, Tn=0 for n>0, and zero connecting maps is a cohomological delta functor. Given any cohomological delta functor S=(Sn,∂S) and any u0:F⇒S0, define un=0 for n>0. Exactness of S gives ker⁡(∂S0)=im⁡(S0(B)→S0(C)), and exactness of F makes F(B)→F(C) epic, so naturality of u0 implies ∂S0u0(C)=0. Thus the connecting squares commute, and uniqueness is again immediate in positive degrees. Therefore the trivial cohomological delta functor is universal by [L2].

Depends on

Used by

Dependency tree · two levels

25 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