in Set Theory & Algebra retagged by
17,265 views
37 votes
37 votes

Let $G$ be an arbitrary group. Consider the following relations on $G$:

  • $R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a = g^{-1}bg$
  • $R_2: \forall a , b \in G, \: a R_2 b \text{ if and only if } a= b^{-1}$

Which of the above is/are equivalence relation/relations?

  1. $R_1$ and $R_2$
  2. $R_1$ only
  3. $R_2$ only
  4. Neither $R_1$ nor $R_2$
in Set Theory & Algebra retagged by
by
17.3k views

1 comment

moved by
B should be the ans
2
2

9 Answers

0 votes
0 votes
=> for R1 :  Given that a =(inverse of g)*b*g  means a=b*e , and so a=b

(bcoz we know that (inverse of an element)*(element)=e ).

→ So statement boils down to  R1: ∀a,b∈G,aR1b iff a=b

        So if G={1,2} , Relation R1 = {(1,1),(2,2)} which is EQUIVALENCE RELATION.

 

=> for R2 : Given condition is that a = (inverse of b).

          Again if G={1,2} , Relation R1 should contain atleast {(1,1),(2,2)} for it to be reflexive which is not always possible bcoz a != (inverse of a) for all ‘a’ . So can’t be reflexive, so can’t be equivalence.

1 comment

$g^{-1}ag$

Group is given not abilean group so you cannot interchange a and g then write equation as:

$bg^{-1}g$ = $b.e$ for R1   

1
1
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true