Disjoint union/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (Parent: Set (mathematics), Set theory; Related: Coproduct, Union) |
No edit summary |
||
| Line 21: | Line 21: | ||
{{r|Coproduct}} | {{r|Coproduct}} | ||
{{r|Union}} | {{r|Union}} | ||
==Articles related by keyphrases (Bot populated)== | |||
{{r|Cartesian product}} | |||
{{r|Intersection}} | |||
{{r|Sir Michael Hardie Boys}} | |||
{{r|Union}} | |||
{{r|Finite set}} | |||
{{r|Schröder-Bernstein theorem}} | |||
Latest revision as of 17:00, 7 August 2024
- See also changes related to Disjoint union, or pages that link to Disjoint union or to this page or whose text contains "Disjoint union".
Parent topics
- Set (mathematics) [r]: Informally, any collection of distinct elements. [e]
- Set theory [r]: Mathematical theory that models collections of (mathematical) objects and studies their properties. [e]
Subtopics
- Coproduct [r]: Add brief definition or description
- Union [r]: The set of elements which are in at least one of a given family of sets. [e]
- Cartesian product [r]: The set of ordered pairs whose elements come from two given sets. [e]
- Intersection [r]: The set of elements that are contained in all of a given family of two or more sets. [e]
- Sir Michael Hardie Boys [r]: Add brief definition or description
- Union [r]: The set of elements which are in at least one of a given family of sets. [e]
- Finite set [r]: The number of its elements is a natural number (0,1,2,3,...) [e]
- Schröder-Bernstein theorem [r]: A classic theorem of set theory asserting that sets can be ordered by size. [e]