Connected category
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In category theory, a branch of mathematics, a connected category is a category in which, for every two objects X and Y there is a finite sequence of objects : X = X_0, X_1, \ldots, X_{n-1}, X_n = Y with morphisms : f_i : X_i \to X_{i+1} or : f_i : X_{i+1} \to X_i for each 0 ≤ i < n (both directions are allowed in the same sequence). Equivalently, a category J is connected if each functor from J to a discrete category is constant. In some cases it is convenient to not consider the empty category to be connected. A stronger notion of connectivity would be to require at least one morphism f between any pair of objects X and Y. Any category with this property is connected in the above sense. A small category is connected if and only if its underlying graph is weakly connected, meaning that it is connected if one disregards the direction of the arrows. Each category J can be written as a disjoint union (or coproduct) of a collection of connected categories, which are called the connected components of J. Each connected component is a full subcategory of J.
In category theory, a branch of mathematics, a connected category is a category in which, for every two objects X and Y there is a finite sequence of objects X = X_0, X_1, \ldots, X_{n-1}, X_n = Y with morphisms f_i : X_i \to X_{i+1} or f_i : X_{i+1} \to X_i for each 0 ≤ i < n (both directions are allowed in the same sequence). Equivalently, a category J is connected if each functor from J to a discrete category is constant. In some cases it is convenient to not consider the empty category to be connected. A stronger notion of connectivity would be to require at least one morphism f between any pair of objects X and Y. Any category with this property is connected in the above sense. A small category is connected if and only if its underlying graph is weakly connected, meaning that it is connected if one disregards the direction of the arrows. Each category J can be written as a disjoint union (or coproduct) of a collection of connected categories, which are called the connected components of J. Each connected component is a full subcategory of J.
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1271881021 under CC BY-SA 4.0; modifications have been made.