Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

t-cohomology is functorial, additive, shift-compatible and detects amplitude

Statement

Let (T≤0,T≥0) be a t-structure on a triangulated category T, with truncations and t-cohomology as in Truncation functors, t-cohomology, amplitude and bounded t-structures and Truncation triangles are essentially unique and give adjoint truncation functors, and let C=T≤0∩T≥0 be the heart.

(i) Each Htn is a functor from T to C: for every morphism f:X→Y the induced map Htn(f) is the unique map compatible with f under the truncations, and values lie in the heart.

(ii) Shifts. Htn(X[m])≅Htn+m(X) for all m,n∈Z, naturally in X.

(iii) Additivity. For a finite biproduct X⊕Y with injections iX,iY and projections pX,pY, the maps (Htn(iX),Htn(iY)):Htn(X)⊕Htn(Y)→Htn(X⊕Y) and (Htn(pX),Htn(pY)):Htn(X⊕Y)→Htn(X)⊕Htn(Y) are mutually inverse isomorphisms; in particular Htn(X⊕Y)≅Htn(X)⊕Htn(Y) naturally.

(iv) Amplitude detection. If X∈T≤m then Htn(X)=0 for every n>m, and if X∈T≥m then Htn(X)=0 for every n<m. If the t-structure is bounded (Truncation functors, t-cohomology, amplitude and bounded t-structures), the converses hold: Htn(X)=0 for all n>m implies X∈T≤m, and Htn(X)=0 for all n<m implies X∈T≥m.

(v) Concentration and its consequences. If X∈T≤m then τ≥mX≅Htm(X)[−m], and if X∈T≥m then τ≤mX≅Htm(X)[−m]; if X lies in both aisles then the canonical map gives X≅Htm(X)[−m]. If X and Y both lie in T≤m∩T≥m, then the canonical identifications X≅Htm(X)[−m] and Y≅Htm(Y)[−m] identify Hom⁡(X,Y) with Hom⁡(Htm(X),Htm(Y)) via f↦Htm(f); in particular this applies when the t-structure is bounded and X,Y have Htn=0 for every n≠m.

Facts & Assumptions

Given: A t-structure (T≤0,T≥0) on a triangulated category T, with truncation triangles τ≤nX→X→τ≥n+1X→τ≤nX[1], heart C=T≤0∩T≥0 and Htn(X)=(τ≤nτ≥nX)[n].

[F1]

Truncation-triangle package: for T∈T≤n the map Hom⁡(T,τ≤nX)→Hom⁡(T,X), u↦(τ≤nX→X)u, is a bijection natural in X, and dually Hom⁡(τ≥nX,T)→Hom⁡(X,T) is a bijection for T∈T≥n; Hom⁡(T≤n,T≥n+1)=0; T≤m⊆T≤n and T≥n⊆T≥m for m≤n; X∈T≤n if and only if τ≤nX→X is an isomorphism, if and only if τ≥n+1X=0, if and only if Hom⁡(X,T≥n+1)=0, and dually for T≥n; the aisles are closed under extensions and finite direct sums; every decomposition triangle with outer terms in T≤n,T≥n+1 is canonically the truncation triangle (Truncation triangles are essentially unique and give adjoint truncation functors).

[F2]

The translation [1] is an additive autoequivalence with chosen coherence isomorphisms [m][n]≅[m+n] (Triangulated category, Category with translation via Truncation functors, t-cohomology, amplitude and bounded t-structures).

[F3]

The category T is additive, and T≤n and T≥n are additive subcategories: they contain the zero object and are closed under finite direct sums by [F1]. A right or left adjoint between additive categories is additive (Any adjoint between additive categories is additive, Additive functor), and an additive functor preserves split biproduct diagrams, carrying the structure maps of a biproduct to mutually inverse structure maps of the image (An additive functor preserves split biproduct diagrams, Biproduct, Additive category).

Proof

technique · direct
1.1F1F2algebra

Claim (i). The formula Htn(X)=(τ≤nτ≥nX)[n] is a composite of functors by [F1] and [F2], and the induced maps are uniquely compatible with the truncation maps by [F1]. Put Y=τ≥nX and Z=τ≤nY. For T∈T≤n−1, adjunction gives Hom⁡(T,Z)≅Hom⁡(T,Y)=0, since Y∈T≥n. The aisle criterion therefore puts Z in T≥n; it is in T≤n by construction. Consequently Z[n]=Htn(X) lies in the heart by the shift conventions.

1.2F1F2algebra

Claim (ii). For all a,b there is a canonical isomorphism τ≤a(X[b])≅(τ≤a+bX)[b] over X[b], and dually for τ≥a: for T∈T≤a both objects represent the same functor, Hom⁡(T,τ≤a(X[b]))≅Hom⁡(T,X[b]) by the adjunction [F1], and Hom⁡(T,(τ≤a+bX)[b])≅Hom⁡(T[−b],τ≤a+bX)≅Hom⁡(T[−b],X)≅Hom⁡(T,X[b]) because T[−b]∈T≤a+b, so the essential uniqueness in [F1] identifies them. Hence Htn(X[m])=(τ≤nτ≥n(X[m]))[n]≅(τ≤n((τ≥n+mX)[m]))[n]≅((τ≤n+mτ≥n+mX)[m])[n]≅Htn+m(X), using the coherence isomorphisms of [F2], and the isomorphisms are natural in X by functoriality of the truncations.

1.3F1algebra

Claim (iv), the forward implications. If X∈T≤m and n>m, then X∈T≤n−1 by [F1], so τ≥nX=0 by the aisle criterion [F1] and Htn(X)=0. If X∈T≥m and n<m, then X∈T≥n+1 by [F1], so τ≥nX≅X and τ≤nτ≥nX=τ≤nX=0 by the dual aisle criterion, whence Htn(X)=0.

1.4F1algebra

Claim (v), concentration. The identity Htm(X)[−m]=τ≤mτ≥mX is the definition. If X∈T≥m then τ≥mX≅X by [F1], giving the second identity. If X∈T≤m, then τ≥mX∈T≤m: for W∈T≥m+1 one has Hom⁡(τ≥mX,W)≅Hom⁡(X,W)=0 by the adjunction and orthogonality of [F1], so the aisle criterion gives τ≥mX∈T≤m; hence τ≤mτ≥mX≅τ≥mX, giving the first identity. If X lies in both aisles, then τ≤mX≅X and τ≥mX≅X, and the composite canonical map X≅Htm(X)[−m] is the truncation map.

2.1step 1.1F1F2F3

Claim (iii). The inclusion T≤n↪T has the right adjoint τ≤n by [F1], and the inclusion T≥n↪T has the left adjoint τ≥n; these inclusions and T are additive by [F3], so τ≤n and τ≥n are additive functors by [F3], and so is the autoequivalence [n] by [F2]. Hence Htn is additive, and by [F3] it preserves the split biproduct diagram of X⊕Y: the images of the injections and projections under Htn are the two mutually inverse structure maps of a biproduct diagram of Htn(X) and Htn(Y), which is precisely the assertion, and the resulting isomorphism Htn(X⊕Y)≅Htn(X)⊕Htn(Y) is natural by functoriality.

2.2step 1.3step 1.4F1algebra

Claim (iv), the converses for a bounded t-structure. Suppose Htn(X)=0 for all n>m. By boundedness choose N≥m with X∈T≤N∩T≥−N; then X∈T≤N, and if X∈T≤k for some k≥m+1, the concentration identity of step 1.4 gives τ≥kX≅Htk(X)[−k]=0, so X≅τ≤k−1X∈T≤k−1 by the aisle criterion. Descending finitely from N to m+1 gives X∈T≤m. The lower bound is dual: if Htn(X)=0 for all n<m, choose N≥−m with X∈T≤N∩T≥−N and ascend from −N to m−1, using τ≤kX≅Htk(X)[−k]=0 to conclude X→τ≥k+1X is an isomorphism and X∈T≥k+1; the two arguments are independent.

2.3step 1.1step 1.4

Claim (v), map detection. Let X,Y∈T≤m∩T≥m. By step 1.4 the canonical maps give isomorphisms X≅Htm(X)[−m] and Y≅Htm(Y)[−m]; under these, a morphism f:X→Y corresponds to Htm(f): both the source and target identifications are the truncation maps, and Htm is a functor commuting with the truncations by step 1.1, so the induced bijection is f↦Htm(f), and it is a bijection because the identifications are isomorphisms.

3.1step 2.2step 2.3

Claim (v), the bounded single-degree case: if the t-structure is bounded and X,Y have Htn=0 for every n≠m, then step 2.2 (applied to the positive and negative ranges) gives X,Y∈T≤m∩T≥m, so step 2.3 applies and Hom⁡(X,Y)→Hom⁡(Htm(X),Htm(Y)), f↦Htm(f), is a bijection under the canonical identifications.

4.1step 1.1step 1.2step 2.1step 1.3step 1.4step 2.2step 2.3step 3.1∎

Steps 1.1 to 1.4 and 2.2 to 3.1 prove all the clauses: (i) in step 1.1, (ii) in step 1.2, (iii) in step 2.1, both directions of (iv) in steps 1.3 and 2.2, and the concentration identities and map detection of (v) in steps 1.4, 2.3 and 3.1.

Depends on

Used by

Cited to discharge well-definedness by Truncation functors, t-cohomology, amplitude and bounded t-structures.

Dependency tree · two levels

33 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