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.

Cartan-Eilenberg injective resolution of a bounded-below complex

Definition

Let K be a cochain complex in an abelian category, with Kp=0 for p<b. We use commuting arrows h:Ip,qIp+1,q and v:Ip,qIp,q+1, with h2=v2=0 and hv=vh. A Cartan–Eilenberg injective resolution is this bicomplex, zero for p<b or q<0, and an augmentation ϵ:KI,0 satisfying hϵ=ϵdK and vϵ=0, with the following data.

Write Zp,q=kerhp,q, Bp,q=imhp1,q and Hp,q=Zp,q/Bp,q. The induced vertical complexes, with the augmentations induced by ϵ, are injective resolutions of Kp, ZpK, BpK and HpK, respectively: 0KpIp,0Ip,1, 0ZpKZp,0Zp,1, 0BpKBp,0Bp,1, 0HpKHp,0Hp,1. In particular every displayed unaugmented term is injective. The sequences 0Bp,qZp,qHp,q0 and 0Zp,qIp,qBp+1,q0 and their augmentation squares are part of the compatibility. Require these two sequences to be split exact in each bidegree; splittings need not commute with v and are not distinguished data.

For comparison with Homological double complex, set Cr,s=Ir,s and twist the vertical arrow by (1)r, as in Commuting versus anticommuting double complex conventions. The cohomological version of Direct sum total complex of a double complex is therefore TotnI=p+q=nIp,q,DIp,q=h+(1)pv. The identity D2=0 follows from the two square-zero identities and cancellation of the mixed terms. Only bpn occur. Replacing p by pb makes the support first quadrant and shifts total degree by b; the signed differential is the displayed one with the original p.

This definition asks for supplied resolution data and makes no existence or choice claim. The zero bicomplex resolves the zero complex. A complex concentrated in one degree may use a single column resolving that object. Empty diagonals are zero; a one-term diagonal is that term. The lower bound b may be negative.

Depends on

Used by

Dependency tree · two levels

13 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