\(
\newcommand{\water}{{\rm H_{2}O}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\N}{\mathbb{N}}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\Q}{\mathbb{Q}}
\newcommand{\E}{\mathbb{E}}
\newcommand{\d}{\mathop{}\!\mathrm{d}}
\newcommand{\grad}{\nabla}
\newcommand{\T}{^\text{T}}
\newcommand{\mathbbone}{\unicode{x1D7D9}}
\renewcommand{\:}{\enspace}
\DeclareMathOperator*{\argmax}{arg\,max}
\DeclareMathOperator*{\argmin}{arg\,min}
\DeclareMathOperator{\Tr}{Tr}
\newcommand{\norm}[1]{\lVert #1\rVert}
\newcommand{\KL}[2]{ \text{KL}\left(\left.\rule{0pt}{10pt} #1 \; \right\| \; #2 \right) }
\newcommand{\slashfrac}[2]{\left.#1\middle/#2\right.}
\)
To partition a set means to cut it into disjoint pieces.
Formally, a partition of a set \(\; \mathcal{S} \;\) is a set of subsets such that:
-
No subset \(\; S \;\) is empty.
-
All subsets are disjoint.
-
The union of all subsets recovers \(\; \mathcal{S} \;\).