Relations and Functions
Here f : A → B and g : B → C are onto functions ∴ g o f is defined from A to C. ∴ g is an onto mapping from B → C ∴ to each z ∈ C, there exists y ∈ B such that g (y) = z Again f is an onto mapping from A to B
∴ to each y ∈ B, there exists y ∈ A such that f(x) = y ∴ to each z ∈ C, there exists x ∈ A such that z = g (y) = g (f(x)) = (g o f) (x) ∴ g o f is onto.
Sponsor Area
Give an example of a relation which is
(i) Symmetric but neither reflexive nor transitive.
(ii) Transitive but neither reflexive nor symmetric.
(iii) Reflexive and symmetric but not transitive.
(iv) Reflexive and transitive but not symmetric.
(v) Symmetric and transitive but not reflexive.
Sponsor Area
Sponsor Area