|
Yoneda Functor
In mathematics, the Yoneda lemma is arguably the most important 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 allows the embedding of any locally small category into a category of functors (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 after Nobuo Yoneda. Generalities The Yoneda lemma suggests that instead of studying the locally small category \mathcal , one should study the category of all functors of \mathcal into \mathbf (the category of sets with ... [...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] |
Ring (mathematics)
In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ''ring'' is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. 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. Formally, a ''ring'' is an abelian group whose operation is called ''addition'', with a second binary operation called ''multiplication'' that is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors use the term " " with a missing i to refer to the more general structure that omits this last requirement; see .) Whether a ring is commutative (that is, whether the order in which two elements are multiplied might change the result) has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Full And Faithful Functors
In category theory, a faithful functor is a functor that is injective on hom-sets, and a full functor is surjective on hom-sets. A functor that has both properties is called a full and faithful functor. Formal definitions Explicitly, let ''C'' and ''D'' be (locally small) categories and let ''F'' : ''C'' → ''D'' be a functor from ''C'' to ''D''. The functor ''F'' induces a function :F_\colon\mathrm_(X,Y)\rightarrow\mathrm_(F(X),F(Y)) for every pair of objects ''X'' and ''Y'' in ''C''. The functor ''F'' is said to be *faithful if ''F''''X'',''Y'' is injectiveJacobson (2009), p. 22 *full if ''F''''X'',''Y'' is surjectiveMac Lane (1971), p. 14 *fully faithful (= full and faithful) if ''F''''X'',''Y'' is bijective for each ''X'' and ''Y'' in ''C''. A mnemonic for remembering the term "full" is that the image of the function fills the codomain; a mnemonic for remembering the term "faithful" is that you can trust (have faith) that F(X)=F(Y) implies X=Y. Properties A faithful functor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Covariant 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) in ... [...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] |
Yoneda Lemma Cd
is a Japanese Japanese may refer to: * Something from or related to Japan, an island country in East Asia * Japanese language, spoken mainly in Japan * Japanese people, the ethnic group that identifies with Japan through ancestry or culture ** Japanese diaspor ... surname. In Japanese, "米田" may also be read as , another Japanese surname. Notable people with the surname include: *, gymnast *, Japanese-American activist and author *, mathematician and computer scientist *, Japanese footballer *, baseball pitcher {{surname Japanese-language surnames ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutative Diagram
350px, The commutative diagram used in the proof of the five lemma. In mathematics, and especially in category theory, a commutative diagram is a diagram such that all directed paths in the diagram with the same start and endpoints lead to the same result. It is said that commutative diagrams play the role in category theory that equations play in algebra. Description A commutative diagram often consists of three parts: * objects (also known as ''vertices'') * morphisms (also known as ''arrows'' or ''edges'') * paths or composites Arrow symbols In algebra texts, the type of morphism can be denoted with different arrow usages: * A monomorphism may be labeled with a \hookrightarrow or a \rightarrowtail. * An epimorphism may be labeled with a \twoheadrightarrow. * An isomorphism may be labeled with a \overset. * The dashed arrow typically represents the claim that the indicated morphism exists (whenever the rest of the diagram holds); the arrow may be optionally labeled as \exist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Éléments De Géométrie Algébrique
The ''Éléments de géométrie algébrique'' ("Elements of algebraic geometry, Algebraic Geometry") by Alexander Grothendieck (assisted by Jean Dieudonné), or ''EGA'' for short, is a rigorous treatise, in French language, French, on algebraic geometry that was published (in eight parts or fascicle (book), fascicles) from 1960 through 1967 by the ''Institut des Hautes Études Scientifiques''. In it, Grothendieck established systematic foundations of algebraic geometry, building upon the concept of Scheme (mathematics), schemes, which he defined. The work is now considered the foundation stone and basic reference of modern algebraic geometry. Editions Initially thirteen chapters were planned, but only the first four (making a total of approximately 1500 pages) were published. Much of the material which would have been found in the following chapters can be found, in a less polished form, in the ''Séminaire de géométrie algébrique'' (known as ''SGA''). Indeed, as explained by G ... [...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) in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Isomorphism
In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure (i.e., the composition of morphisms) of the categories involved. Hence, a natural transformation can be considered to be a "morphism of functors". Informally, the notion of a natural transformation states that a particular map between functors can be done consistently over an entire category. Indeed, this intuition can be formalized to define so-called functor categories. Natural transformations are, after categories and functors, one of the most fundamental notions of category theory and consequently appear in the majority of its applications. Definition If F and G are functors between the categories C and D , then a natural transformation \eta from F to G is a family of morphisms that satisfies two requirements. # The natural transformation must associate, to every object X in C, a morphism \eta_X : F(X) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Covariance And Contravariance Of Functors
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] |
