|
Overcategory
In mathematics, specifically category theory, an overcategory (and undercategory) is a distinguished class of categories used in multiple contexts, such as with covering spaces (espace etale). They were introduced as a mechanism for keeping track of data surrounding a fixed object X in some category \mathcal. There is a dual notion of undercategory, which is defined similarly. Definition Let \mathcal be a category and X a fixed object of \mathcalpg 59. The overcategory (also called a slice category) \mathcal/X is an associated category whose objects are pairs (A, \pi) where \pi:A \to X is a morphism in \mathcal. Then, a morphism between objects f:(A, \pi) \to (A', \pi') is given by a morphism f:A \to A' in the category \mathcal such that the following diagram commutes\begin A & \xrightarrow & A' \\ \pi\downarrow \text & \text &\text \downarrow \pi' \\ X & = & X \endThere is a dual notion called the undercategory (also called a coslice category) X/\mathcal whose objects are pairs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sheaf (mathematics)
In mathematics, a sheaf is a tool for systematically tracking data (such as sets, abelian groups, rings) attached to the open sets of a topological space and defined locally with regard to them. For example, for each open set, the data could be the ring of continuous functions defined on that open set. Such data is well behaved in that it can be restricted to smaller open sets, and also the data assigned to an open set is equivalent to all collections of compatible data assigned to collections of smaller open sets covering the original open set (intuitively, every piece of data is the sum of its parts). The field of mathematics that studies sheaves is called sheaf theory. Sheaves are understood conceptually as general and abstract objects. Their correct definition is rather technical. They are specifically defined as sheaves of sets or as sheaves of rings, for example, depending on the type of data assigned to the open sets. There are also maps (or morphisms) from o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Theory
Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Nowadays, category theory is used in almost all areas of mathematics, and in some areas of computer science. 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 spaces, direct products, completion, and duality. A category is formed by two sorts of objects: the objects of the category, and the morphisms, which relate two objects called the ''source'' and the ''target'' of the morphism. One often says that a morphism is an ''arrow'' that ''maps'' its source to its target. Morphisms can be ''composed'' if the target of the first morphism equals the source of the second one, and morphism com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category (mathematics)
In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple example is the category of sets, whose objects are sets and whose arrows are functions. ''Category theory'' is a branch of mathematics that seeks to generalize all of mathematics in terms of categories, independent of what their objects and arrows represent. Virtually every branch of modern mathematics can be described in terms of categories, and doing so often reveals deep insights and similarities between seemingly different areas of mathematics. As such, category theory provides an alternative foundation for mathematics to set theory and other proposed axiomatic foundations. In general, the objects and arrows may be abstract entities of any kind, and the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Morphism
In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in topology, continuous functions, and so on. In category theory, ''morphism'' is a broadly similar idea: the mathematical objects involved need not be sets, and the relationships between them may be something other than maps, although the morphisms between the objects of a given category have to behave similarly to maps in that they have to admit an associative operation similar to function composition. A morphism in category theory is an abstraction of a homomorphism. The study of morphisms and of the structures (called "objects") over which they are defined is central to category theory. Much of the terminology of morphisms, as well as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutative Property
In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name of the property that says something like or , the property can also be used in more advanced settings. The name is needed because there are operations, such as division and subtraction, that do not have it (for example, ); such operations are ''not'' commutative, and so are referred to as ''noncommutative operations''. The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized. A similar property exists for binary relations; a binary relation is said to be symmetric if the relation applies regardless of the order of its operands; for example, equality is sy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
2 Category
In category theory, a strict 2-category is a category with "morphisms between morphisms", that is, where each hom-set itself carries the structure of a category. It can be formally defined as a category enriched over Cat (the category of categories and functors, with the monoidal structure given by product of categories). The concept of 2-category was first introduced by Charles Ehresmann in his work on enriched categories in 1965. The more general concept of bicategory (or ''weak'' 2-''category''), where composition of morphisms is associative only up to a 2-isomorphism, was introduced in 1968 by Jean Bénabou.Jean Bénabou, Introduction to bicategories, in Reports of the Midwest Category Seminar, Springer, Berlin, 1967, pp. 1--77. Definition A 2-category C consists of: * A class of 0-''cells'' (or ''objects'') , , .... * For all objects and , a category \mathbf(A,B). The objects f,g: A \to B of this category are called 1-''cells'' and its morphisms \alpha: f \Rig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Higher Category Theory
In mathematics, higher category theory is the part of category theory at a ''higher order'', which means that some equalities are replaced by explicit arrows in order to be able to explicitly study the structure behind those equalities. Higher category theory is often applied in algebraic topology (especially in homotopy theory), where one studies algebraic invariants of spaces, such as their fundamental weak ∞-groupoid. Strict higher categories An ordinary category has objects and morphisms, which are called 1-morphisms in the context of higher category theory. A 2-category generalizes this by also including 2-morphisms between the 1-morphisms. Continuing this up to ''n''-morphisms between (''n'' − 1)-morphisms gives an ''n''-category. Just as the category known as Cat, which is the category of small categories and functors is actually a 2-category with natural transformations as its 2-morphisms, the category ''n''-Cat of (small) ''n''-categories is actually ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Product (category Theory)
In category theory, the product of two (or more) objects in a category is a notion designed to capture the essence behind constructions in other areas of mathematics such as the Cartesian product of sets, the direct product of groups or rings, and the product of topological spaces. Essentially, the product of a family of objects is the "most general" object which admits a morphism to each of the given objects. Definition Product of two objects Fix a category C. Let X_1 and X_2 be objects of C. A product of X_1 and X_2 is an object X, typically denoted X_1 \times X_2, equipped with a pair of morphisms \pi_1 : X \to X_1, \pi_2 : X \to X_2 satisfying the following universal property: * For every object Y and every pair of morphisms f_1 : Y \to X_1, f_2 : Y \to X_2, there exists a unique morphism f : Y \to X_1 \times X_2 such that the following diagram commutes: *: Whether a product exists may depend on C or on X_1 and X_2. If it does exist, it is unique up to canonica ... [...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. 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 satisfying the following universal property: for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Limit (category Theory)
In category theory, a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as products, pullbacks and inverse limits. The dual notion of a colimit generalizes constructions such as disjoint unions, direct sums, coproducts, pushouts and direct limits. Limits and colimits, like the strongly related notions of universal properties and adjoint functors, exist at a high level of abstraction. In order to understand them, it is helpful to first study the specific examples these concepts are meant to generalize. Definition Limits and colimits in a category C are defined by means of diagrams in C. Formally, a diagram of shape J in C is a functor from J to C: :F:J\to C. The category J is thought of as an index category, and the diagram F is thought of as indexing a collection of objects and morphisms in C patterned on J. One is most often interested in the case where the category J is a small or even fin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Colimits
In category theory, a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as products, pullbacks and inverse limits. The dual notion of a colimit generalizes constructions such as disjoint unions, direct sums, coproducts, pushouts and direct limits. Limits and colimits, like the strongly related notions of universal properties and adjoint functors, exist at a high level of abstraction. In order to understand them, it is helpful to first study the specific examples these concepts are meant to generalize. Definition Limits and colimits in a category C are defined by means of diagrams in C. Formally, a diagram of shape J in C is a functor from J to C: :F:J\to C. The category J is thought of as an index category, and the diagram F is thought of as indexing a collection of objects and morphisms in C patterned on J. One is most often interested in the case where the category J is a small or even finite cat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grothendieck Topology
In category theory, a branch of mathematics, a Grothendieck topology is a structure on a category ''C'' that makes the objects of ''C'' act like the open sets of a topological space. A category together with a choice of Grothendieck topology is called a site. Grothendieck topologies axiomatize the notion of an open cover. Using the notion of covering provided by a Grothendieck topology, it becomes possible to define sheaves on a category and their cohomology. This was first done in algebraic geometry and algebraic number theory by Alexander Grothendieck to define the étale cohomology of a scheme. It has been used to define other cohomology theories since then, such as ℓ-adic cohomology, flat cohomology, and crystalline cohomology. While Grothendieck topologies are most often used to define cohomology theories, they have found other applications as well, such as to John Tate's theory of rigid analytic geometry. There is a natural way to associate a site to an ordinary top ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Limit (category Theory)")