|
Pushout (category Theory)
In category theory, a branch of mathematics, a pushout (also called a fibered coproduct or fibered sum or cocartesian square or amalgamated sum) is the colimit of a diagram consisting of two morphisms ''f'' : ''Z'' → ''X'' and ''g'' : ''Z'' → ''Y'' with a common domain. The pushout consists of an object ''P'' along with two morphisms ''X'' → ''P'' and ''Y'' → ''P'' that complete a commutative square with the two given morphisms ''f'' and ''g''. In fact, the defining universal property of the pushout (given below) essentially says that the pushout is the "most general" way to complete this commutative square. Common notations for the pushout are P = X \sqcup_Z Y and P = X +_Z Y. The pushout is the categorical dual of the pullback. Universal property Explicitly, the pushout of the morphisms ''f'' and ''g'' consists of an object ''P'' and two morphisms ''i''1 : ''X'' → ''P'' and ''i''2 : ''Y'' → ''P'' such that the diagram : commutes and such that ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Theory
Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Nowadays, category theory is used in almost all areas of mathematics, and in some areas of computer science. In particular, many constructions of new mathematical objects from previous ones, that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality. A category is formed by two sorts of objects: the objects of the category, and the morphisms, which relate two objects called the ''source'' and the ''target'' of the morphism. One often says that a morphism is an ''arrow'' that ''maps'' its source to its target. Morphisms can be ''composed'' if the target of the first morphism equals the source of the second one, and morphism compos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Preimage
In mathematics, the image of a function is the set of all output values it may produce. More generally, evaluating a given function f at each element of a given subset A of its domain produces a set, called the "image of A under (or through) f". Similarly, the inverse image (or preimage) of a given subset B of the codomain of f, is the set of all elements of the domain that map to the members of B. Image and inverse image may also be defined for general binary relations, not just functions. Definition The word "image" is used in three related ways. In these definitions, f : X \to Y is a function from the set X to the set Y. Image of an element If x is a member of X, then the image of x under f, denoted f(x), is the value of f when applied to x. f(x) is alternatively known as the output of f for argument x. Given y, the function f is said to "" or "" if there exists some x in the function's domain such that f(x) = y. Similarly, given a set S, f is said to "" if there exi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Direct Sum Of Abelian Groups
The direct sum is an operation between structures in abstract algebra, a branch of mathematics. It is defined differently, but analogously, for different kinds of structures. To see how the direct sum is used in abstract algebra, consider a more elementary kind of structure, the abelian group. The direct sum of two abelian groups A and B is another abelian group A\oplus B consisting of the ordered pairs (a,b) where a \in A and b \in B. To add ordered pairs, we define the sum (a, b) + (c, d) to be (a + c, b + d); in other words addition is defined coordinate-wise. For example, the direct sum \Reals \oplus \Reals , where \Reals is real coordinate space, is the Cartesian plane, \R ^2 . A similar process can be used to form the direct sum of two vector spaces or two modules. We can also form direct sums with any finite number of summands, for example A \oplus B \oplus C, provided A, B, and C are the same kinds of algebraic structures (e.g., all abelian groups, or all vect ... [...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'') The third e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pointed Space
In mathematics, a pointed space or based space is a topological space with a distinguished point, the basepoint. The distinguished point is just simply one particular point, picked out from the space, and given a name, such as x_0, that remains unchanged during subsequent discussion, and is kept track of during all operations. Maps of pointed spaces (based maps) are Continuous (topology), continuous maps preserving basepoints, i.e., a map f between a pointed space X with basepoint x_0 and a pointed space Y with basepoint y_0 is a based map if it is continuous with respect to the topologies of X and Y and if f\left(x_0\right) = y_0. This is usually denoted :f : \left(X, x_0\right) \to \left(Y, y_0\right). Pointed spaces are important in algebraic topology, particularly in homotopy theory, where many constructions, such as the fundamental group, depend on a choice of basepoint. The pointed set concept is less important; it is anyway the case of a pointed discrete space. Pointed sp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wedge Sum
In topology, the wedge sum is a "one-point union" of a family of topological spaces. Specifically, if ''X'' and ''Y'' are pointed spaces (i.e. topological spaces with distinguished basepoints x_0 and y_0) the wedge sum of ''X'' and ''Y'' is the quotient space of the disjoint union of ''X'' and ''Y'' by the identification x_0 \sim y_0: X \vee Y = (X \amalg Y)\;/, where \,\sim\, is the equivalence closure of the relation \left\. More generally, suppose \left(X_i\right)_ is a indexed family of pointed spaces with basepoints \left(p_i\right)_. The wedge sum of the family is given by: \bigvee_ X_i = \coprod_ X_i\;/, where \,\sim\, is the equivalence closure of the relation \left\. In other words, the wedge sum is the joining of several spaces at a single point. This definition is sensitive to the choice of the basepoints \left(p_i\right)_, unless the spaces \left(X_i\right)_ are homogeneous. The wedge sum is again a pointed space, and the binary operation is associative and commuta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inclusion Map
In mathematics, if A is a subset of B, then the inclusion map (also inclusion function, insertion, or canonical injection) is the function \iota that sends each element x of A to x, treated as an element of B: \iota : A\rightarrow B, \qquad \iota(x)=x. A "hooked arrow" () is sometimes used in place of the function arrow above to denote an inclusion map; thus: \iota: A\hookrightarrow B. (However, some authors use this hooked arrow for any embedding.) This and other analogous injective functions from substructures are sometimes called natural injections. Given any morphism f between objects X and Y, if there is an inclusion map into the domain \iota : A \to X, then one can form the restriction f \, \iota of f. In many instances, one can also construct a canonical inclusion into the codomain R \to Y known as the range of f. Applications of inclusion maps Inclusion maps tend to be homomorphisms of algebraic structures; thus, such inclusion maps are embeddings. More precisel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subspace Topology
In topology and related areas of mathematics, a subspace of a topological space ''X'' is a subset ''S'' of ''X'' which is equipped with a topology induced from that of ''X'' called the subspace topology (or the relative topology, or the induced topology, or the trace topology). Definition Given a topological space (X, \tau) and a subset S of X, the subspace topology on S is defined by :\tau_S = \lbrace S \cap U \mid U \in \tau \rbrace. That is, a subset of S is open in the subspace topology if and only if it is the intersection of S with an open set in (X, \tau). If S is equipped with the subspace topology then it is a topological space in its own right, and is called a subspace of (X, \tau). Subsets of topological spaces are usually assumed to be equipped with the subspace topology unless otherwise stated. Alternatively we can define the subspace topology for a subset S of X as the coarsest topology for which the inclusion map :\iota: S \hookrightarrow X is continuous. More ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Of Topological Spaces
In mathematics, the category of topological spaces, often denoted Top, is the category whose objects are topological spaces and whose morphisms are continuous maps. This is a category because the composition of two continuous maps is again continuous, and the identity function is continuous. The study of Top and of properties of topological spaces using the techniques of category theory is known as categorical topology. N.B. Some authors use the name Top for the categories with topological manifolds, with compactly generated spaces as objects and continuous maps as morphisms or with the category of compactly generated weak Hausdorff spaces. As a concrete category Like many categories, the category Top is a concrete category, meaning its objects are sets with additional structure (i.e. topologies) and its morphisms are functions preserving this structure. There is a natural forgetful functor :''U'' : Top → Set to the category of sets which assigns to each topological spa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adjunction Space
In mathematics, an adjunction space (or attaching space) is a common construction in topology where one topological space is attached or "glued" onto another. Specifically, let ''X'' and ''Y'' be topological spaces, and let ''A'' be a subspace of ''Y''. Let ''f'' : ''A'' → ''X'' be a continuous map (called the attaching map). One forms the adjunction space ''X'' ∪''f'' ''Y'' (sometimes also written as ''X'' +''f'' ''Y'') by taking the disjoint union of ''X'' and ''Y'' and identifying ''a'' with ''f''(''a'') for all ''a'' in ''A''. Formally, :X\cup_f Y = (X\sqcup Y) / \sim where the equivalence relation ~ is generated by ''a'' ~ ''f''(''a'') for all ''a'' in ''A'', and the quotient is given the quotient topology. As a set, ''X'' ∪''f'' ''Y'' consists of the disjoint union of ''X'' and (''Y'' − ''A''). The topology, however, is specified by the quotient construction. Intuitively, one may think of ''Y'' as being glued onto ''X'' via the map ''f''. Examples *A common example ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Union (set Theory)
In set theory, the union (denoted by ∪) of a collection of sets is the set of all elements in the collection. It is one of the fundamental operations through which sets can be combined and related to each other. A refers to a union of zero (0) sets and it is by definition equal to the empty set. For explanation of the symbols used in this article, refer to the table of mathematical symbols. Union of two sets The union of two sets ''A'' and ''B'' is the set of elements which are in ''A'', in ''B'', or in both ''A'' and ''B''. In set-builder notation, :A \cup B = \. For example, if ''A'' = and ''B'' = then ''A'' ∪ ''B'' = . A more elaborate example (involving two infinite sets) is: : ''A'' = : ''B'' = : A \cup B = \ As another example, the number 9 is ''not'' contained in the union of the set of prime numbers and the set of even numbers , because 9 is neither prime nor even. Sets cannot have duplicate elements, so the union of the sets and is . Multip ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Intersection (set Theory)
In set theory, the intersection of two sets A and B, denoted by A \cap B, is the set containing all elements of A that also belong to B or equivalently, all elements of B that also belong to A. Notation and terminology Intersection is written using the symbol "\cap" between the terms; that is, in infix notation. For example: \\cap\=\ \\cap\=\varnothing \Z\cap\N=\N \\cap\N=\ The intersection of more than two sets (generalized intersection) can be written as: \bigcap_^n A_i which is similar to capital-sigma notation. For an explanation of the symbols used in this article, refer to the table of mathematical symbols. Definition The intersection of two sets A and B, denoted by A \cap B, is the set of all objects that are members of both the sets A and B. In symbols: A \cap B = \. That is, x is an element of the intersection A \cap B if and only if x is both an element of A and an element of B. For example: * The intersection of the sets and is . * The number 9 is in t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
