IMPORTANT TERMS, DEFINITIONS & RESULTS

Types of intervals:
 Open interval: If 𝒂 and 𝒃 be two real numbers such that 𝒂 < 𝒃 then, the set of all the real
numbers lying strictly between 𝒂 and 𝒃 is called an open interval. It is denoted by (𝒂, 𝒃)
i.e., {𝒙 ∈ 𝑹: 𝒂 < 𝒙 < 𝒃}.
 Closed interval: If 𝒂 and 𝒃 be two real numbers such that 𝒂 < 𝒃 then, the set of all the
real numbers lying between 𝒂 and 𝒃 such that it includes both 𝒂 and 𝒃 as well as is known
as a closed interval. It is denoted by [𝒂, 𝒃] i.e., {𝒙 ∈ 𝑹: 𝒂 ≤ 𝒙 ≤ 𝒃}.
 Open Closed interval: If 𝒂 and 𝒃 be two real numbers such that 𝒂 < 𝒃 then, the set of all
the real numbers lying between 𝒂 and 𝒃 such that it excludes 𝒂 and includes only 𝒃 is
known as an open closed interval. It is denoted by (𝒂, 𝒃] i.e., {𝒙 ∈ 𝑹: 𝒂 < 𝒙 ≤ 𝒃}.
 Closed Open interval: If 𝒂 and 𝒃 be two real numbers such that 𝒂 < 𝒃 then, the set of all
the real numbers lying between 𝒂 and 𝒃 such that it includes only 𝒂 and excludes 𝒃 is
known as a closed open interval. It is denoted by [𝒂, 𝒃) i.e., {𝒙 ∈ 𝑹: 𝒂 ≤ 𝒙 < 𝒃}.

Ordered Pairs:
If a pair of elements written in circular bracket and grouped together in a particular order, then
such a pair, is called an ordered pair. Ordered pair is written by listing two objects in the
specific order, separated by comma (,) and enclosing the pair in parentheses.
The ordered pair of two elements a and b is denoted by (𝒂, 𝒃): a is first element (or first
component) and b is second element (or second component).
Two ordered pairs are equal if their corresponding elements are equal.
I.e., (𝒂, 𝒃) = (𝒄, 𝒅) ⇒ 𝒂 = 𝒄 𝒂𝒏𝒅 𝒃 = 𝒅
NOTE:
 An ordered pair is not a set containing of two elements. The order of two elements in an
ordered pair is important and the two elements need not be distinct.
 (𝒂, 𝒃) ≠ (𝒃, 𝒂)

Cartesian Product of Two Sets:

Let 𝑨 and 𝑩 be two non-empty sets. The set of all ordered pairs (𝒂, 𝒃) such that 𝒂 ∈ 𝑨 and 𝒃 ∈
𝑩 is called the Cartesian product of set A with set B and is denoted by 𝑨 × 𝑩.
Thus, 𝑨 × 𝑩 = {(𝒂, 𝒃): 𝒂 ∈ 𝑨 𝒂𝒏𝒅 𝒃 ∈ 𝑩}
NOTE:
 If 𝑨 or 𝑩 is a null set then 𝑨 × 𝑩 will also a null set (𝒊. 𝒆. , 𝑨 × 𝑩 = 𝝓, 𝐢𝐟 𝑨 = 𝝓 𝐨𝐫 𝑩 = 𝝓)
 Two ordered pairs are equal, if and only if the corresponding first element are equal and
the second elements are also equal.
 If 𝒏(𝑨) = 𝒑, 𝒏(𝑩) = 𝒒 then 𝒏(𝑨 × 𝑩) = 𝒑𝒒.
  𝑩 × 𝑨 = {(𝒃, 𝒂): 𝒃 ∈ 𝑩 𝒂𝒏𝒅 𝒂 ∈ 𝑨}
 𝑨 × 𝑨 = {(𝒂, 𝒂): 𝒂 ∈ 𝑨, 𝒂 ∈ 𝑩 }
 𝑨 × 𝑨 × 𝑨 = {(𝒂, 𝒃, 𝒄): 𝒂, 𝒃, 𝒄 ∈ 𝑨 }. here (𝒂, 𝒃, 𝒄) is called an ordered triplet.
Example: If 𝐴 = {1, 2, 3} and 𝐵 = {𝑎, 𝑏}. Then
𝐴 × 𝐵 = {(1, 𝑎), (1, 𝑏), (2, 𝑎), (2, 𝑏), (3, 𝑎), (3, 𝑏)}
𝐵 × 𝐴 = {(𝑎, 1), (𝑏, 1), (𝑎, 2), (𝑏, 2), (𝑎, 3), (𝑏, 3)}
𝐴 × 𝐴 = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3)}
𝐵 × 𝐵 = {(𝑎, 𝑎), (𝑎, 𝑏), (𝑏, 𝑎), (𝑏, 𝑏)}

RELATION:
A relation R, from a non-empty set A to another non-empty set B is mathematically defined as
an arbitrary subset of 𝑨 × 𝑩. Equivalently, any subset of 𝑨 × 𝑩 is a relation from A to B.
Thus, R is a relation from A to B ⇔ 𝑹 ⊆ 𝑨 × 𝑩
⇔ 𝑹 ⊆ {(𝒂, 𝒃): 𝒂 ∈ 𝑨, 𝒃 ∈ 𝑩}
NOTE:
 A relation from A to B is also called a relation from 𝑨 into 𝑩.
 If 𝑹 is a relation from a non-void set 𝑨 to non-void set 𝑩 and if (𝒂, 𝒃) ∈ 𝑹, then we write
𝒂𝑹𝒃 which is read as “a is related to b by the relation R”.
 If R is a relation from a non-void set A to non-void set B and if (𝒂, 𝒃) ∉ 𝑹, then we write
𝒂𝑹𝒃 which is read as “a is not related to b by the relation R”.
 If A and B be two non-empty finite sets containing of ‘p’ and ‘q’ elements respectively,
then 𝒏(𝑨 × 𝑩) = 𝒏(𝑨). 𝒏(𝑩) = 𝒑𝒒. Then, total number of subsets of 𝑨 × 𝑩 = 𝟐𝒑𝒒 .
 Since, each subset of 𝑨 × 𝑩 is a relation from A to B, Therefore, total number of relations
from A to B is given as 𝟐𝒑𝒒 .
Example:
 Let 𝐴 = {1,2,4}, 𝐵 = {4,6}. Let 𝑅 = {(1,4), (1,6), (2,4), (2,6), (4,6)}.
Here, 𝑹 ⊆ 𝑨 × 𝑩 and therefore R is a relation from A to B.
 Let 𝐴 = {1,2,3}, 𝐵 = {2,3,5,7}. Let 𝑅 = {(2,3), (3,5), (5,7)}.
Here, 𝑹 ⊄ 𝑨 × 𝑩 and therefore R is not a relation from A to B. Since, (𝟓, 𝟕) ∉ 𝑨 × 𝑩.
 Let 𝐴 = {−1,1,2}, 𝐵 = {1,4,9,10}. Let 𝒂𝑹𝒃 means 𝒂𝟐 = 𝒃 then, 𝑹 = {(−𝟏, 𝟏), (𝟏, 𝟏), (𝟐, 𝟒)}

DOMAIN AND RANGE OF A RELATION:

Domain of a relation:
Let R be a relation from a set A to set B. then the set of all first components or
coordinates of the ordered pairs belonging to R is called the domain of R.
Thus, Domain of R = {𝒂: (𝒂, 𝒃) ∈ 𝑹}.
Clearly, domain of 𝑹 ⊆ 𝑨
Range of a relation:
Let R be a relation from a set A to set B. then the set of all second components or
coordinates of the ordered pairs belonging to R is called the range of R.
Thus, Range of 𝑹 = {𝒃: (𝒂, 𝒃) ∈ 𝑹}.
Clearly, Range of R ⊆ 𝑩

Co-domain of a relation:
Let R be a relation from A to B. Then B is called the codomain of the relation R. So,
we can observe that codomain of a relation R from 𝑨 into 𝑩 is the set B as a whole.
Example:
 Let 𝐴 = {1,2,3,7}, 𝐵 = {3,6}.
Let 𝑎𝑅𝑏 means 𝑎 < 𝑏 then we have 𝑅 = {(1,3), (1,6), (2,3), (2,6), (3,6)}.
Here, Dom.(R) = {1,2,3}, Range of R = {3,6}, Codomain of R = {3,6}
 Let 𝐴 = {1,2,3}, 𝐵 = {2,4,6,8}.
Let 𝑅1 = {(1,2), (2,4), (3,6)} and 𝑅2 = {(2,4), (2,6), (3,8), (1,6)}.
Then both 𝑅1 and 𝑅2 are relations from A to B because 𝑅1 ⊆ 𝐴 × 𝐵 and 𝑅2 ⊆ 𝐴 × 𝐵.
Here, Dom. (𝑅1 ) = {1,2,3}, Range of 𝑅1 = {2,4,6}. Dom. (𝑅2 ) = {2,3,1}, Range of 𝑅2 = {4,6,8}.

Types of relations from one set to another set:

Empty or Void relation:
A relation 𝑹 from 𝑨 to 𝑩 is called an empty relation or a void relation from 𝑨 to 𝑩 if 𝑹 = 𝝓.
Example:
 Let 𝑨 = {𝟐, 𝟒, 𝟔}, 𝑩 = {𝟕, 𝟏𝟏}. Let 𝑹 = {(𝒂, 𝒃): 𝒂 ∈ 𝑨, 𝒃 ∈ 𝑩 𝒂𝒏𝒅 𝒂 − 𝒃 𝒊𝒔 𝒆𝒗𝒆𝒏}.
Here, R is an empty relation.
Universal relation:
A relation R from A to B is said to be the universal relation if 𝑹 = 𝑨 × 𝑩.
In other words, a relation R from set A to B is said to be Universal relation, if
each element of A is related to every element of B. I.e., 𝑹 = 𝑨 × 𝑩.
Example:
 Let 𝑨 = {𝟏, 𝟐}, 𝑩 = {𝟏, 𝟑}. Let 𝑹 = {(𝟏, 𝟏), (𝟏, 𝟑), (𝟐, 𝟏), (𝟐, 𝟑)}. Here, 𝑹 = 𝑨 × 𝑩 so,
R is a universal relation.

Relation on a set and its various types:

Relation on a set: A relation R from a non-empty set A into Itself is called a relation on A.
In other words, if A is a non- empty set, then a subset of 𝑨 × 𝑨 = 𝑨𝟐 is called a relation on A.
Example:
 Let 𝑨 = {𝟏, 𝟐, 𝟑} and 𝑹 = {(𝟑, 𝟏), (𝟑, 𝟐), (𝟐, 𝟏)}. Here, 𝑹 is a relation on set A.
𝟐
NOTE: If A be a finite set having 𝑛 elements, then number of relations on set 𝑨 is 𝟐𝒏×𝒏 i.e., 𝟐𝒏 .
Empty or Void relation:
A relation R on a set A is said to be empty relation or a void relation if 𝑹 = 𝝓. In other words,
a relation R in a set A is empty relation, if no element of A is related to any element of A, i.e.,
𝑹 = 𝝓 ⊂ 𝑨 × 𝑨.
Example:
 Let 𝑨 = {(𝟏, 𝟑)}, 𝑹 = {(𝒂, 𝒃): 𝒂 ∈ 𝑨, 𝒃 ∈ 𝑨 𝒂𝒏𝒅 𝒂 + 𝒃 𝒊𝒔 𝒐𝒅𝒅}. Here, R contains no element,
therefore it is an empty relation on set A.
 Consider the relation R on the set 𝑨 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓} defined by 𝑹 = {(𝒂, 𝒃): 𝒂 − 𝒃 =
𝟏𝟐 𝒘𝒉𝒆𝒓𝒆 𝒂, 𝒃 ∈ 𝑨}.
We observe that 𝒂 − 𝒃 ≠ 𝟏𝟐 for any two elements of A.
∴ (𝒂, 𝒃) ∉ 𝑹 for any 𝒂, 𝒃 ∈ 𝑨.
⇒ R does not contain any element of 𝑨 × 𝑨.
⇒ R is empty set
⇒ R is a void relation on A.
Universal relation:
A relation R on a set A is said to be the universal relation on 𝐴 if 𝑅 = 𝐴 × 𝐴.
In other words, a relation R in a set A is universal relation, if each element of A is related to
every element of A. i.e., 𝑅 = 𝐴 × 𝐴.
Example:
 Let 𝑨 = {𝟏, 𝟐}. Let 𝑹 = {(𝟏, 𝟏), (𝟏, 𝟐), (𝟐, 𝟏), (𝟐, 𝟐)}. Here, 𝑹 = 𝑨 × 𝑨 so, R is a
universal relation.
 Consider the relation R on the set 𝑨 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟔} defined by 𝑹 = {(𝒂, 𝒃) ∈ 𝑹: |𝒂 − 𝒃| ≥
𝟎 𝒘𝒉𝒆𝒓𝒆 𝒂, 𝒃 ∈ 𝑨}.
We observe that |𝒂 − 𝒃| ≥ 𝟎 for any two elements of A.
∴ (𝒂, 𝒃) ∈ 𝑹 for all (𝒂, 𝒃) ∈ 𝑨 × 𝑨.
⇒ Each element of set A is related to every element of set A.
⇒𝑹=𝑨×𝑨
⇒ R is a universal relation on A.
NOTE: The void relation i.e., 𝝓 A on and the universal relation 𝑨 × 𝑨 are respectively the
smallest and largest relations defined on the set A. Also, these are sometimes called Trivial
Relations. And, any other relation is called a non-trivial relation.
 The relations 𝑹 = 𝝓 and 𝑹 = 𝑨 × 𝑨 are two extreme relations.
Identity relation:
A relation 𝑹 on a set 𝑨 is said to be the identity relation on 𝑨 if 𝑹 = {(𝒂, 𝒃): 𝒂 ∈ 𝑨 , 𝒃 ∈
𝑩 𝒂𝒏𝒅 𝒂 = 𝒃}.
Thus, identity relation 𝑹 = {(𝒂, 𝒂): 𝒂 ∈ 𝑨}. The identity relation on set A is also denoted by 𝑰𝑨 .
Example:
 Let 𝑨 = {𝟏, 𝟐, 𝟑, 𝟒}.
Let 𝑰𝑨 = {(𝟏, 𝟏), (𝟐, 𝟐), (𝟑, 𝟑), (𝟒, 𝟒)}.
But, the relation 𝑹 = {(𝟏, 𝟏), (𝟐, 𝟐), (𝟏, 𝟑), (𝟒, 𝟒)} is not an identity relation because
element 1 is related to element 1 and 3.
NOTE: In an identity relation on 𝑨 every element of A should be related to itself only.
Reflexive relation:
A relation R on a set A is said to be reflexive if 𝒂𝑹𝒂, ∀𝒂 ∈ 𝑨 i.e., (𝒂, 𝒂) ∈ 𝑹, for all 𝒂 ∈ 𝑨.
NOTE: A relation R on a set A is not reflexive if there exists an element 𝒂 ∈ 𝑨 such
that(𝒂, 𝒂) ∉ 𝑹.
Example:
 Let 𝑨 = {𝟏, 𝟐, 𝟑}. and 𝑹𝟏 , 𝑹𝟐 , 𝑹𝟑 be the relations given as
𝑹𝟏 = {(𝟏, 𝟏), (𝟐, 𝟐), (𝟑, 𝟑)}; 𝑹𝟐 = {(𝟏, 𝟏), (𝟐, 𝟐), (𝟑, 𝟑), (𝟏, 𝟐), (𝟐, 𝟏), (𝟏, 𝟑)} and
𝑹𝟑 = {(𝟐, 𝟐), (𝟐, 𝟑), (𝟑, 𝟐), (𝟏, 𝟏)}.
Here, 𝑹𝟏 and 𝑹𝟐 are reflexive relations on A but 𝑹𝟑 is not reflexive as 𝟑 ∈ 𝑨 but
(𝟑, 𝟑) ∉ 𝑹𝟑 .
NOTE: The identity relation is always a reflexive relation but the opposite may or may not be
true. As shown in the example above, 𝑹𝟏 is both identity as well as reflexive relation on A but
𝑹𝟐 is only reflexive relation on A.
Symmetric relation:
A relation R on a set A is said to be Symmetric iff (𝒂, 𝒃) ∈ 𝑹 ⇒ (𝒃, 𝒂) ∈ 𝑹, for all 𝒂, 𝒃 ∈ 𝑨.
i.e., 𝒂𝑹𝒃 ⇒ 𝒃𝑹𝒂, for all 𝒂, 𝒃 ∈ 𝑨
Example:
 Let 𝑨 = {𝟏, 𝟐, 𝟑}. and 𝑹𝟏 , 𝑹𝟐 , 𝑹𝟑 and 𝑹𝟒 be the relations given as
𝑹𝟏 = {(𝟏, 𝟐), (𝟐, 𝟏)}; 𝑹𝟐 = {(𝟏, 𝟐), (𝟐, 𝟏), (𝟏, 𝟑), (𝟑, 𝟏)},
𝑹𝟑 = {(𝟐, 𝟐), (𝟐, 𝟑), (𝟑, 𝟐)} and 𝑹𝟒 = {(𝟐, 𝟑), (𝟑, 𝟏), (𝟏, 𝟑)}
Here, 𝑹𝟏 ,𝑹𝟐 and 𝑹𝟑 are Symmetric relations on A but 𝑹𝟒 is not symmetric because (𝟐, 𝟑) ∈ 𝑹𝟒
but (𝟑, 𝟐) ∉ 𝑹𝟒 .
Antisymmetric relation:
A relation R on a set A is said to be Antisymmetric iff (𝒂, 𝒃) ∈ 𝑹, (𝒃, 𝒂) ∈ 𝑹 ⇒ 𝒂 = 𝒃, for
all 𝒂, 𝒃 ∈ 𝑨.
i.e., 𝒂𝑹𝒃, 𝒃𝑹𝒂 ⇒ 𝒂 = 𝒃, for all 𝒂, 𝒃 ∈ 𝑨.
Example:
The relation “greater than or equal to, “≥” is antisymmetric relation as 𝑎 ≥ 𝑏, 𝑏 ≥ 𝑎 ⇒ 𝑎 = 𝑏,
for all 𝑎, 𝑏.
NOTE: “Antisymmetric” is completely different from not symmetric.

Transitive relation:
A relation R on a set A is said to be transitive iff (𝒂, 𝒃) ∈ 𝑹 𝒂𝒏𝒅 (𝒃, 𝒄) ∈ 𝑹 ⇒ (𝒂, 𝒄) ∈ 𝑹, for
all 𝒂, 𝒃, 𝒄 ∈ 𝑨.
i.e., 𝒂𝑹𝒃 𝒂𝒏𝒅 𝒃𝑹𝒄 ⇒ 𝒂𝑹𝒄, for all 𝒂, 𝒃, 𝒄 ∈ 𝑨
Example:
 Let 𝑨 = {𝟏, 𝟐, 𝟑}. and 𝑹𝟏 , 𝑹𝟐 be the relations given as 𝑹𝟏 =
{(𝟏, 𝟐), (𝟐, 𝟑), (𝟏, 𝟑), (𝟑, 𝟐)} and 𝑹𝟐 = {(𝟏, 𝟑), (𝟑, 𝟐), (𝟏, 𝟐)}.
Here, 𝑹𝟐 is transitive relation where as 𝑹𝟏 is not transitive because (𝟐, 𝟑) ∈ 𝑹𝟏 ,
(𝟑, 𝟐) ∈ 𝑹𝟏 but (𝟐, 𝟐) ∉ 𝑹𝟏 .
IMPORTANT NOTE:
For a particular ordered pair in R, if we have (𝑎, 𝑏) and we don’t have (𝑏, 𝑐), then we don’t
have to check transitive relation for that ordered pair. So, we have to check transitivity, only if
we find both (𝑎, 𝑏) and (𝑏, 𝑐) in R.
Example:
Assume 𝑨 = {𝟏, 𝟐, 𝟑} and R be a relation defined on set A as 𝑹 = {(𝟏, 𝟏), (𝟐, 𝟐), (𝟑, 𝟑), (𝟏, 𝟐)}.
Verify R is transitive.
Sol: To verify whether R is Transitive, we have to see the condition given below for every
ordered pair in R.
i.e., (𝑎, 𝑏) ∈ 𝑅 𝑎𝑛𝑑 (𝑏, 𝑐) ∈ 𝑅 ⇒ (𝑎, 𝑐) ∈ 𝑅 (𝑎, 𝑏) (𝑏, 𝑐) → (𝑎, 𝑐)
Let’s see the above condition for every ordered pair in R (1,1) (1,2) → (1,2)
From the picture above, it is clear that R is Transitive. For the (2,2) ---- → ----
two ordered pairs (2,2) and (3,3), we don’t find the pair (𝑏, 𝑐). (3,3) ---- → ----
so, we don’t have to check the condition for those ordered pairs. (1,2) (2,2) → (1,2)
Equivalence relation:
Let A be a non-empty set, then a relation R on set A is said to be an equivalence relation if it
is
 Reflexive i.e., (𝒂, 𝒂) ∈ 𝑹, for all 𝒂 ∈ 𝑨 i.e., 𝒂𝑹𝒂
 Symmetric i.e., (𝒂, 𝒃) ∈ 𝑹 ⇒ (𝒃, 𝒂) ∈ 𝑹, for all 𝒂, 𝒃 ∈ 𝑨 i.e., 𝒂𝑹𝒃 ⇒ 𝒃𝑹𝒂
 Transitive i.e., (𝒂, 𝒃) ∈ 𝑹 𝒂𝒏𝒅 (𝒃, 𝒄) ⇒ (𝒂, 𝒄) ∈ 𝑹, for all 𝒂, 𝒃, 𝒄 ∈ 𝑨 i.e.,
𝒂𝑹𝒃 𝒂𝒏𝒅 𝒃𝑹𝒄 ⇒ 𝒂𝑹𝒄
Example:
 Let 𝑨 = {𝟏, 𝟐, 𝟑}. and 𝑹 be the relations given as 𝑹 =
{(𝟏, 𝟐), (𝟏, 𝟏), (𝟐, 𝟏), (𝟐, 𝟐), (𝟑, 𝟑)}.
Here, 𝑹 is reflexive, symmetric and transitive. So, R is an equivalence relation on A.
Equivalence classes:
Let R be an equivalence relation on a non-empty set A. for all 𝒂 ∈ 𝑨, the Equivalence class of
‘a’ is defined as the set of all such elements of A which are related to ‘𝒂’ under R. It is denoted
by [𝒂].
Thus, [𝒂] = {𝒙 ∈ 𝑨: (𝒙, 𝒂) ∈ 𝑹}.
Example:
 Let 𝑨 = {𝟏, 𝟐, 𝟑}. and 𝑹 be the equivalence relation on A given by
𝑹 = {(𝟏, 𝟏), (𝟐, 𝟐), (𝟑, 𝟑), (𝟏, 𝟐), (𝟐, 𝟏)}
The Equivalence class are
[𝟏] = 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑐𝑙𝑎𝑠𝑠 𝑜𝑓 1 = {𝑥 ∈ 𝐴: (𝑥, 1) ∈ 𝑅} = {𝟏, 𝟐}
Similarly, [𝟐] = {𝟐, 𝟏} and [𝟑] = {𝟑}.
NOTE:
 Two equivalence classes are either disjoint or identical.
 An equivalence relation R on a set A partitions the set into mutually disjoint
equivalence classes.
 An important property of an equivalence relation is that it divides the set into pairwise
disjoint subsets called equivalence classes whose collection is called a partition of the
set. Note that the union of all equivalence classes gives the whole set.
Example:
Let R denotes the equivalence relation in the set Z of integers given by 𝑹=
{(𝒂, 𝒃): 𝟐 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 𝒂 − 𝒃}. Then, the equivalence class [𝟎] is [𝟎] = {𝟎, ±𝟐, ±𝟒, ±𝟔, … … … }.
NOTE:
𝟐
 Number of Reflexive Relations on a set with 𝑛 elements: 𝟐𝒏(𝒏−𝟏) (𝒐𝒓) 𝟐𝒏 −𝒏 .
𝒏(𝒏+𝟏) 𝒏𝟐 +𝒏
 Number of Symmetric Relations on a set with 𝑛 elements: 𝟐 𝟐 (𝒐𝒓) 𝟐 𝟐

𝒏(𝒏−𝟏) 𝒏𝟐 −𝒏
 Reflexive and symmetric Relations on a set with 𝑛 elements: 𝟐 𝟐 (𝒐𝒓) 𝟐 𝟐

𝒏(𝒏−𝟏)
 Number of Anti-Symmetric Relations on a set with 𝒏 elements: 𝟐𝒏 . 𝟑 𝟐 .