Rel, bicategory of relations, allegory
left and right euclidean;
extensional, well-founded relations.
A (binary) relation $\sim$ on a set $A$ is symmetric if any two elements that are related in one order are also related in the other order:
In the language of the $2$-poset-with-duals Rel of sets and relations, a relation $R: A \to A$ is symmetric if it is contained in its reverse:
In that case, this containment is in fact an equality.
A set with a symmetric relation is the same as a loop digraph $(V, E, s:E \to V, t:E \to V)$ with a function $sym:E \to E$ such that
symmetric relation
Last revised on September 22, 2022 at 18:42:01. See the history of this page for a list of all contributions to it.