Saved Bookmarks
| 1. |
Let `f:A to A and g:A to A` be two functions such that fog(x)=gof (x)=x for all `x in A` Statement-1:`{x in A: f(x)=g(x)}={x in A: f(x)=x}={x in A: g(x)=x}` Statement-2: `f:A to A` is bijection.A. 1B. 2C. 3D. 4 |
|
Answer» Correct Answer - A We have, `fog(x)=gof(x)=x"for all "x in A` `Rightarrow` f is invertible such that `g=f^(-1)` `Rightarrow` f is a bijection `Rightarrow [x in A: f(x)=g(x)]=[x in A: f(x)=x]={x in A: g(x)=x]` |
|