Partition

A way to break a set into disjoint nonempty blocks that cover it.
Partition

A partition of a set XX is a set P\mathcal{P} of subsets of XX (called blocks or parts) such that:

  1. (Nonempty blocks) For every BPB\in\mathcal{P}, one has BB\neq\varnothing.
  2. (Pairwise disjoint) For all B,CPB,C\in\mathcal{P}, if BCB\neq C then BC=B\cap C=\varnothing.
  3. (Covers XX) BPB=X\bigcup_{B\in\mathcal{P}} B = X.

Partitions are in bijective correspondence with : an equivalence relation yields a partition by its , and a partition yields an equivalence relation by declaring two elements equivalent exactly when they lie in the same block.

Examples:

  • {{1,3},{2},{4}}\bigl\{\{1,3\},\{2\},\{4\}\bigr\} is a partition of {1,2,3,4}\{1,2,3,4\}.
  • The set of residue classes modulo nn forms a partition of Z\mathbb{Z}.