Day's reflection theorem
ProvedFamousTheorems.day_reflection_theoremDay's reflection theorem. Let be a symmetric monoidal closed category, and let be a fully faithful right adjoint with left adjoint and unit . The following are equivalent:
- is an isomorphism for all and ;
- the precomposition map induced by is an isomorphism for all ;
- is an isomorphism for all ;
- is an isomorphism for all .
Day proved this in 1972. It characterises the reflective subcategories of a closed symmetric monoidal category that are exponential ideals, and for which the reflector is strong monoidal. The monoidal structure then descends to the subcategory. Standard examples include sheafification and localisations of module categories.
Formalization note. Mathlib's CategoryTheory.Monoidal.Reflective.isIso_tfae. ihom d is the internal-hom functor , MonoidalClosed.pre f is precomposition with on internal homs, ▷ is right whiskering and ⊗ₘ is the tensor product of morphisms. Full faithfulness of is given by the instances R.Full and R.Faithful.
import Mathlib
namespace FamousTheorems
open CategoryTheory MonoidalCategory
theorem day_reflection_theorem {C D : Type*} [Category C] [Category D] [MonoidalCategory D] [SymmetricCategory D]
[MonoidalClosed D] {R : Functor C D} [R.Faithful] [R.Full] {L : Functor D C} (adj : L ⊣ R) :
List.TFAE [∀ (c : C) (d : D), IsIso (adj.unit.app ((ihom d).obj (R.obj c))),
∀ (c : C) (d : D), IsIso ((MonoidalClosed.pre (adj.unit.app d)).app (R.obj c)),
∀ d d' : D, IsIso (L.map (adj.unit.app d ▷ d')),
∀ d d' : D, IsIso (L.map (adj.unit.app d ⊗ₘ adj.unit.app d'))] := by sorry
end FamousTheorems