Definition: A binary relation R for which there is no element a such that a R a.

See also reflexive, antisymmetric.

Note: The relation "less than" is irreflexive since no number is less than itself.

Author: PEB

More information

After Eric W. Weisstein's World of Mathematics entry irreflexive.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "irreflexive", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: