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 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 .

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 } }

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

Alias of CategoryTheory.homOfLE.

---

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} : LE.le.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.

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

Alias of CategoryTheory.leOfHom.

---

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

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) : LE.le.hom ⋯ = h

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 = { toInhabited := { default := CategoryTheory.homOfLE ⋯ }, uniq := ⋯ }

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

Equations

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

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

• Monotone.functor h = { toPrefunctor := { 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) : (Monotone.functor h).obj = f

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

• CategoryTheory.Equivalence.toOrderIso e = { toEquiv := { 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) : (CategoryTheory.Equivalence.toOrderIso e) 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) : (OrderIso.symm (CategoryTheory.Equivalence.toOrderIso e)) y = e.inverse.obj y