open import Cat.Displayed.Cartesian
open import Cat.Instances.Functor
open import Cat.Displayed.Base
open import Cat.Prelude

import Cat.Displayed.Reasoning as Dr
import Cat.Displayed.Solver as Ds

module
  Cat.Displayed.Instances.Pullback
    {o β„“ oβ€² β„“β€² oβ€²β€² β„“β€²β€²}
    {X : Precategory o β„“} {B : Precategory oβ€² β„“β€²}
    (F : Functor X B)
    (E : Displayed B oβ€²β€² β„“β€²β€²)
  where

Pullback of a displayed categoryπŸ”—

If we have a category EE displayed over BB, then a functor F:Xβ†’BF : X \to B defines a (contravariant) β€œchange-of-base” action, resulting in a category Fβˆ—(E)F^*(E) displayed over XX.

The reason for this contravariance is the following: A category displayed over XX must have a XX-indexed space of objects; But our category EE has a BB-indexed space of objects. Fortunately, FF gives us a map x↦F0(x)x \mapsto F_0(x) which allows us to convert our XX-indices to BB-indices. The same goes for indexing the displayed Hom\mathbf{Hom}-sets.

Change-of-base : Displayed X oβ€²β€² β„“β€²β€²
Change-of-base .Ob[_] x      = E.Ob[ Fβ‚€ x ]
Change-of-base .Hom[_] f x y = E.Hom[ F₁ f ] x y
Change-of-base .Hom[_]-set f = E.Hom[ F₁ f ]-set
Change-of-base .idβ€²          = hom[ sym F-id ] E.idβ€²
Change-of-base ._βˆ˜β€²_ fβ€² gβ€²   = hom[ sym (F-∘ _ _) ] (fβ€² E.βˆ˜β€² gβ€²)

Proving that the pullback Fβˆ—(E)F^*(E) is indeed a displayed category is a bit trickier than it might seem β€” we must adjust the identity and composites in EE by the paths witnessing functoriality of FF, and this really throws a spanner in the works β€” but the handy displayed category reasoning combinators are here to help.

Change-of-base .idrβ€² {f = f} fβ€² = to-pathp $
  hom[] (hom[ F-∘ _ _ ]⁻ (fβ€² E.βˆ˜β€² hom[ F-id ]⁻ _)) β‰‘βŸ¨ hom[]⟩⟨ smashr _ _ βŸ©β‰‘
  hom[] (hom[] (fβ€² E.βˆ˜β€² E.idβ€²))                    β‰‘βŸ¨ Ds.disp! E βŸ©β‰‘
  fβ€²                                               ∎

Change-of-base .idlβ€² fβ€² = to-pathp $
  hom[] (hom[ F-∘ _ _ ]⁻ (hom[ F-id ]⁻ _ E.βˆ˜β€² fβ€²)) β‰‘βŸ¨ hom[]⟩⟨ smashl _ _ βŸ©β‰‘
  hom[] (hom[] (E.idβ€² E.βˆ˜β€² fβ€²))                    β‰‘βŸ¨ Ds.disp! E βŸ©β‰‘
  fβ€²                                               ∎

Change-of-base .assocβ€² fβ€² gβ€² hβ€² = to-pathp $
  hom[ ap F₁ _ ] (hom[ F-∘ _ _ ]⁻ (fβ€² E.βˆ˜β€² hom[ F-∘ _ _ ]⁻ (gβ€² E.βˆ˜β€² hβ€²)))   β‰‘βŸ¨ hom[]⟩⟨ smashr _ _ βŸ©β‰‘
  hom[] (hom[] (fβ€² E.βˆ˜β€² gβ€² E.βˆ˜β€² hβ€²))                                        β‰‘βŸ¨ Ds.disp! E βŸ©β‰‘
  hom[ sym (F-∘ _ _) ] (hom[ sym (F-∘ _ _) ] (fβ€² E.βˆ˜β€² gβ€²) E.βˆ˜β€² hβ€²)          ∎

As a fibrationπŸ”—

If E\mathcal{E} is a cartesian fibration, then the base change of E\mathcal{E} along FF is also cartesian. To prove this, observe that the object and hom spaces of Change-of-base contain the same data as E\mathcal{E}, just restricted to objects and morphisms in the image of FF. This means that we still have cartesian lifts of all morphisms in X\mathcal{X}: we just have to perform the lifting of FfF f.

Change-of-base-fibration : Cartesian-fibration E β†’ Cartesian-fibration Change-of-base
Change-of-base-fibration fib .Cartesian-fibration.has-lift f FYβ€² = cart-lift
  where
    open Cartesian-lift (Cartesian-fibration.has-lift fib (F₁ f) FYβ€²)

    cart-lift : Cartesian-lift Change-of-base f FYβ€²
    cart-lift .Cartesian-lift.xβ€² = xβ€²
    cart-lift .Cartesian-lift.lifting = lifting
    cart-lift .Cartesian-lift.cartesian .is-cartesian.universal m hβ€² =
      universal (F .Functor.F₁ m) (hom[ F-∘ f m ] hβ€²)
    cart-lift .Cartesian-lift.cartesian .is-cartesian.commutes m hβ€² =
      hom[ F-∘ f m ]⁻ (lifting E.βˆ˜β€² universal (F₁ m) (hom[ F-∘ f m ] hβ€²)) β‰‘βŸ¨ ap hom[ F-∘ f m ]⁻ (commutes _ _) βŸ©β‰‘
      hom[ F-∘ f m ]⁻ (hom[ F-∘ f m ] hβ€²)                                 β‰‘βŸ¨ Ds.disp! E βŸ©β‰‘
      hβ€²                                                                  ∎
    cart-lift .Cartesian-lift.cartesian .is-cartesian.unique {m = m} {hβ€² = hβ€²} mβ€² p =
      unique mβ€² $
        lifting E.βˆ˜β€² mβ€²                                    β‰‘βŸ¨ Ds.disp! E βŸ©β‰‘
        hom[ F-∘ f m ] (hom[ F-∘ f m ]⁻ (lifting E.βˆ˜β€² mβ€²)) β‰‘βŸ¨ ap hom[ F-∘ f m ] p βŸ©β‰‘
        hom[ F-∘ f m ] hβ€² ∎