Reflexive relation
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, a binary relation R on a set X is reflexive if it relates every element of X to itself. 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.
In mathematics, a binary relation R on a set X is reflexive if it relates every element of X to itself. 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. The first explicit use of "reflexivity", that is, describing a relation as having the property that every element is related to itself, is generally attributed to Giuseppe Peano in his Arithmetices principia (1889), wherein he defines one of the fundamental properties of equality being a = a . The first use of the word reflexive in the sense of mathematics and logic was by Bertrand Russell in his Principles of Mathematics (1903). Equivalently, letting \operatorname{I}_X := \{ (x, x) ~:~ x \in X \} denote the identity relation on X , the relation R is reflexive if \operatorname{I}_X \subseteq R . The of R is the union R \cup \operatorname{I}_X, which can equivalently be defined as the smallest (with respect to \subseteq ) reflexive relation on X that is a superset of R. A relation R is reflexive if and only if it is equal to its reflexive closure. The or of R is the smallest (with respect to \subseteq ) relation on X that has the same reflexive closure as R. It is equal to R \setminus \operatorname{I}_X = \{ (x, y) \in R ~:~ x \neq y \}. The reflexive reduction of R can, in a sense, be seen as a construction that is the "opposite" of the reflexive closure of R. For example, the reflexive closure of the canonical strict inequality on the reals \mathbb{R} is the usual non-strict inequality \leq whereas the reflexive reduction of \leq is antisymmetric: if whenever x, y \in X are such that x R y \text{ and } y R x, then necessarily x = y. : if whenever x, y \in X are such that x R y, then necessarily x = y. A relation R is coreflexive if and only if its symmetric closure is anti-symmetric. A reflexive relation on a nonempty set X can neither be irreflexive, nor asymmetric ( R is called if x R y implies not y R x ), nor antitransitive ( R is if x R y \text{ and } y R z implies not x R z ).
Text derived from https://en.wikipedia.org/w/index.php?oldid=1368361737 under CC BY-SA 4.0; modifications have been made.