The reflexive closure of a binary relation is , where . Every reflexive relation containing must contain the diagonal, so this is the least such extension.
Articles by others on the same topic
Reflexive closure of a relation is a concept in mathematics, specifically in the field of graph theory and set theory. Given a relation \( R \) defined on a set \( A \), the reflexive closure of \( R \) is created by ensuring that every element in \( A \) is related to itself, while preserving the original relations of \( R \).