|
Density Theorem (category Theory)
In category theory, a branch of mathematics, the density theorem states that every presheaf of sets is a colimit of representable presheaves in a canonical way. For example, by definition, a simplicial set is a presheaf on the simplex category Δ and a representable simplicial set is exactly of the form \Delta^n = \operatorname(-, (called the standard ''n''-simplex) so the theorem says: for each simplicial set ''X'', :X \simeq \varinjlim \Delta^n where the colim runs over an index category determined by ''X''. Statement Let ''F'' be a presheaf on a category ''C''; i.e., an object of the functor category \widehat = \mathbf(C^\text, \mathbf). For an index category over which a colimit will run, let ''I'' be the category of elements of ''F'': it is the category where # an object is a pair (U, x) consisting of an object ''U'' in ''C'' and an element x \in F(U), # a morphism (U, x) \to (V, y) consists of a morphism u: U \to V in ''C'' such that (Fu)(y) = x. It comes with the for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Category Theory
Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory is used in most areas of mathematics. In particular, many constructions of new mathematical objects from previous ones that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient space (other), quotient spaces, direct products, completion, and duality (mathematics), duality. Many areas of computer science also rely on category theory, such as functional programming and Semantics (computer science), semantics. A category (mathematics), category is formed by two sorts of mathematical object, objects: the object (category theory), objects of the category, and the morphisms, which relate two objects called the ''source'' and the ''target'' of the morphism. Metapho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Presheaf Of Sets
In category theory, a branch of mathematics, a presheaf on a category C is a functor F\colon C^\mathrm\to\mathbf. If C is the poset of open sets in a topological space, interpreted as a category, then one recovers the usual notion of presheaf on a topological space. A morphism of presheaves is defined to be a natural transformation of functors. This makes the collection of all presheaves on C into a category, and is an example of a functor category. It is often written as \widehat = \mathbf^ and it is called the category of presheaves on C. A functor into \widehat is sometimes called a profunctor. A presheaf that is naturally isomorphic to the contravariant hom-functor Hom(–, ''A'') for some object ''A'' of C is called a representable presheaf. Some authors refer to a functor F\colon C^\mathrm\to\mathbf as a \mathbf-valued presheaf. Examples * A simplicial set is a Set-valued presheaf on the simplex category C=\Delta. * A directed multigraph is a presheaf on the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Limit And Colimit Of Presheaves
In category theory Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory ..., a branch of mathematics, a limit or a colimit of presheaves on a category ''C'' is a limit or colimit in the functor category \widehat = \mathbf(C^, \mathbf). The category \widehat admits small limits and small colimits. Explicitly, if f: I \to \widehat is a functor from a small category ''I'' and ''U'' is an object in ''C'', then \varinjlim_ f(i) is computed pointwise: :(\varinjlim f(i))(U) = \varinjlim f(i)(U). The same is true for small limits. Concretely this means that, for example, a fiber product exists and is computed pointwise. When ''C'' is small, by the Yoneda lemma, one can view ''C'' as the full subcategory of \widehat. If \eta: C \to D is a functor, if f: I \to C is a functor from a small categ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Representable Functor
In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures (i.e. sets and functions) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings. From another point of view, representable functors for a category ''C'' are the functors ''given'' with ''C''. Their theory is a vast generalisation of upper sets in posets, and Yoneda's representability theorem generalizes Cayley's theorem in group theory. Definition Let C be a locally small category and let Set be the category of sets. For each object ''A'' of C let Hom(''A'',–) be the hom functor that maps object ''X'' to the set Hom(''A'',''X''). A functor ''F'' : C → Set is said to be representable if it is naturally isomorphic to Hom(''A'',–) for some object ''A'' of C. A representation of ''F'' is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Simplicial Set
In mathematics, a simplicial set is a sequence of sets with internal order structure ( abstract simplices) and maps between them. Simplicial sets are higher-dimensional generalizations of directed graphs. Every simplicial set gives rise to a "nice" topological space, known as its geometric realization. This realization consists of geometric simplices, glued together according to the rules of the simplicial set. Indeed, one may view a simplicial set as a purely combinatorial construction designed to capture the essence of a topological space for the purposes of homotopy theory. Specifically, the category of simplicial sets carries a natural model structure, and the corresponding homotopy category is equivalent to the familiar homotopy category of topological spaces. Formally, a simplicial set may be defined as a contravariant functor from the simplex category to the category of sets. Simplicial sets were introduced in 1950 by Samuel Eilenberg and Joseph A. Zilber. Simplic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Functor Category
In category theory, a branch of mathematics, a functor category D^C is a category where the objects are the functors F: C \to D and the morphisms are natural transformations \eta: F \to G between the functors (here, G: C \to D is another object in the category). Functor categories are of interest for two main reasons: * many commonly occurring categories are (disguised) functor categories, so any statement proved for general functor categories is widely applicable; * every category embeds in a functor category (via the Yoneda embedding); the functor category often has nicer properties than the original category, allowing certain operations that were not available in the original setting. Definition Suppose C is a small category (i.e. the objects and morphisms form a set rather than a proper class) and D is an arbitrary category. The category of functors from C to D, written as Fun(C, D), Funct(C,D), ,D/math>, or D ^C, has as objects the covariant functors from C to D, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Category Of Elements
In category theory, a branch of mathematics, the category of elements of a presheaf is a category associated to that presheaf whose objects are the elements of sets in the presheaf. It and its generalization are also known as the Grothendieck construction (named after Alexander Grothendieck) especially in the theory of descent, in the theory of stacks, and in fibred category theory. The Grothendieck construction is an instance of straightening (or rather unstraightening). Significance In categorical logic, the construction is used to model the relationship between a type theory and a logic over that type theory, and allows for the translation of concepts from indexed category theory into fibred category theory, such as Lawvere's concept of hyperdoctrine. The category of elements of a simplicial set is fundamental in simplicial homotopy theory, a branch of algebraic topology Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study top ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
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] |
|
 |
Yoneda Embedding
In mathematics, the Yoneda lemma is a fundamental result in category theory. It is an abstract result on functors of the type ''morphisms into a fixed object''. It is a vast generalisation of Cayley's theorem from group theory (viewing a group as a miniature category with just one object and only isomorphisms). It also generalizes the information-preserving relation between a term and its Continuation-passing style, continuation-passing style transformation from programming language theory. It allows the Subcategory#Embeddings, embedding of any locally small category into a category of functors (Functor#Covariance and contravariance, contravariant set-valued functors) defined on that category. It also clarifies how the embedded category, of representable functors and their natural transformations, relates to the other objects in the larger functor category. It is an important tool that underlies several modern developments in algebraic geometry and representation theory. It is named ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Constant Functor
In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, and maps between these algebraic objects are associated to continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which category theory is applied. The words ''category'' and ''functor'' were borrowed by mathematicians from the philosophers Aristotle and Rudolf Carnap, respectively. The latter used ''functor'' in a linguistic context; see function word. Definition Let ''C'' and ''D'' be categories. A functor ''F'' from ''C'' to ''D'' is a mapping that * associates each object X in ''C'' to an object F(X) in ''D'', * associates each morphism f \colon X \to Y in ''C'' to a morphism F(f) \colon F(X) \to F(Y) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Categories For The Working Mathematician
''Categories for the Working Mathematician'' (''CWM'') is a textbook in category theory written by American mathematician Saunders Mac Lane, who cofounded the subject together with Samuel Eilenberg. It was first published in 1971, and is based on his lectures on the subject given at the University of Chicago, the Australian National University, Bowdoin College, and Tulane University. It is widely regarded as the premier introduction to the subject. Contents The book has twelve chapters, which are: :Chapter I. Categories, Functors, and Natural Transformations. :Chapter II. Constructions on Categories. :Chapter III. Universals and Limits. :Chapter IV. Adjoints. :Chapter V. Limits. :Chapter VI. Monads and Algebras. :Chapter VII. Monoids. :Chapter VIII. Abelian Categories. :Chapter IX. Special Limits. :Chapter X. Kan Extensions. :Chapter XI. Symmetry and Braiding in Monoidal Categories :Chapter XII. Structures in Categories. Chapters XI and XII were added in the 1998 s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Graduate Texts In Mathematics
Graduate Texts in Mathematics (GTM) () is a series of graduate-level textbooks in mathematics published by Springer-Verlag. The books in this series, like the other Springer-Verlag mathematics series, are yellow books of a standard size (with variable numbers of pages). The GTM series is easily identified by a white band at the top of the book. The books in this series tend to be written at a more advanced level than the similar Undergraduate Texts in Mathematics series, although there is a fair amount of overlap between the two series in terms of material covered and difficulty level. List of books #''Introduction to Axiomatic Set Theory'', Gaisi Takeuti, Wilson M. Zaring (1982, 2nd ed., ) #''Measure and Category – A Survey of the Analogies between Topological and Measure Spaces'', John C. Oxtoby (1980, 2nd ed., ) #''Topological Vector Spaces'', H. H. Schaefer, M. P. Wolff (1999, 2nd ed., ) #''A Course in Homological Algebra'', Peter Hilton, Urs Stammbach (1997, 2 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |