Disjoint union
Summary
In mathematics, the disjoint union (or discriminated union) of the sets and is the set formed from the elements of and labelled (indexed) with the name of the set from which they come. So, an element belonging to both and appears twice in the disjoint union, with two different labels.
Further reading
- Wikipedia, page 188946, revision 1335705780, Disjoint union. adopted
About this page
| Tag | NMN1NEZS04 |
|---|---|
| URI | m2://NMN1NEZS04 |
| Aliases | disjoint-unions |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.