Reflexive relation

  (Redirected from Irreflexive relation)

In mathematics, a binary relation R on a set X is reflexive if it relates every element of 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.

DefinitionsEdit

Let   be a binary relation on a set  , which by definition is just a subset of   For any   the notation   means that   while "not  " means that  

The relation   is called reflexive if   for every   or equivalently, if   where   denotes the identity relation on   The reflexive closure of   is the union   which can equivalently be defined as the smallest (with respect to  ) reflexive relation on   that is a superset of   A relation   is reflexive if and only if it is equal to its reflexive closure.

The reflexive reduction or irreflexive kernel of   is the smallest (with respect to  ) relation on   that has the same reflexive closure as   It is equal to   The irreflexive kernel of   can, in a sense, be seen as a construction that is the "opposite" of the reflexive closure of   For example, the reflexive closure of the canonical strict inequality   on the reals   is the usual non-strict inequality   whereas the reflexive reduction of   is  

Related definitionsEdit

There are several definitions related to the reflexive property. The relation   is called:

Irreflexive or Anti-reflexive
If it does not relate any element to itself; that is, if not   for every   A relation is irreflexive if and only if its complement in   is reflexive. An asymmetric relation is necessarily irreflexive. A transitive and irreflexive relation is necessarily asymmetric.
Left quasi-reflexive
If whenever   are such that   then necessarily  [3]
Right quasi-reflexive
If whenever   are such that   then necessarily  
Quasi-reflexive
If every element that is related to some element is also related to itself. Explicitly, this means that whenever   are such that   then necessarily   and   Equivalently, a binary relation is quasi-reflexive if and only if it is both left quasi-reflexive and right quasi-reflexive. A relation   is quasi-reflexive if and only if its symmetric closure   is left (or right) quasi-reflexive.
Antisymmetric
If whenever   are such that   and   then necessarily  
Coreflexive
If whenever   are such that   then necessarily  [4] A relation   is coreflexive if and only if its symmetric closure is anti-symmetric.

A reflexive relation on a nonempty set   can neither be irreflexive, nor asymmetric (  is called asymmetric if   implies not  ), nor antitransitive (  is antitransitive if   and   implies not  ).

ExamplesEdit

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" (for the integers >1, since 1 is coprime to itself)
  • "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 ( ) 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 (i.e., neither all nor none are). For example, the binary relation "the product of   and   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   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 relationsEdit

The number of reflexive relations on an n-element set is 2n2n.[5]

Number of n-element binary relations of different types
Elem­ents Any Transitive Reflexive Preorder Partial order Total preorder Total order Equivalence relation
0 1 1 1 1 1 1 1 1
1 2 2 1 1 1 1 1 1
2 16 13 4 4 3 3 2 2
3 512 171 64 29 19 13 6 5
4 65,536 3,994 4,096 355 219 75 24 15
n 2n2 2n2n n
k=0
 
k! S(n, k)
n! n
k=0
 
S(n, k)
OEIS A002416 A006905 A053763 A000798 A001035 A000670 A000142 A000110

Philosophical logicEdit

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.[6][7]

NotesEdit

  1. ^ Levy 1979:74
  2. ^ Relational Mathematics, 2010
  3. ^ The Encyclopedia Britannica calls this property quasi-reflexivity.
  4. ^ Fonseca de Oliveira, J. N., & Pereira Cunha Rodrigues, C. D. J. (2004). Transposing Relations: From Maybe Functions to Hash Tables. In Mathematics of Program Construction (p. 337).
  5. ^ On-Line Encyclopedia of Integer Sequences A053763
  6. ^ Alan Hausman; Howard Kahane; Paul Tidman (2013). Logic and Philosophy — A Modern Introduction. Wadsworth. ISBN 1-133-05000-X. Here: p.327-328
  7. ^ D.S. Clarke; Richard Behling (1998). Deductive Logic — An Introduction to Evaluation Techniques and Logical Theory. University Press of America. ISBN 0-7618-0922-8. Here: p.187

ReferencesEdit

External linksEdit