disjoint union
The 'disjoint union' is a mathematical concept used to combine sets or graphs while preserving their distinct identities.
🇺🇸 US Voice:
🇬🇧 UK Voice:
Definition
C1Set Theory
(technical, academic)A combination of sets where elements are tagged with their original set to ensure no overlap.
Example
- In the disjoint union of sets A and B, each element from A and B is labeled to maintain their distinct identities.
C1Graph Theory
(technical, academic)A combination of graphs where vertices and edges are labeled to ensure they remain distinct.
Example
- The disjoint union of graphs G and H results in a new graph where G and H are distinct components.
C2Category Theory
(technical, academic)A coproduct in the category of sets where each element is tagged with its originating set.
Example
- The disjoint union in category theory ensures each element is traceable to its source set.
Similar
Terms that have similar or relatively close meanings to "disjoint union":