Advertisements
Advertisements
Question
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)}, g = {(u, b), (v, a), (w, c)}.
Show that f and g both are bijections and find fog and gof.
Advertisements
Solution
Proving f is a bijection :
f = {(a, v), (b, u), (c, w)} and f : A → B
Injectivity of f: No two elements of A have the same image in B.
So, f is one-one.
Surjectivity of f: Co-domain of f = {u v, w}
Range of f = {u v, w}
Both are same.
So, f is onto.
Hence, f is a bijection.
Proving g is a bijection :
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.
So, g is one-one.
Surjectivity of g: Co-domain of g = {a, b, c}
Range of g = {a, b, c}
Both are the same.
So, g is onto.
Hence, g is a bijection.
Finding fog :
Co-domain of g is same as the domain of f.
So, fog exists and fog : {u v, w} → {u v, w}
(fog) (u) = f (g (u)) = f (b) = u
(fog) (v) = f (g (v)) = f (a) = v
(fog) (w) = f (g (w)) = f (c) = w
So, fog = { (u, u), (v, v), (w, w) }
Finding gof :
Co-domain of f is same as the domain of g.
So, fog exists and gof : {a, b, c} → {a, b, c}
(gof) (a) = g (f (a)) = g (v) = a
(gof) (b) = g (f (b)) = g (u) = b
(gof) (c) = g (f (c)) = g (w) = c
So, gof = { (a, a), (b, b), (c, c) }
APPEARS IN
RELATED QUESTIONS
Let f: R → R be defined as f(x) = 10x + 7. Find the function g: R → R such that g o f = f o g = 1R.
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = |x|
Classify the following function as injection, surjection or bijection :
f : Z → Z, defined by f(x) = x − 5
Classify the following function as injection, surjection or bijection :
f : R → R, defined by f(x) = x3 + 1
Classify the following function as injection, surjection or bijection :
f : Q − {3} → Q, defined by `f (x) = (2x +3)/(x-3)`
Let A = [-1, 1]. Then, discuss whether the following function from A to itself is one-one, onto or bijective : `f (x) = x/2`
If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
Give examples of two one-one functions f1 and f2 from R to R, such that f1 + f2 : R → R. defined by (f1 + f2) (x) = f1 (x) + f2 (x) is not one-one.
Let f = {(1, −1), (4, −2), (9, −3), (16, 4)} and g = {(−1, −2), (−2, −4), (−3, −6), (4, 8)}. Show that gof is defined while fog is not defined. Also, find gof.
Verify associativity for the following three mappings : f : N → Z0 (the set of non-zero integers), g : Z0 → Q and h : Q → R given by f(x) = 2x, g(x) = 1/x and h(x) = ex.
Find fog and gof if : f(x)= x + 1, g (x) = 2x + 3 .
Find fog and gof if : f(x) = `x^2` + 2 , g (x) = 1 − `1/ (1-x)`.
If f(x) = |x|, prove that fof = f.
State with reason whether the following functions have inverse :
f : {1, 2, 3, 4} → {10} with f = {(1, 10), (2, 10), (3, 10), (4, 10)}
Consider f : R → R+ → [4, ∞) given by f(x) = x2 + 4. Show that f is invertible with inverse f−1 of f given by f−1 `(x)= sqrt (x-4)` where R+ is the set of all non-negative real numbers.
If f : R → (−1, 1) defined by `f (x) = (10^x- 10^-x)/(10^x + 10 ^-x)` is invertible, find f−1.
If f : A → A, g : A → A are two bijections, then prove that fog is an injection ?
Which one of the following graphs represents a function?
If f : R → R is defined by f(x) = 3x + 2, find f (f (x)).
Let
\[A = \left\{ x \in R : - 1 \leq x \leq 1 \right\} = B\] Then, the mapping\[f : A \to \text{B given by} f\left( x \right) = x\left| x \right|\] is
Let M be the set of all 2 × 2 matrices with entries from the set R of real numbers. Then, the function f : M→ R defined by f(A) = |A| for every A ∈ M, is
\[f : Z \to Z\] be given by
` f (x) = {(x/2, ", if x is even" ) ,(0 , ", if x is odd "):}`
Then, f is
Mark the correct alternative in the following question:
If the set A contains 7 elements and the set B contains 10 elements, then the number one-one functions from A to B is
If f: R → R is defined by f(x) = x2 – 3x + 2, write f(f (x))
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
{(a, b): a is a person, b is an ancestor of a}
Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subset of X ×Y are function from X to Y or not
f = {(1, 4), (1, 5), (2, 4), (3, 5)}
Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is ______.
Which of the following functions from Z into Z are bijections?
The function f : A → B defined by f(x) = 4x + 7, x ∈ R is ____________.
The number of bijective functions from set A to itself when A contains 106 elements is ____________.
Which of the following functions from Z into Z is bijective?
Let g(x) = x2 – 4x – 5, then ____________.
The solution set of the inequation log1/3(x2 + x + 1) + 1 > 0 is ______.
If f: [0, 1]→[0, 1] is defined by f(x) = `(x + 1)/4` and `d/(dx) underbrace(((fofof......of)(x)))_("n" "times")""|_(x = 1/2) = 1/"m"^"n"`, m ∈ N, then the value of 'm' is ______.
Let a and b are two positive integers such that b ≠ 1. Let g(a, b) = Number of lattice points inside the quadrilateral formed by lines x = 0, y = 0, x = b and y = a. f(a, b) = `[a/b] + [(2a)/b] + ... + [((b - 1)a)/b]`, then the value of `[(g(101, 37))/(f(101, 37))]` is ______.
(Note P(x, y) is lattice point if x, y ∈ I)
(where [.] denotes greatest integer function)
The graph of the function y = f(x) is symmetrical about the line x = 2, then ______.
If A = {x ∈ R: |x – 2| > 1}, B = `{x ∈ R : sqrt(x^2 - 3) > 1}`, C = {x ∈ R : |x – 4| ≥ 2} and Z is the set of all integers, then the number of subsets of the set (A ∩ B ∩ C) C ∩ Z is ______.
Let f(x) be a polynomial function of degree 6 such that `d/dx (f(x))` = (x – 1)3 (x – 3)2, then
Assertion (A): f(x) has a minimum at x = 1.
Reason (R): When `d/dx (f(x)) < 0, ∀ x ∈ (a - h, a)` and `d/dx (f(x)) > 0, ∀ x ∈ (a, a + h)`; where 'h' is an infinitesimally small positive quantity, then f(x) has a minimum at x = a, provided f(x) is continuous at x = a.
