Let f :X\(\to\) Y be an invertible function. Show that f has unique inverse.
(Hint: suppose g1 and g2 are two inverses of f. Then for all y∈ Y, fog1(y) = IY (y) = fog2 (y). Use one-one ness of f).
Let f : X → Y be an invertible function. Also, suppose f has two inverses (say ).
Then, for all y ∈Y, we have: fog1 (y)=Iy (y)=fog2 (y)
=>f(g1 (y))=f(g2 (y))
g1 (y)=g2 (y) [f is invertible =>f is one-one
=>g1 = g2 [g is one-one].
Hence, f has a unique inverse.
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