"The empty relation is reflexive because there is nothing in it to violate reflexivity."

This sounds like the same kind of reasoning that makes the empty relation symmetric and transitive. And for those two, the reasoning is actually correct — no pair exists to check, so the implication that defines each property is vacuously satisfied. Symmetry and transitivity are both "if… then…" statements, and an implication with a false premise is automatically true.

Reflexivity is not built that way.

Read the definition carefully

Reflexive

A relation R on a set A is reflexive if for every a \in A, the pair (a, a) is in R.

This is a "for every" statement, not an "if… then…" statement. It does not say "if a is in R somehow, then (a, a) must be in R." It says: look at every element of A, and the diagonal pair (a, a) had better be in R.

So reflexivity asks a positive question about R: does R contain every diagonal pair? The empty relation contains no diagonal pairs at all. If A is non-empty, the answer is no.

Why: symmetry and transitivity are defined as implications P \Rightarrow Q. If R is empty, the premise P ("some pair is in R") fails, and the whole implication is vacuously true. Reflexivity is defined as a flat universal claim \forall a \in A, (a, a) \in R. There is no premise to make false — the empty relation simply fails to contain any of the pairs the universal quantifier is demanding.

Two cases

Case 1: A is non-empty. Pick any element a \in A. Reflexivity demands (a, a) \in R. But R = \varnothing contains no pair at all, so (a, a) \notin R. Reflexivity fails.

Case 2: A is empty. There are no elements a \in A to check, so the "for every" statement is vacuously satisfied. Reflexivity holds (trivially, because the quantifier ranges over nothing). In this edge case, the empty relation is reflexive — but only because both the relation and the set are empty.

A picture of the failure

Grid of empty relation on a 3-element set showing three missing diagonal cellsA 3 by 3 grid with rows and columns labelled 1, 2, 3. All nine cells are empty. The three diagonal cells (1,1), (2,2), (3,3) are highlighted in a soft red tint with a note saying missing diagonal pair for each. A caption explains that reflexivity requires all three diagonal pairs to be filled. b → a ↓ 1 2 3 1 2 3 missing missing missing R = ∅ on {1,2,3}: all 3 diagonal pairs missing
The empty relation on $A = \{1, 2, 3\}$. All nine cells are empty, including the three diagonal cells (highlighted). Reflexivity requires every diagonal cell to be filled; here none of them are. The relation fails reflexivity at every element of $A$, and in fact is **irreflexive** — the strongest possible form of non-reflexivity.

Contrast with symmetric and transitive

Symmetric and transitive both have the form: "for every pair (or pairs) already in R, some consequence must hold." If there is no such pair to start with, the consequence is vacuously satisfied.

Reflexive is not about pairs already in R — it is about pairs that must be in R. The "must be" is the universal quantifier over elements of A. Vacuous reasoning does not help: there is a quantifier with real content to satisfy, and the empty relation fails it.

Property Logical form Empty relation on non-empty A?
Symmetric (a, b) \in R \Rightarrow (b, a) \in R Holds — vacuously
Transitive (a, b), (b, c) \in R \Rightarrow (a, c) \in R Holds — vacuously
Reflexive for every a \in A: (a, a) \in R Fails — diagonal pairs are missing
Antisymmetric (a, b), (b, a) \in R \Rightarrow a = b Holds — vacuously

The empty relation on a non-empty set is symmetric, transitive, antisymmetric, and not reflexive. It is also not irreflexive-failing — in fact it is irreflexive: no element is related to itself.

Why this matters: symmetric + transitive ≠ equivalence

There is a famous trap where students argue "symmetric + transitive implies reflexive" and cite the empty relation as the trap-busting counter-example (see Symmetric + Transitive Does Not Imply Reflexive). The whole counter-example rests on the fact that the empty relation is not reflexive on a non-empty set. If you mistakenly call the empty relation reflexive, you lose the counter-example, and you walk into the trap.

Interactive: vacuous vs positive

Slider explaining which properties the empty relation satisfiesA horizontal track with a draggable red point. The readout lists whether symmetric, transitive, antisymmetric, and reflexive hold for the empty relation depending on whether the underlying set is empty or non-empty. A = ∅ A ≠ ∅ drag to toggle empty/non-empty A
The empty relation behaves the same way for symmetric, transitive, antisymmetric regardless of whether $A$ is empty or not — all three are vacuously true. Reflexivity is the outlier: it fails unless $A$ is itself empty. The slider makes the one difference visible.

One-line take-away

The empty relation is reflexive only when the underlying set A is also empty. On any non-empty A, reflexivity requires the diagonal pairs to be present, and an empty relation has no pairs at all. "There is nothing to violate" is the wrong reasoning for a property that demands something positive.

Related: Relations · Symmetric + Transitive Does Not Imply Reflexive · Reflexivity Tester: Missing Self-Loops Glow Red · How to Check Reflexivity on an Infinite Set