What is the reflexive closure of the empty relation ∅ over a set A?

Question

What is the reflexive closure of the empty relation ∅ over a set A?

I understand that R is reflexive if A=∅, and isn't if A is nonempty. But what about the reflexive closure of R?

Answer 1

The reflexive closure of some relation $R$ over $A$ is the smallest subset of $A\times A$ that (a) contains $R$ and (b) is reflexive.

In this case $R$ is the empty set, so every subset of $A\times A$ satisfies condition (a). We're left with looking for the smallest subset of $A\times A$ that is a reflexive relation on $A$.

This smallest subset is evidently $\{ \langle a,a\rangle \mid a\in A \}$.

Answer 2

I think you should specify the set on which you define the empty relation. Suppose A,B are two sets where A is empty and B is non-empty.Define the empty relation $ R_1$ (respectively $R_2$) on A (respectively on B). Since for every x∈A,(x,x)∈$R_1$, $R_1$ is reflexive. Since there exists x∈B (you can choose any x in B) such that (x,x)∉$R_2$, $R_2$ is not reflexive. The reflexive closure of $R_2$ is $R_2$∪$I_B$ where $I_B$ is the identity relation on B. Hence an empty relation on an empty set and an empty relation on a non-empty set are different.