module Cat.Displayed.Instances.Subobjects
  {o β„“} (B : Precategory o β„“)

The fibration of subobjectsπŸ”—

Given a base category we can define the displayed category of subobjects over This is, in essence, a restriction of the codomain fibration of but with our attention restricted to the monomorphisms rather than arbitrary maps

record Subobject (y : Ob) : Type (o βŠ” β„“) where
    {domain} : Ob
    map   : Hom domain y
    monic : is-monic map

open Subobject public

To make formalisation smoother, we define our own version of displayed morphisms in the subobject fibration, rather than reusing those of the fundamental self-indexing. The reason for this is quite technical: the type of maps in the self-indexing is only dependent (the domains and) the morphisms being considered, meaning nothing constrains the proofs that these are monomorphisms, causing unification to fail at the determining the full Subobjects involved.

record ≀-over {x y} (f : Hom x y) (a : Subobject x) (b : Subobject y) : Type β„“ where
    map : Hom (a .domain) (b .domain)
    sq : f ∘ a ≑ b ∘ map

open ≀-over public

We will denote the type of maps in the subobject fibration by since there is at most one such map: if satisfy then, since is a mono,

Setting up the displayed category is now nothing more than routine verification: the identity map satisfies and commutative squares can be pasted together.

Subobjects : Displayed B (o βŠ” β„“) β„“
Subobjects .Ob[_] y = Subobject y
Subobjects .Hom[_]  = ≀-over
Subobjects .Hom[_]-set f a b = hlevel 2

Subobjects .id' .map = id
Subobjects .id' .sq  = id-comm-sym

Subobjects ._∘'_ α β .map = α .map ∘ β .map
Subobjects ._∘'_ Ξ± Ξ² .sq  = pullr (Ξ² .sq) βˆ™ extendl (Ξ± .sq)

As a fibrationπŸ”—

By exactly the same construction as for the fundamental self-indexing, if has pullbacks, the displayed category we have built is actually a fibration. The construction is slightly simpler now that we have no need to worry about uniqueness, but we can remind ourselves of the universal property:

On the first stage, we are given the data in black: we can complete an open span to a Cartesian square (in blue) by pulling back along this base change remains a monomorphism. Now given the data in red, we verify that the dashed arrow exists, which is enough for its uniqueness.

  : has-pullbacks B
  β†’ Cartesian-fibration Subobjects
Subobject-fibration pb .has-lift f y' = l where
  it : Pullback _ _ _
  it = pb (y' .map) f
  l : Cartesian-lift Subobjects f y'

  -- The blue square:
  l .x' .domain = it .apex
  l .x' .map    = it .pβ‚‚
  l .x' .monic  = is-monic→pullback-is-monic (y' .monic) (it .has-is-pb)
  l .lifting .map = it .p₁
  l .lifting .sq  = sym (it .square)

  -- The dashed red arrow:
  l .cartesian .universal {u' = u'} m h' = Ξ» where
    .map β†’ it .Pullback.universal (sym (h' .sq) βˆ™ sym (assoc f m (u' .map)))
    .sq  β†’ sym (it .pβ‚‚βˆ˜universal)
  l .cartesian .commutes _ _ = prop!
  l .cartesian .unique _ _   = prop!

As a (weak) cocartesian fibrationπŸ”—

If has an image factorisation for every morphism, then its fibration of subobjects is a weak cocartesian fibration. By a general fact, if also has pullbacks, then is a cocartesian fibration.

  : (βˆ€ {x y} (f : Hom x y) β†’ Image B f)
  β†’ is-weak-cocartesian-fibration Subobjects
Subobject-weak-opfibration ims .weak-lift f x' = l where
  module im = Image B (ims (f ∘ x' .map))

To understand this result, we remind ourselves of the universal property of an image factorisation for It is the initial subobject through with factors. That is to say, if is another subobject, and for some map then Summarised diagrammatically, the universal property of an image factorisation looks like a kite:

Now compare this with the universal property required of a weak co-cartesian lift:

By smooshing the corner together (i.e., composing and we see that this is exactly the kite-shaped universal property of

  l : Weak-cocartesian-lift Subobjects f x'
  l .y' .domain = im.Im
  l .y' .map    = im.Im→codomain
  l .y' .monic  = im.Im→codomain-is-M

  l .lifting .map = im.corestrict
  l .lifting .sq  = sym im.image-factors

  l .weak-cocartesian .universal {x' = y'} h .map = im.universal _ (y' .monic) (h .map) (sym (h .sq))
  l .weak-cocartesian .universal h .sq = idl _ βˆ™ sym im.universal-factors

  l .weak-cocartesian .commutes g' = prop!
  l .weak-cocartesian .unique _ _  = prop!

The aforementioned general fact says that any cartesian and weak cocartesian fibration must actually be a full opfibration.

  : (βˆ€ {x y} (f : Hom x y) β†’ Image B f)
  β†’ (pb : has-pullbacks B)
  β†’ Cocartesian-fibration Subobjects
Subobject-opfibration images pb = cartesian+weak-opfibration→opfibration _
  (Subobject-fibration pb)
  (Subobject-weak-opfibration images)

Subobjects over a baseπŸ”—

We define the category of subobjects of as a fibre of the subobject fibration. However, we use a purpose-built transport function to cut down on the number of coherences required to work with at use-sites.

Sub : Ob β†’ Precategory (o βŠ” β„“) β„“
Sub y = Fibre' Subobjects y re coh where
  re : βˆ€ {a b} β†’ ≀-over (id ∘ id) a b β†’ ≀-over id a b
  re x .map = x .map
  re x .sq  = apβ‚‚ _∘_ (introl refl) refl βˆ™ x .sq

    coh : βˆ€ {a b} (f : ≀-over (id ∘ id) a b) β†’ re f ≑ transport (Ξ» i β†’ ≀-over (idl id i) a b) f
    coh f = prop!

module Sub {y} = Cr (Sub y)

Fibrewise cartesian structureπŸ”—

Since products in slice categories are given by pullbacks, and pullbacks preserve monomorphisms, if has pullbacks, then has products, regardless of what is.

  : βˆ€ {y}
  β†’ has-pullbacks B
  β†’ has-products (Sub y)
Sub-products {y} pb a b = prod where
  it = pb (a .map) (b .map)

  prod : Product (Sub y) a b
  prod .Product.apex .domain = it .apex
  prod .Product.apex .map = a .map ∘ it .p₁
  prod .Product.apex .monic = monic-∘
    (a .monic)
    (is-monic→pullback-is-monic (b .monic) (rotate-pullback (it .has-is-pb)))

  prod .Product.π₁ .map = it .p₁
  prod .Product.π₁ .sq  = idl _

  prod .Product.Ο€β‚‚ .map = it .pβ‚‚
  prod .Product.Ο€β‚‚ .sq  = idl _ βˆ™ it .square

  prod .Product.has-is-product .is-product.⟨_,_⟩ q≀a q≀b .map =
    it .Pullback.universal {p₁' = q≀a .map} {pβ‚‚' = q≀b .map} (sym (q≀a .sq) βˆ™ q≀b .sq)
  prod .Product.has-is-product .is-product.⟨_,_⟩ q≀a q≀b .sq =
    idl _ βˆ™ sym (pullr (it .pβ‚βˆ˜universal) βˆ™ sym (q≀a .sq) βˆ™ idl _)
  prod .Product.has-is-product .is-product.Ο€β‚βˆ˜factor = prop!
  prod .Product.has-is-product .is-product.Ο€β‚‚βˆ˜factor = prop!
  prod .Product.has-is-product .is-product.unique _ _ _ = prop!


Since identity of is given by identity of they underlying objects and identity-over of the corresponding morphisms, if is univalent, we can conclude that is, too. Since is always thin, we can summarise the situation by saying that is a partial order if is univalent.

Sub-is-category : βˆ€ {y} β†’ is-category B β†’ is-category (Sub y)
Sub-is-category b-cat .to-path {a} {b} x =
    (b-cat .to-path i)
    (Univalent.Hom-pathp-refll-iso b-cat (sym (x .Sub.from .sq) βˆ™ idl _))
    i : a .domain β‰… b .domain
    i = make-iso (x .map) (x .Sub.from .map) (ap map (Sub.invl x)) (ap map (Sub.invr x))
Sub-is-category b-cat .to-path-over p =
  Sub.β‰…-pathp refl _ prop!