Reflexive closure
In mathematics, the reflexive closure of a binary relation R on a set X is the smallest reflexive relation on X that contains R.
For example, if X is a set of distinct numbers and x R y means "x is less than y", then the reflexive closure of R is the relation "x is less than or equal to y".
Definition
The reflexive closure S of a relation R on a set X is given by
In English, the reflexive closure of R is the union of R with the identity relation on X.
Example
As an example, if
then the relation is already reflexive by itself, so it doesn't differ from its reflexive closure.
However, if any of the pairs in was absent, it would be inserted for the reflexive closure. For example, if
then reflexive closure is, by the definition of a reflexive closure:
- .
gollark: I always hate it when that happens and I have to reconstruct the proof by iterating through all possible statements.
gollark: Great!
gollark: I write with an uncountably infinite number of appendices. It's likely that *one* will contain the proof, though I haven't proved it.
gollark: You know, for purposes.
gollark: They also ensure appropriate citation.
See also
References
- Franz Baader and Tobias Nipkow, Term Rewriting and All That, Cambridge University Press, 1998, p. 8
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.