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 pseudocode, union by rank is: function Union(x, y) is // Replace nodes by roots x := Find(x) y := Find(y) if x = y then return // x and y are already in the same set end if // If necessary, rename variables to ensure that // x has rank at least as large as that of y if x.rank < y.rank then (x, y) := (y, x) end if // Make x the new root y ...
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 ...
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 ...
The pushout of f and g is the disjoint union of X and Y, where elements sharing a common preimage (in Z) are identified, together with the morphisms i 1, i 2 from X and Y, i.e. = / where ~ is the finest equivalence relation (cf. also this) such that f(z) ~ g(z) for all z in Z.
The 2-regular graphs are the disjoint unions of cycle graphs. [4] More generally, every graph is the disjoint union of connected graphs, its connected components. The cographs are the graphs that can be constructed from single-vertex graphs by a combination of disjoint union and complement operations. [5]
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".