|
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 c in \mathcal and d in \mathcal, a bijection between the respective morphism sets :\ma ... [...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] |
Cognate
In historical linguistics, cognates or lexical cognates are sets of words that have been inherited in direct descent from an etymological ancestor in a common parent language. Because language change can have radical effects on both the sound and the meaning of a word, cognates may not be obvious, and it often takes rigorous study of historical sources and the application of the comparative method to establish whether lexemes are cognate. Cognates are distinguished from loanwords, where a word has been borrowed from another language. Name The English term ''cognate'' derives from Latin , meaning "blood relative". Examples An example of cognates from the same Indo-European root are: ''night'' ( English), ''Nacht'' ( German), ''nacht'' ( Dutch, Frisian), ''nag'' (Afrikaans), ''Naach'' ( Colognian), ''natt'' ( Swedish, Norwegian), ''nat'' ( Danish), ''nátt'' ( Faroese), ''nótt'' ( Icelandic), ''noc'' ( Czech, Slovak, Polish), ночь, ''noch'' ( Russian), Ð½Ð¾Ñ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Comma Category
In mathematics, a comma category (a special case being a slice category) is a construction in category theory. It provides another way of looking at morphisms: instead of simply relating objects of a Category (mathematics), category to one another, morphisms become objects in their own right. This notion was introduced in 1963 by William Lawvere, F. W. Lawvere (Lawvere, 1963 p. 36), although the technique did not become generally known until many years later. Several mathematical concepts can be treated as comma categories. Comma categories also guarantee the existence of some Limit (category theory), limits and colimits. The name comes from the notation originally used by Lawvere, which involved the comma punctuation mark. The name persists even though standard notation has changed, since the use of a comma as an operator is potentially confusing, and even Lawvere dislikes the uninformative term "comma category" (Lawvere, 1963 p. 13). Definition The most general comma ca ... [...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 \e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Supremum
In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, and if ''b'' is a lower bound of S, then ''b'' is less than or equal to the infimum of S. Consequently, the term ''greatest lower bound'' (abbreviated as ) is also commonly used. The supremum (abbreviated sup; : suprema) of a subset S of a partially ordered set P is the least element in P that is greater than or equal to each element of S, if such an element exists. If the supremum of S exists, it is unique, and if ''b'' is an upper bound of S, then the supremum of S is less than or equal to ''b''. Consequently, the supremum is also referred to as the ''least upper bound'' (or ). The infimum is, in a precise sense, dual to the concept of a supremum. Infima and suprema of real numbers are common special cases that are important in analy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Initial Object
In category theory, a branch of mathematics, an initial object of a category is an object in such that for every object in , there exists precisely one morphism . The dual notion is that of a terminal object (also called terminal element): is terminal if for every object in there exists exactly one morphism . Initial objects are also called coterminal or universal, and terminal objects are also called final. If an object is both initial and terminal, it is called a zero object or null object. A pointed category is one with a zero object. A strict initial object is one for which every morphism into is an isomorphism. Examples * The empty set is the unique initial object in Set, the category of sets. Every one-element set ( singleton) is a terminal object in this category; there are no zero objects. Similarly, the empty space is the unique initial object in Top, the category of topological spaces and every one-point space is a terminal object in this category. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dual (category Theory)
In category theory, a branch of mathematics, duality is a correspondence between the properties of a category ''C'' and the dual properties of the opposite category ''C''op. Given a statement regarding the category ''C'', by interchanging the source and target of each morphism as well as interchanging the order of composing two morphisms, a corresponding dual statement is obtained regarding the opposite category ''C''op. (''C''op is composed by reversing every morphism of ''C''.) Duality, as such, is the assertion that truth is invariant under this operation on statements. In other words, if a statement ''S'' is true about ''C'', then its dual statement is true about ''C''op. Also, if a statement is false about ''C'', then its dual has to be false about ''C''op. (Compactly saying, ''S'' for ''C'' is true if and only if its dual for ''C''op is true.) Given a concrete category ''C'', it is often the case that the opposite category ''C''op per se is abstract. ''C''op need not b ... [...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] |
Rng (algebra)
In mathematics, and more specifically in abstract algebra, a rng (or non-unital ring or pseudo-ring) is an algebraic structure satisfying the same properties as a ring (mathematics), ring, but without assuming the existence of a multiplicative identity. The term ''rng'', pronounced like ''rung'' (IPA: ), is meant to suggest that it is a ring without ''i'', that is, without the requirement for an identity element. There is no consensus in the community as to whether the existence of a multiplicative identity must be one of the ring axioms (see '). The term ''rng'' was coined to alleviate this ambiguity when people want to refer explicitly to a ring without the axiom of multiplicative identity. A number of algebras of functions considered in Mathematical analysis, analysis are not unital, for instance the algebra of functions decreasing to zero at infinity, especially those with compact support on some (non-compact space, compact) space. Rngs appear in the following chain of subcl ... [...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 product (category theory), products, pullback (category theory), pullbacks and inverse limits. The duality (category theory), dual notion of a colimit generalizes constructions such as disjoint unions, direct sums, coproducts, pushout (category theory), pushouts and direct limits. Limits and colimits, like the strongly related notions of universal property, 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 (mathematics), category C are defined by means of diagrams in C. Formally, a diagram (category theory), 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 tho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Categories For The Working Mathematician
''Categories for the Working Mathematician'' (''CWM'') is a textbook in category theory written by American mathematician Saunders Mac Lane, who cofounded the subject together with Samuel Eilenberg. It was first published in 1971, and is based on his lectures on the subject given at the University of Chicago, the Australian National University, Bowdoin College, and Tulane University. It is widely regarded as the premier introduction to the subject. Contents The book has twelve chapters, which are: :Chapter I. Categories, Functors, and Natural Transformations. :Chapter II. Constructions on Categories. :Chapter III. Universals and Limits. :Chapter IV. Adjoints. :Chapter V. Limits. :Chapter VI. Monads and Algebras. :Chapter VII. Monoids. :Chapter VIII. Abelian Categories. :Chapter IX. Special Limits. :Chapter X. Kan Extensions. :Chapter XI. Symmetry and Braiding in Monoidal Categories :Chapter XII. Structures in Categories. Chapters XI and XII were added in the 1998 s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
