Documentation

DerivedAlgGeo.Algebra.Homology.DGCategory.AdjunctionH0Presentation

Presenting a dg adjunction on ordinary categories #

A strict dg adjunction A : L ⊣ R induces A.h0 : L.h0 ⊣ R.h0. An application usually does not use the literal homotopy categories, however: it has equivalences H⁰ C ≌ X and H⁰ D ≌ Y, and names the transported functors by ordinary functors F : X ⥤ Y and G : Y ⥤ X.

DGAdjunction.H0Presentation packages exactly those two functor identifications. Its toAdjunction is obtained only by composing Mathlib adjunctions and transporting along Mathlib natural isomorphisms. The construction therefore introduces no second notion of transported adjunction. The unit and counit accessors expose the comparison maps needed by cone and kernel presentations downstream.

The category equivalences are arguments rather than Enhancements because pretriangulated structure is irrelevant here. Taking them to be the comparison equivalences of two enhancements is the intended principal use.

What this does not provide #

The functor isomorphisms are supplied data. In particular, this file does not show that a geometric functor has a dg lift, construct a Fourier--Mukai kernel, or turn an ordinary adjunction into a dg adjunction. Nor does it identify the transported adjunction with some independently chosen adjunction: that requires compatibility of units or counits, not merely the fact that the endpoint functors are isomorphic.

@[reducible, inline]
abbrev CategoryTheory.DGAdjunction.transportedH0Left {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {L : DGFunctor C D} (eC : H0 C ≌ X) (eD : H0 D ≌ Y) :

The left functor obtained from L.h0 by changing source and target along the supplied category equivalences.

Equations
Instances For
    @[reducible, inline]
    abbrev CategoryTheory.DGAdjunction.transportedH0Right {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {R : DGFunctor D C} (eC : H0 C ≌ X) (eD : H0 D ≌ Y) :

    The right functor obtained from R.h0 by changing source and target along the supplied category equivalences. Its parentheses match the right adjoint produced by two applications of Adjunction.comp.

    Equations
    Instances For
      noncomputable def CategoryTheory.DGAdjunction.transportedH0 {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {L : DGFunctor C D} {R : DGFunctor D C} (A : DGAdjunction L R) (eC : H0 C ≌ X) (eD : H0 D ≌ Y) :

      Transport the adjunction induced by a strict dg adjunction through two equivalences of ordinary categories.

      This is the composite of eC.symm.toAdjunction, A.h0, and eD.toAdjunction; all coherence is inherited from Mathlib's Adjunction.comp.

      Equations
      Instances For
        theorem CategoryTheory.DGAdjunction.transportedH0_unit_app {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {L : DGFunctor C D} {R : DGFunctor D C} (A : DGAdjunction L R) (eC : H0 C ≌ X) (eD : H0 D ≌ Y) (Z : X) :

        Expand both Adjunction.comp steps in the transported unit, making the original h0Unit visible between the source- and target-equivalence units.

        theorem CategoryTheory.DGAdjunction.transportedH0_counit_app {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {L : DGFunctor C D} {R : DGFunctor D C} (A : DGAdjunction L R) (eC : H0 C ≌ X) (eD : H0 D ≌ Y) (Z : Y) :

        Expand both Adjunction.comp steps in the transported counit, making the original h0Counit visible between the source- and target-equivalence counits.

        structure CategoryTheory.DGAdjunction.H0Presentation {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {L : DGFunctor C D} {R : DGFunctor D C} (eC : H0 C ≌ X) (eD : H0 D ≌ Y) (F : Functor X Y) (G : Functor Y X) :
        Type (max (max (max uX uY) vX) vY)

        Data presenting two dg functors, after passage to H⁰ and transport through category equivalences, by named ordinary functors.

        The data depends only on the endpoint functors. A particular adjunction between them is supplied later to toAdjunction, so the same presentation may be reused for more than one adjunction structure.

        • leftIso : transportedH0Left eC eD ≅ F

          Identification of the transported left dg functor with its ordinary presentation.

        • rightIso : transportedH0Right eC eD ≅ G

          Identification of the transported right dg functor with its ordinary presentation.

        Instances For
          noncomputable def CategoryTheory.DGAdjunction.H0Presentation.toAdjunction {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {L : DGFunctor C D} {R : DGFunctor D C} {eC : H0 C ≌ X} {eD : H0 D ≌ Y} {F : Functor X Y} {G : Functor Y X} (P : H0Presentation eC eD F G) (A : DGAdjunction L R) :
          F ⊣ G

          The ordinary adjunction presented by P.

          Mathlib first transports the composed H⁰ adjunction along leftIso, then along rightIso.

          Equations
          Instances For

            The presented unit is the transported H⁰ unit followed by the two stored functor comparisons.

            The presented counit is the inverse right comparison, then the inverse left comparison, followed by the transported H⁰ counit. This is the normal form consumed by a counit-cone or counit-kernel presentation.

            theorem CategoryTheory.DGAdjunction.H0Presentation.toAdjunction_unit_app {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {L : DGFunctor C D} {R : DGFunctor D C} {eC : H0 C ≌ X} {eD : H0 D ≌ Y} {F : Functor X Y} {G : Functor Y X} (P : H0Presentation eC eD F G) (A : DGAdjunction L R) (Z : X) :

            Pointwise normal form of the presented unit.

            theorem CategoryTheory.DGAdjunction.H0Presentation.toAdjunction_counit_app {C : Type uC} {D : Type uD} {X : Type uX} {Y : Type uY} [DGCategory C] [DGCategory D] [Category.{vX, uX} X] [Category.{vY, uY} Y] {L : DGFunctor C D} {R : DGFunctor D C} {eC : H0 C ≌ X} {eD : H0 D ≌ Y} {F : Functor X Y} {G : Functor Y X} (P : H0Presentation eC eD F G) (A : DGAdjunction L R) (Z : Y) :

            Pointwise normal form of the presented counit.