open import 1Lab.Reflection.Record

open import Cat.Instances.Functor
open import Cat.Instances.Product
open import Cat.Diagram.Product
open import Cat.Prelude

module Cat.Instances.StrictCat where

Strict precategoriesπŸ”—

We call a precategory strict if its space of objects is a Set. While general precategories are too homotopically interesting to fit into a Precategory (because functor spaces will not, in general, be h-sets), the strict categories do form a precategory, which we denote Catstrict{{{\mathfrak{Cat}}}_{\mathrm{strict}}}.

Strict-cats : βˆ€ o h β†’ Precategory _ _
Strict-cats o h .Ob = Σ[ C ∈ Precategory o h ] (is-set (Ob C))
Strict-cats o h .Hom (C , _) (D , _) = Functor C D
Strict-cats o h .id  = Id
Strict-cats o h ._∘_ = _F∘_
Strict-cats o h .idr _       = Functor-path (Ξ» _ β†’ refl) Ξ» _ β†’ refl
Strict-cats o h .idl _       = Functor-path (Ξ» _ β†’ refl) Ξ» _ β†’ refl
Strict-cats o h .assoc _ _ _ = Functor-path (Ξ» _ β†’ refl) Ξ» _ β†’ refl

This assembles into a Precategory because the only bit of a Functor that doesn’t have a fixed h-level is the object mapping; By asking that D be a strict category, this fixes the functors to be sets.

Strict-cats o h .Hom-set _ (D , dset) = Functor-is-set dset

ProductsπŸ”—

We prove that Strict-cats has products. This is because (CΓ—D)0(\mathcal{C} \times \mathcal{D})_0 is C0Γ—D0\mathcal{C}_0 \times \mathcal{D}_0, and h-levels are closed under products.

Strict-cats-products
  : {C D : Precategory o h}
  β†’ (cob : is-set (Ob C)) (dob : is-set (Ob D))
  β†’ Product (Strict-cats o h) (C , cob) (D , dob)
Strict-cats-products {C = C} {D = D} cob dob = prod where
  prod : Product (Strict-cats _ _) (C , cob) (D , dob)
  prod .apex = C Γ—αΆœ D , Γ—-is-hlevel 2 cob dob
  prod .π₁ = Fst {C = C} {D = D}
  prod .Ο€β‚‚ = Snd {C = C} {D = D}
  prod .has-is-product .⟨_,_⟩ p q = Cat⟨ p , q ⟩Cat
  prod .has-is-product .Ο€β‚βˆ˜factor = Functor-path (Ξ» _ β†’ refl) Ξ» _ β†’ refl
  prod .has-is-product .Ο€β‚‚βˆ˜factor = Functor-path (Ξ» _ β†’ refl) Ξ» _ β†’ refl
  prod .has-is-product .unique other p q =
    Functor-path (Ξ» x i β†’ Fβ‚€ (p i) x , Fβ‚€ (q i) x) Ξ» f i β†’ F₁ (p i) f , F₁ (q i) f