In mathematics, a morphism is an abstraction derived from structure-preserving mappings between two mathematical structures. Mathematics is the body of Knowledge and Academic discipline that studies such concepts as Quantity, Structure, Space and In Mathematics and related technical fields the term map or mapping is often a Synonym for function. In Mathematics, a structure on a set, or more generally a type, consists of additional Mathematical objects that in some manner attach to the
The study of morphisms and of the structures (called objects) over which they are defined, is central to category theory. In Mathematics, category theory deals in an abstract way with mathematical Structures and relationships between them it abstracts from sets In Mathematics, category theory deals in an abstract way with mathematical Structures and relationships between them it abstracts from sets Much of the terminology of morphisms, as well as the intuition underlying them, comes from concrete categories, where the objects are simply sets with some additional structure, and morphisms are functions preserving this structure. In Mathematics, a concrete category is commonly understood as a category whose objects are structured sets, whose Morphisms are structure-preserving Nevertheless, morphisms are not necessarily functions, and objects over which morphisms are defined are not necessarily sets. The Mathematical concept of a function expresses dependence between two quantities one of which is given (the independent variable, argument of the function Instead, a morphism is often thought of as an arrow linking an object called the domain to another object called the codomain. In mathematics and especially in Category theory a commutative diagram is a Diagram of objects also known as vertices, and Morphisms also In Mathematics, category theory deals in an abstract way with mathematical Structures and relationships between them it abstracts from sets In Mathematics, category theory deals in an abstract way with mathematical Structures and relationships between them it abstracts from sets Hence morphisms do not so much map sets into sets, as embody a relationship between some posited domain and codomain.
The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in topology, continuous functions; in universal algebra, homomorphisms; in group theory, group homomorphisms. Topology ( Greek topos, "place" and logos, "study" is the branch of Mathematics that studies the properties of In Mathematics, a continuous function is a function for which intuitively small changes in the input result in small changes in the output Universal algebra (sometimes called general algebra) is the field of Mathematics that studies Algebraic structures themselves not examples ("models" In Abstract algebra, a homomorphism is a structure-preserving map between two Algebraic structures (such as groups rings or Vector Group theory is a mathematical discipline the part of Abstract algebra that studies the Algebraic structures known as groups. In Mathematics, given two groups ( G, * and ( H, · a group homomorphism from ( G, * to ( H, · is a function
Contents |
A category C consists of two classes, one of objects and the other of morphisms. In Mathematics, a category is a fundamental and abstract way to describe mathematical entities and their relationships In Set theory and its applications throughout Mathematics, a class is a collection of sets (or sometimes other mathematical objects that can be unambiguously
There are two operations defined on every morphism, the domain (or source) and the codomain (or target). In Mathematics, the domain of a given function is the set of " Input " values for which the function is defined In Mathematics, the codomain, or target, of a function f: X → Y is the set
If a morphism f has domain X and codomain Y, we write f : X → Y. Thus a morphism is an arrow from its domain to its codomain. The set of all morphisms from X to Y is denoted homC(X,Y) or simply hom(X, Y) and called the hom-set between X and Y. (Some authors write MorC(X,Y) or Mor(X, Y)).
For every three objects X, Y, and Z, there exists a binary operation hom(X, Y) × hom(Y, Z) → hom(X, Z) called composition. In Mathematics, a binary operation is a calculation involving two Operands, in other words an operation whose Arity is two In Mathematics, a composite function represents the application of one function to the results of another The composite of f : X → Y and g : Y → Z is written g o f, gf, or even fg. The composition of morphisms is often represented by a commutative diagram. In mathematics and especially in Category theory a commutative diagram is a Diagram of objects also known as vertices, and Morphisms also For example,
Morphisms satisfy two axioms:
When C is a concrete category, the identity morphism is just the identity function, and composition is just the ordinary composition of functions. In Mathematics, an identity function, also called identity map or identity transformation, is a function that always returns the same value that In Mathematics, a composite function represents the application of one function to the results of another Associativity then follows, because the composition of functions is associative.
Note that the domain and codomain are in fact part of the information determining a morphism. For example, in the category of sets, where morphisms are functions, two functions may be identical as sets of ordered pairs (may have the same range), while having different codomains. In Mathematics, the range of a function is the set of all "output" values produced by that function The two functions are distinct from the viewpoint of category theory. Thus many authors require that the hom-classes hom(X, Y) be disjoint. In practice, this is not a problem because if this disjointness does not hold, it can be assured by appending the domain and codomain to the morphisms, (say, as the second and third components of an ordered triple).
It is also called a mono or a monic. The morphism f has a left inverse if there is a morphism g:Y → X such that g o f = idX. The left inverse g is also called a retraction of f. Morphisms with left inverses are always monomorphisms, but the converse is not always true in every category; a monomorphism may fail to have a left-inverse.
A split monomorphism h : X → Y is a monomorphism having a left inverse g : Y → X, so that g o h = idX. Thus h o g : Y → Y is idempotent, so that (h o g)2 = h o g. Idempotence ˌaɪdɨmˈpoʊtəns describes the property of operations in Mathematics and Computer science which means that multiple applications of the operation
In concrete categories, a function which has left inverse is injective. In Mathematics, a concrete category is commonly understood as a category whose objects are structured sets, whose Morphisms are structure-preserving Thus in concrete categories, monomorphisms are often, but not always, injective. The condition of being an injection is stronger than that of being a monomorphism, but weaker than that of being a split monomorphism.
A split epimorphism is an epimorphism having a right inverse.
In concrete categories, a function which has a right inverse is surjective. In Mathematics, a concrete category is commonly understood as a category whose objects are structured sets, whose Morphisms are structure-preserving In Mathematics, a function f is said to be surjective or onto, if its values span its whole Codomain; that is for every Thus in concrete categories, epimorphisms are often, but not always, surjective. The condition of being a surjection is stronger than that of being an epimorphism, but weaker than that of being a split epimorphism. In the category of sets, every surjection has a section, a result equivalent to the axiom of choice. In Mathematics, the category of sets, denoted as Set, is the category whose objects are all sets and whose Morphisms are In Mathematics, the axiom of choice, or AC, is an Axiom of Set theory.
Note that if a split monomorphism f has a left-inverse g, then g is a split epimorphism and has right-inverse f.
If a morphism has both left-inverse and right-inverse, then the two inverses are equal, so f is an isomorphism, and g is called simply the inverse of f. Inverse morphisms, if they exist, are unique. The inverse g is also an isomorphism with inverse f. Two objects with an isomorphism between them are said to be isomorphic or equivalent. In Abstract algebra, an isomorphism ( Greek: ἴσος isos "equal" and μορφή morphe "shape" is a bijective
Note that while every isomorphism is a bimorphism, a bimorphism is not necessarily an isomorphism. For example, in the category of commutative rings the inclusion Z → Q is a bimorphism which is not an isomorphism. In Ring theory, a branch of Abstract algebra, a commutative ring is a ring in which the multiplication operation has the commutative property However, any morphism that is both an epimorphism and a split monomorphism, or both a monomorphism and a split epimorphism, must be an isomorphism. A category, such as Set, in which every bimorphism is an isomorphism is known as a balanced category.
A split endomorphism is an idempotent endomorphism f if f admits a decomposition f = h o g with g o h = id. In particular, the Karoubi envelope of a category splits every idempotent morphism. In Mathematics the Karoubi envelope (or Cauchy completion, but that term has other meanings of a category C is a classification of the
For more examples, see the entry category theory. In Mathematics, category theory deals in an abstract way with mathematical Structures and relationships between them it abstracts from sets