If the functions f and g are defined on R→R such that f(x)={0,if x is rationalx,if x is irrational and g(x)={0,if x is irrationalx,if x is rational,
then (f−g)(x) is
A
a bijective function
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
B
neither a one-one nor an onto function
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
a one-one but not an onto function
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
an onto but not a one-one function
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is A a bijective function (f−g)(x)={−x,if x is rationalx,if x is irrational
Let x1,x2∈ rational (f−g)(x1)=(f−g)(x2)⇒−x1=−x2⇒x1=x2⋯(i)
Let x1,x2∈ irrational (f−g)(x1)=(f−g)(x2)⇒x1=x2⋯(ii)
Let x1∈ irrational, x2∈ rational (f−g)(x1)=(f−g)(x2)⇒x1=−x2⇒x+x2=0⋯(iii)
This is not possible as sum of rational and irrational cannot be 0.
So, this is a contradiction to assumption x1∈ irrational, x2∈ rational ∴ From equations (i),(ii) and (iii), we get (f−g)(x) is one-one function.
Let y∈ rational ⇒y=(f−g)(x)⇒y=−x ⇒x=−y∈ rational ⋯(iv)
y∈ Irrational ⇒y=(f−g)(x)⇒y=x ⇒x∈ irrational ⋯(v)
∴ from (iv) and (v)(f−g)(x) is onto function.
Hence (f−g)(x) is a bijective function.