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:
The continuous maps h : X ∪ f Y → Z are in 1-1 correspondence with the pairs of continuous maps h X : X → Z and h Y : Y → Z that satisfy h X (f(a))=h Y (a) for all a in A.. In the case where A is a closed subspace of Y one can show that the map X → X ∪ f Y is a closed embedding and (Y − A) → X ∪ f Y is an open embedding.
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 ...
Geometric join of two line segments.The original spaces are shown in green and blue. The join is a three-dimensional solid, a disphenoid, in gray.. In topology, a field of mathematics, the join of two topological spaces and , often denoted by or , is a topological space formed by taking the disjoint union of the two spaces, and attaching line segments joining every point in to every point in .
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.
Two disjoint sets. In set theory in mathematics and formal logic, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set. [1] For example, {1, 2, 3} and {4, 5, 6} are disjoint sets, while {1, 2, 3} and {3, 4, 5} are not disjoint. A collection of two ...
View history; Tools. Tools. move to sidebar hide. Actions Read; ... Disjoint may refer to: ... Disjoint union; Disjoint-set data structure