Library UniMath.Bicategories.ComprehensionCat.Biequivalence.DFLCompCatToFinLim

1. The action on objects

Section DFLFullCompCatLimits.
  Context (C : dfl_full_comp_cat).

  Definition binproducts_dfl_full_comp_cat
    : BinProducts C.
  Show proof.

    use (adj_equiv_preserves_binproducts_f
           (dfl_full_comp_cat_adjequiv_base C)).
    apply fiberwise_binproducts_dfl_full_comp_cat.

  Definition equalizers_dfl_full_comp_cat
    : Equalizers C.
  Show proof.

    use (adj_equiv_preserves_equalizers_f
           (dfl_full_comp_cat_adjequiv_base C)).
    apply fiberwise_equalizers_dfl_full_comp_cat.

End DFLFullCompCatLimits.

Definition dfl_full_comp_cat_to_finlim
(C : dfl_full_comp_cat)
: univ_cat_with_finlim.
Show proof.

  use make_univ_cat_with_finlim.
  - exact C.
  - exact [].
  - use Pullbacks_from_Equalizers_BinProducts.
    + exact (binproducts_dfl_full_comp_cat C).
    + exact (equalizers_dfl_full_comp_cat C).

2. The action on morphisms

Section DFLFullCompCatLimitPreservation.
Context {C₁ C₂ : dfl_full_comp_cat}
(F : dfl_full_comp_cat_functor C₁ C₂).

To construct the action on morphisms, one needs to show that the underlying functor of a functor between comprehension categories preserves both equalizers and binary products. The idea is that we have a diagram of functors commutes up to natural isomorphism. This diagram consists of two squares: one is given by `τ` and the other is given by `θ` below. The horizontal sides, which are `χ₁ ∙ E₁` and `χ₂ ∙ E₂`, of this square are adjoint equivalences, and for that reason, the functor `F` preserves products and equalizers whenever the fiber functor does. Since we assume product types and equalizer types to be stable under substitution, the fiber functor indeed preserves them, and thus `F` does so as well.

  Let T₂ : Terminal C₂
    := make_Terminal _ (comp_cat_functor_terminal F [] (pr2 [])).

  Let χ ₁ : (disp_cat_of_types C₁ )[{[]}] ⟶ (disp_codomain C₁ )[{[]}]
    := fiber_functor (comp_cat_comprehension C₁) [].
  Let χ ₂ : (disp_cat_of_types C₂ )[{F []}] ⟶ (disp_codomain C₂ )[{F []}]
    := fiber_functor (comp_cat_comprehension C₂) (F []).
  Let FF : (disp_cat_of_types C₁ )[{[]}] ⟶ (disp_cat_of_types C₂ )[{F []}]
    := fiber_functor (comp_cat_type_functor F) [].
  Let Farr : (disp_codomain C₁ )[{[]}] ⟶ (disp_codomain C₂ )[{F []}]
    := fiber_functor (disp_codomain_functor F) [].
  Let τ : nat_z_iso (FF ∙ χ ₂) (χ ₁ ∙ Farr)
    := full_comp_cat_fiber_nat_z_iso_inv F [].

  Let E₁ : (C₁ / []) ⟶ C₁
    := cod_fib_terminal_to_base [].
  Let E₂ : (C₂ / T₂ ) ⟶ C₂
    := cod_fib_terminal_to_base T₂.

  Let θ : nat_z_iso (Farr ∙ E₂) (E₁ ∙ F)
    := cod_fib_terminal_to_base_nat_z_iso
         F
         (comp_cat_functor_terminal F)
         [].

  Definition dfl_functor_nat_z_iso
    : nat_z_iso (FF ∙ (χ ₂ ∙ E₂ )) ((χ ₁ ∙ E₁ ) ∙ F)
    := nat_z_iso_comp
         (post_whisker_nat_z_iso τ E₂)
         (pre_whisker_nat_z_iso χ ₁ θ).

  Let τ θ : nat_z_iso (FF ∙ (χ ₂ ∙ E₂ )) ((χ ₁ ∙ E₁ ) ∙ F)
    := dfl_functor_nat_z_iso.

  Definition preserves_binproduct_binproducts_dfl_functor
    : preserves_binproduct F.
  Show proof.

    use (preserves_binproduct_equivalence_f _ _ _ _ _ _ τ θ).
    - use comp_adj_equivalence_of_cats.
      + apply dfl_full_comp_cat_adjequiv_empty.
      + apply cod_fib_terminal.
    - use comp_adj_equivalence_of_cats.
      + exact (dfl_full_comp_cat_adjequiv_terminal C₂ T₂).
      + exact (cod_fib_terminal T₂).
    - apply preserves_binproducts_dfl_full_comp_cat_functor.

  Definition preserves_equalizer_binproducts_dfl_functor
    : preserves_equalizer F.
  Show proof.

     use (preserves_equalizer_equivalence_f _ _ _ _ _ _ τ θ).
    - use comp_adj_equivalence_of_cats.
      + apply dfl_full_comp_cat_adjequiv_empty.
      + apply cod_fib_terminal.
    - use comp_adj_equivalence_of_cats.
      + exact (dfl_full_comp_cat_adjequiv_terminal C₂ T₂).
      + exact (cod_fib_terminal T₂).
    - apply preserves_equalizers_dfl_full_comp_cat_functor.

End DFLFullCompCatLimitPreservation.

Definition dfl_functor_comp_cat_to_finlim_functor
           {C₁ C₂ : dfl_full_comp_cat}
           (F : dfl_full_comp_cat_functor C₁ C₂)
  : functor_finlim
      (dfl_full_comp_cat_to_finlim C₁)
      (dfl_full_comp_cat_to_finlim C₂).
Show proof.

  use make_functor_finlim.
  - exact F.
  - exact (comp_cat_functor_terminal F).
  - use preserves_pullback_from_binproduct_equalizer.
    + exact (binproducts_dfl_full_comp_cat C₁).
    + exact (equalizers_dfl_full_comp_cat C₁).
    + exact (preserves_binproduct_binproducts_dfl_functor F).
    + exact (preserves_equalizer_binproducts_dfl_functor F).

3. The action on 2-cells

Definition dfl_functor_comp_cat_to_finlim_nat_trans
           {C₁ C₂ : dfl_full_comp_cat}
           {F G : dfl_full_comp_cat_functor C₁ C₂}
           (τ : dfl_full_comp_cat_nat_trans F G)
  : nat_trans_finlim
      (dfl_functor_comp_cat_to_finlim_functor F)
      (dfl_functor_comp_cat_to_finlim_functor G).
Show proof.

use make_nat_trans_finlim.
exact τ.

4. The identitor and compositor

Definition dfl_functor_comp_cat_to_finlim_identitor
           (C : dfl_full_comp_cat)
  : id₁ (dfl_full_comp_cat_to_finlim C )
    ==>
    dfl_functor_comp_cat_to_finlim_functor (id₁ C).
Show proof.

use make_nat_trans_finlim.
apply nat_trans_id.

Definition dfl_functor_comp_cat_to_finlim_compositor
           {C₁ C₂ C₃ : bicat_of_dfl_full_comp_cat}
           (F : C₁ --> C₂)
           (G : C₂ --> C₃)
  : dfl_functor_comp_cat_to_finlim_functor F · dfl_functor_comp_cat_to_finlim_functor G
    ==>
    dfl_functor_comp_cat_to_finlim_functor (F · G).
Show proof.

use make_nat_trans_finlim.
apply nat_trans_id.

5. The data of the pseudofunctor

Definition dfl_full_comp_cat_to_finlim_psfunctor_data
  : psfunctor_data
      bicat_of_dfl_full_comp_cat
      bicat_of_univ_cat_with_finlim.
Show proof.

  use make_psfunctor_data.
  - exact dfl_full_comp_cat_to_finlim.
  - exact (λ _ _ F , dfl_functor_comp_cat_to_finlim_functor F).
  - exact (λ _ _ _ _ τ , dfl_functor_comp_cat_to_finlim_nat_trans τ).
  - exact dfl_functor_comp_cat_to_finlim_identitor.
  - exact (λ _ _ _ F G , dfl_functor_comp_cat_to_finlim_compositor F G).

6. The laws of the pseudofunctor

Proposition dfl_full_comp_cat_to_finlim_psfunctor_laws
: psfunctor_laws dfl_full_comp_cat_to_finlim_psfunctor_data.
Show proof.

  refine (_ ,, _ ,, _ ,, _ ,, _ ,, _ ,, _) ;
    intro ; intros ;
    use nat_trans_finlim_eq ;
    intro ; cbn.
  - apply idpath.
  - apply idpath.
  - rewrite !id_right.
    exact (!(functor_id _ _)).
  - rewrite !id_right.
    apply idpath.
  - rewrite !id_left, !id_right.
    exact (!(functor_id _ _)).
  - rewrite !id_left, !id_right.
    apply idpath.
  - rewrite !id_left, !id_right.
    apply idpath.

Definition dfl_full_comp_cat_to_finlim_invertible_cells
: invertible_cells dfl_full_comp_cat_to_finlim_psfunctor_data.
Show proof.

  split.
  - intro C.
    use is_invertible_2cell_cat_with_finlim.
    apply is_nat_z_iso_nat_trans_id.
  - intros C₁ C₂ C₃ F G.
    use is_invertible_2cell_cat_with_finlim.
    apply is_nat_z_iso_nat_trans_id.

7. The pseudofunctor from DFL comprehension categories to categories with finite limits

Definition dfl_comp_cat_to_finlim_psfunctor
  : psfunctor
      bicat_of_dfl_full_comp_cat
      bicat_of_univ_cat_with_finlim.
Show proof.

  use make_psfunctor.
  - exact dfl_full_comp_cat_to_finlim_psfunctor_data.
  - exact dfl_full_comp_cat_to_finlim_psfunctor_laws.
  - exact dfl_full_comp_cat_to_finlim_invertible_cells.