Let be a set. We define the partition of a set (denoted ) such that it’s true that:
- The elements of are non-empty subsets of
- The union of the elements of is
- The intersection of any pair of elements of is empty
Let and .
Both of these sets form a partition of :
Let . This set has the partitions:
Those are just two instances of partitions of . It can have other partitions.