Connected components of a category

Defines a type ConnectedComponents J indexing the connected components of a category, and the full subcategories giving each connected component: Component j : Type u₁. We show that each Component j is in fact connected.

We show every category can be expressed as a disjoint union of its connected components, in particular Decomposed J is the category (definitionally) given by the sigma-type of the connected components of J, and it is shown that this is equivalent to J.

def CategoryTheory.ConnectedComponents (J : Type u₁) [CategoryTheory.Category.{v₁, u₁} J] : Type u₁

This type indexes the connected components of the category J.

Equations

• CategoryTheory.ConnectedComponents J = Quotient (CategoryTheory.Zigzag.setoid J)

def CategoryTheory.Functor.mapConnectedComponents {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {K : Type u₂} [CategoryTheory.Category.{v₂, u₂} K] (F : CategoryTheory.Functor J K) (x : CategoryTheory.ConnectedComponents J) : CategoryTheory.ConnectedComponents K

The map ConnectedComponents J → ConnectedComponents K induced by a functor J ⥤ K.

Equations

• F.mapConnectedComponents x = Quotient.lift (Quotient.mk (CategoryTheory.Zigzag.setoid K) ∘ F.obj) ⋯ x

@[simp]

theorem CategoryTheory.Functor.mapConnectedComponents_mk {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {K : Type u₂} [CategoryTheory.Category.{v₂, u₂} K] (F : CategoryTheory.Functor J K) (j : J) : F.mapConnectedComponents ⟦j⟧ = ⟦F.obj j⟧

instance CategoryTheory.instInhabitedConnectedComponents {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] [Inhabited J] : Inhabited (CategoryTheory.ConnectedComponents J)

Equations

• CategoryTheory.instInhabitedConnectedComponents = { default := Quotient.mk'' default }

def CategoryTheory.ConnectedComponents.functorToDiscrete {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (X : Type u_1) (f : CategoryTheory.ConnectedComponents J → X) : CategoryTheory.Functor J (CategoryTheory.Discrete X)

Every function from connected components of a category gives a functor to discrete category

Equations

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

def CategoryTheory.ConnectedComponents.liftFunctor (J : Type u_2) [CategoryTheory.Category.{u_3, u_2} J] {X : Type u_1} (F : CategoryTheory.Functor J (CategoryTheory.Discrete X)) : CategoryTheory.ConnectedComponents J → X

Every functor to a discrete category gives a function from connected components

Equations

• CategoryTheory.ConnectedComponents.liftFunctor J F = Quotient.lift (fun (c : J) => (F.obj c).as) ⋯

def CategoryTheory.ConnectedComponents.typeToCatHomEquiv (J : Type u_2) [CategoryTheory.Category.{u_3, u_2} J] (X : Type u_1) : (CategoryTheory.ConnectedComponents J → X) ≃ CategoryTheory.Functor J (CategoryTheory.Discrete X)

Functions from connected components and functors to discrete category are in bijection

Equations

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

def CategoryTheory.Component {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) : Type u₁

Given an index for a connected component, produce the actual component as a full subcategory.

Equations

• CategoryTheory.Component j = CategoryTheory.FullSubcategory fun (k : J) => Quotient.mk'' k = j

instance CategoryTheory.instCategoryComponent {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {j : CategoryTheory.ConnectedComponents J} : CategoryTheory.Category.{v₁, u₁} (CategoryTheory.Component j)

Equations

• CategoryTheory.instCategoryComponent = CategoryTheory.FullSubcategory.category fun (k : J) => Quotient.mk'' k = j

@[simp]

theorem CategoryTheory.Component.ι_map {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) : ∀ {X Y : CategoryTheory.InducedCategory J CategoryTheory.FullSubcategory.obj} (f : X ⟶ Y), (CategoryTheory.Component.ι j).map f = f

@[simp]

theorem CategoryTheory.Component.ι_obj {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) (self : CategoryTheory.FullSubcategory fun (k : J) => Quotient.mk'' k = j) : (CategoryTheory.Component.ι j).obj self = self.obj

def CategoryTheory.Component.ι {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) : CategoryTheory.Functor (CategoryTheory.Component j) J

The inclusion functor from a connected component to the whole category.

Equations

• CategoryTheory.Component.ι j = CategoryTheory.fullSubcategoryInclusion fun (k : J) => Quotient.mk'' k = j

instance CategoryTheory.instFullComponentι {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {j : CategoryTheory.ConnectedComponents J} : (CategoryTheory.Component.ι j).Full

Equations

• ⋯ = ⋯

instance CategoryTheory.instFaithfulComponentι {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {j : CategoryTheory.ConnectedComponents J} : (CategoryTheory.Component.ι j).Faithful

Equations

• ⋯ = ⋯

instance CategoryTheory.instNonemptyComponent {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) : Nonempty (CategoryTheory.Component j)

Each connected component of the category is nonempty.

Equations

• ⋯ = ⋯

instance CategoryTheory.instInhabitedComponent {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) : Inhabited (CategoryTheory.Component j)

Equations

• CategoryTheory.instInhabitedComponent j = Classical.inhabited_of_nonempty'

instance CategoryTheory.instIsConnectedComponent {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) : CategoryTheory.IsConnected (CategoryTheory.Component j)

Each connected component of the category is connected.

Equations

• ⋯ = ⋯

@[reducible, inline]

abbrev CategoryTheory.Decomposed (J : Type u₁) [CategoryTheory.Category.{v₁, u₁} J] : Type u₁

The disjoint union of Js connected components, written explicitly as a sigma-type with the category structure. This category is equivalent to J.

Equations

• CategoryTheory.Decomposed J = ((j : CategoryTheory.ConnectedComponents J) × CategoryTheory.Component j)

@[reducible, inline]

abbrev CategoryTheory.inclusion {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) : CategoryTheory.Functor (CategoryTheory.Component j) (CategoryTheory.Decomposed J)

The inclusion of each component into the decomposed category. This is just sigma.incl but having this abbreviation helps guide typeclass search to get the right category instance on decomposed J.

Equations

• CategoryTheory.inclusion j = CategoryTheory.Sigma.incl j

@[simp]

theorem CategoryTheory.decomposedTo_map (J : Type u₁) [CategoryTheory.Category.{v₁, u₁} J] : ∀ {X Y : (i : CategoryTheory.ConnectedComponents J) × CategoryTheory.Component i} (g : X ⟶ Y), (CategoryTheory.decomposedTo J).map g = CategoryTheory.Sigma.descMap CategoryTheory.Component.ι X Y g

@[simp]

theorem CategoryTheory.decomposedTo_obj (J : Type u₁) [CategoryTheory.Category.{v₁, u₁} J] (X : (i : CategoryTheory.ConnectedComponents J) × CategoryTheory.Component i) : (CategoryTheory.decomposedTo J).obj X = X.snd.obj

def CategoryTheory.decomposedTo (J : Type u₁) [CategoryTheory.Category.{v₁, u₁} J] : CategoryTheory.Functor (CategoryTheory.Decomposed J) J

The forward direction of the equivalence between the decomposed category and the original.

Equations

• CategoryTheory.decomposedTo J = CategoryTheory.Sigma.desc CategoryTheory.Component.ι

@[simp]

theorem CategoryTheory.inclusion_comp_decomposedTo {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] (j : CategoryTheory.ConnectedComponents J) : (CategoryTheory.inclusion j).comp (CategoryTheory.decomposedTo J) = CategoryTheory.Component.ι j

instance CategoryTheory.instFullDecomposedDecomposedTo {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] : (CategoryTheory.decomposedTo J).Full

Equations

• ⋯ = ⋯

instance CategoryTheory.instFaithfulDecomposedDecomposedTo {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] : (CategoryTheory.decomposedTo J).Faithful

Equations

• ⋯ = ⋯

instance CategoryTheory.instEssSurjDecomposedDecomposedTo {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] : (CategoryTheory.decomposedTo J).EssSurj

Equations

• ⋯ = ⋯

instance CategoryTheory.instIsEquivalenceDecomposedDecomposedTo {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] : (CategoryTheory.decomposedTo J).IsEquivalence

Equations

• ⋯ = ⋯

@[simp]

theorem CategoryTheory.decomposedEquiv_functor {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] : CategoryTheory.decomposedEquiv.functor = CategoryTheory.decomposedTo J

def CategoryTheory.decomposedEquiv {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] : CategoryTheory.Decomposed J ≌ J

This gives that any category is equivalent to a disjoint union of connected categories.

Equations

• CategoryTheory.decomposedEquiv = (CategoryTheory.decomposedTo J).asEquivalence