What Is A Symmetric Relation?
A symmetric relation is a relation in which every ordered pair has a matching reverse pair: whenever $(a, b)$ is in the relation, $(b, a)$ is in it too. Written formally, a relation $R$ on a set $A$ is symmetric if $(a, b) \in R$ implies $(b, a) \in R$ for all $a, b \in A$.
Two ideas sit underneath that sentence. A relation is any rule that links elements of a set, and it is recorded as a collection of ordered pairs. The pair $(a, b)$ means "$a$ is related to $b$", and the order inside the pair matters.
Symmetry is the promise that the order does not change the answer. If $a$ relates to $b$, then $b$ relates to $a$, always. This is the same two-way rule behind the symmetric property of equality, where $a = b$ forces $b = a$.
One quick note that saves confusion later. Self-pairs like $(a, a)$ are their own reverse, so they never threaten symmetry. The test only has real work to do on pairs where the two elements differ.
What Are Some Examples Of Symmetric Relations?
The clearest way to feel symmetry is to sort everyday relations into the ones that reverse and the ones that do not.
Table: Everyday relations that are symmetric, and some that are not.
Relation | Symmetric? | Reason |
|---|---|---|
"is a sibling of" | Yes | If A is a sibling of B, then B is a sibling of A |
"is equal to" ($=$) | Yes | If $a = b$, then $b = a$ |
"is parallel to" | Yes | If line $m$ is parallel to line $n$, then $n$ is parallel to $m$ |
"is married to" | Yes | If A is married to B, then B is married to A |
"is less than or equal to" ($\leq$) | No | $3 \leq 5$ holds, but $5 \leq 3$ does not |
"divides" | No | $2$ divides $6$, but $6$ does not divide $2$ |
"is a parent of" | No | If A is a parent of B, then B is not a parent of A |
Now the same idea on a plain set. Take $A = {1, 2, 3}$ and the relation:
$$R = {(1, 1),\ (1, 2),\ (2, 1)}$$
The only off-diagonal pair is $(1, 2)$, and its reverse $(2, 1)$ is present, so $R$ is symmetric. Compare it with:
$$S = {(1, 2),\ (2, 3)}$$
Here $(1, 2)$ needs $(2, 1)$ and $(2, 3)$ needs $(3, 2)$, and neither reverse is in $S$. So $S$ is not symmetric.
How Do You Check If A Relation Is Symmetric?
To check symmetry, take every pair that points one way and confirm the pair pointing back is also there. Three steps settle it every time.
List every ordered pair $(a, b)$ in $R$ where $a \neq b$.
For each of those, look for its reverse $(b, a)$ inside $R$.
If even one reverse is missing, $R$ is not symmetric. Self-pairs $(a, a)$ never cause a problem.
Example 1: Is $R = {(1, 1),\ (1, 2),\ (2, 1)}$ symmetric?
The off-diagonal pairs are $(1, 2)$ and $(2, 1)$. The reverse of $(1, 2)$ is $(2, 1)$, which is present, and the reverse of $(2, 1)$ is $(1, 2)$, also present.
Final answer: yes, $R$ is symmetric.
Example 2: Is $S = {(1, 2),\ (2, 1),\ (2, 3)}$ symmetric?
The rusher glances at $(1, 2)$ and $(2, 1)$, sees a matched pair, and writes "symmetric." That answer is wrong, and the reason is easy to verify: $(2, 3)$ is in $S$, but its reverse $(3, 2)$ is not. One unmatched pair is all it takes.
Final answer: no, $S$ is not symmetric.
There is a neat shortcut worth knowing. A relation is symmetric exactly when it equals its own inverse relation, $R = R^{-1}$, because forming the inverse is precisely the act of reversing every pair.
How Many Symmetric Relations Are There On A Set?
The number of symmetric relations on a set of $n$ elements is:
$$2^{\frac{n(n+1)}{2}}$$
The formula falls out of a short counting argument. A relation on an $n$-element set is any choice of ordered pairs from the $n \times n$ grid of possibilities. Symmetry ties each pair $(a, b)$ to its partner $(b, a)$, so they must be chosen together, and that shrinks how many free choices you have.
The $n$ self-pairs $(a, a)$ each sit on the diagonal and can go in or out on their own: that is $2^{n}$ choices.
The off-diagonal pairs come in $\frac{n(n-1)}{2}$ mirror-image partners, and each partner is one free in-or-out choice: that is $2^{\frac{n(n-1)}{2}}$ choices.
Multiplying the two gives $2^{n} \cdot 2^{\frac{n(n-1)}{2}} = 2^{\frac{n(n+1)}{2}}$.
Table: How fast the number of symmetric relations grows with set size.
Elements $n$ | Formula $2^{n(n+1)/2}$ | Count |
|---|---|---|
1 | $2^{1}$ | 2 |
2 | $2^{3}$ | 8 |
3 | $2^{6}$ | 64 |
4 | $2^{10}$ | 1,024 |
A three-element set already allows 64 symmetric relations, which is why counting them by hand stops being sensible almost immediately.
What Is The Difference Between Symmetric, Antisymmetric, And Asymmetric Relations?
These three names sound related and get mixed up constantly, so it helps to define each on its own terms before comparing them.
A relation is antisymmetric when the only way both $(a, b)$ and $(b, a)$ can appear is if $a = b$. A relation is asymmetric when $(a, b)$ being present forces $(b, a)$ to be absent, and no self-pair $(a, a)$ is ever allowed.
Table: How symmetric, antisymmetric, and asymmetric relations compare.
Type | Rule | Self-pairs $(a, a)$ | Example |
|---|---|---|---|
Symmetric | $(a, b) \in R \Rightarrow (b, a) \in R$ | Allowed | "is a sibling of", $=$ |
Antisymmetric | $(a, b) \in R$ and $(b, a) \in R \Rightarrow a = b$ | Allowed | $\leq$, "divides" |
Asymmetric | $(a, b) \in R \Rightarrow (b, a) \notin R$ | Never | $<$, "is a parent of" |
The part that trips up even strong students is that symmetric and antisymmetric are not opposites. It took me a second read of the definitions to accept it, but equality is both symmetric and antisymmetric at once: the only pairs it contains are self-pairs $(a, a)$, which satisfy both rules. A relation can also be neither, so "not symmetric" tells you nothing about whether a relation is antisymmetric. The two tests are separate questions asked of the same relation.
Why Do Symmetric Relations Matter?
Symmetric relations are worth naming because the two-way property they capture shows up wherever a connection does not depend on direction. The name lets mathematics treat all such connections with one shared toolkit.
They are one leg of an equivalence relation. A relation that is reflexive, symmetric, and transitive is called an equivalence relation, the machinery that lets us treat different-looking things as the same, such as equal fractions or congruent triangles. Symmetry is the part that guarantees "sameness" reads identically from either side.
They model two-way connections. Friendship, being neighbours, being on the same team, or being wired together on a network are all links where relating one way means relating the other. Symmetry is their common shape.
They collapse a directed picture into an undirected one. In a graph, symmetry means every arrow has a twin pointing back, so you can erase the arrowheads and draw plain lines without losing information.
That last point is why symmetric relations sit right next to graphs and matrices. Symmetry is the formal name for a connection that does not care which side you start from, and once a topic has that property, a large amount of other mathematics becomes available to it.
A symmetric relation can also be read off a grid. Write a $1$ wherever a pair is in the relation and a $0$ where it is not, and a symmetric relation produces a symmetric matrix, one that equals its own transpose. For $A = {1, 2, 3}$ and $R = {(1, 1), (1, 2), (2, 1)}$:
$$M = \begin{bmatrix} 1 & 1 & 0 \ 1 & 0 & 0 \ 0 & 0 & 0 \end{bmatrix}$$
Reflect $M$ across its diagonal and nothing moves, which is the grid picture of "every pair reverses."
Who Shaped The Idea Of Symmetric Relations?
The idea that a relationship could be a mathematical object in its own right is younger than most of the algebra around it. For centuries, logic could handle statements about categories ("all horses are animals") but stumbled on statements about relations ("is the head of").
Two more figures turned that opening into the theory we use now.
Charles Sanders Peirce (1839–1914, United States) built De Morgan's idea into a working algebra of relations, defining properties including symmetry and transitivity in a form close to today's textbooks.
Georg Cantor (1845–1918, born in Russia, worked in Germany) founded set theory, which let a relation be defined cleanly as a set of ordered pairs, the exact definition this article rests on.
Where Are Symmetric Relations Used In The Real World?
The two-way property turns up across fields that look unrelated on the surface.
Social networks: a "friend" connection on platforms like Facebook is symmetric, so the system stores the link on both profiles automatically. A "follow" on X or Instagram is not symmetric, since you can follow someone who does not follow you back.
Computer and transport networks: an undirected network, such as roads between towns or cables between machines, is a symmetric relation, and its adjacency matrix equals its own transpose.
Geometry: "is congruent to" and "is parallel to" are symmetric, which is what lets you say two shapes match without worrying about which one you named first.
Databases: a "is married to" or "is a co-author with" table has to record both directions, or a query will find the link from only one side.
Chemistry: "is bonded to" between two atoms is symmetric, so a molecule's bond diagram reads the same from either atom's point of view.
One property, "the link runs both ways," quietly organises friend graphs, road maps, congruent shapes, and chemical bonds. That reach across fields is a sign the idea was worth naming.
What Are The Most Common Symmetric Relation Mistakes?
Three errors account for most lost marks on this topic, and they match the misconceptions documented in discrete-mathematics error guides.
Letting one missing reverse pair slip through.
Where it slips in:
A student lists pairs quickly, includes $(a, b)$ but forgets $(b, a)$, or checks only the first matched pair and stops.
Don't do this:
Do not declare a relation symmetric after spot-checking one or two pairs.
The correct way:
For every pair $(a, b)$ in $R$ with $a \neq b$, confirm $(b, a)$ is also present. A single missing reverse pair makes the whole relation not symmetric.
Confusing symmetric with reflexive.
Where it slips in:
A student sees the self-pairs $(a, a)$ and calls the relation symmetric, or assumes a symmetric relation has to contain every $(a, a)$.
Don't do this:
Do not treat "has the diagonal pairs" and "reverses every off-diagonal pair" as the same test.
The correct way:
Reflexive is about self-pairs $(a, a)$; symmetric is about reverse pairs $(a, b)$ and $(b, a)$. They are independent properties, and a relation can have one without the other.
Assuming "not symmetric" means "antisymmetric."
Where it slips in:
A second-guesser decides a relation fails the symmetry test and writes "so it must be antisymmetric," treating the two as opposites.
Don't do this:
Do not read antisymmetric as the negation of symmetric.
The correct way:
Test antisymmetry on its own terms: the only way both $(a, b)$ and $(b, a)$ may appear is when $a = b$. A relation can be both symmetric and antisymmetric, or neither, so failing one test says nothing about the other.
Practice Problems On Symmetric Relations
Work on the set $A = {1, 2, 3}$ unless a problem says otherwise. Answers follow each line.
Is $R = {(1, 1), (2, 2), (1, 2), (2, 1)}$ symmetric?
(Answer: yes; the only off-diagonal pair $(1, 2)$ has its reverse $(2, 1)$.)Is $S = {(1, 2), (2, 3), (3, 1)}$ symmetric?
(Answer: no; none of $(2, 1)$, $(3, 2)$, $(1, 3)$ are present.)How many symmetric relations exist on a 3-element set?
(Answer: $2^{3 \cdot 4 / 2} = 2^{6} = 64$.)Add the fewest pairs to make $T = {(1, 2), (2, 3)}$ symmetric.
(Answer: add $(2, 1)$ and $(3, 2)$, giving the symmetric closure.)Is the relation "$\geq$" on the real numbers symmetric?
(Answer: no; $5 \geq 3$ holds but $3 \geq 5$ does not.)Is the empty relation on $A$ symmetric?
(Answer: yes; there is no pair that could fail the test, so it is symmetric by default.)
Where Should You Go Next After Symmetric Relations?
Symmetry is one property among a family, and several natural doors open from here.
Types of relations. See where reflexive, transitive, and the other properties fit, with symmetry as one member of the set.
Relations and functions. Learn when a relation tightens into a function, where each input is tied to exactly one output.
Inverse relation. Go deeper on $R^{-1}$, the reversal that a symmetric relation happens to equal.
If your child is building these foundations, a live Bhanzu trainer teaches relations starting from the two-way intuition behind symmetry in the Bhanzu algebra program.
Was this article helpful?
Your feedback helps us write better content