Equivalent Characterizations of Finer Equivalence Relation
Jump to navigation Jump to search
Let $X$ be a set.
Let $\equiv$ and $\sim$ be equivalence relations on $X$.
The following are equivalent:
- $\equiv$ is finer than $\sim$:
- $\forall x, y \in X : x \equiv y \implies x \sim y$
- The graph of $\equiv$ is contained in the graph of $\sim$.
- Every $\equiv$-equivalence class is contained in a $\sim$-equivalence class.
- Every $\sim$-equivalence class is saturated under $\equiv$.