What Are Reflexive Relations?
A reflexive relation is a relation on a set in which every element is related to itself. Written formally, a relation $R$ on a set $A$ is reflexive when $(a,a) \in R$ for every element $a \in A$. The word to hold onto is every: the self-pair has to be present for each element, not just for one or two of them.
A quick reminder of the setup. A relation on a set $A$ is any collection of ordered pairs drawn from $A$, and each pair $(a,b)$ records that $a$ is related to $b$. The pairs of the form $(a,a)$, where an element is paired with itself, are the ones reflexivity cares about. Everything else in the relation is free.
Take the set $A = {1, 2, 3}$. For a relation on $A$ to be reflexive, it must contain all three self-pairs:
$$(1,1), \quad (2,2), \quad (3,3)$$
These three pairs are the non-negotiable part. A relation can carry any of the other pairs it likes, such as $(1,2)$ or $(3,1)$, and still be reflexive, as long as the three self-pairs are all there. Miss even one, and the relation stops being reflexive. For the wider family this belongs to, see types of relations.
How Do You Check If A Relation Is Reflexive?
List the elements of the set, then confirm that the self-pair $(a,a)$ appears for each one. If every element has its self-pair, the relation is reflexive. If a single one is missing, it is not.
Work it on $A = {1, 2, 3}$ with two relations.
Example 1: Test $R_1 = {(1,1), (2,2), (3,3), (1,2)}$.
Check each element in turn:
$1$: is $(1,1) \in R_1$? Yes.
$2$: is $(2,2) \in R_1$? Yes.
$3$: is $(3,3) \in R_1$? Yes.
All three self-pairs are present, so $R_1$ is reflexive. The extra pair $(1,2)$ does not change that.
Example 2: Test $R_2 = {(1,1), (2,2), (1,3), (3,1)}$.
Check each element:
$1$: is $(1,1) \in R_2$? Yes.
$2$: is $(2,2) \in R_2$? Yes.
$3$: is $(3,3) \in R_2$? No.
The self-pair $(3,3)$ is missing, so $R_2$ is not reflexive. Final answer: one absent self-pair is enough to break reflexivity.
There is a clean way to see this at a glance. Draw the elements as dots and draw an arrow from each element to whatever it relates to. A relation is reflexive exactly when every dot has a small arrow looping back to itself, called a self-loop. Write the same relation as a grid of $0$s and $1$s, with a $1$ in row $a$, column $b$ when $(a,b)$ is in the relation, and reflexivity becomes the rule that the whole main diagonal is filled with $1$s.
How Many Reflexive Relations Are There On A Set?
On a set with $n$ elements, the number of reflexive relations is $2^{n^2 - n}$. Here is where that formula comes from, and it is short.
A relation on an $n$-element set is a choice of which ordered pairs to include, out of all $n^2$ possible pairs. For a reflexive relation, the $n$ self-pairs $(a,a)$ are forced in, so there is no choice about those. That leaves $n^2 - n$ off-diagonal pairs, and each one is an independent yes-or-no decision: in the relation, or out.
$$\text{Number of reflexive relations} = 2^{n^2 - n}$$
Two independent choices give $2 \times 2 = 4$ outcomes, three give $2^3 = 8$, and $n^2 - n$ of them give $2^{n^2 - n}$. Put a few sizes side by side.
Table: Count of reflexive relations for small set sizes, from the formula $2^{n^2 - n}$.
Set size $n$ | Off-diagonal pairs $n^2 - n$ | Reflexive relations $2^{n^2 - n}$ |
|---|---|---|
$1$ | $0$ | $2^{0} = 1$ |
$2$ | $2$ | $2^{2} = 4$ |
$3$ | $6$ | $2^{6} = 64$ |
$4$ | $12$ | $2^{12} = 4096$ |
The jump from $64$ to $4096$ between a three-element and a four-element set shows how fast the count grows. The self-pairs stay fixed; all the growth lives in the off-diagonal pairs.
What Are Some Examples Of Reflexive Relations?
Many of the most familiar comparisons in math are reflexive, because they hold trivially when you compare something with itself. A few are not, and those are worth seeing side by side.
Table: Everyday relations sorted by whether each element relates to itself.
Relation | On the set of | Reflexive? | Why |
|---|---|---|---|
Is equal to $(=)$ | Real numbers | Yes | $a = a$ for every number |
Less than or equal to $(\leq)$ | Real numbers | Yes | $a \leq a$ is always true |
Divides $(a \mid a)$ | Positive integers | Yes | every number divides itself |
Is a subset of $(\subseteq)$ | Any collection of sets | Yes | every set is a subset of itself |
Strictly less than $(<)$ | Real numbers | No | $a < a$ is never true |
Is a sibling of | People | No | nobody is their own sibling |
The pattern is worth naming. Relations built from equal-or-something ($=$, $\leq$, $\geq$, $\subseteq$) tend to be reflexive, because the "equal" part covers the self-comparison. Strict relations ($<$, $>$, "is a sibling of," "is the parent of") tend not to be, because they rule out the element itself. The smallest reflexive relation of all is the diagonal relation, which contains the self-pairs and nothing else: on $A = {1,2,3}$ that is ${(1,1),(2,2),(3,3)}$.
What Is The Difference Between Reflexive And Irreflexive Relations?
A relation is irreflexive when no element is related to itself, so $(a,a) \notin R$ for every $a$. This is the exact opposite end from reflexive, and here is the trap: irreflexive is not the same as "not reflexive." A relation can fail to be reflexive without being irreflexive.
Three buckets, not two:
Reflexive: every element has its self-pair. On ${1,2,3}$, the relation ${(1,1),(2,2),(3,3)}$ qualifies.
Irreflexive: no element has its self-pair. Strict "less than" $(<)$ qualifies, since $a < a$ is never true.
Neither: some self-pairs present, some missing. On ${1,2,3}$, the relation ${(1,1)}$ is neither, because $1$ relates to itself but $2$ and $3$ do not.
That middle-and-third split is where marks are lost. "Not reflexive" only tells you at least one self-pair is missing. "Irreflexive" is a much stronger claim, that they are all missing. A relation between those two states, with some self-pairs and not others, is neither reflexive nor irreflexive.
Why Do Reflexive Relations Matter?
Reflexivity looks almost too obvious to bother naming. Its importance shows up the moment you ask which relations behave like equality, because "behaving like equality" is what lets you sort a set into clean, non-overlapping groups.
It is one of the three pillars of an equivalence relation. A relation that is reflexive, symmetric, and transitive together is called an equivalence relation, and equivalence relations are how mathematics captures "same in some way." Same remainder when divided by 5, same shape, same day of the week: each is an equivalence relation, and each needs reflexivity to work.
It guarantees nothing gets left out. Reflexivity forces every element to relate to itself, which means every element lands inside its own group. Without it, an element could belong to no group at all, and the tidy split of a set into non-overlapping classes would fall apart.
It is the base case for building bigger structures. Orderings such as $\leq$ and $\subseteq$ start from reflexivity and add antisymmetry and transitivity. Reflexivity is the quiet first requirement that the more famous properties are stacked on top of.
So the property earns its name not on its own, but as the foundation the useful relations are built from. When a relation sorts a set into groups where every member has a home, reflexivity is doing the first piece of that work. For how relations connect to the wider topic, see relations and functions.
Who Discovered The Logic Of Relations?
For over two thousand years, the reflexive property had nowhere to live. Classical logic, inherited from Aristotle, was built around statements like "all men are mortal" and could not properly handle relational reasoning, the kind that says "if $a$ equals $b$ and $b$ equals $c$, then $a$ equals $c$." The mathematics of relations, where reflexivity, symmetry, and transitivity became named properties, arrived only in the nineteenth century.
Two mathematicians carried the idea forward:
Charles Sanders Peirce (1839–1914, United States) built an algebraic calculus of relations, introducing notation for composing and inverting relations and classifying their structural properties. Much of his work went unrecognised in his lifetime, and he is now counted among the most original logicians the country produced.
Ernst Schröder (1841–1902, Germany) systematised the algebra of relations across his multi-volume work on logic, turning De Morgan's and Peirce's ideas into the organised theory that later fed into modern set theory.
Where Are Reflexive Relations Used In The Real World?
The property is quiet, but it sits under a surprising amount of everyday computing and reasoning.
Databases and access control: a permission rule where every user can read their own records is a reflexive relation on the set of users, and systems often add these self-links by default.
Spreadsheets and dependency graphs: a cell trivially depends on itself; software that tracks "depends on" often treats the relation as reflexive so nothing is accidentally dropped from a recalculation.
Sorting and ranking: any ordering that allows ties, like "ranks the same as or higher than," is reflexive, which is why $\leq$ rather than $<$ is the natural tool for putting a list in order.
Clustering and classification: grouping data by "is similar to, counting a point as similar to itself" relies on reflexivity so that every data point belongs to at least its own cluster.
Equality checking in programming: a well-behaved equality test must return true when an object is compared with itself, which is exactly the reflexive requirement.
One small property, "each thing relates to itself," turns up in permission systems, spreadsheets, ranking, and machine learning. Mathematics keeps reusing its simplest ideas in the places you would least expect them.
What Are The Most Common Reflexive Relations Mistakes?
These three errors account for most of the lost marks on reflexivity, and each traces back to reading the definition too quickly.
Thinking one self-pair is enough.
Where it slips in:
A student checks that some element has its self-pair, sees a $(a,a)$ sitting in the relation, and declares the whole relation reflexive.
Don't do this:
Do not stop after finding a single self-pair. One present self-pair says nothing about the others.
The correct way:
Confirm $(a,a)$ for every element of the set. On ${1,2,3}$ that means checking $(1,1)$, $(2,2)$, and $(3,3)$; a single missing self-pair breaks reflexivity.
Confusing reflexive with symmetric.
Where it slips in:
A student mixes "every element relates to itself" with "if $a$ relates to $b$ then $b$ relates to $a$," and starts checking mirrored pairs when testing reflexivity.
Don't do this:
Do not look at off-diagonal pairs $(a,b)$ and $(b,a)$ when the question is about reflexivity. That is a symmetry check, a different property.
The correct way:
For reflexivity, look only at the self-pairs $(a,a)$ on the diagonal. Symmetry is about the off-diagonal mirror; keep the two tests separate.
Treating "not reflexive" as "irreflexive."
Where it slips in:
A relation is found to be missing some self-pair, and the student labels it irreflexive, as if that were the automatic opposite.
Don't do this:
Do not assume the opposite of reflexive is irreflexive. Missing some self-pairs is not the same as missing all of them.
The correct way:
Use three buckets. Irreflexive means no element relates to itself; a relation like ${(1,1)}$ on ${1,2,3}$ is neither reflexive nor irreflexive.
Practice Problems On Reflexive Relations
Use $A = {1, 2, 3}$ unless a problem says otherwise. Answers follow each line.
Is $R = {(1,1),(2,2),(3,3),(2,3)}$ reflexive?
(Answer: Yes. All three self-pairs are present; the extra $(2,3)$ does not matter.)Is $R = {(1,1),(2,2),(1,3),(3,1)}$ reflexive?
(Answer: No. The self-pair $(3,3)$ is missing.)How many reflexive relations exist on a set of $4$ elements?
(Answer: $2^{4^2 - 4} = 2^{12} = 4096$.)Is "greater than or equal to" $(\geq)$ on the integers reflexive?
(Answer: Yes, because $a \geq a$ holds for every integer.)Classify $R = {(1,1)}$ on $A$ as reflexive, irreflexive, or neither.
(Answer: Neither. It contains $(1,1)$ so it is not irreflexive, and it is missing $(2,2)$ and $(3,3)$ so it is not reflexive.)What is the fewest pairs you must add to $R = {(1,2),(2,3)}$ to make it reflexive on $A$?
(Answer: Add the three self-pairs $(1,1)$, $(2,2)$, $(3,3)$.)
Where Should You Go Next After Reflexive Relations?
Reflexivity is one piece of a larger map, and a few natural doors open from here.
Types of relations. See where reflexive sits among symmetric, transitive, and the other relation types, and how they combine.
Relations and functions. Step back to the parent topic and see how a relation becomes a function once each input has exactly one output.
The reflexive property. Look at reflexivity as it appears in equality and geometry proofs, where $a = a$ justifies a shared side or angle.
Symmetric relations, transitive relations, and equivalence relations are the natural next three, since a relation that is reflexive, symmetric, and transitive is what mathematicians call an equivalence relation. If your child is building these foundations, a live Bhanzu trainer teaches relations starting from the "why" behind each property in the Bhanzu algebra program.
Was this article helpful?
Your feedback helps us write better content