Kernel (category theory)In and its applications to other branches of mathematics, kernels are a generalization of the kernels of group homomorphisms, the kernels of module homomorphisms and certain other kernels from algebra. Intuitively, the kernel of the morphism f : X → Y is the "most general" morphism k : K → X that yields zero when composed with (followed by) f. Note that kernel pairs and difference kernels (also known as binary equalisers) sometimes go by the name "kernel"; while related, these aren't quite the same thing and are not discussed in this article.
Representable functorIn mathematics, particularly , a representable functor is a certain functor from an arbitrary into the . Such functors give representations of an abstract category in terms of known structures (i.e. sets and functions) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings. From another point of view, representable functors for a category C are the functors given with C. Their theory is a vast generalisation of upper sets in posets, and of Cayley's theorem in group theory.
Limit (category theory)In , a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as , and inverse limits. The of a colimit generalizes constructions such as disjoint unions, direct sums, coproducts, s and direct limits. Limits and colimits, like the strongly related notions of 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.
SubcategoryIn mathematics, specifically , a subcategory of a C is a category S whose are objects in C and whose morphisms are morphisms in C with the same identities and composition of morphisms. Intuitively, a subcategory of C is a category obtained from C by "removing" some of its objects and arrows. Let C be a category. A subcategory S of C is given by a subcollection of objects of C, denoted ob(S), a subcollection of morphisms of C, denoted hom(S).
Free productIn mathematics, specifically group theory, the free product is an operation that takes two groups G and H and constructs a new group G ∗ H. The result contains both G and H as subgroups, is generated by the elements of these subgroups, and is the “universal” group having these properties, in the sense that any two homomorphisms from G and H into a group K factor uniquely through a homomorphism from G ∗ H to K. Unless one of the groups G and H is trivial, the free product is always infinite.
Ring homomorphismIn ring theory, a branch of abstract algebra, a ring homomorphism is a structure-preserving function between two rings. More explicitly, if R and S are rings, then a ring homomorphism is a function f : R → S such that f is: addition preserving: for all a and b in R, multiplication preserving: for all a and b in R, and unit (multiplicative identity) preserving: Additive inverses and the additive identity are part of the structure too, but it is not necessary to require explicitly that they too are respected, because these conditions are consequences of the three conditions above.
Field of fractionsIn abstract algebra, the field of fractions of an integral domain is the smallest field in which it can be embedded. The construction of the field of fractions is modeled on the relationship between the integral domain of integers and the field of rational numbers. Intuitively, it consists of ratios between integral domain elements. The field of fractions of an integral domain is sometimes denoted by or , and the construction is sometimes also called the fraction field, field of quotients, or quotient field of .
Glossary of ring theoryRing theory is the branch of mathematics in which rings are studied: that is, structures supporting both an addition and a multiplication operation. This is a glossary of some terms of the subject. For the items in commutative algebra (the theory of commutative rings), see glossary of commutative algebra. For ring-theoretic concepts in the language of modules, see also Glossary of module theory. For specific types of algebras, see also: Glossary of field theory and Glossary of Lie groups and Lie algebras.
Equaliser (mathematics)In mathematics, an equaliser is a set of arguments where two or more functions have equal values. An equaliser is the solution set of an equation. In certain contexts, a difference kernel is the equaliser of exactly two functions. Let X and Y be sets. Let f and g be functions, both from X to Y. Then the equaliser of f and g is the set of elements x of X such that f(x) equals g(x) in Y. Symbolically: The equaliser may be denoted Eq(f, g) or a variation on that theme (such as with lowercase letters "eq").
