A relation $R$ is an equivalence relation if it is reflexive, symmetric, and transitive.[1]
Footnotes
[1] Further Terminology: If instead $R$ is just symmetric and transitive, then it is called a partial equivalence relation.
Here's a breakdown of the differences between each PDF style:
| Style | Class | Font | Theorem Environments |
|---|---|---|---|
| Style 1 | book |
Alegreya Sans | tcbthm |
| Style 2 | book |
Alegreya Sans | amsthm |
| Style 3 | book |
Arno* | amsthm |
| Style 4 | book |
Computer Modern | amsthm |
*To be replaced with Linus Romer's Elemaints when it is released.
