Preorders as categories

We install a category instance on any preorder. This is not to be confused with the category of preorders, defined in Order.Category.Preorder.

We show that monotone functions between preorders correspond to functors of the associated categories.

Main definitions

• homOfLE and leOfHom provide translations between inequalities in the preorder, and morphisms in the associated category.
• Monotone.functor is the functor associated to a monotone function.

@[instance 100]

instance Preorder.smallCategory (α : Type u) [Preorder α] : CategoryTheory.SmallCategory α

The category structure coming from a preorder. There is a morphism X ⟶ Y if and only if X ≤ Y.

Because we don't allow morphisms to live in Prop, we have to define X ⟶ Y as ULift (PLift (X ≤ Y)). See CategoryTheory.homOfLE and CategoryTheory.leOfHom.

See https://stacks.math.columbia.edu/tag/00D3.

Equations

• Preorder.smallCategory α = CategoryTheory.Category.mk ⋯ ⋯ ⋯

instance Preorder.subsingleton_hom {α : Type u} [Preorder α] (U : α) (V : α) : Subsingleton (U ⟶ V)

Equations

• ⋯ = ⋯

def CategoryTheory.homOfLE {X : Type u} [Preorder X] {x : X} {y : X} (h : x ≤ y) : x ⟶ y

Express an inequality as a morphism in the corresponding preorder category.

Equations

• CategoryTheory.homOfLE h = { down := { down := h } }

@[reducible, inline]

abbrev LE.le.hom {X : Type u_1} [Preorder X] {x : X} {y : X} (h : x ≤ y) : x ⟶ y

Express an inequality as a morphism in the corresponding preorder category.

Equations

• @LE.le.hom = @CategoryTheory.homOfLE

@[simp]

theorem CategoryTheory.homOfLE_refl {X : Type u} [Preorder X] {x : X} (h : x ≤ x) : h.hom = CategoryTheory.CategoryStruct.id x

@[simp]

theorem CategoryTheory.homOfLE_comp {X : Type u} [Preorder X] {x : X} {y : X} {z : X} (h : x ≤ y) (k : y ≤ z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE h) (CategoryTheory.homOfLE k) = CategoryTheory.homOfLE ⋯

theorem CategoryTheory.leOfHom {X : Type u} [Preorder X] {x : X} {y : X} (h : x ⟶ y) : x ≤ y

Extract the underlying inequality from a morphism in a preorder category.

@[reducible, inline]

abbrev Quiver.Hom.le {X : Type u_1} [Preorder X] {x : X} {y : X} (h : x ⟶ y) : x ≤ y

Extract the underlying inequality from a morphism in a preorder category.

Equations

• @Quiver.Hom.le = @CategoryTheory.leOfHom

theorem CategoryTheory.leOfHom_homOfLE {X : Type u} [Preorder X] {x : X} {y : X} (h : x ≤ y) : ⋯ = h

theorem CategoryTheory.homOfLE_leOfHom {X : Type u} [Preorder X] {x : X} {y : X} (h : x ⟶ y) : ⋯.hom = h

theorem CategoryTheory.homOfLE_isIso_of_eq {X : Type u} [Preorder X] {x : X} {y : X} (h : x ≤ y) (heq : x = y) : CategoryTheory.IsIso (CategoryTheory.homOfLE h)

theorem CategoryTheory.homOfLE_comp_eqToHom_assoc {X : Type u} [Preorder X] {a : X} {b : X} {c : X} (hab : a ≤ b) (hbc : b = c) {Z : X} (h : c ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hab) (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hbc) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE ⋯) h

@[simp]

theorem CategoryTheory.homOfLE_comp_eqToHom {X : Type u} [Preorder X] {a : X} {b : X} {c : X} (hab : a ≤ b) (hbc : b = c) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hab) (CategoryTheory.eqToHom hbc) = CategoryTheory.homOfLE ⋯

theorem CategoryTheory.eqToHom_comp_homOfLE_assoc {X : Type u} [Preorder X] {a : X} {b : X} {c : X} (hab : a = b) (hbc : b ≤ c) {Z : X} (h : c ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hab) (CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hbc) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE ⋯) h

@[simp]

theorem CategoryTheory.eqToHom_comp_homOfLE {X : Type u} [Preorder X] {a : X} {b : X} {c : X} (hab : a = b) (hbc : b ≤ c) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hab) (CategoryTheory.homOfLE hbc) = CategoryTheory.homOfLE ⋯

theorem CategoryTheory.homOfLE_op_comp_eqToHom_assoc {X : Type u} [Preorder X] {a : X} {b : X} {c : X} (hab : b ≤ a) (hbc : { unop := b } = { unop := c }) {Z : Xᵒᵖ} (h : { unop := c } ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hab).op (CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hbc) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE ⋯).op h

@[simp]

theorem CategoryTheory.homOfLE_op_comp_eqToHom {X : Type u} [Preorder X] {a : X} {b : X} {c : X} (hab : b ≤ a) (hbc : { unop := b } = { unop := c }) : CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hab).op (CategoryTheory.eqToHom hbc) = (CategoryTheory.homOfLE ⋯).op

theorem CategoryTheory.eqToHom_comp_homOfLE_op_assoc {X : Type u} [Preorder X] {a : X} {b : X} {c : X} (hab : { unop := a } = { unop := b }) (hbc : c ≤ b) {Z : Xᵒᵖ} (h : { unop := c } ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hab) (CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE hbc).op h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.homOfLE ⋯).op h

@[simp]

theorem CategoryTheory.eqToHom_comp_homOfLE_op {X : Type u} [Preorder X] {a : X} {b : X} {c : X} (hab : { unop := a } = { unop := b }) (hbc : c ≤ b) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom hab) (CategoryTheory.homOfLE hbc).op = (CategoryTheory.homOfLE ⋯).op

def CategoryTheory.opHomOfLE {X : Type u} [Preorder X] {x : Xᵒᵖ} {y : Xᵒᵖ} (h : x.unop ≤ y.unop) : y ⟶ x

Construct a morphism in the opposite of a preorder category from an inequality.

Equations

• CategoryTheory.opHomOfLE h = (CategoryTheory.homOfLE h).op

theorem CategoryTheory.le_of_op_hom {X : Type u} [Preorder X] {x : Xᵒᵖ} {y : Xᵒᵖ} (h : x ⟶ y) : y.unop ≤ x.unop

instance CategoryTheory.uniqueToTop {X : Type u} [Preorder X] [OrderTop X] {x : X} : Unique (x ⟶ ⊤)

Equations

• CategoryTheory.uniqueToTop = { default := CategoryTheory.homOfLE ⋯, uniq := ⋯ }

instance CategoryTheory.uniqueFromBot {X : Type u} [Preorder X] [OrderBot X] {x : X} : Unique (⊥ ⟶ x)

Equations

• CategoryTheory.uniqueFromBot = { default := CategoryTheory.homOfLE ⋯, uniq := ⋯ }

@[simp]

theorem CategoryTheory.orderDualEquivalence_inverse_map (X : Type u) [Preorder X] : ∀ {X_1 Y : Xᵒᵖ} (f : X_1 ⟶ Y), (CategoryTheory.orderDualEquivalence X).inverse.map f = CategoryTheory.homOfLE ⋯

@[simp]

theorem CategoryTheory.orderDualEquivalence_functor_map (X : Type u) [Preorder X] : ∀ {X_1 Y : Xᵒᵈ} (f : X_1 ⟶ Y), (CategoryTheory.orderDualEquivalence X).functor.map f = (CategoryTheory.homOfLE ⋯).op

@[simp]

theorem CategoryTheory.orderDualEquivalence_inverse_obj (X : Type u) [Preorder X] (x : Xᵒᵖ) : (CategoryTheory.orderDualEquivalence X).inverse.obj x = OrderDual.toDual x.unop

@[simp]

theorem CategoryTheory.orderDualEquivalence_functor_obj (X : Type u) [Preorder X] (x : Xᵒᵈ) : (CategoryTheory.orderDualEquivalence X).functor.obj x = { unop := OrderDual.ofDual x }

@[simp]

theorem CategoryTheory.orderDualEquivalence_unitIso (X : Type u) [Preorder X] : (CategoryTheory.orderDualEquivalence X).unitIso = CategoryTheory.Iso.refl (CategoryTheory.Functor.id Xᵒᵈ)

@[simp]

theorem CategoryTheory.orderDualEquivalence_counitIso (X : Type u) [Preorder X] : (CategoryTheory.orderDualEquivalence X).counitIso = CategoryTheory.Iso.refl ({ obj := fun (x : Xᵒᵖ) => OrderDual.toDual x.unop, map := fun {X_1 Y : Xᵒᵖ} (f : X_1 ⟶ Y) => CategoryTheory.homOfLE ⋯, map_id := ⋯, map_comp := ⋯ }.comp { obj := fun (x : Xᵒᵈ) => { unop := OrderDual.ofDual x }, map := fun {X_1 Y : Xᵒᵈ} (f : X_1 ⟶ Y) => (CategoryTheory.homOfLE ⋯).op, map_id := ⋯, map_comp := ⋯ })

def CategoryTheory.orderDualEquivalence (X : Type u) [Preorder X] : Xᵒᵈ ≌ Xᵒᵖ

The equivalence of categories from the order dual of a preordered type X to the opposite category of the preorder X.

Equations

• One or more equations did not get rendered due to their size.

def Monotone.functor {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] {f : X → Y} (h : Monotone f) : CategoryTheory.Functor X Y

A monotone function between preorders induces a functor between the associated categories.

Equations

• h.functor = { obj := f, map := fun {X_1 Y_1 : X} (g : X_1 ⟶ Y_1) => CategoryTheory.homOfLE ⋯, map_id := ⋯, map_comp := ⋯ }

@[simp]

theorem Monotone.functor_obj {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] {f : X → Y} (h : Monotone f) : h.functor.obj = f

instance instFullFunctor {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (f : X ↪o Y) : ⋯.functor.Full

Equations

• ⋯ = ⋯

@[simp]

theorem OrderIso.equivalence_inverse {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (e : X ≃o Y) : e.equivalence.inverse = ⋯.functor

@[simp]

theorem OrderIso.equivalence_counitIso {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (e : X ≃o Y) : e.equivalence.counitIso = CategoryTheory.NatIso.ofComponents (fun (x : Y) => CategoryTheory.eqToIso ⋯) ⋯

@[simp]

theorem OrderIso.equivalence_unitIso {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (e : X ≃o Y) : e.equivalence.unitIso = CategoryTheory.NatIso.ofComponents (fun (x : X) => CategoryTheory.eqToIso ⋯) ⋯

@[simp]

theorem OrderIso.equivalence_functor {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (e : X ≃o Y) : e.equivalence.functor = ⋯.functor

def OrderIso.equivalence {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (e : X ≃o Y) : X ≌ Y

The equivalence of categories X ≌ Y induced by e : X ≃o Y.

Equations

• One or more equations did not get rendered due to their size.

theorem CategoryTheory.Functor.monotone {X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (f : CategoryTheory.Functor X Y) : Monotone f.obj

A functor between preorder categories is monotone.

theorem CategoryTheory.Iso.to_eq {X : Type u} [PartialOrder X] {x : X} {y : X} (f : x ≅ y) : x = y

def CategoryTheory.Equivalence.toOrderIso {X : Type u} {Y : Type v} [PartialOrder X] [PartialOrder Y] (e : X ≌ Y) : X ≃o Y

A categorical equivalence between partial orders is just an order isomorphism.

Equations

• e.toOrderIso = { toFun := e.functor.obj, invFun := e.inverse.obj, left_inv := ⋯, right_inv := ⋯, map_rel_iff' := ⋯ }

@[simp]

theorem CategoryTheory.Equivalence.toOrderIso_apply {X : Type u} {Y : Type v} [PartialOrder X] [PartialOrder Y] (e : X ≌ Y) (x : X) : e.toOrderIso x = e.functor.obj x

@[simp]

theorem CategoryTheory.Equivalence.toOrderIso_symm_apply {X : Type u} {Y : Type v} [PartialOrder X] [PartialOrder Y] (e : X ≌ Y) (y : Y) : e.toOrderIso.symm y = e.inverse.obj y