Difference between revisions of "Reflexivity"
From Encyclopedia of Mathematics
(TeX) |
m (links) |
||
Line 1: | Line 1: | ||
{{TEX|done}} | {{TEX|done}} | ||
− | A property of binary relations. A [[Binary relation|binary relation]] $R$ on a set $A$ is called reflexive if $aRa$ for all $a\in A$. Examples of reflexive relations are equality, equivalence, order. | + | A property of binary relations. A [[Binary relation|binary relation]] $R$ on a set $A$ is called reflexive if $aRa$ for all $a\in A$. Examples of reflexive relations are equality (cf [[Equality axioms]]), [[equivalence relation]]s, [[Order (on a set)|order]]. |
Revision as of 19:46, 12 October 2014
A property of binary relations. A binary relation $R$ on a set $A$ is called reflexive if $aRa$ for all $a\in A$. Examples of reflexive relations are equality (cf Equality axioms), equivalence relations, order.
How to Cite This Entry:
Reflexivity. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Reflexivity&oldid=33591
Reflexivity. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Reflexivity&oldid=33591
This article was adapted from an original article by T.S. Fofanova (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article