Alphabeta Math
TheoremStatement: 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.

The canonical pair is a t structure

Statement

The canonical pair is a t-structure on D(A) and on each of D,D+,Db by intersection. More generally if Hi(X)=0 for i>a and Hj(Y)=0 for j<b, then HomD(X,Y[n])=0 for n<ba, and naturally HomD(X,Y[ba])HomA(HaX,HbY).

Facts & Assumptions

Given: The canonical pair is a t-structure on D(A) and on each of D,D+,Db by intersection. More generally if Hi(X)=0 for i>a and Hj(Y)=0 for j<b, then HomD(X,Y[n])=0 for n<ba, and naturally HomD(X,Y[ba])HomA(HaX,HbY).

[F1]

The t-structure axioms consist of shift inclusions, orthogonality, and a decomposition triangle (Canonical t structure on a derived category).

[F2]

Canonical truncations preserve exactly the cohomology degrees on their retained sides (Canonical truncation is a complex and has the claimed cohomology).

[F3]

Canonical truncations fit distinguished triangles (Canonical truncations fit a distinguished triangle).

[F4]

The bounded derived localizations are fully faithful exact subcategories with the specified cohomological supports (Bounded derived localizations embed fully faithfully).

Proof

1.1

Replace Y by τbY and in any left roof out of X replace its vertex L by τaL. These replacements are quasi-isomorphisms, including when all cohomology vanishes. A map LY[n] is zero if n<ba, since every degree has either zero source or zero target.

F2algebra
2.1

At n=ba only degree a can be nonzero. The chain-map equations say exactly that this component kills imdLa1 and lands in kerdY[n]a, so it is a map HaLHbY. Homotopies cannot alter this component: their possibly contributing terms have source above a or target below a. A denominator induces an isomorphism on Ha, so roof refinements give the same map HaXHbY. Conversely such a map defines a chain map from τaX into (τbY)[ba] by quotient then inclusion. The two constructions are inverse, by replacing a roof vertex as in step 1.1; all maps are the specified cohomology maps, hence natural.

F2step 1.1algebra
2.2

The identity Hi(X[1])=Hi+1(X) gives the two shift inclusions. Step 1.1 with a=0,b=1,n=0 gives orthogonality. The triangle τ0XXτ1X gives the required decomposition with the prescribed cohomology supports. These verify all axioms.

F1F2F3step 1.1
3.1

Canonical truncations preserve every one-sided or two-sided cohomological boundedness condition. The bounded embeddings are full and exact, so the same Hom vanishing and the same decomposition triangles lie in each bounded category. This proves the restricted t-structures.

F4step 2.2

Depends on

Used by

Cited to discharge well-definedness by Canonical t structure on a derived category.

Dependency tree · two levels

10 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