Antisymmetric relation

Transitive binary relations
Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric
Total,
Semiconnex
Anti-
reflexive
Equivalence relation Green tickY ✗ ✗ ✗ ✗ ✗ Green tickY ✗ ✗
Preorder (Quasiorder) ✗ ✗ ✗ ✗ ✗ ✗ Green tickY ✗ ✗
Partial order ✗ Green tickY ✗ ✗ ✗ ✗ Green tickY ✗ ✗
Total preorder ✗ ✗ Green tickY ✗ ✗ ✗ Green tickY ✗ ✗
Total order ✗ Green tickY Green tickY ✗ ✗ ✗ Green tickY ✗ ✗
Prewellordering ✗ ✗ Green tickY Green tickY ✗ ✗ Green tickY ✗ ✗
Well-quasi-ordering ✗ ✗ ✗ Green tickY ✗ ✗ Green tickY ✗ ✗
Well-ordering ✗ Green tickY Green tickY Green tickY ✗ ✗ Green tickY ✗ ✗
Lattice ✗ Green tickY ✗ ✗ Green tickY Green tickY Green tickY ✗ ✗
Join-semilattice ✗ Green tickY ✗ ✗ Green tickY ✗ Green tickY ✗ ✗
Meet-semilattice ✗ Green tickY ✗ ✗ ✗ Green tickY Green tickY ✗ ✗
Strict partial order ✗ Green tickY ✗ ✗ ✗ ✗ ✗ Green tickY Green tickY
Strict weak order ✗ Green tickY ✗ ✗ ✗ ✗ ✗ Green tickY Green tickY
Strict total order ✗ Green tickY Green tickY ✗ ✗ ✗ ✗ Green tickY Green tickY
Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric
Definitions,
for all and
Green tickY indicates that the column's property is always true for the row's term (at the very left), while ✗ indicates that the property is not guaranteed
in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric,
is indicated by Green tickY in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively.

All definitions tacitly require the homogeneous relation be transitive: for all if and then
A term's definition may require additional properties that are not listed in this table.

In mathematics, a binary relation on a set is antisymmetric if there is no pair of distinct elements of each of which is related by to the other. More formally, is antisymmetric precisely if for all

if with then must not hold,

or equivalently,

if and then .

The definition of antisymmetry says nothing about whether actually holds or not for any . An antisymmetric relation on a set may be reflexive (that is, for all ), irreflexive (that is, for no ), or neither reflexive nor irreflexive. A relation is asymmetric if and only if it is both antisymmetric and irreflexive.