Diagram (category Theory)
In category theory, a branch of mathematics, a diagram is the categorical analogue of an indexed family in set theory. The primary difference is that in the categorical setting one has morphisms that also need indexing. An indexed family of sets is a collection of sets, indexed by a fixed set; equivalently, a ''function'' from a fixed index ''set'' to the class of ''sets''. A diagram is a collection of objects and morphisms, indexed by a fixed category; equivalently, a ''functor'' from a fixed index ''category'' to some ''category''. Definition Formally, a diagram of type ''J'' in a category ''C'' is a ( covariant) functor The category ''J'' is called the index category or the scheme of the diagram ''D''; the functor is sometimes called a ''J''-shaped diagram. The actual objects and morphisms in ''J'' are largely irrelevant; only the way in which they are interrelated matters. The diagram ''D'' is thought of as indexing a collection of objects and morphisms in ''C'' patterned on ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Commutative Diagram
350px, The commutative diagram used in the proof of the five lemma In mathematics, and especially in category theory, a commutative diagram is a diagram such that all directed paths in the diagram with the same start and endpoints lead to the same result. It is said that commutative diagrams play the role in category theory that equations play in algebra. Description A commutative diagram often consists of three parts: * objects (also known as ''vertices'') * morphisms (also known as ''arrows'' or ''edges'') * paths or composites Arrow symbols In algebra texts, the type of morphism can be denoted with different arrow usages: * A monomorphism may be labeled with a \hookrightarrow or a \rightarrowtail. * An epimorphism may be labeled with a \twoheadrightarrow. * An isomorphism may be labeled with a \overset. * The dashed arrow typically represents the claim that the indicated morphism exists (whenever the rest of the diagram holds); the arrow may be optionally labeled as \e ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Coproduct
In category theory, the coproduct, or categorical sum, is a construction which includes as examples the disjoint union of sets and of topological spaces, the free product of groups, and the direct sum of modules and vector spaces. The coproduct of a family of objects is essentially the "least specific" object to which each object in the family admits a morphism. It is the category-theoretic dual notion to the categorical product, which means the definition is the same as the product but with all arrows reversed. Despite this seemingly innocuous change in the name and notation, coproducts can be and typically are dramatically different from products within a given category. Definition Let C be a category and let X_1 and X_2 be objects of C. An object is called the coproduct of X_1 and X_2, written X_1 \sqcup X_2, or X_1 \oplus X_2, or sometimes simply X_1 + X_2, if there exist morphisms i_1 : X_1 \to X_1 \sqcup X_2 and i_2 : X_2 \to X_1 \sqcup X_2 that satisfies th ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Directed Set
In mathematics, a directed set (or a directed preorder or a filtered set) is a preordered set in which every finite subset has an upper bound. In other words, it is a non-empty preordered set A such that for any a and b in A there exists c in A with a \leq c and b \leq c. A directed set's preorder is called a direction. The notion defined above is sometimes called an . A is defined symmetrically, meaning that every finite subset has a lower bound. Some authors (and this article) assume that a directed set is directed upward, unless otherwise stated. Other authors call a set directed if and only if it is directed both upward and downward. Directed sets are a generalization of nonempty totally ordered sets. That is, all totally ordered sets are directed sets (contrast Partially ordered sets, ordered sets, which need not be directed). Join-semilattices (which are partially ordered sets) are directed sets as well, but not conversely. Likewise, Lattice (order), lattices are directed s ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Poset Category
In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is reflexive, antisymmetric, and transitive. A partially ordered set (poset for short) is an ordered pair P=(X,\leq) consisting of a set X (called the ''ground set'' of P) and a partial order \leq on X. When the meaning is clear from context and there is no ambiguity about the partial order, the set X itself is sometimes called a poset. Partial order relations The term ''partial order'' usually refers to the reflexive partial order relations, referred to in this article as ''non-strict'' partial orders. However some a ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Coequalizer
In category theory, a coequalizer (or coequaliser) is a generalization of a quotient by an equivalence relation to objects in an arbitrary category. It is the categorical construction dual to the equalizer. Definition A coequalizer is the colimit of a diagram consisting of two objects ''X'' and ''Y'' and two parallel morphisms . More explicitly, a coequalizer of the parallel morphisms ''f'' and ''g'' can be defined as an object ''Q'' together with a morphism such that . Moreover, the pair must be universal in the sense that given any other such pair (''Q''′, ''q''′) there exists a unique morphism such that . This information can be captured by the following commutative diagram: As with all universal constructions, a coequalizer, if it exists, is unique up to a unique isomorphism (this is why, by abuse of language, one sometimes speaks of "the" coequalizer of two parallel arrows). It can be shown that a coequalizing arrow ''q'' is an epimorphism in any ca ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Equaliser (mathematics)
In mathematics, an equaliser is a set of arguments where two or more functions have equal values. An equaliser is the solution set of an equation. In certain contexts, a difference kernel is the equaliser of exactly two functions. Definitions Let ''X'' and ''Y'' be sets. Let ''f'' and ''g'' be functions, both from ''X'' to ''Y''. Then the ''equaliser'' of ''f'' and ''g'' is the set of elements ''x'' of ''X'' such that ''f''(''x'') equals ''g''(''x'') in ''Y''. Symbolically: : \operatorname(f, g) := \. The equaliser may be denoted Eq(''f'', ''g'') or a variation on that theme (such as with lowercase letters "eq"). In informal contexts, the notation is common. The definition above used two functions ''f'' and ''g'', but there is no need to restrict to only two functions, or even to only finitely many functions. In general, if F is a set of functions from ''X'' to ''Y'', then the ''equaliser'' of the members of F is the set of elements ''x'' of ''X'' such that, given an ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Quiver (mathematics)
In mathematics, especially representation theory, a quiver is another name for a multidigraph; that is, a directed graph where Loop (graph theory), loops and multiple arrows between two vertex (graph theory), vertices are allowed. Quivers are commonly used in representation theory: a representation of a quiver assigns a vector space to each vertex of the quiver and a linear map to each arrow . In category theory, a quiver can be understood to be the underlying structure of a category (mathematics), category, but without composition or a designation of identity morphisms. That is, there is a forgetful functor from (the category of categories) to (the category of multidigraphs). Its left adjoint is a free functor which, from a quiver, makes the corresponding free category. Definition A quiver consists of: * The set of vertices of * The set of edges of * Two functions: giving the ''start'' or ''source'' of the edge, and another function, givin ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Walking Quiver
In mathematics, especially representation theory, a quiver is another name for a multidigraph; that is, a directed graph where loops and multiple arrows between two vertices are allowed. Quivers are commonly used in representation theory: a representation of a quiver assigns a vector space to each vertex of the quiver and a linear map to each arrow . In category theory, a quiver can be understood to be the underlying structure of a category, but without composition or a designation of identity morphisms. That is, there is a forgetful functor from (the category of categories) to (the category of multidigraphs). Its left adjoint is a free functor which, from a quiver, makes the corresponding free category. Definition A quiver consists of: * The set of vertices of * The set of edges of * Two functions: giving the ''start'' or ''source'' of the edge, and another function, giving the ''target'' of the edge. This definition is identical to ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Pullback (category Theory)
In category theory, a branch of mathematics, a pullback (also called a fiber product, fibre product, fibered product or Cartesian square) is the limit (category theory), limit of a diagram (category theory), diagram consisting of two morphisms and with a common codomain. The pullback is written :. Usually the morphisms and are omitted from the notation, and then the pullback is written :. The pullback comes equipped with two natural morphisms and . The pullback of two morphisms and need not exist, but if it does, it is essentially uniquely defined by the two morphisms. In many situations, may intuitively be thought of as consisting of pairs of elements with in , in , and . For the general definition, a universal property is used, which essentially expresses the fact that the pullback is the "most general" way to complete the two given morphisms to a commutative diagram, commutative square. The Dual (category theory), dual concept of the pullback is the ''Pushout ( ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Cospan
In category theory, a span, roof or correspondence is a generalization of the notion of relation between two objects of a category. When the category has all pullbacks (and satisfies a small number of other conditions), spans can be considered as morphisms in a category of fractions. The notion of a span is due to Nobuo Yoneda (1954) and Jean Bénabou (1967). Formal definition A span is a diagram of type \Lambda = (-1 \leftarrow 0 \rightarrow +1), i.e., a diagram of the form Y \leftarrow X \rightarrow Z. That is, let Λ be the category (-1 ← 0 → +1). Then a span in a category ''C'' is a functor ''S'' : Λ → ''C''. This means that a span consists of three objects ''X'', ''Y'' and ''Z'' of ''C'' and morphisms ''f'' : ''X'' → ''Y'' and ''g'' : ''X'' → ''Z'': it is two maps with common ''domain''. The colimit of a span is a pushout. Examples * If ''R'' is a relation between sets ''X'' and ''Y'' (i.e ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Dual (category Theory)
In category theory, a branch of mathematics, duality is a correspondence between the properties of a category ''C'' and the dual properties of the opposite category ''C''op. Given a statement regarding the category ''C'', by interchanging the source and target of each morphism as well as interchanging the order of composing two morphisms, a corresponding dual statement is obtained regarding the opposite category ''C''op. (''C''op is composed by reversing every morphism of ''C''.) Duality, as such, is the assertion that truth is invariant under this operation on statements. In other words, if a statement ''S'' is true about ''C'', then its dual statement is true about ''C''op. Also, if a statement is false about ''C'', then its dual has to be false about ''C''op. (Compactly saying, ''S'' for ''C'' is true if and only if its dual for ''C''op is true.) Given a concrete category ''C'', it is often the case that the opposite category ''C''op per se is abstract. ''C''op need not b ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |