|
Distributive Category
In mathematics, a category is distributive if it has finite products and finite coproducts and such that for every choice of objects A,B,C, the canonical map : mathit_A \times\iota_1, \mathit_A \times\iota_2: A\!\times\!B \,+ A\!\times\!C \to A\!\times\!(B+C) is an isomorphism, and for all objects A, the canonical map 0 \to A\times 0 is an isomorphism (where 0 denotes the initial object). Equivalently, if for every object A the endofunctor A \times - defined by B\mapsto A\times B preserves coproducts up to isomorphisms f. It follows that f and aforementioned canonical maps are equal for each choice of objects. In particular, if the functor A \times - has a right adjoint (i.e., if the category is cartesian closed), it necessarily preserves all colimits, and thus any cartesian closed category with finite coproducts (i.e., any bicartesian closed category) is distributive. Example The category of sets is distributive. Let , , and be sets. Then :\begin A\times (B\amalg ... [...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] |
Bicartesian Closed Category
In category theory, a category is Cartesian closed if, roughly speaking, any morphism defined on a product of two objects can be naturally identified with a morphism defined on one of the factors. These categories are particularly important in mathematical logic and the theory of programming, in that their internal language is the simply typed lambda calculus. They are generalized by closed monoidal categories, whose internal language, linear type systems, are suitable for both quantum and classical computation. Etymology Named after René Descartes (1596–1650), French philosopher, mathematician, and scientist, whose formulation of analytic geometry gave rise to the concept of Cartesian product, which was later generalized to the notion of categorical product. Definition The category C is called Cartesian closed iff it satisfies the following three properties: * It has a terminal object. * Any two objects ''X'' and ''Y'' of C have a product ''X'' ×''Y'' in C. * Any tw ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Of Abelian Groups
In mathematics, the category Ab has the abelian groups as objects and group homomorphisms as morphisms. This is the prototype of an abelian category: indeed, every small abelian category can be embedded in Ab. Properties The zero object of Ab is the trivial group which consists only of its neutral element. The monomorphisms in Ab are the injective group homomorphisms, the epimorphisms are the surjective group homomorphisms, and the isomorphisms are the bijective group homomorphisms. Ab is a full subcategory of Grp, the category of ''all'' groups. The main difference between Ab and Grp is that the sum of two homomorphisms ''f'' and ''g'' between abelian groups is again a group homomorphism: :(''f''+''g'')(''x''+''y'') = ''f''(''x''+''y'') + ''g''(''x''+''y'') = ''f''(''x'') + ''f''(''y'') + ''g''(''x'') + ''g''(''y'') : = ''f''(''x'') + ''g''(''x'') + ''f''(''y'') + ''g''(''y'') = (''f''+''g'')(''x'') + (''f''+''g'')(''y' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Of Groups
In mathematics, the category Grp (or Gp) has the class of all groups for objects and group homomorphisms for morphisms. As such, it is a concrete category. The study of this category is known as group theory. Relation to other categories There are two forgetful functors from Grp, M: Grp → Mon from groups to monoids and U: Grp → Set from groups to sets. M has two adjoints: one right, I: Mon→Grp, and one left, K: Mon→Grp. I: Mon→Grp is the functor sending every monoid to the submonoid of invertible elements and K: Mon→Grp the functor sending every monoid to the Grothendieck group In mathematics, the Grothendieck group, or group of differences, of a commutative monoid is a certain abelian group. This abelian group is constructed from in the most universal way, in the sense that any abelian group containing a group homomorp ... of that monoid. The forgetful functor U: Grp → Set has a left adjoint given by the composite KF: Set→Mon→Grp, where F is the Free_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cardinality
The thumb is the first digit of the hand, next to the index finger. When a person is standing in the medical anatomical position (where the palm is facing to the front), the thumb is the outermost digit. The Medical Latin English noun for thumb is ''pollex'' (compare ''hallux'' for big toe), and the corresponding adjective for thumb is ''pollical''. Definition Thumb and fingers The English word ''finger'' has two senses, even in the context of appendages of a single typical human hand: 1) Any of the five terminal members of the hand. 2) Any of the four terminal members of the hand, other than the thumb. Linguistically, it appears that the original sense was the first of these two: (also rendered as ) was, in the inferred Proto-Indo-European language, a suffixed form of (or ), which has given rise to many Indo-European-family words (tens of them defined in English dictionaries) that involve, or stem from, concepts of fiveness. The thumb shares the following with each of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distributive Property
In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality x \cdot (y + z) = x \cdot y + x \cdot z is always true in elementary algebra. For example, in elementary arithmetic, one has 2 \cdot (1 + 3) = (2 \cdot 1) + (2 \cdot 3). Therefore, one would say that multiplication ''distributes'' over addition. This basic property of numbers is part of the definition of most algebraic structures that have two operations called addition and multiplication, such as complex numbers, polynomials, Matrix (mathematics), matrices, Ring (mathematics), rings, and Field (mathematics), fields. It is also encountered in Boolean algebra and mathematical logic, where each of the logical and (denoted \,\land\,) and the logical or (denoted \,\lor\,) distributes over the other. Definition Given a Set (mathematics), set S and two binary operators \,*\, and \,+\, on S, *the operation \,*\, is over (or with respect to) \,+ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Set
In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example, is a finite set with five elements. The number of elements of a finite set is a natural number (possibly zero) and is called the ''cardinality (or the cardinal number)'' of the set. A set that is not a finite set is called an '' infinite set''. For example, the set of all positive integers is infinite: Finite sets are particularly important in combinatorics, the mathematical study of counting. Many arguments involving finite sets rely on the pigeonhole principle, which states that there cannot exist an injective function from a larger finite set to a smaller finite set. Definition and terminology Formally, a set S is called finite if there exists a bijection for some natural number n (natural numbers are defined as sets in Zermelo-Fraenkel set theory). The number n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijection
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the ''inverse'' of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the ''multiplication by two'' defines a bijection from the integers to the even numbers, which has the ''division by two'' as its inverse function. A function is bijective if and only if it is both injective (or ''one-to-one'')—meaning that each element in the codomain is mappe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Disjoint Union
In mathematics, the disjoint union (or discriminated union) A \sqcup B of the sets and is the set formed from the elements of and labelled (indexed) with the name of the set from which they come. So, an element belonging to both and appears twice in the disjoint union, with two different labels. A disjoint union of an indexed family of sets (A_i : i\in I) is a set A, often denoted by \bigsqcup_ A_i, with an injective function, injection of each A_i into A, such that the image (mathematics), images of these injections form a Partition (set theory), partition of A (that is, each element of A belongs to exactly one of these images). A disjoint union of a family of pairwise disjoint sets is their Union (set theory), union. In category theory, the disjoint union is the coproduct of the category of sets, and thus defined up to a bijection. In this context, the notation \coprod_ A_i is often used. The disjoint union of two sets A and B is written with infix notation as A \sq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Set (mathematics)
In mathematics, a set is a collection of different things; the things are '' elements'' or ''members'' of the set and are typically mathematical objects: numbers, symbols, points in space, lines, other geometric shapes, variables, or other sets. A set may be finite or infinite. There is a unique set with no elements, called the empty set; a set with a single element is a singleton. Sets are ubiquitous in modern mathematics. Indeed, set theory, more specifically Zermelo–Fraenkel set theory, has been the standard way to provide rigorous foundations for all branches of mathematics since the first half of the 20th century. Context Before the end of the 19th century, sets were not studied specifically, and were not clearly distinguished from sequences. Most mathematicians considered infinity as potentialmeaning that it is the result of an endless processand were reluctant to consider infinite sets, that is sets whose number of members is not a natural number. Specific ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Of Sets
In the mathematical field of category theory, the category of sets, denoted by Set, is the category whose objects are sets. The arrows or morphisms between sets ''A'' and ''B'' are the functions from ''A'' to ''B'', and the composition of morphisms is the composition of functions. Many other categories (such as the category of groups, with group homomorphisms as arrows) add structure to the objects of the category of sets or restrict the arrows to functions of a particular kind (or both). Properties of the category of sets The axioms of a category are satisfied by Set because composition of functions is associative, and because every set ''X'' has an identity function id''X'' : ''X'' → ''X'' which serves as identity element for function composition. The epimorphisms in Set are the surjective maps, the monomorphisms are the injective maps, and the isomorphisms are the bijective maps. The empty set serves as the initial object in Set with empty functions as morph ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Colimit
In category theory, a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as products, pullbacks and inverse limits. The dual notion of a colimit generalizes constructions such as disjoint unions, direct sums, coproducts, pushouts 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. Definition Limits and colimits in a category C are defined by means of diagrams in C. Formally, a 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 thought of as indexing a collection of objects and morphisms in C patterned on J. One is most often interested in the case where the category J is a small or even finite cat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
