About: Connected category

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 with morphisms or 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 small category is connected if and only if its underlying graph is weakly connected, meaning that it is connected if one disregard the direction of the arrows.

Property Value
dbo:abstract
  • 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 with morphisms or 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 disregard 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. (en)
dbo:wikiPageID
  • 1411533 (xsd:integer)
dbo:wikiPageLength
  • 1616 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 985323868 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdfs:comment
  • 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 with morphisms or 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 small category is connected if and only if its underlying graph is weakly connected, meaning that it is connected if one disregard the direction of the arrows. (en)
rdfs:label
  • Connected category (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License