Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Splitting a bounded complex by vanishing higher Ext

Statement

Assume the standing supplied projective or injective resolution hypotheses and let X have cohomology in a finite interval. If Ext⁡p(HiX,HjX)=0 for every p≥2 and i>j, then X≅⨁iHi(X)[−i], a finite sum. The isomorphism is not asserted canonical. If Ext⁡2(M,N)=0 for every pair, all cohomologically bounded complexes split this way; for this corollary impose also DC and set-sized extension classes as in the Yoneda comparison.

Facts & Assumptions

Given: Assume the standing supplied projective or injective resolution hypotheses and let X have cohomology in a finite interval. If Ext⁡p(HiX,HjX)=0 for every p≥2 and i>j, then X≅⨁iHi(X)[−i], a finite sum. The isomorphism is not asserted canonical. If Ext⁡2(M,N)=0 for every pair, all cohomologically bounded complexes split this way; for this corollary impose also DC and set-sized extension classes as in the Yoneda comparison.

[F1]

Under supplied one-sided resolutions, classical Ext is the corresponding shifted derived Hom (Ext is hom in the derived category).

[F2]

Canonical truncations give distinguished triangles and isolate single cohomology layers (Canonical truncations fit a distinguished triangle).

[F3]

Under its DC, size, and one-sided resolution hypotheses, Yoneda extensions represent all positive derived Ext classes and splicing is shifted composition (Yoneda product is composition in the derived category).

[F4]

Representable Hom applied to a distinguished triangle is exact (Long exact Hom sequences of a distinguished triangle).

[F5]

The canonical biproduct triangle is distinguished (Zero and split triangles are distinguished).

[F6]

Two isomorphism components of a triangle morphism force the third to be an isomorphism (Two isomorphism components of a morphism of triangles force the third).

Proof

1.1F4F5F6algebra

First let A→uB→vC→wA[1] be distinguished with w=0. Hom exactness supplies s:C→B with vs=1C. The split triangle maps to this triangle by (1A,(u,s),1C): the middle square uses vu=0,vs=1, and the last square uses w=0. Two isomorphism components force (u,s) to be an isomorphism. Conversely such a split-triangle isomorphism forces w=0. This includes zero vertices.

1.2F2algebra

Choose a≤b bounding the cohomology. For empty cohomological support the object is zero, and for a single degree the canonical truncation maps identify X with Ha(X)[−a]. If a<b, use the triangle τ≤b−1X→X→Hb(X)[−b]→(τ≤b−1X)[1]. Induction on b−a identifies its head with ⨁a≤i<bHi(X)[−i].

2.1F1step 1.1step 1.2algebra

The connecting map lies in the finite direct sum of groups Hom⁡D(HbX[−b],HiX[−i+1])=Ext⁡b−i+1(HbX,HiX). Since i<b, every exponent is at least two, so each group vanishes by hypothesis. The splitting criterion in step 1.1 completes the induction. Its section s was chosen and need not be unique.

3.1F3step 2.1algebra∎

Under the additional Yoneda hypotheses, any positive-degree Ext class is a Yoneda extension class. For p>2, break its exact extension at the image after the last two arrows toward its quotient endpoint. It becomes a splice of a two-extension and a (p−2)-extension. If all two-extension groups vanish, composition compatibility makes the splice zero. Thus all Ext groups of degree at least two vanish for all pairs, and step 2.1 applies.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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