To show that the function f:A→B defined by f(x)=x−5x−3, where A=R−{5} and B=R−{1}, is one-one and onto, we need to prove both injectivity and surjectivity.
Injectivity (One-One)
A function f is injective if f(a)=f(b) implies a=b for all a,b∈A.
Let f(a)=f(b).
a−5a−3=b−5b−3
Cross-multiplying:
(a−3)(b−5)=(b−3)(a−5)
Expanding both sides:
ab−5a−3b+15=ab−3a−5b+15
Simplifying:
−5a−3b=−3a−5b
−5a+5b=−3a+3b
−2a=−2b
a=b
Thus, f is injective.
Surjectivity (Onto)
A function f is surjective if for every y∈B, there exists an x∈A such that f(x)=y.
Let y∈B:
y=x−5x−3
Solving for x:
y(x−5)=x−3
yx−5y=x−3
x(y−1)=5y−3
x=y−15y−3
We need to ensure x=5:
y−15y−3=5
Check whether x=5 can occur:
5=y−15y−3
5(y−1)=5y−3
5y−5=5y−3
−5=−3
Thus, x=y−15y−3 is always valid, and since y=1, x∈A. Therefore, f is surjective.
Hence, the function is both one-one and onto.