Explore BrainMass

Providing Proof about Functions

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

Let f: X--> Y and g: Y-->Z be functions. Show that if g o f is injective, then f must be injective. Is it true that g must also be injective? Show that if g o f is surjective, then g must be surjective. Is it true that f must also be surjective?

© BrainMass Inc. brainmass.com December 20, 2018, 8:39 am ad1c9bdddf

Solution Preview

Recall that a function f:X-->Y is called injective, if for any elements x and x' from X, the equality f(x)=f(x') implies that x=x'. f is called surjective if for any element y from Y there exists an element x from X such that f(x)=y.

Let gf: X-->Z be injective, and let x, x' be elements of X such that ...

Solution Summary

This solution helps with proof about functions.