|
Dendroidal Set
In mathematics, a dendroidal set is a generalization of simplicial sets introduced by . They have the same relation to (colored symmetric) operads, also called symmetric multicategories, that simplicial sets have to categories. Definition A dendroidal set is a contravariant 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 ... from Ω to sets, where Ω is the tree category consisting of finite rooted trees considered as operads, whose morphisms are operad morphisms. The trees are allowed to have some edges with a vertex on only one side; these are called outer edges, and the root is one of the outer edges. References * *{{nlab, id=dendroidal+set, title=Dendroidal set Simplicial sets ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplicial Set
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 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. 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 " well-behaved" 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. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Operad
In mathematics, an operad is a structure that consists of abstract operations, each one having a fixed finite number of inputs (arguments) and one output, as well as a specification of how to compose these operations. Given an operad O, one defines an ''algebra over O'' to be a set together with concrete operations on this set which behave just like the abstract operations of O. For instance, there is a Lie operad L such that the algebras over L are precisely the Lie algebras; in a sense L abstractly encodes the operations that are common to all Lie algebras. An operad is to its algebras as a group is to its group representations. History Operads originate in algebraic topology; they were introduced to characterize iterated loop spaces by J. Michael Boardman and Rainer M. Vogt in 1969 and by J. Peter May in 1970. The word "operad" was created by May as a portmanteau of "operations" and "monad" (and also because his mother was an opera singer). Interest in operads was conside ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetric Multicategory
Symmetry (from grc, συμμετρία "agreement in dimensions, due proportion, arrangement") in everyday language refers to a sense of harmonious and beautiful proportion and balance. In mathematics, "symmetry" has a more precise definition, and is usually used to refer to an object that is invariant under some transformations; including translation, reflection, rotation or scaling. Although these two meanings of "symmetry" can sometimes be told apart, they are intricately related, and hence are discussed together in this article. Mathematical symmetry may be observed with respect to the passage of time; as a spatial relationship; through geometric transformations; through other kinds of functional transformations; and as an aspect of abstract objects, including theoretic models, language, and music. This article describes symmetry from three perspectives: in mathematics, including geometry, the most familiar type of symmetry for many people; in science and nature; ... [...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] |
Contravariant 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] |
Set (category Theory)
In the mathematical field of category theory, the category of sets, denoted as Set, is the category whose objects are sets. The arrows or morphisms between sets ''A'' and ''B'' are the total functions from ''A'' to ''B'', and the composition of morphisms is the composition of functions. Many other categories (such as the category of groups, with group homomorphisms as arrows) add structure to the objects of the category of sets and/or restrict the arrows to functions of a particular kind. Properties of the category of sets The axioms of a category are satisfied by Set because composition of functions is associative, and because every set ''X'' has an identity function id''X'' : ''X'' → ''X'' which serves as identity element for function composition. The epimorphisms in Set are the surjective maps, the monomorphisms are the injective maps, and the isomorphisms are the bijective maps. The empty set serves as the initial object in Set with empty functions as morphisms. Ev ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Symmetric Multicategory")
