Set membership
Membership relation
Set membership
set elements
set members
subset relation
set inclusion
set containment
subset
superset
set equality
proper subset
proper superset
If A = {2, 3, 4} and B = {3, 4, 5, 6}, then: A β© B = {3, 4} and A βͺ B = {2, 3, 4, 5, 6}. We can say that (A β© B) β (A βͺ B). If A = {4, 5, 6, 7} and B = {3, 4, 5, 6, 7, 8}, then A β B. If A = {4, 5, 6, 7} and B = {4, 5, 6, 7}, then A β B.
Subset
Set inclusion, a binary relation derived from membership relation, is a binary relation between two sets. The relation "is included in", also called subset relation, is denoted by the symbol .
If all members of set are also members of set , then is a subset of , denoted . Equivalently, is a superset of , denoted .
The relationship of one set being a subset of another is called inclusion or sometimes containment.
The subset relation defines a partial order on sets. The algebra of subsets forms a Boolean algebra in which the subset relation is called inclusion.
The definition for subset also means that any set is a subset (or superset) of itself.
Any set, , is a subset of itself,
This also gives us the definition of set equality: two sets are equal if they containt precisely the same elements, that is, if they are each other's subsets:
Sets and are equal if and .
If set contains the same elements as set , but also additional ones, then is a proper subset of , denoted as .
is a proper subset of if and only if is a subset of , but .
Set membership is not set inclusion: note that are elements of the set , but not its subsets, i.e. .
On the other hand, subsets, such as , are not elements of the set , but (some of) its subsets, e.g. .
Notations
Last updated
Was this helpful?