|
Additive Functor
In mathematics, specifically in category theory, a preadditive category is another name for an Ab-category, i.e., a category that is enriched over the category of abelian groups, Ab. That is, an Ab-category C is a category such that every hom-set Hom(''A'',''B'') in C has the structure of an abelian group, and composition of morphisms is bilinear, in the sense that composition of morphisms distributes over the group operation. In formulas: f\circ (g + h) = (f\circ g) + (f\circ h) and (f + g)\circ h = (f\circ h) + (g\circ h), where + is the group operation. Some authors have used the term ''additive category'' for preadditive categories, but this page reserves that term for certain special preadditive categories (see below). Examples The most obvious example of a preadditive category is the category Ab itself. More precisely, Ab is a closed monoidal category. Note that commutativity is crucial here; it ensures that the sum of two group homomorphisms is again a ho ... [...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] |
Additive Category
In mathematics, specifically in category theory, an additive category is a preadditive category C admitting all finitary biproducts. Definition There are two equivalent definitions of an additive category: One as a category equipped with additional structure, and another as a category equipped with ''no extra structure'' but whose objects and morphisms satisfy certain equations. Via preadditive categories A category C is preadditive if all its hom-sets are abelian groups and composition of morphisms is bilinear; in other words, C is enriched over the monoidal category of abelian groups. In a preadditive category, every finitary product is necessarily a coproduct, and hence a biproduct, and conversely every finitary coproduct is necessarily a product (this is a consequence of the definition, not a part of it). The empty product, is a final object and the empty product in the case of an empty diagram, an initial object. Both being limits, they are not finite ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Factor Ring
In ring theory, a branch of abstract algebra, a quotient ring, also known as factor ring, difference ring or residue class ring, is a construction quite similar to the quotient group in group theory and to the quotient space (linear algebra), quotient space in linear algebra. It is a specific example of a quotient (universal algebra), quotient, as viewed from the general setting of universal algebra. Starting with a ring (mathematics), ring R and a two-sided ideal I in , a new ring, the quotient ring , is constructed, whose elements are the cosets of I in R subject to special + and \cdot operations. (Quotient ring notation almost always uses a fraction slash ""; stacking the ring over the ideal using a horizontal line as a separator is uncommon and generally avoided.) Quotient rings are distinct from the so-called "quotient field", or field of fractions, of an integral domain as well as from the more general "rings of quotients" obtained by localization of a ring, localization. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jacobson Radical
In mathematics, more specifically ring theory, the Jacobson radical of a ring R is the ideal consisting of those elements in R that annihilate all simple right R- modules. It happens that substituting "left" in place of "right" in the definition yields the same ideal, and so the notion is left–right symmetric. The Jacobson radical of a ring is frequently denoted by J(R) or \operatorname(R); the former notation will be preferred in this article to avoid confusion with other radicals of a ring. The Jacobson radical is named after Nathan Jacobson, who was the first to study it for arbitrary rings in . The Jacobson radical of a ring has numerous internal characterizations, including a few definitions that successfully extend the notion to non-unital rings. The radical of a module extends the definition of the Jacobson radical to include modules. The Jacobson radical plays a prominent role in many ring- and module-theoretic results, such as Nakayama's lemma. Definitions ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ideal (ring)
In mathematics, and more specifically in ring theory, an ideal of a ring is a special subset of its elements. Ideals generalize certain subsets of the integers, such as the even numbers or the multiples of 3. Addition and subtraction of even numbers preserves evenness, and multiplying an even number by any integer (even or odd) results in an even number; these closure and absorption properties are the defining properties of an ideal. An ideal can be used to construct a quotient ring in a way similar to how, in group theory, a normal subgroup can be used to construct a quotient group. Among the integers, the ideals correspond one-for-one with the non-negative integers: in this ring, every ideal is a principal ideal consisting of the multiples of a single non-negative number. However, in other rings, the ideals may not correspond directly to the ring elements, and certain properties of integers, when generalized to rings, attach more naturally to the ideals than to the eleme ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monoid
In abstract algebra, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being . Monoids are semigroups with identity. Such algebraic structures occur in several branches of mathematics. The functions from a set into itself form a monoid with respect to function composition. More generally, in category theory, the morphisms of an object to itself form a monoid, and, conversely, a monoid may be viewed as a category with a single object. In computer science and computer programming, the set of strings built from a given set of characters is a free monoid. Transition monoids and syntactic monoids are used in describing finite-state machines. Trace monoids and history monoids provide a foundation for process calculi and concurrent computing. In theoretical computer science, the study of monoids is fundamental for automata theory (Krohn–Rhodes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1 (number)
1 (one, unit, unity) is a number, numeral, and glyph. It is the first and smallest positive integer of the infinite sequence of natural numbers. This fundamental property has led to its unique uses in other fields, ranging from science to sports, where it commonly denotes the first, leading, or top thing in a group. 1 is the unit of counting or measurement, a determiner for singular nouns, and a gender-neutral pronoun. Historically, the representation of 1 evolved from ancient Sumerian and Babylonian symbols to the modern Arabic numeral. In mathematics, 1 is the multiplicative identity, meaning that any number multiplied by 1 equals the same number. 1 is by convention not considered a prime number. In digital technology, 1 represents the "on" state in binary code, the foundation of computing. Philosophically, 1 symbolizes the ultimate reality or source of existence in various traditions. In mathematics The number 1 is the first natural number after 0. Each natural ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abstract Nonsense
In mathematics, abstract nonsense, general abstract nonsense, generalized abstract nonsense, and general nonsense are nonderogatory terms used by mathematicians to describe long, theoretical parts of a proof they skip over when readers are expected to be familiar with them. These terms are mainly used for abstract methods related to category theory and homological algebra. More generally, "abstract nonsense" may refer to a proof that relies on category-theoretic methods, or even to the study of category theory itself. Background Roughly speaking, category theory is the study of the general form, that is, categories of mathematical theories, without regard to their content. As a result, mathematical proofs that rely on category-theoretic ideas often seem out-of-context, somewhat akin to a non sequitur (literary device), non sequitur. Authors sometimes dub these proofs "abstract nonsense" as a light-hearted way of alerting readers to their abstract nature. Labeling an argument "abstr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Identity Element
In mathematics, an identity element or neutral element of a binary operation is an element that leaves unchanged every element when the operation is applied. For example, 0 is an identity element of the addition of real numbers. This concept is used in algebraic structures such as group (mathematics), groups and ring (mathematics), rings. The term ''identity element'' is often shortened to ''identity'' (as in the case of additive identity and multiplicative identity) when there is no possibility of confusion, but the identity implicitly depends on the binary operation it is associated with. Definitions Let be a set equipped with a binary operation ∗. Then an element of is called a if for all in , and a if for all in . If is both a left identity and a right identity, then it is called a , or simply an . An identity with respect to addition is called an Additive identity, (often denoted as 0) and an identity with respect to m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Endomorphism Ring
In mathematics, the endomorphisms of an abelian group ''X'' form a ring. This ring is called the endomorphism ring of ''X'', denoted by End(''X''); the set of all homomorphisms of ''X'' into itself. Addition of endomorphisms arises naturally in a pointwise manner and multiplication via endomorphism composition. Using these operations, the set of endomorphisms of an abelian group forms a (unital) ring, with the zero map 0: x \mapsto 0 as additive identity and the identity map 1: x \mapsto x as multiplicative identity. The functions involved are restricted to what is defined as a homomorphism in the context, which depends upon the category of the object under consideration. The endomorphism ring consequently encodes several internal properties of the object. As the endomorphism ring is often an algebra over some ring ''R,'' this may also be called the endomorphism algebra. An abelian group is the same thing as a module over the ring of integers, which is the initial object ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring (algebra)
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 defined a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Endomorphism
In mathematics, an endomorphism is a morphism from a mathematical object to itself. An endomorphism that is also an isomorphism is an automorphism. For example, an endomorphism of a vector space is a linear map , and an endomorphism of a group is a group homomorphism . In general, we can talk about endomorphisms in any category. In the category of sets, endomorphisms are functions from a set ''S'' to itself. In any category, the composition of any two endomorphisms of is again an endomorphism of . It follows that the set of all endomorphisms of forms a monoid, the full transformation monoid, and denoted (or to emphasize the category ). Automorphisms An invertible endomorphism of is called an automorphism. The set of all automorphisms is a subset of with a group structure, called the automorphism group of and denoted . In the following diagram, the arrows denote implication: Endomorphism rings Any two endomorphisms of an abelian group, , can be ad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
