Documentation

TauCeti.CategoryTheory.Triangulated.VerdierLocalization

Verdier localizations: kernels and comparison functors #

Let C be a pretriangulated category and P a class of objects. Mathlib's Verdier localization inverts the class P.trW of morphisms whose cone satisfies P. This file records the elementary facts relating P to the localization and to triangle functors, and the comparison functors between two Verdier localizations.

The statements about P.trW itself hold for arbitrary P in a pretriangulated C:

Mathlib only constructs the triangulated structure on the localization at P.trW (through the calculus of fractions and the compatibility with the triangulation) when C is triangulated and P is a triangulated subcategory. Under these hypotheses the statements above have the following consequences for Verdier quotients:

Main definitions #

Main results #

References #

The zero objects of a pretriangulated category form a triangulated subcategory.

A triangle functor inverts the morphisms whose cone lies in P if and only if it sends every object of P to a zero object. When C is triangulated and P is a triangulated subcategory, so that the localization at P.trW is triangulated, this together with the localization universal property identifies the triangle functors that factor through the Verdier quotient by P.

An object of P becomes zero in the Verdier localization at P.

The kernel of the Verdier localization. If P is a thick triangulated subcategory of a triangulated category, an object becomes zero in the Verdier localization at P if and only if it belongs to P.

theorem CategoryTheory.ObjectProperty.TrWLocalization.exists_map_comp_eq_map {C : Type u_1} [Category.{v_1, u_1} C] [Limits.HasZeroObject C] [Preadditive C] [HasShift C ℤ] [∀ (n : ℤ), (shiftFunctor C n).Additive] [Pretriangulated C] (P : ObjectProperty C) {D : Type u_2} [Category.{v_2, u_2} D] (L : Functor C D) [L.IsLocalization P.trW] [IsTriangulated C] [P.IsTriangulated] {ι : Type u_3} {X : ι → C} {X₀ : C} (δ : (i : ι) → X i ⟶ X₀) (H : ∀ (K : C), P K → ∀ (a : X₀ ⟶ K), ∃ (i : ι), CategoryStruct.comp (δ i) a = 0) {Y : C} (g : L.obj X₀ ⟶ L.obj Y) :
∃ (i : ι) (h : X i ⟶ Y), CategoryStruct.comp (L.map (δ i)) g = L.map h

Morphisms out of an approximated object. Let δᵢ : Xᵢ ⟶ X₀ be morphisms such that every morphism from X₀ to an object of P is killed by some δᵢ. Then every morphism L X₀ ⟶ L Y in the Verdier localization becomes, after precomposition with some L δᵢ, the image of a morphism Xᵢ ⟶ Y.

theorem CategoryTheory.ObjectProperty.TrWLocalization.exists_comp_eq_zero_of_map_eq_zero {C : Type u_1} [Category.{v_1, u_1} C] [Limits.HasZeroObject C] [Preadditive C] [HasShift C ℤ] [∀ (n : ℤ), (shiftFunctor C n).Additive] [Pretriangulated C] (P : ObjectProperty C) {D : Type u_2} [Category.{v_2, u_2} D] (L : Functor C D) [L.IsLocalization P.trW] [Limits.HasZeroMorphisms D] [L.PreservesZeroMorphisms] [IsTriangulated C] [P.IsTriangulated] {ι : Type u_3} {X : ι → C} {X₀ : C} (δ : (i : ι) → X i ⟶ X₀) (H : ∀ (K : C), P K → ∀ (a : X₀ ⟶ K), ∃ (i : ι), CategoryStruct.comp (δ i) a = 0) {Y : C} (f : X₀ ⟶ Y) (hf : L.map f = 0) :
∃ (i : ι), CategoryStruct.comp (δ i) f = 0

The kernel on an approximated object. Let δᵢ : Xᵢ ⟶ X₀ be morphisms such that every morphism from X₀ to an object of P is killed by some δᵢ. A morphism f : X₀ ⟶ Y that vanishes in the Verdier localization is killed by some δᵢ.

For P ≤ Q, the identity functor of C, as a morphism of localizers from the morphisms with cone in P to the morphisms with cone in Q. It induces a comparison functor between any localizations at P.trW and Q.trW; when C is triangulated and P, Q are triangulated subcategories, this is the comparison triangle functor between the Verdier quotients.

Instances For