Simplex Category
In mathematics, the simplex category (or simplicial category or nonempty finite ordinal category) is the category of non-empty finite ordinals and order-preserving maps. It is used to define simplicial and cosimplicial objects. Formal definition The simplex category is usually denoted by \Delta. There are several equivalent descriptions of this category. \Delta can be described as the category of ''non-empty finite ordinals'' as objects, thought of as totally ordered sets, and ''(non-strictly) order-preserving functions'' as morphisms. The objects are commonly denoted = \ (so that is the ordinal n+1 ). The category is generated by coface and codegeneracy maps, which amount to inserting or deleting elements of the orderings. (See simplicial set for relations of these maps.) A simplicial object is a presheaf on \Delta, that is a contravariant functor from \Delta to another category. For instance, simplicial sets are contravariant with the codomain category being the catego ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Monad (category Theory)
In category theory, a branch of mathematics, a monad (also triple, triad, standard construction and fundamental construction) is a monoid in the category of endofunctors. An endofunctor is a functor mapping a category to itself, and a monad is an endofunctor together with two natural transformations required to fulfill certain coherence conditions. Monads are used in the theory of pairs of adjoint functors, and they generalize closure operators on partially ordered sets to arbitrary categories. Monads are also useful in the theory of datatypes and in functional programming languages, allowing languages with non-mutable states to do things such as simulate for-loops; see Monad (functional programming). Introduction and definition A monad is a certain type of endofunctor. For example, if F and G are a pair of adjoint functors, with F left adjoint to G, then the composition G \circ F is a monad. If F and G are inverse functors, the corresponding monad is the identity functor. ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Simplicial Sets
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, * a 0-dimensional simplex is a point (mathematics), point, * a 1-dimensional simplex is a line segment, * a 2-dimensional simplex is a triangle, * a 3-dimensional simplex is a tetrahedron, and * a 4-dimensional simplex is a 5-cell. Specifically, a ''k''-simplex is a ''k''-dimensional polytope which is the convex hull of its ''k'' + 1 Vertex (geometry), vertices. More formally, suppose the ''k'' + 1 points u_0, \dots, u_k \in \mathbb^ are affinely independent, which means u_1 - u_0,\dots, u_k-u_0 are linearly independent. Then, the simplex determined by them is the set of points : C = \left\ This representation in terms of weighted vertices is known as the barycentric coordinate system. A regular simplex is a simpl ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Homotopy Theory
In mathematics, homotopy theory is a systematic study of situations in which maps can come with homotopies between them. It originated as a topic in algebraic topology but nowadays is studied as an independent discipline. Besides algebraic topology, the theory has also been used in other areas of mathematics such as algebraic geometry (e.g., A1 homotopy theory) and category theory (specifically the study of higher categories). Concepts Spaces and maps In homotopy theory and algebraic topology, the word "space" denotes a topological space. In order to avoid pathologies, one rarely works with arbitrary spaces; instead, one requires spaces to meet extra constraints, such as being compactly generated, or Hausdorff, or a CW complex. In the same vein as above, a "map" is a continuous function, possibly with some extra constraints. Often, one works with a pointed space -- that is, a space with a "distinguished point", called a basepoint. A pointed map is then a map which preserv ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Algebraic Topology
Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces. The basic goal is to find algebraic invariant (mathematics), invariants that classification theorem, classify topological spaces up to homeomorphism, though usually most classify up to Homotopy#Homotopy equivalence and null-homotopy, homotopy equivalence. Although algebraic topology primarily uses algebra to study topological problems, using topology to solve algebraic problems is sometimes also possible. Algebraic topology, for example, allows for a convenient proof that any subgroup of a free group is again a free group. Main branches of algebraic topology Below are some of the main areas studied in algebraic topology: Homotopy groups In mathematics, homotopy groups are used in algebraic topology to classify topological spaces. The first and simplest homotopy group is the fundamental group, which records information about loops in a space. Intuitively, homotopy gro ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Abstract Simplicial Complex
In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family. It is a purely combinatorial description of the geometric notion of a simplicial complex. Lee, John M., Introduction to Topological Manifolds, Springer 2011, , p153 For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles (sets of size 3), their edges (sets of size 2), and their vertices (sets of size 1). In the context of matroids and greedoids, abstract simplicial complexes are also called independence systems. An abstract simplex can be studied algebraically by forming its Stanley–Reisner ring; this sets up a powerful relation between combinatorics and commutative algebra. Definitions A collection of non-empty finite subsets of a set ''S'' is called a set-family. A set-family is called an abstract simplicial c ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
PROP (category Theory)
In category theory, a branch of mathematics, a PROP is a symmetric strict monoidal category whose objects are the natural numbers ''n'' identified with the finite sets \ and whose tensor product is given on objects by the addition on numbers. Because of “symmetric”, for each ''n'', the symmetric group on ''n'' letters is given as a subgroup of the automorphism group of ''n''. The name PROP is an abbreviation of "PROduct and Permutation category". The notion was introduced by Adams and MacLane; the topological version of it was later given by Boardman and Vogt. Following them, J. P. May then introduced the notion of “operad”, a particular kind of PROP. There are the following inclusions of full subcategories: pg 45 :\mathsf \subset \tfrac\mathsf \subset \mathsf where the first category is the category of (symmetric) operads. Examples and variants An important ''elementary'' class of PROPs are the sets \mathcal^ of ''all'' matrices (regardless of number of rows and colu ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Simplicial Category (other) in the category of categories
{{mathematical disambiguation ...
In mathematics, simplicial category may refer to: * Simplex category, the category of finite ordinals and order-preserving functions * Simplicially enriched category, a category enriched over the category of simplicial sets * Simplicial object In mathematics, a simplicial set is an object composed of ''simplices'' in a specific way. Simplicial sets are higher-dimensional generalizations of directed graphs, partially ordered sets and categories. Formally, a simplicial set may be defined a ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Compact Closed Category
In category theory, a branch of mathematics, compact closed categories are a general context for treating dual objects. The idea of a dual object generalizes the more familiar concept of the dual of a finite-dimensional vector space. So, the motivating example of a compact closed category is FdVect, the category having finite-dimensional vector spaces as objects and linear maps as morphisms, with tensor product as the monoidal structure. Another example is Rel, the category having sets as objects and relations as morphisms, with Cartesian monoidal structure. Symmetric compact closed category A symmetric monoidal category (\mathbf,\otimes,I) is compact closed if every object A \in \mathbf C has a dual object. If this holds, the dual object is unique up to canonical isomorphism, and is denoted A^*. In a bit more detail, an object A^* is called the dual of A if it is equipped with two morphisms called the unit \eta_A:I\to A^*\otimes A and the counit \varepsilon_A ... [...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 as mo ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Adjoint Functors
In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e., constructions of objects having a certain universal property), such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology. By definition, an adjunction between categories \mathcal and \mathcal is a pair of functors (assumed to be covariant) :F: \mathcal \rightarrow \mathcal and G: \mathcal \rightarrow \mathcal and, for all objects X in \mathcal and Y in \mathcal a bijection between the respective morphism s ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Comonoid
In category theory, a branch of mathematics, a monoid (or monoid object, or internal monoid, or algebra) in a monoidal category is an object ''M'' together with two morphisms * ''μ'': ''M'' ⊗ ''M'' → ''M'' called ''multiplication'', * ''η'': ''I'' → ''M'' called ''unit'', such that the pentagon diagram : and the unitor diagram : commute. In the above notation, is the identity morphism of , is the unit element and α, λ and ρ are respectively the associativity, the left identity and the right identity of the monoidal category C. Dually, a comonoid in a monoidal category C is a monoid in the dual category Cop. Suppose that the monoidal category C has a symmetry ''γ''. A monoid ''M'' in C is commutative when . Examples * A monoid object in Set, the category of sets (with the monoidal structure induced by the Cartesian product), is a monoid in the usual sense. * A monoid object in Top, the category of topological spaces (with the monoidal structure induced by the ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |