Let f : X → Y be an invertible function. Show that the inverse of f-1 is f, i.e., (f-1)-1 = f.
Let f : X → Y be an invertible function.
Then, there exists a function g: Y → X such that gof = IX and fog = IY
Here, f-1 = g.
Now, gof = IX and fog = IY
⇒ f-1 of = IX and fof -1= IY
Hence, f-1 : Y → X is invertible and f is the inverse of f-1
i.e., (f-1)-1 = f.
Determine whether each of the following relations are reflexive, symmetric, and transitive.
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
Determine whether each of the following relations are reflexive, symmetric, and transitive.
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive
but not symmetric.
Check whether the relation R in R defined as R = {(a, b): a ≤ b3} is reflexive, symmetric or transitive