Combinatorics and Graph Theory · Problem 1.4.1

Fundamentals — David Guichard

Mathematics — Combinatorics · partitions-equivalence-relations

Problem

Show that if

\{A_1, A_2, \ldots, A_k\}

is a partition of

\{1, 2, \ldots, n\}

, then there is a unique equivalence relation

\equiv

whose equivalence classes are

\{A_1, A_2, \ldots, A_k\}