A [[Binary Relation]] $\sim$ on a [[Set|set]] $X$ is considered to have the [[Reflexive Property]] if [[Universal Quantifier|for any]] $a\in X$, the relation holds for $a$ with itself. $\huge a \sim a $ Or in other words, for a binary relation $R$ on a set $X$, any [[Ordered Pairs|Ordered Pair]] $(a,a)$ with $a\in X$ must exist in $R$. $ \huge \forall a\in X; (a,a) \in R $