Is R an Identity Relation on A?

In summary, the conversation discusses the concept of an identity relation on a set A, defined as the smallest possible equivalence relation on A. The relation R={<1,1>,<2,2>,<3,3>} is an example of an identity relation on A, but R= {<1,1>,<2,2>} is not, as it fails the reflexive test.
  • #1
oriel1
8
0
Let A= {1,2,3}.
Let R= {<1,1>,<2,2>}.

I(A) (Identity Realtion) on A >(def)> {<x,x>|x \(\displaystyle \in\) A}
So that mean : \(\displaystyle \forall\) <x,x> x \(\displaystyle \in\) A
(That how I understood it)

My question:
Is R is identity relation on A ?

Thank you !
 
Physics news on Phys.org
  • #2
No. Think about (3,3).
 
  • #3
Deveno said:
No. Think about (3,3).
Ok Actually R={<1,1>,<2,2>,<3,3>} is identity relation on A for sure.
But what prevent from R= {<1,1>,<2,2>} to bo identity on A?
It not writed \(\displaystyle \forall\) x \(\displaystyle \in\) A.
 
  • #4
The definition (yours, not mine) says:

$I(A) = \{(x,x)\mid x \in A\}$.

However, $3 \in A = \{1,2,3\}$, but $(3,3) \not\in R$.

That is, $(3,3)$ is a pair with $3 \in A$, and thus $(3,3)$ fulfills the requirements to be an element of $I(A)$. Most texts define the identity relation as the smallest possible equivalence relation on a given set, and your relation fails the reflexive test.
 
  • #5
Thank you. now i understand it.
 

FAQ: Is R an Identity Relation on A?

What is an identity relation?

An identity relation is a type of binary relation in mathematics that maps an element to itself. In other words, if a is an element of a set A, then the identity relation on A will map a to itself (aRb if and only if a=b).

What is the notation for an identity relation?

The notation for an identity relation is "R = {(a,a) | a is an element of A}". This means that the relation R contains ordered pairs of elements from the set A where both elements are equal to each other.

Is the identity relation reflexive?

Yes, the identity relation is reflexive. This means that every element in the set A is related to itself (aRa) and satisfies the reflexive property of a relation.

Is the identity relation symmetric?

Yes, the identity relation is symmetric. This means that if a is related to b (aRb), then b is also related to a (bRa). Since the identity relation only contains ordered pairs of elements that are equal to each other, it satisfies the symmetric property.

Is the identity relation transitive?

Yes, the identity relation is transitive. This means that if a is related to b (aRb) and b is related to c (bRc), then a is also related to c (aRc). Since the identity relation only contains ordered pairs of elements that are equal to each other, it satisfies the transitive property.

Similar threads

Replies
1
Views
823
Replies
1
Views
794
Replies
0
Views
1K
Replies
3
Views
2K
Replies
2
Views
1K
Replies
6
Views
1K
Replies
1
Views
758
Replies
22
Views
5K
Back
Top