Difference between revisions of "Subset"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In mathematics, especially in set theory, a set A is a '''subset''' of a set B, or equivalently B is a superset of A, if A is "contained" inside...") |
Karl Jones (Talk | contribs) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 5: | Line 5: | ||
The relationship of one set being a subset of another is called inclusion or sometimes containment. | The relationship of one set being a subset of another is called inclusion or sometimes containment. | ||
| − | The subset relation defines a [[ | + | The subset relation defines a [[partially ordered set]]. |
The [[algebra structure]] of subsets forms a [[Boolean algebra]] in which the subset relation is called [[Inclusion (Boolean algebra)|inclusion]]. | The [[algebra structure]] of subsets forms a [[Boolean algebra]] in which the subset relation is called [[Inclusion (Boolean algebra)|inclusion]]. | ||
| Line 12: | Line 12: | ||
* [[Containment order]] | * [[Containment order]] | ||
| − | * [[ | + | * [[Partially ordered set]] |
* [[Set (mathematics)]] | * [[Set (mathematics)]] | ||
Latest revision as of 09:20, 17 September 2016
In mathematics, especially in set theory, a set A is a subset of a set B, or equivalently B is a superset of A, if A is "contained" inside B, that is, all elements of A are also elements of B.
A and B may coincide.
The relationship of one set being a subset of another is called inclusion or sometimes containment.
The subset relation defines a partially ordered set.
The algebra structure of subsets forms a Boolean algebra in which the subset relation is called inclusion.
See also
External links
- Subset @ Wikipedia.org
