In , a branch of mathematics, the cone of a functor is an abstract notion used to define the of that functor. Cones make other appearances in category theory as well.
Let F : J → C be a in C. Formally, a diagram is nothing more than a functor from J to C. The change in terminology reflects the fact that we think of F as indexing a family of and morphisms in C. The J is thought of as an "index category". One should consider this in analogy with the concept of an indexed family of objects in set theory. The primary difference is that here we have morphisms as well. Thus, for example, when J is a , it corresponds most closely to the idea of an indexed family in set theory. Another common and more interesting example takes J to be a . J can also be taken to be the empty category, leading to the simplest cones.
Let N be an object of C. A cone from N to F is a family of morphisms
for each object X of J, such that for every morphism f : X → Y in J the following diagram commutes:
The (usually infinite) collection of all these triangles can
be (partially) depicted in the shape of a cone with the apex N. The cone ψ is sometimes said to have vertex N and base F.
One can also define the notion of a cone from F to N (also called a co-cone) by reversing all the arrows above. Explicitly, a co-cone from F to N is a family of morphisms
for each object X of J, such that for every morphism f : X → Y in J the following diagram commutes:
At first glance cones seem to be slightly abnormal constructions in category theory. They are maps from an object to a functor (or vice versa). In keeping with the spirit of category theory we would like to define them as morphisms or objects in some suitable category. In fact, we can do both.
Let J be a small category and let CJ be the of type J in C (this is nothing more than a ). Define the diagonal functor Δ : C → CJ as follows: Δ(N) : J → C is the constant functor to N for all N in C.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
This course will provide an introduction to model category theory, which is an abstract framework for generalizing homotopy theory beyond topological spaces and continuous maps. We will study numerous
In , 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.
In , a branch of mathematics, the diagonal functor is given by , which maps as well as morphisms. This functor can be employed to give a succinct alternate description of the product of objects within the : a product is a universal arrow from to . The arrow comprises the projection maps. More generally, given a , one may construct the , the objects of which are called . For each object in , there is a constant diagram that maps every object in to and every morphism in to .
In mathematics, in the field of , a discrete category is a category whose only morphisms are the identity morphisms: homC(X, X) = {idX} for all objects X homC(X, Y) = ∅ for all objects X ≠ Y Since by axioms, there is always the identity morphism between the same object, we can express the above as condition on the cardinality of the hom-set | homC(X, Y) | is 1 when X = Y and 0 when X is not equal to Y. Some authors prefer a weaker notion, where a discrete category merely needs to be equivalent to such a category.
The starting point for this project is the article of Kathryn Hess [11]. In this article, a homotopic version of monadic descent is developed. In the classical setting, one constructs a category D(𝕋) of coalgebras in the Eilenberg-Moore category of ...
A multifiltration is a functor indexed by Nr that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural Nr-graded R[x(1),...x(r)]-module structure on the homology of a multifiltration of ...
Elsevier2017
, , ,
Within the context of microgrids optimal voltage control, most schemes proposed in the literature either rely on (i) droop-control methods or (ii) methods involving the computation of explicit nodal power set-points as a solution to a given optimization pr ...