Transitive binary relations
Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Total, Semiconnex Anti- reflexive Equivalence relation Y ✗ ✗ ✗ ✗ ✗ Y ✗ ✗ Preorder (Quasiorder) ✗ ✗ ✗ ✗ ✗ ✗ Y ✗ ✗ Partial order ✗ Y ✗ ✗ ✗ ✗ Y ✗ ✗ Total preorder ✗ ✗ Y ✗ ✗ ✗ Y ✗ ✗ Total order ✗ Y Y ✗ ✗ ✗ Y ✗ ✗ Prewellordering ✗ ✗ Y Y ✗ ✗ Y ✗ ✗ Well-quasi-ordering ✗ ✗ ✗ Y ✗ ✗ Y ✗ ✗ Well-ordering ✗ Y Y Y ✗ ✗ Y ✗ ✗ Lattice ✗ Y ✗ ✗ Y Y Y ✗ ✗ Join-semilattice ✗ Y ✗ ✗ Y ✗ Y ✗ ✗ Meet-semilattice ✗ Y ✗ ✗ ✗ Y Y ✗ ✗ Strict partial order ✗ Y ✗ ✗ ✗ ✗ ✗ Y Y Strict weak order ✗ Y ✗ ✗ ✗ ✗ ✗ Y Y Strict total order ✗ Y Y ✗ ✗ ✗ ✗ Y Y Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Definitions, for all ${\displaystyle a,b}$ and ${\displaystyle S\neq \varnothing$ :} ${\displaystyle {\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}}$ ${\displaystyle {\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}}$ ${\displaystyle {\begin{aligned}\min S\\{\text{exists}}\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}}$ ${\displaystyle aRa}$ ${\displaystyle {\text{not }}aRa}$ ${\displaystyle {\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}}$
Y indicates that the column's property is always true 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 Y in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively. All definitions tacitly require the homogeneous relation ${\displaystyle R}$ be transitive: for all ${\displaystyle a,b,c,}$ if ${\displaystyle aRb}$ and ${\displaystyle bRc}$ then ${\displaystyle aRc.}$ A term's definition may require additional properties that are not listed in this table.

In mathematics, a binary relation ${\displaystyle R}$ on a set ${\displaystyle X}$ is reflexive if it relates every element of ${\displaystyle X}$ to itself.^[1][2]

An example of a reflexive relation is the relation "is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to possess reflexivity. Along with symmetry and transitivity, reflexivity is one of three properties defining equivalence relations.

Definitions

Let ${\displaystyle R}$ be a binary relation on a set ${\displaystyle X,}$ which by definition is just a subset of ${\displaystyle X\times X.}$ For any ${\displaystyle x,y\in X,}$ the notation ${\displaystyle xRy}$ means that ${\displaystyle (x,y)\in R}$ while "not ${\displaystyle xRy}$" means that ${\displaystyle (x,y)\not \in R.}$

The relation ${\displaystyle R}$ is called reflexive if ${\displaystyle xRx}$ for every ${\displaystyle x\in X}$ or equivalently, if ${\displaystyle \operatorname {I} _{X}\subseteq R}$ where ${\displaystyle \operatorname {I} _{X}:=\{(x,x)~:~x\in X\}}$ denotes the identity relation on ${\displaystyle X.}$ The reflexive closure of ${\displaystyle R}$ is the union ${\displaystyle R\cup \operatorname {I} _{X},}$ which can equivalently be defined as the smallest (with respect to ${\displaystyle \subseteq }$) reflexive relation on ${\displaystyle X}$ that is a superset of ${\displaystyle R.}$ A relation ${\displaystyle R}$ is reflexive if and only if it is equal to its reflexive closure.

The reflexive reduction or irreflexive kernel of ${\displaystyle R}$ is the smallest (with respect to ${\displaystyle \subseteq }$) relation on ${\displaystyle X}$ that has the same reflexive closure as ${\displaystyle R.}$ It is equal to ${\displaystyle R\setminus \operatorname {I} _{X}=\{(x,y)\in R~:~x\neq y\}.}$ The reflexive reduction of ${\displaystyle R}$ can, in a sense, be seen as a construction that is the "opposite" of the reflexive closure of ${\displaystyle R.}$ For example, the reflexive closure of the canonical strict inequality ${\displaystyle <}$ on the reals ${\displaystyle \mathbb {R} }$ is the usual non-strict inequality ${\displaystyle \leq }$ whereas the reflexive reduction of ${\displaystyle \leq }$ is ${\displaystyle <.}$

Examples

Examples of reflexive relations include:

• "is equal to" (equality)
• "is a subset of" (set inclusion)
• "divides" (divisibility)
• "is greater than or equal to"
• "is less than or equal to"

Examples of irreflexive relations include:

• "is not equal to"
• "is coprime to" on the integers larger than 1
• "is a proper subset of"
• "is greater than"
• "is less than"

An example of an irreflexive relation, which means that it does not relate any element to itself, is the "greater than" relation (${\displaystyle x>y}$) on the real numbers. Not every relation which is not reflexive is irreflexive; it is possible to define relations where some elements are related to themselves but others are not (that is, neither all nor none are). For example, the binary relation "the product of ${\displaystyle x}$ and ${\displaystyle y}$ is even" is reflexive on the set of even numbers, irreflexive on the set of odd numbers, and neither reflexive nor irreflexive on the set of natural numbers.

An example of a quasi-reflexive relation ${\displaystyle R}$ is "has the same limit as" on the set of sequences of real numbers: not every sequence has a limit, and thus the relation is not reflexive, but if a sequence has the same limit as some sequence, then it has the same limit as itself. An example of a left quasi-reflexive relation is a left Euclidean relation, which is always left quasi-reflexive but not necessarily right quasi-reflexive, and thus not necessarily quasi-reflexive.

An example of a coreflexive relation is the relation on integers in which each odd number is related to itself and there are no other relations. The equality relation is the only example of a both reflexive and coreflexive relation, and any coreflexive relation is a subset of the identity relation. The union of a coreflexive relation and a transitive relation on the same set is always transitive.

Number of reflexive relations

The number of reflexive relations on an ${\displaystyle n}$-element set is ${\displaystyle 2^{n^{2}-n}.}$^[6]

Note that S(n, k) refers to Stirling numbers of the second kind.

Philosophical logic

Authors in philosophical logic often use different terminology. Reflexive relations in the mathematical sense are called totally reflexive in philosophical logic, and quasi-reflexive relations are called reflexive.^[7][8]

Notes

References

External links

• "Reflexivity", Encyclopedia of Mathematics, EMS Press, 2001 [1994]