Summarize this article:
151 LearnersLast updated on October 28, 2025

A symmetric relation is a binary relation in which, if element a relates to element b, then b also relates to a. This means that the relationship is mutual and order-independent. This article further discusses symmetric relations.
A relation is a subset of the Cartesian product of two sets, connecting elements through ordered pairs. In each ordered pair, the first element comes from the domain, and the second from the range.
In other words, it connects elements of one set to elements of another through ordered pairs (a, b), where 'a' is from the domain and 'b' is from the range.
A symmetric relation on a set X means that whenever an ordered pair (a, b) is in R, then the pair (b, a) must also be included in R. Every connection between two elements will be mutual; if a relates to b, then b relates to a.
Examples
In mathematics, relations define connections between elements of sets using ordered pairs.
Here are some important points to remember.
1. Asymmetric ⇒ Antisymmetric (and implies irreflexive).
If xRy, then yRx cannot hold, so antisymmetry is satisfied.
2. Antisymmetric relations allow (a, a) ∈ R (e.g., ≤), but asymmetric relations do not.
3. Symmetric and asymmetric are mutually exclusive, except for the empty relation.
4. Symmetric and antisymmetric relations coincide only in trivial cases, such as the identity relation {(x, x) | x ∈ X}.
A relation R on a set A is symmetric if:
\(∀a, b∈A, (a, b)∈R ⟹ (b, a)∈R.\)
Equivalently, R = R-1(its inverse)
1. Inverse equals itself:
R-1 = R.
2. Closed under set operations:
If R1 and R2 are symmetric, then so are R1 ∪ R2 and R1 ∩ R2.
3. Matrix representation is symmetric:
Its adjacency matrix satisfies M = MT
4. Digraphs have paired edges:
Every directed edge a→b is accompanied by b→a.
5. Extremes are symmetric:
The empty relation and the universal relation (all pairs) are both symmetric.
A relation is both symmetric and antisymmetric only in trivial cases, such as the identity relation {(x, x) | x ∈ X}.
Number of Symmetric Relations Formula
Number of symmetric relations = \(2^ { \ n \ ({ n \ + \ 1 \over 2})}\)
Where
Let's practice this using an example.
Example: Set A = {1,2,3}:
Explanation: Here n = 3,
so, number of symmetric relations = \(2^ { \ 3\ ({ 3 \ + \ 1 \over 2})} = 2 ^ { 3 \times 2} = 2 ^ 6 = 64\)
Practice Problem: Similarly, find the number of symmetric relation of set B = {3, 2, 5, 3} by yourself for practice.
To check if a relation R on a set A is symmetric, follow these steps:
Let's practice this using some problems.
Problem 1:
Let R = { (1, 2), (2, 1), (3, 4), (4, 3) }.
Each pair has its reverse, so R is symmetric.
Problem 2:
Let R = { (1, 3), (3, 4), (4, 3) }.
The pair (1, 3) does not have its reverse, so R is not symmetric.
To make symmetric relations easy and simple, here are a few quick tips and tricks:
Parent Tip: Relate symmetric relations to real life relations to help your child understand better. Encourage your child to practice.
Students make mistakes while solving symmetric relations. Common mistakes like misidentifying asymmetric relations as symmetric and overlooking reversed pairs in data structures. Let’s check out some of these mistakes so that we can avoid them.
Symmetrical relations are prevalent in various aspects of our daily lives, from social interactions to mathematical concepts. Let’s see some of their real-life applications.
Is the relation R = {(1, 1), (2, 2), (1, 2), (2, 1)} symmetric?
Yes, the relation is symmetric.
Checking the condition for symmetry
R = {(1, 1), (2, 2), (1, 2), (2, 1)}
For each pair (a, b) ∈ R, the pair (b, a) is also in R. Since, it satisfies the condition for symmetry.
Thus, it is symmetric.
Is the relation R = {(1,1), (2, 2), (3, 3), (1, 2)} symmetric?
No, the relation is not symmetric.
Checking the condition for symmetry.
R {(1,1), (2, 2), (3, 3), (1, 2)}
For symmetry, if (1,2) ∈ R, then (2,1) must also be in R. Since (2,1) ∉ R, the relation is not symmetric.
Is the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} symmetric?
No, the relation is not symmetric.
The given relation is R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)}
The pair (2, 3) ∈ R but (3, 2) ∉ R, violating the symmetry condition.
Thus, the given relation is not symmetric.
Is the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2)} symmetric?
Yes, the relation is symmetric.
Checking the condition for symmetric
R {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3), (3, 2)}
For every pair (a, b) ∈ R, the pair (b, a) is also in R, confirming symmetry.
Is the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (3, 1)} symmetric?
No, the relation is not symmetric.
Checking R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (3, 1)}.
The pair (3,1) ∈ R but (1,3) ∉ R, so the relation is not symmetric.
Jaskaran Singh Saluja is a math wizard with nearly three years of experience as a math teacher. His expertise is in algebra, so he can make algebra classes interesting by turning tricky equations into simple puzzles.
: He loves to play the quiz with kids through algebra to make kids love it.






