Question

Let (G, *) and (H, A) be any two
groups. A mapping f from G to
His called - if f(a*b)= f(a) A
f(b) for all ab E G.*​

Answer 1

Answer:

answr

search

What would you like to ask?

12th

Maths

Relations and Functions

Types of Functions

Let A = { a,b,c } ,B = { u,...

MATHS

Let A={a,b,c},B={u,v,w} and let f and g be two functions from A to B and from B to A respectively defined as f={(a,v),(b,u),(c,w)} and g={(u,b),(v,a),(w,c)}. Show that f and g both are bijections and find f∘g and g∘f.

HARD

Share

Study later

ANSWER

(i) Test of bijection of f:

f={a,v),(b,u),(c,w)} and f:A→B

Injectivity of f: We can see, no two elements of A have the same image in B.

∴ f is injective function.

Surjectivity of f: Co-domain of f={u,v,w}

Range of f={u,v,w}

Both are same.

∴ f is surjective function.

Since, f injective and surjective function then, it is a bijection.

(ii) Test of bijection of g:

⇒ g{(u,b),(v,a),(w,c)} and g:B→A

Injectivity of g: No two elements of B have the same image in A.

∴ g is injective function.

Surjectivity of g: Co-domain of g={a,b,c}

Range of g={a,b,c}

Both are the same.

∴ g is surjecutve function.

Since, g injective and surjective function then, it is a bijection.

(iii) Finding f∘g:

Co-domain of g is same as the domain of f.

So, f∘g exists and f∘g:{u,v,w}→{u,v,w}

⇒ (f∘g)(u)=f[g(u)]=f(b)=u

⇒ (f∘g)(v)=f[g(v)]=f(a)=v

⇒ (f∘g)(w)=f[g(w)]=f(c)=w

So, f∘g={(u,u),(v,v),(w,w)}

(iv) Finding g∘f:

Co-domain of f is same as the domain of g.

So, f∘g exists and g∘f:{a,b,c}→{a,b,c}

⇒ (g∘f)(a)=g[f(a)]=g(v)=a

⇒ (g∘f)(b)=g[f(b)]=g(u)=b

⇒ (g∘f)(c)=g[f(c)]=g(w)=c

∴ g∘f={(a,a),(b,b),(c,c)}

Step-by-step explanation:

Thank you I hope you understand ☺☺