Search results
Results From The WOW.Com Content Network
In mathematics, the disjoint union (or discriminated union) of the sets A and B is the set formed from the elements of A and B labelled (indexed) with the name of the set from which they come. So, an element belonging to both A and B appears twice in the disjoint union, with two different labels.
The disjoint union space X, together with the canonical injections, can be characterized by the following universal property: If Y is a topological space, and f i : X i → Y is a continuous map for each i ∈ I, then there exists precisely one continuous map f : X → Y such that the following set of diagrams commute:
In this way, the disjoint union construction provides a way of viewing any family of sets indexed by as a set "fibered" over , and conversely, for any set : fibered over , we can view it as the disjoint union of the fibers of . Jacobs has referred to these two perspectives as "display indexing" and "pointwise indexing".
If {X i} is a collection of spaces and X is the (set-theoretic) disjoint union of {X i}, then the coproduct topology (or disjoint union topology, topological sum of the X i) on X is the finest topology for which all the injection maps are continuous. Core-compact space Cosmic space A continuous image of some separable metric space. [3 ...
The concept of disjoint union secretly underlies the above examples: the direct sum of abelian groups is the group generated by the "almost" disjoint union (disjoint union of all nonzero elements, together with a common zero), similarly for vector spaces: the space spanned by the "almost" disjoint union; the free product for groups is generated ...
In mathematics, specifically algebraic topology, the mapping cylinder [1] of a continuous function between topological spaces and is the quotient = (([,])) / where the denotes the disjoint union, and ~ is the equivalence relation generated by
The best mathematical definition of disjoint union is to be a coproduct in the category of sets. As such, the discrete union is defined up to an isomorphism, and the definition with "index space" given in the article is just one realization among others. When the sets are pairwise disjoint, the usual union is another realization.
One common convention is to associate intersection = {: ()} with logical conjunction (and) and associate union = {: ()} with logical disjunction (or), and then transfer the precedence of these logical operators (where has precedence over ) to these set operators, thereby giving precedence over .