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

Effaceable homological delta functors are universal

Statement

Let T=(Tn,T) be a homological delta functor on an abelian category. If T is effaceable in positive degrees by projectives, then T is universal.

Facts & Assumptions

Given: A homological delta functor S=(Sn,S) and a natural transformation u0:S0T0.

[L1]

Universality for a homological delta functor means unique extension of u0 to a morphism of homological delta functors (Universal delta functor, Morphism of homological delta functors).

[L2]

Effaceability supplies admissible projective effacements, and the dimension-shift lemma makes the corresponding connecting maps monic (Effaceable homological delta functor in positive degrees, Dimension shift for a homological delta functor effaced in the middle).

[L3]

Item 19 defines the next-degree component from one chosen effacement, item 20 makes it independent of that choice, and item 21 preserves compatibility with connecting morphisms (A partial morphism of delta functors extends through one dimension shift, The effacement extension is independent of the effacing morphism, The effacement extension commutes with connecting morphisms).

Proof

technique · induction
1.1

Start with the given u0 as the degree-zero component.

basegiven
1.2

Suppose by induction that for some n>0 we have already constructed natural transformations ui:SiTi for all i<n, and that these form a morphism of homological delta functors through degree n1. For each object A, choose an effacement pA:PAA for the target value Tn(A) using [L2]. Then [L3] defines a map un(A):Sn(A)Tn(A) from that effacement, and [L3] makes it independent of the chosen pA.

ihL2L3construct
2.1

To check naturality of the family from step 1.2, compare two chosen effacements over a morphism f:AB by a common dominating effacement. The covered naturality from [L3] applies to that dominating choice, and the choice independence from [L3] transports the result back to the original objects. Thus un is natural. The same comparison argument, now applied over a short exact sequence, together with the connecting-map compatibility from [L3], shows that adjoining un preserves the morphism-of-delta-functors condition in degree n.

L3step 1.2discharge-induction
3.1

This constructs a morphism u:ST extending u0 in every degree. For uniqueness, let vn be any other degree-n component compatible with the already fixed lower-degree data. Choose an effacement p:PA for Tn(A). Because un and vn have the same lower-degree compatibility, their composites with nT agree. The map nT is monic by [L2], so un(A)=vn(A). Hence the extension is unique in each degree, and [L1] identifies T as universal.

L1L2step 1.1step 2.1discharge-induction

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