Partition
A way to break a set into disjoint nonempty blocks that cover it.
Partition
A partition of a set is a set of subsets of (called blocks or parts) such that:
- (Nonempty blocks) For every , one has .
- (Pairwise disjoint) For all , if then .
- (Covers ) .
Partitions are in bijective correspondence with equivalence relations : an equivalence relation yields a partition by its equivalence classes , and a partition yields an equivalence relation by declaring two elements equivalent exactly when they lie in the same block.
Examples:
- is a partition of .
- The set of residue classes modulo forms a partition of .