|
Accessible Object
The theory of accessible categories is a part of mathematics, specifically of category theory. It attempts to describe categories in terms of the "size" (a cardinal number) of the operations needed to generate their objects. The theory originates in the work of Grothendieck completed by 1969, and Gabriel and Ulmer (1971). It has been further developed in 1989 by Michael Makkai and Robert Paré, with motivation coming from model theory, a branch of mathematical logic. A standard text book by Adámek and Rosický appeared in 1994. Accessible categories also have applications in homotopy theory.J. Rosick�"On combinatorial model categories" ''arXiv'', 16 August 2007. Retrieved on 19 January 2008.Rosický, J. "Injectivity and accessible categories." ''Cubo Matem. Educ'' 4 (2002): 201-211. Grothendieck continued the development of the theory for homotopy-theoretic purposes in his (still partly unpublished) 1991 manuscript ''Les dérivateurs''. Some properties of accessible categories dep ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hom Functor
In mathematics, specifically in category theory, hom-sets (i.e. sets of morphisms between object (category theory), objects) give rise to important functors to the category of sets. These functors are called hom-functors and have numerous applications in category theory and other branches of mathematics. Formal definition Let ''C'' be a locally small category (i.e. a category (mathematics), category for which hom-classes are actually Set (mathematics), sets and not proper classes). For all objects ''A'' and ''B'' in ''C'' we define two functors to the category of sets as follows: : The functor Hom(–, ''B'') is also called the ''functor of points'' of the object ''B''. Note that fixing the first argument of Hom naturally gives rise to a covariant functor and fixing the second argument naturally gives a contravariant functor. This is an artifact of the way in which one must compose the morphisms. The pair of functors Hom(''A'', –) and Hom(–, ''B'') are related in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complete Category
In mathematics, a complete category is a category in which all small limits exist. That is, a category ''C'' is complete if every diagram ''F'' : ''J'' → ''C'' (where ''J'' is small) has a limit in ''C''. Dually, a cocomplete category is one in which all small colimits exist. A bicomplete category is a category which is both complete and cocomplete. The existence of ''all'' limits (even when ''J'' is a proper class) is too strong to be practically relevant. Any category with this property is necessarily a thin category: for any two objects there can be at most one morphism from one object to the other. A weaker form of completeness is that of finite completeness. A category is finitely complete if all finite limits exists (i.e. limits of diagrams indexed by a finite category ''J''). Dually, a category is finitely cocomplete if all finite colimits exist. Theorems It follows from the existence theorem for limits that a category is complete if and only if it has equalizers (o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grothendieck Category
In mathematics, a Grothendieck category is a certain kind of abelian category, introduced in Alexander Grothendieck's Tôhoku paper of 1957English translation in order to develop the machinery of homological algebra for modules and for sheaves in a unified manner. The theory of these categories was further developed in Pierre Gabriel's 1962 thesis. To every algebraic variety V one can associate a Grothendieck category \operatorname(V), consisting of the quasi-coherent sheaves on V. This category encodes all the relevant geometric information about V, and V can be recovered from \operatorname(V) (the Gabriel–Rosenberg reconstruction theorem). This example gives rise to one approach to noncommutative algebraic geometry: the study of "non-commutative varieties" is then nothing but the study of (certain) Grothendieck categories. Definition By definition, a Grothendieck category \mathcal is an AB5 category with a generator. Spelled out, this means that * \mathcal is an abelian ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Universal Algebra
Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures in general, not specific types of algebraic structures. For instance, rather than considering groups or rings as the object of studythis is the subject of group theory and ring theory in universal algebra, the object of study is the possible types of algebraic structures and their relationships. Basic idea In universal algebra, an (or algebraic structure) is a set ''A'' together with a collection of operations on ''A''. Arity An ''n''- ary operation on ''A'' is a function that takes ''n'' elements of ''A'' and returns a single element of ''A''. Thus, a 0-ary operation (or ''nullary operation'') can be represented simply as an element of ''A'', or a '' constant'', often denoted by a letter like ''a''. A 1-ary operation (or '' unary operation'') is simply a function from ''A'' to ''A'', often denoted by a symbol placed in front of its argument, like ~'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Variety (universal Algebra)
In universal algebra, a variety of algebras or equational class is the class of all algebraic structures of a given signature satisfying a given set of identities. For example, the groups form a variety of algebras, as do the abelian groups, the rings, the monoids etc. According to Birkhoff's theorem, a class of algebraic structures of the same signature is a variety if and only if it is closed under the taking of homomorphic images, subalgebras, and (direct) products. In the context of category theory, a variety of algebras, together with its homomorphisms, forms a category; these are usually called ''finitary algebraic categories''. A ''covariety'' is the class of all coalgebraic structures of a given signature. Terminology A variety of algebras should not be confused with an algebraic variety, which means a set of solutions to a system of polynomial equations. They are formally quite distinct and their theories have little in common. The term "variety of algeb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
First-order Theory
In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. In most scenarios a deductive system is first understood from context, giving rise to a formal system that combines the language with deduction rules. An element \phi\in T of a deductively closed theory T is then called a theorem of the theory. In many deductive systems there is usually a subset \Sigma \subseteq T that is called "the set of axioms" of the theory T, in which case the deductive system is also called an "axiomatic system". By definition, every axiom is automatically a theorem. A first-order theory is a set of first-order sentences (theorems) recursively obtained by the inference rules of the system applied to the set of axioms. General theories (as expressed in formal language) When defining theories for foundational purposes, additional care must be taken, as normal set-theoretic language may not be appropriate. The construction of a theory begins by sp ... [...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] |
Cocomplete
In mathematics, a complete category is a category in which all small limits exist. That is, a category ''C'' is complete if every diagram ''F'' : ''J'' → ''C'' (where ''J'' is small) has a limit in ''C''. Dually, a cocomplete category is one in which all small colimits exist. A bicomplete category is a category which is both complete and cocomplete. The existence of ''all'' limits (even when ''J'' is a proper class) is too strong to be practically relevant. Any category with this property is necessarily a thin category: for any two objects there can be at most one morphism from one object to the other. A weaker form of completeness is that of finite completeness. A category is finitely complete if all finite limits exists (i.e. limits of diagrams indexed by a finite category ''J''). Dually, a category is finitely cocomplete if all finite colimits exist. Theorems It follows from the existence theorem for limits that a category is complete if and only if it has equalizers (of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finitely Generated Module
In mathematics, a finitely generated module is a module that has a finite generating set. A finitely generated module over a ring ''R'' may also be called a finite ''R''-module, finite over ''R'', or a module of finite type. Related concepts include finitely cogenerated modules, finitely presented modules, finitely related modules and coherent modules all of which are defined below. Over a Noetherian ring the concepts of finitely generated, finitely presented and coherent modules coincide. A finitely generated module over a field is simply a finite-dimensional vector space, and a finitely generated module over the integers is simply a finitely generated abelian group. Definition The left ''R''-module ''M'' is finitely generated if there exist ''a''1, ''a''2, ..., ''a''''n'' in ''M'' such that for any ''x'' in ''M'', there exist ''r''1, ''r''2, ..., ''r''''n'' in ''R'' with ''x'' = ''r''1''a''1 + ''r''2''a''2 + ... + ''r''''n''''a''''n''. The set is referred to as a gene ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring (mathematics)
In mathematics, a ring is an algebraic structure consisting of a set with two binary operations called ''addition'' and ''multiplication'', which obey the same basic laws as addition and multiplication of integers, except that multiplication in a ring does not need to be commutative. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series. A ''ring'' may be defined as a set that is endowed with two binary operations called ''addition'' and ''multiplication'' such that the ring is an abelian group with respect to the addition operator, and the multiplication operator is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors apply the term ''ring'' to a further generalization, often called a '' rng'', that omits the requirement for a multiplicative identity, and instead call the structure defi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Of Modules
In algebra, given a ring ''R'', the category of left modules over ''R'' is the category whose objects are all left modules over ''R'' and whose morphisms are all module homomorphisms between left ''R''-modules. For example, when ''R'' is the ring of integers Z, it is the same thing as the category of abelian groups. The category of right modules is defined in a similar way. One can also define the category of bimodules over a ring ''R'' but that category is equivalent to the category of left (or right) modules over the enveloping algebra of ''R'' (or over the opposite of that). Note: Some authors use the term module category for the category of modules. This term can be ambiguous since it could also refer to a category with a monoidal-category action. Properties The categories of left and right modules are abelian categories. These categories have enough projectives and enough injectives. Mitchell's embedding theorem states every abelian category arises as a full sub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
