Discrete categories

We define Discrete α as a structure containing a term a : α for any type α, and use this type alias to provide a SmallCategory instance whose only morphisms are the identities.

There is an annoying technical difficulty that it has turned out to be inconvenient to allow categories with morphisms living in Prop, so instead of defining X ⟶ Y in Discrete α as X = Y, one might define it as PLift (X = Y). In fact, to allow Discrete α to be a SmallCategory (i.e. with morphisms in the same universe as the objects), we actually define the hom type X ⟶ Y as ULift (PLift (X = Y)).

Discrete.functor promotes a function f : I → C (for any category C) to a functor Discrete.functor f : Discrete I ⥤ C.

Similarly, Discrete.natTrans and Discrete.natIso promote I-indexed families of morphisms, or I-indexed families of isomorphisms to natural transformations or natural isomorphism.

We show equivalences of types are the same as (categorical) equivalences of the corresponding discrete categories.

structure CategoryTheory.Discrete (α : Type u₁) : Type u₁

A wrapper for promoting any type to a category, with the only morphisms being equalities.

• as : α

  A wrapper for promoting any type to a category, with the only morphisms being equalities.

theorem CategoryTheory.Discrete.ext {α : Type u₁} {x y : CategoryTheory.Discrete α} (as : x.as = y.as) : x = y

@[simp]

theorem CategoryTheory.Discrete.mk_as {α : Type u₁} (X : CategoryTheory.Discrete α) : { as := X.as } = X

def CategoryTheory.discreteEquiv {α : Type u₁} : CategoryTheory.Discrete α ≃ α

Discrete α is equivalent to the original type α.

Equations

• CategoryTheory.discreteEquiv = { toFun := CategoryTheory.Discrete.as, invFun := CategoryTheory.Discrete.mk, left_inv := ⋯, right_inv := ⋯ }

@[simp]

theorem CategoryTheory.discreteEquiv_apply {α : Type u₁} (self : CategoryTheory.Discrete α) : CategoryTheory.discreteEquiv self = self.as

@[simp]

theorem CategoryTheory.discreteEquiv_symm_apply_as {α : Type u₁} (as : α) : (CategoryTheory.discreteEquiv.symm as).as = as

instance CategoryTheory.instDecidableEqDiscrete {α : Type u₁} [DecidableEq α] : DecidableEq (CategoryTheory.Discrete α)

Equations

• CategoryTheory.instDecidableEqDiscrete = CategoryTheory.discreteEquiv.decidableEq

instance CategoryTheory.discreteCategory (α : Type u₁) : CategoryTheory.SmallCategory (CategoryTheory.Discrete α)

The "Discrete" category on a type, whose morphisms are equalities.

Because we do not allow morphisms in Prop (only in Type), somewhat annoyingly we have to define X ⟶ Y as ULift (PLift (X = Y)).

See https://stacks.math.columbia.edu/tag/001A

Equations

• CategoryTheory.discreteCategory α = CategoryTheory.Category.mk ⋯ ⋯ ⋯

instance CategoryTheory.Discrete.instInhabited {α : Type u₁} [Inhabited α] : Inhabited (CategoryTheory.Discrete α)

Equations

• CategoryTheory.Discrete.instInhabited = { default := { as := default } }

instance CategoryTheory.Discrete.instSubsingleton {α : Type u₁} [Subsingleton α] : Subsingleton (CategoryTheory.Discrete α)

Equations

• ⋯ = ⋯

instance CategoryTheory.Discrete.instSubsingletonDiscreteHom {α : Type u₁} (X Y : CategoryTheory.Discrete α) : Subsingleton (X ⟶ Y)

Equations

• ⋯ = ⋯

def CategoryTheory.Discrete.tacticDiscrete_cases : Lean.ParserDescr

A simple tactic to run cases on any Discrete α hypotheses.

Equations

• CategoryTheory.Discrete.tacticDiscrete_cases = Lean.ParserDescr.node `CategoryTheory.Discrete.tacticDiscrete_cases 1024 (Lean.ParserDescr.nonReservedSymbol "discrete_cases" false)

def CategoryTheory.Discrete.discreteCases : Lean.Elab.Tactic.TacticM Unit

Use:

attribute [local aesop safe tactic (rule_sets := [CategoryTheory])]
  CategoryTheory.Discrete.discreteCases

to locally gives aesop_cat the ability to call cases on Discrete and (_ : Discrete _) ⟶ (_ : Discrete _) hypotheses.

Equations

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

instance CategoryTheory.Discrete.instUnique {α : Type u₁} [Unique α] : Unique (CategoryTheory.Discrete α)

Equations

• CategoryTheory.Discrete.instUnique = Unique.mk' (CategoryTheory.Discrete α)

theorem CategoryTheory.Discrete.eq_of_hom {α : Type u₁} {X Y : CategoryTheory.Discrete α} (i : X ⟶ Y) : X.as = Y.as

Extract the equation from a morphism in a discrete category.

@[reducible, inline]

abbrev CategoryTheory.Discrete.eqToHom {α : Type u₁} {X Y : CategoryTheory.Discrete α} (h : X.as = Y.as) : X ⟶ Y

Promote an equation between the wrapped terms in X Y : Discrete α to a morphism X ⟶ Y in the discrete category.

Equations

• CategoryTheory.Discrete.eqToHom h = CategoryTheory.eqToHom ⋯

@[reducible, inline]

abbrev CategoryTheory.Discrete.eqToIso {α : Type u₁} {X Y : CategoryTheory.Discrete α} (h : X.as = Y.as) : X ≅ Y

Promote an equation between the wrapped terms in X Y : Discrete α to an isomorphism X ≅ Y in the discrete category.

Equations

• CategoryTheory.Discrete.eqToIso h = CategoryTheory.eqToIso ⋯

@[reducible, inline]

abbrev CategoryTheory.Discrete.eqToHom' {α : Type u₁} {a b : α} (h : a = b) : { as := a } ⟶ { as := b }

A variant of eqToHom that lifts terms to the discrete category.

Equations

• CategoryTheory.Discrete.eqToHom' h = CategoryTheory.Discrete.eqToHom h

@[reducible, inline]

abbrev CategoryTheory.Discrete.eqToIso' {α : Type u₁} {a b : α} (h : a = b) : { as := a } ≅ { as := b }

A variant of eqToIso that lifts terms to the discrete category.

Equations

• CategoryTheory.Discrete.eqToIso' h = CategoryTheory.Discrete.eqToIso h

@[simp]

theorem CategoryTheory.Discrete.id_def {α : Type u₁} (X : CategoryTheory.Discrete α) : { down := { down := ⋯ } } = CategoryTheory.CategoryStruct.id X

instance CategoryTheory.Discrete.instIsIso {I : Type u₁} {i j : CategoryTheory.Discrete I} (f : i ⟶ j) : CategoryTheory.IsIso f

Equations

• ⋯ = ⋯

def CategoryTheory.Discrete.functor {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} (F : I → C) : CategoryTheory.Functor (CategoryTheory.Discrete I) C

Any function I → C gives a functor Discrete I ⥤ C.

Equations

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

@[simp]

theorem CategoryTheory.Discrete.functor_obj {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} (F : I → C) (i : I) : (CategoryTheory.Discrete.functor F).obj { as := i } = F i

@[simp]

theorem CategoryTheory.Discrete.functor_map {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} (F : I → C) {i : CategoryTheory.Discrete I} (f : i ⟶ i) : (CategoryTheory.Discrete.functor F).map f = CategoryTheory.CategoryStruct.id (F i.as)

@[deprecated CategoryTheory.Discrete.functor_map]

theorem CategoryTheory.Discrete.CategoryTheory.FreeMonoidalCategory.discrete_functor_map_eq_id {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} (F : I → C) {i : CategoryTheory.Discrete I} (f : i ⟶ i) : (CategoryTheory.Discrete.functor F).map f = CategoryTheory.CategoryStruct.id (F i.as)

Alias of CategoryTheory.Discrete.functor_map.

@[simp]

theorem CategoryTheory.Discrete.functor_obj_eq_as {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} (F : I → C) (X : CategoryTheory.Discrete I) : (CategoryTheory.Discrete.functor F).obj X = F X.as

@[deprecated CategoryTheory.Discrete.functor_obj_eq_as]

theorem CategoryTheory.Discrete.CategoryTheory.FreeMonoidalCategory.discrete_functor_obj_eq_as {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} (F : I → C) (X : CategoryTheory.Discrete I) : (CategoryTheory.Discrete.functor F).obj X = F X.as

Alias of CategoryTheory.Discrete.functor_obj_eq_as.

def CategoryTheory.Discrete.functorComp {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {J : Type u₁'} (f : J → C) (g : I → J) : CategoryTheory.Discrete.functor (f ∘ g) ≅ (CategoryTheory.Discrete.functor (CategoryTheory.Discrete.mk ∘ g)).comp (CategoryTheory.Discrete.functor f)

The discrete functor induced by a composition of maps can be written as a composition of two discrete functors.

Equations

• CategoryTheory.Discrete.functorComp f g = CategoryTheory.NatIso.ofComponents (fun (x : CategoryTheory.Discrete I) => CategoryTheory.Iso.refl ((CategoryTheory.Discrete.functor (f ∘ g)).obj x)) ⋯

@[simp]

theorem CategoryTheory.Discrete.functorComp_hom_app {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {J : Type u₁'} (f : J → C) (g : I → J) (X : CategoryTheory.Discrete I) : (CategoryTheory.Discrete.functorComp f g).hom.app X = CategoryTheory.CategoryStruct.id (f (g X.as))

@[simp]

theorem CategoryTheory.Discrete.functorComp_inv_app {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {J : Type u₁'} (f : J → C) (g : I → J) (X : CategoryTheory.Discrete I) : (CategoryTheory.Discrete.functorComp f g).inv.app X = CategoryTheory.CategoryStruct.id (f (g X.as))

def CategoryTheory.Discrete.natTrans {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {F G : CategoryTheory.Functor (CategoryTheory.Discrete I) C} (f : (i : CategoryTheory.Discrete I) → F.obj i ⟶ G.obj i) : F ⟶ G

For functors out of a discrete category, a natural transformation is just a collection of maps, as the naturality squares are trivial.

Equations

• CategoryTheory.Discrete.natTrans f = { app := f, naturality := ⋯ }

@[simp]

theorem CategoryTheory.Discrete.natTrans_app {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {F G : CategoryTheory.Functor (CategoryTheory.Discrete I) C} (f : (i : CategoryTheory.Discrete I) → F.obj i ⟶ G.obj i) (i : CategoryTheory.Discrete I) : (CategoryTheory.Discrete.natTrans f).app i = f i

def CategoryTheory.Discrete.natIso {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {F G : CategoryTheory.Functor (CategoryTheory.Discrete I) C} (f : (i : CategoryTheory.Discrete I) → F.obj i ≅ G.obj i) : F ≅ G

For functors out of a discrete category, a natural isomorphism is just a collection of isomorphisms, as the naturality squares are trivial.

Equations

• CategoryTheory.Discrete.natIso f = CategoryTheory.NatIso.ofComponents f ⋯

@[simp]

theorem CategoryTheory.Discrete.natIso_inv_app {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {F G : CategoryTheory.Functor (CategoryTheory.Discrete I) C} (f : (i : CategoryTheory.Discrete I) → F.obj i ≅ G.obj i) (X : CategoryTheory.Discrete I) : (CategoryTheory.Discrete.natIso f).inv.app X = (f X).inv

@[simp]

theorem CategoryTheory.Discrete.natIso_hom_app {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {F G : CategoryTheory.Functor (CategoryTheory.Discrete I) C} (f : (i : CategoryTheory.Discrete I) → F.obj i ≅ G.obj i) (X : CategoryTheory.Discrete I) : (CategoryTheory.Discrete.natIso f).hom.app X = (f X).hom

instance CategoryTheory.Discrete.instIsIsoFunctorNatTrans {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u_1} {F G : CategoryTheory.Functor (CategoryTheory.Discrete I) C} (f : (i : CategoryTheory.Discrete I) → F.obj i ⟶ G.obj i) [∀ (i : CategoryTheory.Discrete I), CategoryTheory.IsIso (f i)] : CategoryTheory.IsIso (CategoryTheory.Discrete.natTrans f)

Equations

• ⋯ = ⋯

@[simp]

theorem CategoryTheory.Discrete.natIso_app {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {F G : CategoryTheory.Functor (CategoryTheory.Discrete I) C} (f : (i : CategoryTheory.Discrete I) → F.obj i ≅ G.obj i) (i : CategoryTheory.Discrete I) : (CategoryTheory.Discrete.natIso f).app i = f i

def CategoryTheory.Discrete.natIsoFunctor {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {F : CategoryTheory.Functor (CategoryTheory.Discrete I) C} : F ≅ CategoryTheory.Discrete.functor (F.obj ∘ CategoryTheory.Discrete.mk)

Every functor F from a discrete category is naturally isomorphic (actually, equal) to Discrete.functor (F.obj).

Equations

• CategoryTheory.Discrete.natIsoFunctor = CategoryTheory.Discrete.natIso fun (x : CategoryTheory.Discrete I) => CategoryTheory.Iso.refl (F.obj x)

def CategoryTheory.Discrete.compNatIsoDiscrete {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] {I : Type u₁} {D : Type u₃} [CategoryTheory.Category.{v₃, u₃} D] (F : I → C) (G : CategoryTheory.Functor C D) : (CategoryTheory.Discrete.functor F).comp G ≅ CategoryTheory.Discrete.functor (G.obj ∘ F)

Composing Discrete.functor F with another functor G amounts to composing F with G.obj

Equations

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

def CategoryTheory.Discrete.equivalence {I : Type u₁} {J : Type u₂} (e : I ≃ J) : CategoryTheory.Discrete I ≌ CategoryTheory.Discrete J

We can promote a type-level Equiv to an equivalence between the corresponding discrete categories.

Equations

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

@[simp]

theorem CategoryTheory.Discrete.equivalence_unitIso {I : Type u₁} {J : Type u₂} (e : I ≃ J) : (CategoryTheory.Discrete.equivalence e).unitIso = CategoryTheory.Discrete.natIso fun (i : CategoryTheory.Discrete I) => CategoryTheory.eqToIso ⋯

@[simp]

theorem CategoryTheory.Discrete.equivalence_counitIso {I : Type u₁} {J : Type u₂} (e : I ≃ J) : (CategoryTheory.Discrete.equivalence e).counitIso = CategoryTheory.Discrete.natIso fun (j : CategoryTheory.Discrete J) => CategoryTheory.eqToIso ⋯

@[simp]

theorem CategoryTheory.Discrete.equivalence_inverse {I : Type u₁} {J : Type u₂} (e : I ≃ J) : (CategoryTheory.Discrete.equivalence e).inverse = CategoryTheory.Discrete.functor (CategoryTheory.Discrete.mk ∘ ⇑e.symm)

@[simp]

theorem CategoryTheory.Discrete.equivalence_functor {I : Type u₁} {J : Type u₂} (e : I ≃ J) : (CategoryTheory.Discrete.equivalence e).functor = CategoryTheory.Discrete.functor (CategoryTheory.Discrete.mk ∘ ⇑e)

def CategoryTheory.Discrete.equivOfEquivalence {α : Type u₁} {β : Type u₂} (h : CategoryTheory.Discrete α ≌ CategoryTheory.Discrete β) : α ≃ β

We can convert an equivalence of discrete categories to a type-level Equiv.

Equations

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

@[simp]

theorem CategoryTheory.Discrete.equivOfEquivalence_apply {α : Type u₁} {β : Type u₂} (h : CategoryTheory.Discrete α ≌ CategoryTheory.Discrete β) (a✝ : α) : (CategoryTheory.Discrete.equivOfEquivalence h) a✝ = (CategoryTheory.Discrete.as ∘ h.functor.obj ∘ CategoryTheory.Discrete.mk) a✝

@[simp]

theorem CategoryTheory.Discrete.equivOfEquivalence_symm_apply {α : Type u₁} {β : Type u₂} (h : CategoryTheory.Discrete α ≌ CategoryTheory.Discrete β) (a✝ : β) : (CategoryTheory.Discrete.equivOfEquivalence h).symm a✝ = (CategoryTheory.Discrete.as ∘ h.inverse.obj ∘ CategoryTheory.Discrete.mk) a✝

def CategoryTheory.Discrete.opposite (α : Type u₁) : (CategoryTheory.Discrete α)ᵒᵖ ≌ CategoryTheory.Discrete α

A discrete category is equivalent to its opposite category.

Equations

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

@[simp]

theorem CategoryTheory.Discrete.opposite_inverse_obj (α : Type u₁) (a✝ : CategoryTheory.Discrete α) : (CategoryTheory.Discrete.opposite α).inverse.obj a✝ = Opposite.op a✝

@[simp]

theorem CategoryTheory.Discrete.opposite_functor_obj_as (α : Type u₁) (X : (CategoryTheory.Discrete α)ᵒᵖ) : ((CategoryTheory.Discrete.opposite α).functor.obj X).as = (Opposite.unop X).as

@[simp]

theorem CategoryTheory.Discrete.functor_map_id {J : Type v₁} {C : Type u₂} [CategoryTheory.Category.{v₂, u₂} C] (F : CategoryTheory.Functor (CategoryTheory.Discrete J) C) {j : CategoryTheory.Discrete J} (f : j ⟶ j) : F.map f = CategoryTheory.CategoryStruct.id (F.obj j)

def CategoryTheory.piEquivalenceFunctorDiscrete (J : Type u₂) (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] : J → C ≌ CategoryTheory.Functor (CategoryTheory.Discrete J) C

The equivalence of categories (J → C) ≌ (Discrete J ⥤ C).

Equations

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

@[simp]

theorem CategoryTheory.piEquivalenceFunctorDiscrete_unitIso (J : Type u₂) (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] : (CategoryTheory.piEquivalenceFunctorDiscrete J C).unitIso = CategoryTheory.Iso.refl (CategoryTheory.Functor.id (J → C))

@[simp]

theorem CategoryTheory.piEquivalenceFunctorDiscrete_inverse_obj (J : Type u₂) (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor (CategoryTheory.Discrete J) C) (j : J) : (CategoryTheory.piEquivalenceFunctorDiscrete J C).inverse.obj F j = F.obj { as := j }

@[simp]

theorem CategoryTheory.piEquivalenceFunctorDiscrete_inverse_map (J : Type u₂) (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] {X✝ Y✝ : CategoryTheory.Functor (CategoryTheory.Discrete J) C} (f : X✝ ⟶ Y✝) (j : J) : (CategoryTheory.piEquivalenceFunctorDiscrete J C).inverse.map f j = f.app { as := j }

@[simp]

theorem CategoryTheory.piEquivalenceFunctorDiscrete_functor_obj (J : Type u₂) (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] (F : J → C) : (CategoryTheory.piEquivalenceFunctorDiscrete J C).functor.obj F = CategoryTheory.Discrete.functor F

@[simp]

theorem CategoryTheory.piEquivalenceFunctorDiscrete_functor_map (J : Type u₂) (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] {X✝ Y✝ : J → C} (f : X✝ ⟶ Y✝) : (CategoryTheory.piEquivalenceFunctorDiscrete J C).functor.map f = CategoryTheory.Discrete.natTrans fun (j : CategoryTheory.Discrete J) => f j.as

@[simp]

theorem CategoryTheory.piEquivalenceFunctorDiscrete_counitIso (J : Type u₂) (C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] : (CategoryTheory.piEquivalenceFunctorDiscrete J C).counitIso = CategoryTheory.NatIso.ofComponents (fun (F : CategoryTheory.Functor (CategoryTheory.Discrete J) C) => CategoryTheory.NatIso.ofComponents (fun (x : CategoryTheory.Discrete J) => CategoryTheory.Iso.refl ((({ obj := fun (F : CategoryTheory.Functor (CategoryTheory.Discrete J) C) (j : J) => F.obj { as := j }, map := fun {X Y : CategoryTheory.Functor (CategoryTheory.Discrete J) C} (f : X ⟶ Y) (j : J) => f.app { as := j }, map_id := ⋯, map_comp := ⋯ }.comp { obj := fun (F : J → C) => CategoryTheory.Discrete.functor F, map := fun {X Y : J → C} (f : X ⟶ Y) => CategoryTheory.Discrete.natTrans fun (j : CategoryTheory.Discrete J) => f j.as, map_id := ⋯, map_comp := ⋯ }).obj F).obj x)) ⋯) ⋯

class CategoryTheory.IsDiscrete (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] : Prop

A category is discrete when there is at most one morphism between two objects, in which case they are equal.

• subsingleton : ∀ (X Y : C), Subsingleton (X ⟶ Y)
• eq_of_hom : ∀ {X Y : C}, (X ⟶ Y) → X = Y

theorem CategoryTheory.obj_ext_of_isDiscrete {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.IsDiscrete C] {X Y : C} (f : X ⟶ Y) : X = Y

instance CategoryTheory.Discrete.isDiscrete (C : Type u_1) : CategoryTheory.IsDiscrete (CategoryTheory.Discrete C)

Equations

• ⋯ = ⋯

instance CategoryTheory.instIsDiscreteOpposite (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.IsDiscrete C] : CategoryTheory.IsDiscrete Cᵒᵖ

Equations

• ⋯ = ⋯