Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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.

Dimension shift for a homological delta functor effaced in the middle

Statement

Let T=(Tn,∂) be a homological delta functor. For a short exact sequence 0→K→P→A→0 and an integer n>0, the connecting map ∂n:Tn(A)→Tn−1(K) has the following properties:

  1. if Tn(P)→Tn(A) is the zero map, then ∂n is a monomorphism,
  2. if Tn−1(K)→Tn−1(P) is the zero map, then ∂n is an epimorphism,
  3. if both conditions hold, then ∂n is an isomorphism.

Facts & Assumptions

Given: A short exact sequence 0→K→P→A→0 and an integer n>0.

[L1]

A homological delta functor attaches an exact segment Tn(P)→Tn(A)→∂nTn−1(K)→Tn−1(P) to the given short exact sequence (Homological delta functor).

Proof

technique · direct
1.1L1givenalgebra

By [L1], the kernel of ∂n is the image of Tn(P)→Tn(A). Therefore if that incoming map is zero, then ker⁡(∂n)=0 and ∂n is monic.

1.2L1givenalgebra

Again by [L1], the image of ∂n is the kernel of Tn−1(K)→Tn−1(P). If the outgoing map is zero, then that kernel is all of Tn−1(K), so ∂n is epic.

2.1step 1.1step 1.2∎

When both hypotheses hold, steps 1.1 and 1.2 show that ∂n is both monic and epic, hence an isomorphism in the abelian target category.

Depends on

Used by

Dependency tree · two levels

3 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