In mathematics, the reflexive closure of a binary relation
is the smallest reflexive relation on
A relation is called reflexive if it relates every element of
is a set of distinct numbers and
", then the reflexive closure of
The reflexive closure
In plain English, the reflexive closure of
with the identity relation on
is already reflexive by itself, so it does not differ from its reflexive closure.
However, if any of the reflexive pairs in
was absent, it would be inserted for the reflexive closure.
then the reflexive closure is
This programming language theory or type theory-related article is a stub.
You can help Wikipedia by expanding it.